# HDU 1034 Candy Sharing Game

146人阅读 评论(0)

## Source:

http://acm.hdu.edu.cn/showproblem.php?pid=1034

## 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

Copy sample input to clipboard

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

## Notes:

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

## 题目大意：

n个学生围成一圈，每个人手上有偶数个糖果，他们都把自己手中一半的糖果分给他右边的同学。分完若为奇数，则老师会给他一颗糖果（another piece）。游戏直到所有人糖果数一样则结束。

## Caution:

1、注意最后一个人与第一个人之间的关系
2、先给再拿。所以考虑倒序

## 示例代码：

#include <iostream>
#include <cstring>
#include <string>

using namespace std;

int a[100001];

bool iscontinue(int arr[],int n)
{
for (int i = 0; i < n - 1;++i)//注意边界
if (arr[i] != arr[i + 1])
return 1;
return 0;
}

int main()
{
int n;
while (cin >> n && n)
{
int count = 0;
memset(a, 0, sizeof(a));
for (int i = 0; i < n; ++i)
cin >> a[i];
while (iscontinue(a, n))
{
++count;
int y = a[n - 1];//第1点+第2点。备份
for (int i = n - 1; i >= 1; --i)//第2点。倒序
{
a[i] = a[i] / 2 + a[i - 1] / 2;
if (a[i] % 2)
++a[i];
}
a[0] = a[0]/2 + y / 2;//第1点
if (a[0] % 2)
++a[0];
}
cout << count << " " << a[0] << endl;
}
return 0;
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：8049次
• 积分：442
• 等级：
• 排名：千里之外
• 原创：23篇
• 转载：0篇
• 译文：0篇
• 评论：0条