1 solutions

  • 1
    @ 2025-9-4 21:54:35

    #include using namespace std;

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

    int main() { int n, count = 0; cin >> n; for (int i = 2; i <= n - 2; ++i) { if (is_prime(i) && is_prime(i + 2)) { ++count; } } cout << count << endl; return 0; }

    • 1

    Information

    ID
    1092
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    8
    Tags
    # Submissions
    25
    Accepted
    6
    Uploaded By