Project Euler_Problem 136_Singleton Difference

原题目：

解题思路:设x=(y+a),z=(y-a)，暴力枚举a和y即可.

代码：

ll ans1 = 0,ans2=0,flag;
void solve() {
    ll i, j,k,x,y,z,p,q,u,v;
    ll N = 100000000,NN=50000000;
    u = 0;
    
    
    for (i = 2; i <= N; i++) {
        for (j = (i >> 2)+1; j < i; j++) {
            p = i * (4 * j - i);
            if (p >= NN)break;
            D[p]++;

        }
    }

    for (i = 1; i <= NN; i++) {
        if (D[i] == 1) {
            ans1++;
        }
    }


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