```
class test {
private static boolean[] check = new boolean[101];//这里定100会有越界错误
private static int[] primeList = new int[101];
private static void euler(int num) {
int count = 0;
for (int i = 2; i ) {
if (!check[i]) {
primeList[count++] = i;
}
for (int j = 0; j < count && i * primeList[j] ) {
check[i * primeList[j]] = true;
if (i % primeList[j] == 0) {
break;
}
}
}
System.out.println(count);
}
public static void main(String[] args) {