49,441
社区成员




package com.LQ.day9;
public class Question1 {
public static void main(String[] args) {
int cnt = 0;
for (int i = 2; ; i++) {
if (isPrime(i)) {
cnt++;
if(cnt ==100002){
System.out.println(i);
return;
}
}
}
}
public static boolean isPrime(int n) {
if (n == 1) return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
}