플리나를 위하여

#include <iostream>
using namespace std;

void BAEKJOON_10989()
{
	ios::ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int N;
	cin >> N;
	int index[10001] = { 0 };
	for (int i = 0; i < N; i++)
	{
		int temp;
		cin >> temp;
		index[temp]++;
	}
	for (int i = 1; i <= 10000; i++)
	{
		for (int j = 0; j < index[i]; j++)
		{
			cout << i << "\n";
		}
	}
	return;
}void BAEKJOON_번호()
{
	return;
}

#include <iostream>
#include <algorithm>
using namespace std;

void BAEKJOON_2751()
{
	int N;
	cin >> N;
	int* arr = new int[N];
	for (int i = 0; i < N; i++)
	{
		cin >> arr[i];
	}
	sort(arr, arr + N);
	for (int i = 0; i < N; i++)
	{
		cout << arr[i] << "\n";
	}
	delete[] arr;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_2750()
{
	int N;
	cin >> N;
	int16_t* arr = new int16_t[N];
	for (int i = 0; i < N; i++)
	{
		cin >> arr[i];
	}
	for (int i = 0; i < N - 1; i++)
	{
		int temp;
		for (int j = i + 1; j < N; j++)
		{
			if (arr[i] > arr[j])
			{
				temp = arr[i];
				arr[i] = arr[j];
				arr[j] = temp;
			}
		}
	}
	for (int i = 0; i < N; i++)
	{
		cout << arr[i] << "\n";
	}
	delete[] arr;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_1436()
{
	int N;
	cin >> N;
	int count = 0;
	int result;
	for(int i = 666; true; i++)
	{
		int currentNumber = i;
		while (currentNumber >= 666)
		{
			if (currentNumber % 1000 == 666)
			{
				count++;
				break;
			}
			currentNumber /= 10;
		}
		if (count == N)
		{
			result = i;
			break;
		}
	}
	cout << result << endl;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_1018()
{
	/*----------기준 체스판----------*/
	char standard[9][8];
	for (int i = 0; i < 9; i++)
	{
		for (int j = 0; j < 8; j++)
		{ // i + j가 짝수면 흰색, 홀수면 검정색
			standard[i][j] = (i + j) % 2 ? 'B' : 'W';
		}
	}
	/*----------데이터 입력----------*/
	int N;
	int M;
	cin >> N >> M;
	char** data = new char*[N];
	for (int i = 0; i < N; i++)
	{
		data[i] = new char[M + 1];
		cin >> data[i];
	}
	/*----------비교 시작----------*/
	int changePt = 64;
	for (int i = 0; i <= N - 8 && changePt; i++)
	{// 비교 시작 위치 지정, changePt == 0인 경우 반복문 종료
		for (int j = 0; j <= M - 8 && changePt; j++)
		{
			int valueWB = 0;
			int valueBW = 0;
			for (int m = 0; m < 8; m++)
			{// 비교 진행
				for (int n = 0; n < 8; n++)
				{
					valueWB += standard[m][n] != data[i + m][j + n];
					valueBW += standard[m + 1][n] != data[i + m][j + n];
				}
			}
			changePt = changePt > valueWB ? valueWB : changePt;
			changePt = changePt > valueBW ? valueBW : changePt;
		}
	}
	cout << changePt << endl;
	/*----------메모리 해제----------*/
	for (int i = 0; i < N; i++)
	{
		delete[] data[i];
	}
	delete[] data;
	return;
}

#include <iostream>
using namespace std;

	int N;
	cin >> N;

	/*----------데이터 구성----------*/
	// data[0] 몸무게
	// data[1] 키
	// data[2] 등수
	/*-------------------------------*/
	int** data = new int*[N];
	for (int i = 0; i < N; i++)
	{
		data[i] = new int[3];
		cin >> data[i][0] >> data[i][1];
		data[i][2] = N;
	}
	/*----------덩치값 비교----------*/
	for (int i = 0; i < N - 1; i++)
	{
		for (int j = i + 1; j < N; j++)
		{
			if (data[i][0] > data[j][0] && data[i][1] > data[j][1])
			{// i가 j보다 덩치값이 크면
				data[i][2]--;
			}
			else if (data[i][0] < data[j][0] && data[i][1] < data[j][1])
			{// j가 i보다 덩치값이 크면
				data[j][2]--;
			}
			else
			{// 덩치값의 우위를 알 수 없으면
				data[i][2]--;
				data[j][2]--;
			}
		}
	}
	/*----------등수 출력하기----------*/
	for (int i = 0; i < N; i++)
	{
		cout << data[i][2];
		if (i != N - 1)
		{
			cout << ' ';
		}
	}
	cout << "\n";
	/*----------메모리 해제----------*/
	for (int i = 0; i < N; i++)
	{
		delete[] data[i];
	}
	delete[] data;

#include <iostream>
#include <fstream>
int Problem018()
{
	/*---------------값 입력 받기------------------*/
	std::ifstream file("Project_Euler_018.txt");
	if (!(file.is_open()))
	{
		return -1;
	}
	int numArr[15][15] = { 0 };
	for (int i = 0; i < 15; i++)
	{
		for (int j = 0; j <= i; j++)
		{
			file >> numArr[i][j];
		}
	}
	file.close();
	/*-----------------계산하기--------------------*/
	for (int i = 13; i >= 0; i--)
	{
		for (int j = 0; j <= i; j++)
		{
			int sumLeft = numArr[i][j] + numArr[i + 1][j];
			int sumRight = numArr[i][j] + numArr[i + 1][j + 1];
			numArr[i][j] = sumLeft > sumRight ? sumLeft : sumRight;
		}
	}

	return numArr[0][0];
}

#include <iostream>
using namespace std;

void BAEKJOON_2231()
{
	int N;
	cin >> N;
	int M = 0;
	if (N <= 10)
	{
		M = N % 2 == 0 ? N / 2 : 0;
	}
	else
	{
		int digit = 0;
		int copyN = N;
		while (copyN)
		{
			digit++;
			copyN /= 10;
		}
		for (int i = N - digit * 9; i < N; i++)
		{
			int currentNumber = i;
			int sum = i;
			while (currentNumber)
			{
				sum += currentNumber % 10;
				currentNumber /= 10;
			}
			if (sum == N)
			{
				M = i;
				break;
			}
		}
	}
	cout << M << endl;
	return;
}