플리나를 위하여

#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;
}

#include <iostream>
using namespace std;

void BAEKJOON_2798()
{
	int N;
	int M;
	cin >> N >> M;
	int card[100];
	for (int i = 0; i < N; i++)
	{
		cin >> card[i];
	}

	int result = 0;
	for (int i = 0; i < N - 2 && result < M; i++)
	{
		for (int j = i + 1; j < N - 1 && result < M; j++)
		{
			for (int n = j + 1; n < N && result < M; n++)
			{
				int sum = card[i] + card[j] + card[n];
				if (sum > result && sum <= M)
				{
					result = sum;
				}
			}
		}
	}
	cout << result << endl;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_1002()
{
	int T;
	cin >> T;
	for (int i = 0; i < T; i++)
	{
		int x1;
		int y1;
		int x2;
		int y2;
		int r1;
		int r2;
		cin >> x1 >> y1 >> r1 >> x2 >> y2 >> r2;
		int result;
		if (x1 == x2 && y1 == y2) // A와 B가 같은 위치인 경우
		{
			result = r1 == r2 ? -1 : 0;
		}
		else
		{
			int distance = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
			if (r1 * r1 < distance && r2 * r2 < distance) // A와 B 사이에 있는 경우
			{
				if ((r1 + r2) * (r1 + r2) > distance)
				{
					result = 2;
				}
				else if ((r1 + r2) * (r1 + r2) == distance)
				{
					result = 1;
				}
				else
				{
					result = 0;
				}
			}
			else // A와 B 사이에 없는 경우
			{
				if ((r1 - r2) * (r1 - r2) < distance)
				{
					result = 2;
				}
				else if ((r1 - r2) * (r1 - r2) == distance)
				{
					result = 1;
				}
				else
				{
					result = 0;
				}
			}
		}
		cout << result << endl;
	}
	return;
}

#define _USE_MATH_DEFINES
#include <iostream>
#include <cmath>
using namespace std;

void BAEKJOON_3053()
{
	int R;
	cin >> R;
	cout << fixed;
	cout << R * R * M_PI << endl;
	cout << R * R * 2.0 << endl;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_4153()
{
	int A;
	int B;
	int C;
	while (true)
	{
		cin >> A >> B >> C;
		if (!A && !B && !C)
		{
			break;
		}
		if (A  *A + B * B == C * C || B * B + C * C == A * A || C * C + A * A == B * B)
		{
			cout << "right" << endl;
		}
		else
		{
			cout << "wrong" << endl;
		}
	}
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_3009()
{
	int x;
	int y;
	int posX = 0;
	int posY = 0;
	for(int i = 0; i < 3; i++)
	{
		cin >> x >> y;
		posX ^= x;
		posY ^= y;
	}
	cout << posX << ' ' << posY << endl;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_1085()
{
	int x;
	int y;
	int w;
	int h;
	cin >> x >> y >> w >> h;
	int distance = w - x < h - y ? w - x : h - y;
	distance = distance < x ? distance : x;
	distance = distance < y ? distance : y;
	cout << distance << endl;
	return;
}