孪生素数统计：C++ 代码实现

#include #include using namespace std;

bool isPrime(int num) { if (num <= 1) { return false; } for (int i = 2; i * i <= num; i++) { if (num % i == 0) { return false; } } return true; }

int main() { int n; cin >> n;

vector<int> primes;
for (int i = 2; i <= n; i++) {
    if (isPrime(i)) {
        primes.push_back(i);
    }
}

for (int i = 0; i < primes.size() - 1; i++) {
    if (primes[i + 1] - primes[i] == 2) {
        cout << primes[i] << ' ' << primes[i + 1] << endl;
    }
}

return 0;

}