import java.util.Scanner;
public class Main{
public static int N;
public static int[] Child;
public static int count=0;
public void getResult(){
while(true){
boolean judge=true;
for(int i=1;i<N;i++){
if(Child[0]!=Child[i]){
judge=false;
break;
}
}
if(judge)
break;
int[] half=new int[N];
for(int i=0;i<N;i++){
if(i==N-1)
half[0]=Chlid[i]/2;
else
half[i+1]=Child[i]/2;
}
for(int i=0;i<N;i++){
Chlid[i]=Child[i]/2+half[i];
if(Child[i]/2==1){
count++;
Child[i]++;
}
}
}
System.out.println(count);
}
public static void main(String[] args){
MAin test=new Main();
Scanner in=new Scanner(System.in);
N=in.nextInt();
Child=new int[N];
for(int i=0;i<N;i++){
Child[i]=in.nextInt();
test.getResult();
}
}
试题 历届试题 分糖果
最新推荐文章于 2023-01-29 16:37:45 发布