[Softeer/C++] 진정한 효도

https://softeer.ai/practice/7374

Softeer - 현대자동차그룹 SW인재확보플랫폼

소스코드

#include<iostream>
#include <algorithm>

using namespace std;
int minmin(int a, int b, int c)
{
	int arr[3] = { a, b, c };

	sort(arr, arr + 3);
	int middle = arr[1];

	int result = 0;
	for (int i = 0; i < 3; i++)
	{
		if (arr[i] != middle)
			result = arr[i] - middle;
	}
	return abs(result);
}

int main(int argc, char** argv)
{
	int in;

	int arr[3][3];

	for (int i = 0; i < 3; i++)
	{
		for (int j = 0; j < 3; j++)
		{
			cin >> in;
			arr[i][j] = in;
		}
	}

	int result = 9999;
	int temp = 0;
	for (int i = 0; i < 3; i++)
	{
		if (arr[i][0] == arr[i][1] && arr[i][1] == arr[i][2])
		{
			result = 0;
			break;
		}
		else
		{
			temp = minmin(arr[i][0], arr[i][1], arr[i][2]);
			if (result > temp)
				result = temp;
		}
	}

	if (result != 0)
	{
		for (int i = 0; i < 3; i++)
		{
			if (arr[0][i] == arr[1][i] && arr[1][i] == arr[2][i])
			{
				result = 0;
				break;
			}
			else
			{
				temp = minmin(arr[0][i], arr[1][i], arr[2][i]);
				if (result > temp)
					result = temp;
			}
		}
	}
	cout << result;

	return 0;
}