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

题目大意就是求出2维 、 3维 、4维下正方形中正方形和长方形的个数（正方体和超正方体类似）

基本就是推出个公式。。正方形是平方和，长方体是 总的长方形个数- 正方形个数 （ 这个想起高中一道数学题比如n条边就用行和列分别选两条边来包围一个长方形 C（2,n+1)*C(2,n+1)。代码里利用了迭代求和。。没有背公式

蛋疼的是一开始没有对数组初始化一直WA

Problem J

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

Input: standard input

Output: standard output

Time Limit: 2 seconds

You can see a (4x4) grid below. Can you tell me how many squares and rectangles are hidden there? You can assume that squares are not rectangles. Perhaps one can count it by hand but can you count it for a (100x100) grid or a (10000x10000) grid. Can you do it for higher dimensions? That is can you count how many cubes or boxes of different size are there in a (10x10x10) sized cube or how many hyper-cubes or hyper-boxes of different size are there in a four-dimensional (5x5x5x5) sized hypercube. Remember that your program needs to be very efficient. You can assume that squares are not rectangles, cubes are not boxes and hyper-cubes are not hyper-boxes. 

Fig: A 4x4 Grid	Fig: A 4x4x4 Cube

 

Input

The input contains one integer N (0<=N<=100) in each line, which is the length of one side of the grid or cube or hypercube. As for the example above the value of N is 4. There may be as many as 100 lines of input.

Output

For each line of input, output six integers S2, R2, S3, R3, S4, R4 in a single line where S2 means no of squares of different size in ( NxN) two-dimensional grid, R2 means no of rectangles of different size in (NxN) two-dimensional grid. S3, R3, S4, R4 means similar cases in higher dimensions as described before.  

 

Sample Input:

1
2
3

Sample Output:

1 0 1 0 1 0
5 4 9 18 17 64
14 22 36 180 98 1198

#include <iostream>
#include <cstdio>
#include <math.h>
using namespace std;

const int maxn = 105;
unsigned long long s2[maxn],r2[maxn],s3[maxn],r3[maxn],s4[maxn],r4[maxn];
int main()
{
    long long  n;


    s2[0]=0;s3[0]=0;s4[0]=0;

    for(unsigned long long i=1;i<=100;i++)
    {
        s2[i]=s2[i-1]+i*i;
        r2[i]=pow((i+1)*i/2,2)-s2[i];

        s3[i]=s3[i-1]+i*i*i;
        r3[i]=pow(i*(i+1)/2,3)-s3[i];

        s4[i]=s4[i-1]+i*i*i*i;
        r4[i]=pow(i*(i+1)/2,4)-s4[i];

    }

    while(scanf("%lld",&n)!=EOF)
    {
         printf("%llu %llu %llu %llu %llu %llu
",s2[n],r2[n],s3[n],r3[n],s4[n],r4[n]);
    }
    return 0;
}