Project Euler_Problem 131_Prime Cube Partnership

原问题：

题目大意： 

题解思路：

void solve() {
    ll i, j, k, p, q, r, t;
    double a1, a2 = 0;
    ll NN = 200;
    double a = 0, b = 0;
    
    get_prime(1000000);
    prime_vis[1] = 1;

    for (i = 1; i <= 1000; i++) {
        p = 3 * i * i + 3 * i + 1;
        if(p<=1000000&& prime_vis[p] == 0){
            ans1++;
        }
    }
    

    
    printf("%lld\n", ans1);

}