sicily 1052. Candy Sharing Game
来源:互联网 发布:红包神器软件 编辑:程序博客网 时间:2024/05/28 23:21
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
题目分析
给定一组数,每次将每个数的一半分给下一个数(同时,最后一个给第一个)
若此时为奇数,自增一求使所以数相等需要几轮及最后的结果
#include <stdio.h>bool equal(int a[], int size) { for (int c = 1; c < size; ++c) if (a[c] != a[c - 1]) return false; return true;}int main(){ int num; while (scanf("%d", &num) && num != 0) { int a[num]; for (int c = 0; c < num; ++c) scanf("%d", &a[c]); int count = 0; while (!equal(a, num)) { int temp = a[num - 1] / 2; for (int c = num - 1; c > 0; --c) { a[c] /= 2; a[c] += a[c - 1] / 2; if (a[c] % 2 == 1) a[c]++; } a[0] /= 2; a[0] += temp; if (a[0] % 2 == 1) a[0]++; ++count; } printf("%d %d\n", count, a[0]); } 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
- java中内部类访问局部变量的时候,为什么变量必须加上final修饰
- IOS KVO笔记
- jq幻灯
- javaWeb常见异常的解决方法
- 数据库笔记----金融数字前面加零
- sicily 1052. Candy Sharing Game
- 思考中前进----泛型和Object比较
- hihocoder #1258 签到题
- Java多线程线程、同步代码块、同步函数、死锁
- cocos2d-x学习笔记(1) 工程初始化
- javascript 地理位置api的测试
- 如何成为优秀的驱动开发工程师
- 顺序入栈的出栈方法种数
- 【2015-2016 ACM-ICPC, NEERC, Northern Subregional Contest H】【字符串哈希 构造】Hash Code Hacker 构造有相同哈希值的不同字符串