HDU 1034 Candy Sharing Game

Candy Sharing Game


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.
 

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


题意:先输入一个数N,下面有N个学生糖数,每个学生初始都有偶数个糖,然后每次所有人都拿出自己糖数的一半给右边的学生,一轮结束,所有奇数补一,最后求多少轮后所有学生糖相等,每个学生有多少糖。

我也不知到学生数有什么限制,直接就写1000了,模拟一下。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[1000];
int main()
{
    int i,j,n,t;
    while(~scanf("%d",&n)&&n)
    {
        for(i=0; i<n; i++)
        {
            scanf("%d",&a[i]);
        }
        bool f=1;
        int c=0;
        while(f)
        {
            c++;
            f=0;
            t=a[n-1]/2;
            a[n-1]=a[n-1]/2;
            for(j=n-1; j>=1; j--)
            {
                a[j]+=a[j-1]/2;
                if(a[j]%2)
                    a[j]++;
                a[j-1]/=2;
            }
            a[0]+=t;
            if(a[0]%2)
                a[0]++;
            for(j=0; j<n-1; j++)
                if(a[j]!=a[j+1])
                {
                    f=1;
                    break;
                }
            if(a[n-1]!=a[0])
                f=1;
        }
        printf("%d %d\n",c,a[0]);
    }
    return 0;
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/DT_Zhangshuo/article/details/52960180
个人分类: 找规律
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭