Project Euler_Problem 225_Tribonacci Non-divisors

原题目：

代码：

void solve() {
    ll i, j,k,x,y,z,p,q,u,v;
    ll N = 10000,NN=6000000;
    k = 2;
    u = 0;
    v = 0;
    double a, b,c;
    for (i = 5; i <= N; i += 2) {
        p = 1, q = 1, u = 1;
        while (1) {
            x = (p + q + u)%i;
            if (x == 0)break;
            p = q % i;
            q = u%i;
            u = x%i;

            if (p == 1 && q == 1 && u == 1) {
                printf("%lld %lld\n",++v, i); break;
            }
        }
        
    }
    

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