hdoj 2277 Change the ball 【找规律】



Change the ball

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 511    Accepted Submission(s): 185

Problem Description

Garfield has three piles of balls, each pile has unique color of following: yellow, blue, and red. Now we also know Garfield has Y yellow balls, B blue balls, and R red balls. But Garfield just wants to change all the balls to one color. When he puts two balls of different color togather, the balls then change their colors automatically into the rest color. For instance, when Garfield puts a red one and a yellow one togather, the two balls immediately owns blue color, the same to other situations. But the rule doesn’t work when the two balls have the same color.
  Garfield is not able to estimate the minimal steps to achieve the aim. Can you tell him?

 

Input

For each line, there are three intergers Y, B, R(1<=Y,B,R<=1000),indicate the number refered above.

 

Output

For each case, tell Garfield the minimal steps to complete the assignment. If not, output the symbol “):”.

 

Sample Input

  
  

   
   1 2 3
1 2 2
  
  

 

Sample Output

  
  

   
   ):
2
  
  

 

题意：给你Y个黄色气球，B个蓝色气球，R个红色气球。每次操作，可以把两个不同颜色的气球变成两个第三种颜色的气球。问你能否经过若干次得到颜色全相同的气球，若可以输出最少次数。

思路：只要这三个气球的个数，满足两个气球个数相同或者两个气球个数之差是3的倍数就可以完成题目要求的转换。

AC代码：升序排列后 一次判断

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
	int a[4];
	while(scanf("%d%d%d", &a[0], &a[1], &a[2]) != EOF)
	{
		sort(a, a+3);
		if(a[1] == a[0] || (a[1] - a[0]) % 3 == 0)
		printf("%d\n", a[1]);
		else if((a[2] - a[1]) % 3 == 0 || (a[2] - a[0]) % 3 == 0 || a[2] == a[1])
		printf("%d\n", a[2]);
		else
		printf("):\n");
	}
	return 0;
}