HDU 1034 Candy Sharing Game

原创 2015年11月21日 10:24:32

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:

首选吐槽原题样例的输入数据毫无美感可言,一堆叠在一起简直心理burden。上面的输入样例是我改过格式的了。
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;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU-1034-Candy Sharing Game(C++ && 简单模拟)

Candy Sharing Game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Othe...

hdu 1034 Candy Sharing Game

http://acm.hdu.edu.cn/showproblem.php?pid=1034Problem DescriptionA number of students sit in a circl...

HDU 1034 Candy Sharing Game 模拟

题意:N个人围成一圈,在每个回合中,每个人把自己的糖果分一半给右边的人,在一个回合结束后,如果这个人的的糖果数是奇数,老师就会给这个人一个糖果,回合结束的条件:所有人的糖果数是相同的。问回合进行多少次...

杭电1034 Candy Sharing Game

Candy Sharing Game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Othe...
  • z8110
  • z8110
  • 2015-12-08 18:46
  • 309

hdoj 1034 Candy Sharing Game

Candy Sharing Game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Othe...

hdoj 1034Candy Sharing Game

一开始递归过程没写好,还以为不是模拟过程,后来直接删除直接重写,之前错过许多次,思路变得清晰了,就AC了。。 题目大意:一群学生围成一个圈,老师在中间,每个学生都有偶数个苹果,老师在中间吹一次哨子,...

杭电-1034Candy Sharing Game(模拟)

Candy Sharing Game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Ot...

文章标题 POJ :1666 Candy Sharing Game(模拟)

Candy Sharing GameDescriptionA number of students sit in a circle facing their teacher in the center...

题目1145:Candy Sharing Game

题目描述:     A number of students sit in a circle facing their teacher in the center. Each student in...

分糖果(1002. Candy Sharing Game)

题目:猴子选大王,有N只猴子,从1~N进行编号。它们按照编号的顺时针方向,排成一个圆圈,然后从第一只猴子开始报数。第一    只猴子报1,以后每只猴子报的数字都是它前面猴子所报数字加1。如果一只猴子报...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)