PAT1007 素数对猜想

#include <iostream>
#include <valarray>
#include <vector>
using namespace std;

bool IsPrime(int num){
    if (num == 2 || num == 3 || num == 5){
        return true;
    }

   
    if (num % 6 != 1 && num % 6 != 5){
        return false;
    }

    int temp = sqrt(num);
    for (int i = 5; i <= temp; ++i) {
        if (temp % i == 0){
            return false;
        }
    }

    return true;
}

int main() {
    vector<int> v;
    int n;
    cin >> n;
    

    for (int i = 2; i <= n; ++i) {
        bool b = IsPrime(i);

        if (b){
            v.push_back(i);
        }
    }

    int count = 0;
    int temp = v.size() - 1;
    for (int i = 0; i < temp; ++i){
        if ((v[i + 1] - v[i]) == 2){
            count++;
        }
    }

    cout << count << endl;
    system("pause");
    return 0;
}