Candy Sharing Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3321 Accepted Submission(s): 2071
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 8HintThe 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.
n个学生围成一圈,老师每吹一次哨。给右边同学一半的糖果,每一次分完,如果手中糖果是奇数,老师多给一块,直到相等。
刚开始只想着把糖果的一半记下来了,没有把每个学生的糖果减半,后来改过来,又坑在这个地方:分完糖果以后,如果是奇数的糖果多给一个之后进行比较,不是给右边的同学一半糖果之后就立马进行比较!!!
#include <iostream> #include <stdio.h> #include <memory.h> using namespace std; int a[1005],b[1005]; int main(void) { // freopen("A.txt","r",stdin); int n; while(scanf("%d",&n)!=EOF&&n) { int ok=1; memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } int count=0; while(1) { for(int i=1;i<=n;i++) { if(a[i]%2) a[i]++; } ok=1; for(int i=1;i<=n;i++) { if(i==1) { if(a[1]!=a[n]) { //printf("%d\n",ok); ok=0; break; } } else { if(a[i]!=a[i-1]) { ok=0; break; } } } if(ok) break; count++; for(int i=1;i<=n;i++) { b[i]=a[i]/2; a[i]/=2; } for(int i=2;i<=n;i++) a[i]+=b[i-1]; a[1]+=b[n]; } printf("%d %d\n",count,a[1]); } return 0; }