蓝桥杯-- Candy Sharing Game(模拟)

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

For each game, the input begins with the number NN (1≤N≤100)(1≤N≤100) of students, followed by NN (even) candy(the number of candy no more than 1000) counts for the children counter-clockwise around the circle.

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.

Examples

Input

Copy

4
2
4
6
8

Output

Copy

4 8

Input

Copy

2
2
2

Output

Copy

0 2

Note

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>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <set>
#include <cstring>
#include <stack>
#include <set>
#include <vector>
#include <map>
#include <time.h>
#include <queue>
#define Swap(a,b)  a ^= b ^= a ^= b
#define pi acos(-1)
#define cl(a,b) memset(a,b,sizeof(a))
#define lson rt<<1
#define rson rt<<1|1
using namespace std ;
typedef long long LL;
//const int N = 1e7+10 ;
const int inf = 0x3f3f3f3f;
const int MAX = 50050;
int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

int a[1005] ;
int ans  ;
int main()
{
	int n ;
	int ans1 = 0 ,ans2 = 0  ;
	cin >>n  ;
	for(int i = 1 ;i<=n;i++){
		cin >>a[i] ;
	}
	bool flag = false ;
	int i ;
	while(1){
		
		for(i = 2 ; i<=n;i++ ){
			if(a[i-1]!=a[i])
			break;
		}
		if(i>n){
			ans2 = a[i-1] ;
		 	break;
		}
		
		ans1++ ;
		int t = a[n]/2 ;
		for(int i = n ; i>1;i--){
			a[i]/=2 ;
			a[i]+=a[i-1]/2 ;
		}
		a[1]/=2 ;
		a[1]+=t ;
		for(int i = 1 ; i<=n ; i++ ){
			if(a[i]&1){
				a[i]++ ;
			}
		}
	
	}
	cout<<ans1<<" "<<ans2;
	return 0 ;
}