poj3086Triangular Sums
来源:互联网 发布:剑三萝莉捏脸数据 编辑:程序博客网 时间:2024/04/30 08:25
Memory Limit: 65536KTotal Submissions: 6286
Accepted: 4466
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):
XX XX X XX 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
434510
Sample Output
1 3 452 4 1053 5 2104 10 2145
Source
#include <stdio.h>
using namespace std;
int main()
{
int i,n;
double k,ans;
scanf("%d",&n);
for(i=1;i<=n;++i)
{
scanf("%lf",&k);
ans=k*(k+1)*(k+2)*(k+3)/8;
printf("%d %.lf %.lf\n",i,k,ans);
}
return 0;
}
- poj3086Triangular Sums
- Sums
- sums
- 2Sums&3Sums
- Sums of Sums
- Alternating Sums
- Subset Sums
- Subset Sums
- Herd Sums
- Triangular Sums
- Subset Sums
- Triangular Sums
- Triangular Sums
- Subset Sums
- Triangular Sums
- 3 sums
- Herd Sums
- Triangular Sums
- Volatile 变量
- 杭电OJ(HDU)-ACM Steps-Chapter One-《A+B for Input-Output Practice》 1至8 全解
- 一文认识并读懂大数据
- xml验证器
- android LayoutInflater的使用
- poj3086Triangular Sums
- 扩展jquery easyui tree的搜索树节点方法
- vc6.0 如何在一个窗体中改变另一个窗体下的按钮状态
- Android activity限制横屏
- xml命名空间
- android 自定义控件 自定义属性详细介绍
- OpenStack入门以及一些资料之(五、Glance镜像)
- Oracle修改字段类型
- 怎样追MM