ZOJ.2773 Triangular Sums【水~】 2015/09/24

Triangular Sums

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

The nth Triangular number, T(n) = 1 + ... + n, is the sum of the first n integers. It is the number of points in a triangular array with n points on side.

For example T(4):

   X
  X X
 X X X
X X X X

Write a program to compute the weighted sum of triangular numbers:

W(n) = SUM[k = 1..n; k*T(k+1)]

Input

The first line of input contains a single integer N, (1 <= N <= 1000) which is the number of datasets that follow.

Each dataset consists of a single line of input containing a single integer n, (1 <= n <= 300), which is the number of points on a side of the triangle.

Output

For each dataset, output on a single line the dataset number, (1 through N), a blank, the value of n for the dataset, a blank, and the weighted sum , W(n), of triangular numbers for n.

Sample Input

4
3
4
5
10

Sample Output

1 3 45
2 4 105
3 5 210
4 10 2145

---

Source: Greater New York Regional 2006
水，W(n) = W(n-1) + n*(n+1)*(n+2)/2

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>

using namespace std;

int sum[310];

void init(){
    sum[1] = 3;
    for( int i = 2 ; i <= 300 ; ++i ){
        int ret = i*(i+1)*(i+2)/2;
        sum[i] = sum[i-1] + ret;
    }
}

int main(){
    init();
    int t,ans=1,n;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        printf("%d %d %d\n",ans++,n,sum[n]);
    }
    return 0;
}