UVa 10177 - (2/3/4)-D Sqr/Rects/Cubes/Boxes?

传送门UVa 10177 - (2/3/4)-D Sqr/Rects/Cubes/Boxes?

看了二十来分钟, 估摸着我是找不出规律来了. 

其实我连N * N * N都不会数.

参考了别人的解题报告, 规律如下.

n维正方形: 1^n + 2^n +.....+n^n.

矩形的话, 只要算出包括正方形在内的数量, 减去正方形. 总共的数量是(1 + 2 +.... +n)^n

#include <cstdio>
#include <cmath>

int main()
{
    long long s2[110], s3[110], s4[110], r2[110], r3[110], r4[110];
    s2[0] = s3[0] = s4[0] = r2[0] = r3[0] = r4[0] = 0;
    for (long long i = 1; i <= 100; i++)
    {
        s2[i] = s2[i - 1] + i * i;
        s3[i] = s3[i - 1] + i * i * i;
        s4[i] = s4[i - 1] + i * i * i * i;
        r2[i] = pow(i * (i + 1) / 2, 2) - s2[i];
        r3[i] = pow(i * (i + 1) / 2, 3) - s3[i];
        r4[i] = pow(i * (i + 1) / 2, 4) - s4[i];
    }
    long long n;
    while (~scanf("%lld", &n))
        printf("%lld %lld %lld %lld %lld %lld\n", s2[n], r2[n], s3[n], r3[n], s4[n], r4[n]);
    return 0;
}