B - Candy Sharing Game

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


        
  

Hint

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个学生环做在一起，每个人都有偶数个糖，哨声响起后同时将自己糖的一半分给右边的同学，结束后是奇数的从老师那得到一个糖。同学们的糖都一样时，游戏结束，输入N，再输入N名同学的糖数。输出循环的次数，和次数同学们手中的糖的数

  
  

   
   

    
    #include<iostream>
using namespace std;
int student[10000],stud[10000];
int main()
{
   
   
   
   

    
     int i,n,flag,num;
 while((cin>>n)&&n)  //判断是否为0 
 {
  for(i=0;i<n;i++)
  {
   cin>>student[i];
  }
  num=0;
  while(1)
  {
   for(i=0;i<n;i++)
  {
   student[i]=student[i]/2; //哨声响起 
  }
  for(i=0;i<n;i++)
  {
   if(i==0)
   {
    stud[0]=student[0]+student[n-1];
   }
   else
   {
    stud[i]=student[i]+student[i-1];
   }
   
  }
  flag=1; 
  for(i=0;i<n;i++)
  {
   if(stud[i]%2==1)
   {
    stud[i]+=1; 
   }
   student[i]=stud[i];
  } 
  for(i=0;i<n-1;i++) //判断是否全部相等 
  {
   if(stud[i]!=stud[i+1])
   {
    flag=0;
    break;
   }
  }
  
  num+=1;
  
  if(flag==1)
  {
   break;
  } 
  
  }
  
   cout<<num<<" "<<stud[0]<<endl;
 }
}