【杭电oj】1034-Candy Sharing Game（水）

Candy Sharing Game

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4508    Accepted Submission(s): 2757

Problem Description

A number of students sit in a circle facing their teacher in the center. Each student initially has an even number of pieces of candy. When the teacher blows a whistle, each student simultaneously gives half of his or her candy to the neighbor on the right. Any student, who ends up with an odd number of pieces of candy, is given another piece by the teacher. The game ends when all students have the same number of pieces of candy. 
Write a program which determines the number of times the teacher blows the whistle and the final number of pieces of candy for each student from the amount of candy each child starts with.

 

Input

The input may describe more than one game. For each game, the input begins with the number N of students, followed by N (even) candy counts for the children counter-clockwise around the circle. The input ends with a student count of 0. Each input number is on a line by itself.

 

Output

For each game, output the number of rounds of the game followed by the amount of candy each child ends up with, both on one line.

 

Sample Input

   
   
   
   

    
    
    
    6
36
2
2
2
2
2
11
22
20
18
16
14
12
10
8
6
4
2
4
2
4
6
8
0
   
   
   
   

 

Sample Output

   
   
   
   

    
    
    
    15 14
17 22
4 8


    
    
    
    
 
     
 
      Hint 
     
 The game ends in a finite number of steps because: 1. The maximum candy count can never increase. 2. The minimum candy count can never decrease. 3. No one with more than the minimum amount will ever decrease to the minimum. 4. If the maximum and minimum candy count are not the same, at least one student with the minimum amount must have their count increase. 
    
    
    
    
     
   
   
   
   

 

Source

Greater New York 2003

实在不清楚题意就自己模拟一下算一算就行，不难。

下图用数据 4  2  4  6  8  模拟：

代码如下：

#include <stdio.h>
int main()
{
	int u;
	int chl[10000],ex[10000];		//原队列，交换队列 
	int ans;
	int max,min;
	while (~scanf ("%d",&u) && u)
	{
		max=ans=0;
		min=10000;
		for (int i=1;i<=u;i++)
		{
			scanf ("%d",&chl[i]);
			if (chl[i]>max)
				max=chl[i];
			if (chl[i]<min)
				min=chl[i];
		}
		while (max!=min)
		{
			//给交换数组赋值
			ex[1]=chl[u]/2;		
			for (int i=2;i<=u;i++)
			{
				ex[i]=chl[i-1]/2;
			}
			//相加

			for (int i=1;i<=u;i++)
			{
				chl[i]=chl[i]/2+ex[i];
			}
			//整理奇数糖并算出数组的最大最小值
			max=0;
			min=10000;
			for (int i=1;i<=u;i++)
			{
				if (chl[i]&1)
					chl[i]++;
				if (chl[i]>max)
					max=chl[i];
				if (chl[i]<min)
					min=chl[i];
			}
			//记录过程
			ans++;
		}
		printf ("%d %d\n",ans,min);
	}
	return 0; 
}