Project Euler_Problem 135_Same Differences

原题目：

题目大意：

解题思路：

暴力枚举即可

ll ans1 = 0;
void solve() {
    ll i, j,x,y;
    ll N = 1000000;
    
    for (i = 2;i<=1000000; i++) {
        for (j = i/4; j < i; j++) {
            if (i > j > 1000000)continue;
            if (4 * j - i <= 0)continue;
            x = i * (4 * j - i);
            if (x > 1000000)break;
            A[x]++;
        }
        if(i%10000==0)
        printf("%lld\n", i);
    }
    
    for (i = 1; i <= 1000000; i++) {
        if (A[i] == 10) {
            ans1++;
        }
    }

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