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 Descriptiona 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.

Inputthe 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.

Outputfor 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 Input6362222211222018161412108642424680

Sample Output15 1417 224 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 coun t 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]);p rintf ("\ n"), if (S[1]==s[n]) k++;if (k==n) {flag=0;ant=s[1];}} printf ("%d%d\n", ans,ant);} RetUrn 0;} 

　　

HDU 1034 Candy Sharing Game