Problem 3466 --Triangular Sums

3466: Triangular Sums

上一题 正确率: $75.00\%$ 下一题
"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $4$ 正确数量 $3$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签

Description

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

推荐代码 查看3466 所有题解 上传题解视频得图灵币

本题记录 用 户（点击查看用户） 运行号（点击购买题解） 时 间
算法最快[$0 $ms] aoj_judger 614950 2020-10-07 16:38:06
内存最少[$0 $KB] aoj_judger 615338 2020-10-08 15:07:37
第一AC aoj_judger 614950 2020-10-07 16:38:06
第一挑战 aoj_judger 614950 2020-10-07 16:38:06

赛题来源/所属竞赛 N/A

竞赛编号 竞赛名称 竞赛时间 访问比赛