import java.util.Scanner;
public class PrimePair {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int N = scan.nextInt();
scan.close();
if(N <= 100000) {
int num1 = 2; //用来记录第i个素数的值
int num =0; //记录第i-1个素数的值
int record = 0; //记录符合条件的素数对
for(int i = 2; i <= N; i++) { //遍历寻找N以内的素数
boolean bool = true;
for(int j = 2; j * j <= i; j++) {
if(i % j == 0) {
bool = false;
break;
}
}
if(bool) {
num = num1;
num1 = i;
if(num1 - num == 2) {
record++;
}
}
}
System.out.println(record);
}
}
}
PTA试题1----素数对问题
最新推荐文章于 2025-03-30 23:49:56 发布