UVa/102.cpp at master · fkrafi/UVa · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<stdio.h>
#include<string>
using namespace std;
#define MAX 2147483647

char s[5], str[5];
long long int sumB, sumG, sumC;
long long int B[3], G[3], C[3];
long long int res, temp;

void find()
{
	res = MAX;
	temp = sumB-B[0] + sumC-C[1]+ sumG-G[2];
	if(temp < res)
	{
		res = temp;
		strcpy(s, "BCG");
	}

	temp = sumB-B[0] + sumG-G[1] + sumC-C[2];
	if(temp < res)
	{
		res = temp;
		strcpy(s, "BGC");
	}

	temp = sumC-C[0] + sumB-B[1] + sumG-G[2];
	if(temp < res)
	{
		res = temp;
		strcpy(s, "CBG");
	}

	temp = sumC-C[0] + sumG-G[1] + sumB-B[2];
	if(temp < res)
	{
		res = temp;
		strcpy(s, "CGB");
	}

	temp = sumG-G[0] + sumB-B[1] + sumC-C[2];
	if(temp < res)
	{
		res = temp;
		strcpy(s, "GBC");
	}

	temp = sumG-G[0] + sumC-C[1] + sumB-B[2];
	if(temp < res)
	{
		res = temp;
		strcpy(s, "GCB");
	}
}

int main()
{
	freopen("102.txt", "r", stdin);
	long long int i;
	while(scanf("%lld%lld%lld%lld%lld%lld%lld%lld%lld", &B[0], &G[0], &C[0], &B[1], &G[1], &C[1], &B[2], &G[2], &C[2]) != EOF)
	{
		sumB = sumG = sumC = 0;
		for(i=0; i<3; i++)
		{
			sumB += B[i];
			sumG += G[i];
			sumC += C[i];
		}
		find();
		printf("%s %lld\n", s, res);
	}
	return 0;
}