乔治有一些同样长的小木棍。。。

package net.johnhany.wpcrawler;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class sort {

public static void main(String args[]) {

int woodNum = 0;
int woodLength = 0; // 木头的数量和长度
int length = 0;
int sumLength = 0;
int i = 0;
int wood[] = new int[61];// 命名数组

Scanner scanner = new Scanner(System.in);
System.out.println("请输入整数数据~");
while (true) {
length = scanner.nextInt();
if (length == 0) {
break;
}
if (0 < length && length < 50) {
wood[i] = length;
System.out.println(length);
sumLength = length + sumLength;
i++;
woodNum = i;
}
}
if (woodNum > 60) {
System.out.println("小木头太多了 请重新输入");
}
Arrays.sort(wood);
System.out.println("小木头的总数" + woodNum + "木头的总长度" + sumLength);
// 将木头 剪裁后的数据录入

int y1 = woodNum * sumLength;
ArrayList<Integer> yueshu = new ArrayList<Integer>();
for (int a = 1; a < y1; a++) {
if (y1 % a == 0) {
yueshu.add(a);
}
}
for (int b = 1; b < yueshu.size(); b++) {
if (yueshu.get(b) >= wood[wood.length - 1] && yueshu.get(b) <= sumLength) {
System.out.println(yueshu.get(b));
break;
}
}
}
}