[sicily]1052. Candy Sharing Game
来源:互联网 发布:php 抽象工厂模式 编辑:程序博客网 时间:2024/05/22 06:25
1052. Candy Sharing Game
Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
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
6362222211222018161412108642424680
Sample Output
15 1417 224 8Notes: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
简单的游戏模拟题,利用数组就可以轻松解决。代码如下:
#include <iostream>#include <algorithm>#include <cmath>using namespace std;int main(){ int t; while(cin>>t && t>0) { int circle[t]; int count=0,flag=1; for(int i=0; i<t; i++) cin>>circle[i]; while(flag==1) { flag = 0; if(circle[0] != circle[t-1])//先判断圈中是否存在不同数,如果有设 flag = 1; flag = 1; for(int i=0; i<t-1; i++) { if(circle[i] != circle[i+1]) flag = 1; } if(flag==1) // 有不相同的数,继续将自己的一半分给右边的人 { count++; int tmp = circle[t-1]; for(int i=t-1; i>0; i--) { circle[i] = (circle[i]+circle[i-1])/2; } circle[0] = (circle[0]+tmp)/2; for(int i=0; i<t; i++) // 如果奇数,从老师那边获取一个,凑成偶数个 { if(circle[i]%2 == 1) circle[i]++; } } } cout<<count<<" "<<circle[0]<<endl; } //system("pause"); return 0; }
- sicily--1052. Candy Sharing Game
- Sicily.1052. Candy Sharing Game
- sicily 1052. Candy Sharing Game
- sicily 1052.Candy Sharing Game
- Sicily 1052. Candy Sharing Game
- [sicily]1052. Candy Sharing Game
- sicily 1052. Candy Sharing Game
- Sicily: Candy Sharing Game
- [sicily online]1052. Candy Sharing Game
- sicily 1052 Candy Sharing Game
- 1052. Candy Sharing Game
- 1052. Candy Sharing Game
- SOJ 1052. Candy Sharing Game
- Candy Sharing Game
- 1034:Candy Sharing Game
- 1034 Candy Sharing Game
- hdu1034-Candy Sharing Game
- hdu1034 Candy Sharing Game
- 11月风怒(2)
- 菜鸟留念
- 4.2.1 Codec基类
- hdu 1686 Oulipo KMP 纯手搓
- 高通平台Camera框架部分浅谈--Camera C/S 的init流程
- [sicily]1052. Candy Sharing Game
- yii1框架寻找类的方法之import
- SpringMVC从Controller跳转到另一个Controller
- iOS自定义转场动画(2)——自定义Pop转场动画并加入手势驱动
- 从腾讯QQgame高性能服务器集群架构看“分而治之”与“自治”等分布式架构设计原则
- 《山海经——五藏山经》
- Ubuntu 手动安装firefox以及创建快捷方式和账号同步
- Java中Synchronized的用法
- JavaScript——js获取url方法,方便以后页面的跳转