(模拟题)
来源:互联网 发布:京东延保服务 知乎 编辑:程序博客网 时间:2024/05/22 09:22
Candy Sharing Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1685 Accepted Submission(s): 1045
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.
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1685 Accepted Submission(s): 1045
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.
Source
#include <iostream> #include <cstring> using namespace std; int num[105][2]; int N; bool end()//判断是否end过程中,处理分糖果 { bool flag = true;//是否end for(int i = 0; i < N; i ++) { num[i][0] = num[i][0] + num[i][1]; //先处理 if(num[i][0] % 2 != 0) num[i][0] ++;//奇数就加1 } for(int i = 0; i < N-1; i ++) { if(num[i][0] != num[i+1][0]) flag = false;//两两中相等就都相等 } return flag; } int main() { while(cin >> N && N) { memset(num,0,sizeof(num)); for(int i = 0; i < N; i ++) cin >> num[i][0]; int time = 0;//次数 while(1) { if(end()) break; time ++; for(int i = 0; i < N; i ++)//循环处理 { int right = (i+1)%N; //这里表示下一个人 num[right][1] = num[i][0] / 2; num[i][0] = num[i][0]/2; } } cout << time << ' ' << num[0][0]<<endl; } return 0; }
0 0
- 【NOIP 模拟题】[T1]return(模拟)
- hdu1013(模拟题)
- Miscalculation(模拟题)
- hdu1034(模拟题)
- (模拟题)
- POJ1008(模拟题)
- POJ1013(模拟题)
- POJ1016(模拟题)
- POJ1298(模拟题)
- NBU 1409(模拟题)
- ACdreamoj(1105)模拟题
- D - Safecracker(模拟题)
- ZOJ 3897(模拟题)
- Game(bc模拟题)
- CF_602B(模拟水题)
- hdu6112(模拟水题)
- 大风车转呀转(模拟题)
- 模拟题
- 浅析最小生成树和单源最短路径的区别(含Prim、Kruskal、Dijkstra、Bellman-Ford)
- 加密术
- nginx学习10——gzip压缩,expire缓存
- XML布局属性
- 两个有序序列中找出公共序列
- (模拟题)
- Bundle传输数据之携带集合对象
- 第一篇博文
- OpenGL系列教程(3)——OpenGL基础(2)
- 如何学习一门语言
- 救基友记2
- ACM刷题之ZOJ————Java Beans
- android 如何去除textview imageview的图片,内容
- JAVA8接口中的default、static方法使用注意事项