- wangdi's blog
哥德巴赫猜想
- 2023-8-21 11:29:38 @
#include <bits/stdc++.h>
using namespace std;
bool prime(int n) {
if (n < 2) {
return false;
} else {
int nn = sqrt(n);
for (int i = 2; i <= nn; i++) {
if (n % i == 0) {
return false;
}
}
}
return true;
}
int main() {
// 哥德巴赫猜想:任一大于2的偶数都可写成两个质数之和
int cnt = 0;
for (int n = 4; n <= 1000; n += 2) {
for (int i = 2; i < n - 1; i++) {
if (prime(i) && prime(n - i)) {
cout << n << "=" << i << "+" << n - i << endl;
cnt++;
break;
}
}
}
cout << "cnt = " << cnt << endl;
return 0;
}