Project Euler_Problem 134_Prime Pair Connection

原题目：

题目大意：

题解思路：

思路一： 暴力搜索

思路二：逆元+费马小定理

速度快多了 

void solve() {
    ll i, j, k, p, q, r, t,u,v;
    double a1, a2 = 0;
    NN = 1000000000;
    double a, b, c;
    v = 0;
    
    get_prime(1050000);
    ans1 = 0;
    
    for (i = 3; i <= pcnt; i++) {
        p = prime[i];
        if (p > 1000000)break;
        q = prime[i + 1];
        
        r = p; t = 1;
        while (r) {
            r = r / 10;
            t=t*10;
        }

        MOD = q;
        r = quickMod(t, q - 2);

        u = p * r;
        k = u / q;

        v = (k+1)*q-u;
        v = v * t + p;

        ans1 = ans1 + v;

    }

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

}