import java.util.Scanner;
public class sum {
//此方法判断传入的数是否为素数
static boolean is_prime(int n) {
if (n <= 0 || n == 1) {
return false;
}
for (int i = 2; i <= Math.sqrt((double) n); i++) {
if (n % i == 0)
return false;
}
return true;
}
//这是一个main方法,是程序的入口:
public static void main(String[] args) {
Scanner fin = new Scanner(System.in);
int a, b, ans;
while (fin.hasNext()) {
a = fin.nextInt();
b = fin.nextInt();
if (a == -1 && b == -1) {
break;
}
ans = 0;
for (int i = a; i <= b; i++) {
//判断此数是否为素数
if (is_prime(i)) {
ans++;
//打印
System.out.print(i + " ");
}
}
//打印
System.out.println();//换行
System.out.println("素数有:" + ans);//计算素数个数
}
}
}
10-12
5144
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
06-24
151
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)