解题思路:
注意事项:
参考代码:
import java.util.Scanner; public class C1431 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int n = sc.nextInt(); int[] a = new int[n]; for(int i = 0; i < n; i++){ a[i] = sc.nextInt(); } System.out.println(F(a)); } sc.close(); } private static int F(int[] a){ int count = 0; int n = a.length; while(true){ boolean isEqual = true; int temp = a[0]/2 + a[n-1]/2; //最后一个数 if(temp % 2 == 1){ temp += 1; count++; } for(int i = 0; i < n-1; i++){ a[i] = a[i]/2 + a[i+1]/2; if(a[i] % 2 == 1){ a[i] += 1; count++; } if(isEqual){ if(temp != a[i]){ isEqual = false; } } } a[n-1] = temp; if(isEqual) break; } return count; } }
0.0分
4 人评分
点我有惊喜!你懂得!浏览:1239 |
剔除相关数 (C语言代码)浏览:1015 |
兰顿蚂蚁 (C++代码)浏览:1097 |
c primer plus 第十二章 12.1小节浏览:377 |
printf基础练习2 (C语言代码)浏览:305 |
C语言训练-大、小写问题 (C语言代码)浏览:732 |
【矩阵】 (C++代码)浏览:950 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:462 |
1017题解浏览:605 |
C语言程序设计教程(第三版)课后习题5.7 (C语言代码)浏览:547 |