package com.a.b;
public class PrimeNumbersFinder {
public static void main(String[] args) {
int start = 2; // 开始数字
int end = 100; // 结束数字
System.out.println("质数列表(从 " + start + " 到 " + end + "):");
for (int i = start; i <= end; i++) {
if (isPrime(i)) {
System.out.print(i + " ");
}
}
}
public static boolean isPrime(int num) {
if (num <= 1) {
return false;
}
for (int i = 2; i <= Math.sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
}
zhao质数java
最新推荐文章于 2024-09-27 00:45:01 发布