1007 素数对猜想 (20 分)
输入样例:
20
输出样例:
4
AC代码
#include <iostream>
#include <cmath>
using namespace std;
int isPrime(int x);
int main() {
int N, Temp = 2, cnt = 0;
cin >> N;
for (int i = 3; i <= N; i++)
if (isPrime(i)) { if ((i - Temp) == 2) cnt++; Temp = i; }
cout << cnt;
return 0;
}
int isPrime(int x) {
int ret = 1;
for (int i = 2; i <= sqrt(x); i++) if (x%i == 0) { ret = 0; break; }
if (x == 1) ret = 0;
return ret;
}