hdoj-1034-Candy Sharing Game
来源:互联网 发布:上网流量控制软件 编辑:程序博客网 时间:2024/06/04 18:40
Candy Sharing Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3812 Accepted Submission(s): 2377
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
6362222211222018161412108642424680
Sample Output
15 1417 224 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.
Source
Greater New York 2003
#include<stdio.h>#include<string.h>int a[10000];int n;bool judge(){for(int i=0;i<n-1;++i){if(a[i]!=a[i+1]) return false;}return true;}int main(){while(~scanf("%d",&n),n){ int ncas=0,i,t1,t2;for(i=0;i<n;++i) scanf("%d",&a[i]);while(!judge()){ncas++; t2=a[0];for(i=1;i<=n;++i){t1=a[i%n];a[i%n]=a[i%n]/2+t2/2;t2=t1;}for(i=0;i<n;++i) if(a[i]&1) a[i]++;}printf("%d %d\n",ncas,a[0]);}return 0;}
We have carefully selected several similar problems for you:1035 1031 1037 1038 1015
0 0
- hdoj-1034-Candy Sharing Game
- hdoj 1034 Candy Sharing Game
- hdoj 1034 Candy Sharing Game
- hdoj 1034Candy Sharing Game
- HDOJ 1034 Candy Sharing Game
- HDOJ Candy Sharing Game
- hdoj 1034 Candy Sharing Game 【模拟】
- HDOJ 1034 Candy Sharing Game(模拟)
- HDOJ HDU 1034 Candy Sharing Game
- 1034:Candy Sharing Game
- 1034 Candy Sharing Game
- hdoj Candy Sharing Game 1034 (简单递推)
- hdoj 1034 Candy Sharing Game 【水模拟】【周赛】
- hdu 1034 Candy Sharing Game
- hdu 1034 Candy Sharing Game
- HDU 1034 Candy Sharing Game
- HDU 1034 Candy Sharing Game
- hdu 1034 Candy Sharing Game
- C++_布局(placement)new操作符
- hdu1394Minimum Inversion Number逆序数
- Eclipse的java代码出错:The import XXXX cannot be resolved
- GPS北斗软件接收机/跟踪捕获定位输出/A GPS software receiver【All of acq track nav filter and other NMEA】*嵌入式GPS导航代码*
- 各种return情况下try,catch,finally的执行顺序
- hdoj-1034-Candy Sharing Game
- 记录切换功能研究实现
- 对称加密----AES和DES加密、解密
- 年度催泪之作:2015中国程序员生存报告
- sql查询优化小结
- LintCode_138——子数组和为零
- excel里怎样根据两个表里面相同的列,合并其他列到同一个表里
- Jenkins安装配置
- 返回两个日期之间的日期集合