Triangular Sums

最新推荐文章于 2018-04-04 11:15:00 发布

第九系艾文

最新推荐文章于 2018-04-04 11:15:00 发布

阅读量494

点赞数

分类专栏： ACM 文章标签： Triangular Sums

本文链接：https://blog.csdn.net/ly1358152944/article/details/41120709

版权

ACM 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

Triangular Sums

时间限制： 3000 ms | 内存限制： 65535 KB

难度： 2

描述

The n^th 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.

样例输入

样例输出

1 3 45 2 4 105 3 5 210

4 10 2145

代码：

<em>#include<stdio.h>
int main()
{
	int m,n,i,j,k,sum;
	scanf("%d",&m);
	for(i=1;i<=m;i++)
	{
		sum=0;
		scanf("%d",&n);
		for(j=1;j<=n;j++)
		{
			k=j*(j+2)*(j+1)/2;
			sum=sum+k;
		}
		printf("%d %d %d\n",i,n,sum);
	}
	return 0;
}</em>