NYOJ-ACM-Triangular Sums

描述

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.

样例输入

4
3
4
5
10

样例输出

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

思路：

大意是计算K*(1+2+..+K+1)（K=1,2,3......n）的值，再把每次相加的结果相加。

代码：

import java.util.Scanner;
/*
 * 计算w(n) = sum{k=1...n;k*T(k+1)}
 * T(k+1)=1+2+3+...+k;
 */
public class Main {
	public static int sum(int a){
		int result = 0;
		for(int i=0;i<=a;i++){
			result += i;
		}
		return result;
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] a = new int[n];
		int[] s = new int[n];
		for(int i=0;i<n;i++){
			a[i] = sc.nextInt();
		}
		for(int i=0;i<n;i++){
			for(int j=1;j<=a[i];j++){
				s[i] += j*sum(j+1);
			}
			System.out.println((i+1)+" "+a[i]+" "+s[i]);
		}
	}
}