NYOJ-122-Triangular Sums-2013年10月5日15:55:52
来源:互联网 发布:wifi限速软件 编辑:程序博客网 时间:2024/05/21 20:49
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 XWrite 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.
- 样例输入
434510
- 样例输出
1 3 452 4 1053 5 2104 10 2145
# include<stdio.h>int main(){int N,n,i,T,W,k;scanf("%d",&N);k = 0;while(N--){k++;scanf("%d",&n);W = 0;for(i=1;i<=n;i++){T = (i+2) * (i+1) / 2;W = i * T + W;}printf("%d %d %d\n",k,n,W);}return 0;}
- NYOJ-122-Triangular Sums-2013年10月5日15:55:52
- nyoj 122 Triangular Sums
- NYOJ 122 Triangular Sums
- NYOJ 122 Triangular Sums
- nyoj 122 Triangular Sums
- NYOJ-122 Triangular Sums
- nyoj 122 Triangular Sums
- nyoj 122 triangular sums
- NYOJ 122 Triangular Sums
- nyoj 122Triangular Sums
- 【NYOJ】[122]Triangular Sums
- nyoj 122 triangular sums
- NYOJ - Triangular Sums
- NYOJ-ACM-Triangular Sums
- 122 Triangular Sums
- 南阳122 Triangular Sums
- 题目122 Triangular Sums
- 122 Triangular Sums
- 收集(快照)日志
- poj1782Run Length Encoding(题目难以看懂,也有一些坑)
- 提升系统版本号
- modelsim安装问题
- 字符串复制\比较\连接问题
- NYOJ-122-Triangular Sums-2013年10月5日15:55:52
- 添加物理卷到卷组
- 消除IBM P750小机上的黄色报警灯
- GetOpenFileNameA 和 DirectDraw 冲突?
- 搭建Nginx+Java环境(转)
- 修改内核参数
- NYOJ-125-盗梦空间-2013年10月5日16:48:58
- 增加交换分区容量
- 图的一些基本概念