杭电-1034Candy Sharing Game(模拟)
来源:互联网 发布:织梦cms模板下载 编辑:程序博客网 时间:2024/06/01 10:50
Candy Sharing Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4434 Accepted Submission(s): 2705
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.
模拟题,模拟每次变化的过程!
#include<cstdio>#include<cstring>#include<algorithm> #define N 1000100using namespace std;long long a[N],b[N];int main(){long long m,n,i,j,cot,t,p;while(scanf("%lld",&m),m){cot=0;for(i=1;i<=m;i++){scanf("%lld",&a[i]);b[i]=a[i];}sort(b+1,b+m+1);//记得一定要用一个数组代替,因为我们不能改变原来人员的位置while(b[1]!=b[m])//当最大和最小值都相等的时候,所有的值就都相等了{t=a[m];for(i=1;i<=m;i++){p=t/2+a[i]/2;t=a[i];a[i]=p;if(a[i]&1)a[i]++;b[i]=a[i];}sort(b+1,b+m+1);cot++;}printf("%lld %lld\n",cot,a[1]);}return 0;}
0 0
- 杭电-1034Candy Sharing Game(模拟)
- 杭电1034(模拟法) 之 Candy Sharing Game
- 杭电 1034:Candy Sharing Game
- 杭电 HDU 1034 Candy Sharing Game
- 杭电1034 Candy Sharing Game
- HDU杭电1034 Candy Sharing Game
- 【杭电oj】1034-Candy Sharing Game(水)
- HDU 1034 Candy Sharing Game 模拟题
- hdu 1034 Candy Sharing Game(暴力模拟)
- hdu 1034 Candy Sharing Game【水题 模拟】
- hdoj 1034 Candy Sharing Game 【模拟】
- HDOJ 1034 Candy Sharing Game(模拟)
- HDU 1034 Candy Sharing Game 模拟
- HDU 1034:Candy Sharing Game【模拟】
- 模拟:HDU1034-Candy Sharing Game
- 1034:Candy Sharing Game
- 1034 Candy Sharing Game
- 杭电HOJ1034 Candy Sharing Game 的一种解法
- 添加和删除选项:javascript
- UGUI中image不能使用旧版Animation
- C++学习知识点总结(1)
- NOIP2015 day2t3 运输计划
- What is JSON?
- 杭电-1034Candy Sharing Game(模拟)
- hdu 5592 BestCoder Round #65(树状数组)
- LINUX打印
- Arduino 平台与C语言程序设计-week1-Arduino Environment-Lesson3
- Best Time to Buy and Sell Stock with Cooldown
- Nginx 配置SSL访问
- 编译原理 LR(0)项目集规范族的构造 LR(0)分析表+分析语句 详解分析+代码
- splay区间翻转及删除区间,平移区间
- 实例Block传值