1697. Triangular Sums

单点时限: 2.0 sec

内存限制: 256 MB

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)]

输入格式

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.

输出格式

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.

样例

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

24 人解决,31 人已尝试。

26 份提交通过,共有 37 份提交。

3.7 EMB 奖励。

创建: 13 年,4 月前.

修改: 3 年,4 月前.

最后提交: 11 月,3 周前.

来源: Greater New York 2006

题目标签