Candy Sharing Game

Candy Sharing Game

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2877    Accepted Submission(s): 1800

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
  
  
  
  


  
  
  
  

   
   题目意思就是说：
   
   一些学生坐在面对他们的老师在圆心。每个学生最初具有偶数个糖果条。当老师鸣笛，每个学生同时给一半他或她的糖果到右边的邻居。任何学生，谁结束了糖果件数为奇数，由老师给出另一块。比赛结束时，所有学生都有糖果件数相同。
   
   

   
   编写一个程序，它决定了老师吹哨和糖果为每个学生的作品的最终数目从糖果每个孩子开始与量的次数；
  
  
  
  

   
   这样一来只需要利用几个循环去判断就行了，
  
  
  
  

   
   AC代码：
  
  
  
  

   
   
   
   
#include <stdio.h>
int main()
{
  int n;
  int i;
  int flag;
  int a[1000];
  int chance;
  int sum;
  while(~scanf("%d",&n))
  {
    flag=1;
    sum=0;
    if(n==0)  break;
    for(i=0;i<n;i++)
    {
      scanf("%d",&a[i]);
    }
    while(flag)
    {
      flag=0;
      for(i=1;i<n;i++)
      {
        if(a[i-1]!=a[i])
        {
          flag=1;
        }
      }
      chance=a[n-1]/2;
      a[n-1]=a[n-1]/2;
      for(i=n-1;i>0;i--)
      {
        a[i]+=a[i-1]/2;
        a[i-1]=a[i-1]/2;
      }
      a[0]=a[0]+chance;
      for(i=0;i<n;i++)
      {
        if(a[i]%2!=0)
        {
          a[i]++;
        }
      }        
      k++;
    }
    printf("%d %d\n",k-1,a[0]);
  }
  return 0;
}