nyoj 122 triangular sums

Triangular Sums

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

难度：2

描述
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.样例输入4
3
4
5
10
样例输出1 3 45
2 4 105
3 5 210
4 10 2145
#include<stdio.h>
int main()
{

 int n,d=0;
 scanf("%d",&n);
 while(n--)
 {
  int a,leap=0,sum=0,i;
  scanf("%d",&a);
  for(i=1;i<=a;i++)
  {
   for(int j=1;j<=i+1;j++)
   {
    leap+=j;
   }
   sum+=i*leap;
   leap=0;
  }
  d++;
  printf("%d %d %d\n",d,a,sum);
 }
 return 0;
}