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): 593    Accepted Submission(s): 207

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

题意：给三个小球，其中两个不一样颜色的碰一下这两个小球可以变成第三种小球的颜色，问最少需要几步可以让所有的

        球变成同一种颜色

题解：1、当有两种颜色的小球个数相等时步数就等于这相等个数小球的个数

        2、当其中有一个数与另一个数的差是3的倍数时也可以答案是做差的两个数中较大的那个

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
bool cmp(int a,int b)
{
	return a>b;
}
int main()
{
	int n,m,j,i,t;
	int a[10];
	int x,y;
	while(scanf("%d%d%d",&a[0],&a[1],&a[2])!=EOF)
	{
		sort(a,a+3,cmp);
        if(a[0]==a[1]||a[1]==a[2]||(a[1]-a[2])%3==0)
            printf("%d\n",a[1]);
        else if((a[0]-a[1])%3==0||(a[0]-a[2])%3==0)
        	printf("%d\n",a[0]);
        else 
        printf("):\n");
	}
	return 0;
}