1156 Sexy Primes
#include <iostream>
#include <cmath>
using namespace std;
int p, ans;
int isPrime(int x) {
if (x < 2) return false;
for (int i = 2; i <= sqrt(x); i++)
if (x % i == 0) return false;
return true;
}
int main() {
cin >> p;
if (isPrime(p) && isPrime(p - 6)) {
cout << "Yes"<<endl;
cout<< p - 6;
} else if (isPrime(p) && isPrime(p + 6)) {
cout << "Yes" <<endl;
cout<< p + 6;
} else {
for (ans = p + 1; ; ans++) {
if (isPrime(ans) && isPrime(ans - 6)) break;
if (isPrime(ans) && isPrime(ans + 6)) break;
}
cout << "No"<<endl;
cout<< ans;
}
return 0;
}
更多推荐
所有评论(0)