蓝桥杯JAVA版答案——历年真题——分巧克力

更多JAVA版答案移步我的博客：蓝桥杯JAVA版答案汇总

本题考查

枚举？

思路

简单枚举，巧克力的最大长度一定小于等于所有给定巧克力的最大边长

AC代码

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner scaner = new Scanner(System.in);
		int n = scaner.nextInt();
		int k = scaner.nextInt();
		int[][] chocolate = new int[n][2];
		int max = 0;
		for (int i = 0; i < n; i++) {
			chocolate[i][0] = scaner.nextInt();
			chocolate[i][1] = scaner.nextInt();
			int cMax = Math.max(chocolate[i][0], chocolate[i][1]);
			max = max > cMax? max:cMax;
		}
		scaner.close();
		for (int i = max; i >= 1; i--) {
			int cPiece = 0;
			for (int j = 0; j < n; j++)
				cPiece+=(chocolate[j][0]/i)*(chocolate[j][1]/i);
			if(cPiece>=k) {
				System.out.println(i);
				break;
			}
		}
	}
}