【蓝桥杯】均分纸牌

标签：java   算法   蓝桥杯   

　3

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class 均分纸牌 {

	public static List<Integer> list = new ArrayList<Integer>();
	
	public static int sum = 0;
	
	public static int count = 0;

	public static void main(String[] args) {
		 Scanner scan = new Scanner(System.in);
		 int n = Integer.parseInt(scan.nextLine());
		 String str = scan.nextLine();
		 String[] strs = str.split(" ");
		 for(int i=0; i<strs.length; i++) {
			 sum += Integer.parseInt(strs[i]);
		 }
		 for(int i=0; i<n; i++) {
			 list.add(Integer.parseInt(strs[i]) - sum/n);
		 }
		 for(int i=1; i<n; i++) {
			 if(list.get(i-1) != 0) {
				 list.set(i, list.get(i)-(0-list.get(i-1)));
				 count ++;
			 }
		 }
		 System.out.println(count);
	}
}

【蓝桥杯】均分纸牌,布布扣,bubuko.com

【蓝桥杯】均分纸牌

标签：java   算法   蓝桥杯   

原文地址：http://blog.csdn.net/tracysilocean/article/details/27537183