import java.util.Scanner;
public class Main {
private static int prime(int a){
int i;
for (i=2;i<=a;i++){
if(a%i==0){
break;
}
}
if(i==a){
return 1;
}else {
return 0;
}
}
public static void main(String[] args) {
int M,N;
int cnt = 0,sum = 0;
Scanner scanner = new Scanner(System.in);
M = scanner.nextInt();
N = scanner.nextInt();
for (int i = M; i <= N; i++) {
if (prime(i) == 1){
cnt++;
sum += i;
}
}
System.out.println(cnt+" "+sum);
}
}
统计素数并求和:Java保温
最新推荐文章于 2025-05-21 10:31:23 发布