hdu 1034 Candy Sharing Game

Candy Sharing Game

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

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.

 

 

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<queue>
#include<map> 
#include<vector>
#define MAX 100010
#define LL long long
#define INF 0xfffffff
#define fab(x) (x)>0?(x):(-x)
#define mem(x) memset(x,0,sizeof(x))
#define PI acos(-1)
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int n,m,j,i,t;
    int s[MAX],s1[MAX];
	while(scanf("%d",&n),n)
	{
		for(i=1;i<=n;i++)
		{
			scanf("%d",&s[i]);
			s1[i]=s[i];
		}
		int flag=1;
		int ans=0;
		int ant=0;
		while(flag)
		{
			ans++;
			
			s[1]=s1[n]/2+s1[1]/2;
			if(s[1]&1)
			    s[1]+=1;
			    
			//s1[1]=s[1];
			
			for(i=2;i<=n;i++)
			{
				s[i]=s1[i-1]/2+s1[i]/2;
				if(s[i]&1)
				    s[i]+=1;
			    //s1[i]=s[i]; 
			}
			for(i=1;i<=n;i++)
			    s1[i]=s[i];
//			for(i=1;i<=n;i++)
//			{
//				printf("%d# ",s[i]);
//			}
//			printf("\n");
			
			int k=0;
			for(i=1;i<n;i++)
			{
				if(s[i]==s[i+1])
					k++;
				else
				    break;
			}
			for(i=1;i<=n;i++)
			printf("%d ",s[i]);
			printf("\n");
			if(s[1]==s[n])
			    k++;
			if(k==n)
			{
				flag=0;
				ant=s[1];
			} 
		}
		printf("%d %d\n",ans,ant);
	}	
	return 0;
}