杭电acm 1034题

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

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个开始都拿着偶数颗糖的小朋友围着老师坐，老师一吹哨子同时给自己右手边的同学自己一半的糖，结束后奇数颗糖的同学老师会给一颗糖补成偶数棵，直到大家手上的糖一样数目...问需要玩几次，以及最后糖的数量是多少？

 #include <iostream>
 using namespace std;
 #define Max 10000
 int judge(int *stu,int len);
 int main(void)
 {
     int student[Max];
     int N;
     int j=;
     int i=;
     int temp[Max];
     int around=;
     cin>>N;
     while(N)
     {
         around=;
         for(i=;i<N;i++)
             cin>>student[i];
         for(j=;;j++)
         {

             //所有的都看看有没有奇数
             for(i=;i<N;i++)
             {
                 student[i]=student[i]/;
                 temp[i]=student[i];
             }
             for(i=;i<N;i++)
             {
                 student[i]+=temp[i-];
             }
             student[]+=temp[N-];
             for(i=;i<N;i++)
             {
                 if(student[i]%==)
                     student[i]+=;
             }
             around+=;
             if(judge(student,N))
                 break;

         }

         cout<<around<<" "<<student[]<<endl;
         cin>>N;
     }
     return ;
 }
 int judge(int *stu,int len)
 {
     int flag=;
     for(int i=;i<len;i++)
     {
         if(stu[i-]==stu[i])
             continue;
         else {flag=;break;} 

     }
     return flag;

 }