Hdoj 1034 Candy sharing Game (analog)

 Candy sharing Game

Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 4439 Accepted Submission (s): 2709


Problem Description A number of students sit in A circle facing their teacher in the center. Each student initially have an even number of pieces of candy. When the teacher blows a whistle, each student simultaneously gives half of he or her candy to the neighbor on the right. Any student, who ends-a odd number of pieces of candy, is given another piece by the teacher. The game ends when all students has the same number of pieces of candy.
Write a program which determines the number of times the 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 of the 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, bot h 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

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 would ever decrease to the minimum. 4. If the maximum and minimum candy count is not the same in least one student with the minimum amount must has their C Ount increase.
Test instructions: Understand test instructions is very key Ah, English blind really kneeling cry. There are n students sitting together in a ring, at the beginning of each hand have even-numbered candy, in the whistle when the sound of the same time to take out half of their hands to the right of the classmate (note that the N-person at the same time, is not understood here), after the end, the hands of candy is odd will be from the teacher to get When all the students in the hands of the number of sweets are equal, the game is over. Give the initial state, ask the game to blow the whistle several times, the final students in the hands of the candy is how much.
Very simple, according to the topic of simulation of the game process can be.
The code is as follows:

#include <cstdio>
#include <cstring>
using namespace std;
int a[10000],b[10000];
int main ()
{
	int n,i,ans,j;
	while (scanf ("%d", &n) &&n)
	{
		for (i=0;i<n;++i)
			scanf ("%d", &a[i]);
		ans=0;
		while (1)
		{
			memset (b,0,sizeof (b));
			for (i=0;i<n;++i)
				a[i]/=2;
			for (I=0;i<n;++i)
			{
				if (i==n-1)
					b[0]=a[0]+a[n-1];
				else
					b[i+1]=a[i+1]+a[i];
			}
			for (I=0;i<n;++i)
			{
				if (b[i]&1)
					b[i]++;
				A[i]=b[i];
			}
			int sign=1;
			for (I=0;i<n;++i)
			{for
				(j=0;j<n;++j)
				{
					if (A[i]!=a[j])
					{
						sign=0;
						break;
					}
				}
				if (!sign) break
					;
			}
			ans++;
			if (sign) break
				;
		}
		printf ("%d%d\n", ans,a[0]);
	}
	return 0; 
}