Project Euler_Problem 174_Hollow Square Laminae II

原问题：

解题思路：暴力搜索即可

代码：

void serch1(ll x) {
    ll i, j, k, p, q;
    p = 0;
    for (i = x; i > 2; i = i - 2) {
        p = p + 4 * (i - 1);
        if (p > 1000000)break;
        A[p]++;
    }
}



ll ans1 = 0,ans2=0,flag;
void solve() {
    ll i, j,k,x,y,p,q,u,v;
    ll N = 1000000;
    u = 0;
    
    for (i = 250001; i >= 3; i--) {
        serch1(i);
    }
    for (i = 1; i <= 1000000; i++) {
        if(A[i]<=10)
        B[A[i]]++;
    }

    for (i = 1; i <= 10; i++) {
        ans1 = ans1 + B[i];
    }

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