Candy Sharing Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4482 Accepted Submission(s): 2742
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.
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 8AC-code:#include<cstdio> int s[100000]; int main() { int n,i,a,k,flag; while(scanf("%d",&n),n) { for(i=0;i<n;i++) scanf("%d",&s[i]); for(k=1;;k++) { a=s[0]; for(i=0;i<n-1;i++) { s[i]=s[i]/2+s[i+1]/2; if(s[i]%2==1) s[i]++; } s[n-1]=s[n-1]/2+a/2; if(s[n-1]%2==1) s[n-1]++; flag=1; for(i=1;i<n;i++) if(s[0]!=s[i]) flag=0; if(flag) break; } printf("%d %d\n",k,s[0]); } return 0; }
本文介绍了一种名为Candy Sharing Game的游戏算法实现。该算法旨在解决一群学生围坐成一圈,通过吹哨子的方式互相传递糖果,直到所有学生手中的糖果数量相同为止的问题。文中提供了完整的C语言代码实现,并详细描述了输入输出格式及样例。

1万+

被折叠的 条评论
为什么被折叠?



