public class _2_countPrimes {
public static void main(String[] args) {
System.out.println(countPrimes(100));
}
static int countPrimes(int x){
int count=0;
for (int i = 2; i < x; i++) {
count+=isPrime(i)?1:0;
}
return count;
}
private static boolean isPrime(int x) {
for (int i = 2; i*i <= x; i++) {
if (x%i==0)return false;
}
return true;
}
}
2.统计素数个数
最新推荐文章于 2022-12-20 22:06:14 发布