南阳题目122-Triangular Sums
来源:互联网 发布:手机怎么禁止安装软件 编辑:程序博客网 时间:2024/05/11 01:28
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
- 来源
就是直接计算就行了,公式就是W(n) = SUM[k = 1…n; k * T(k + 1)]
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int solve(int x){int i,sum=0;for(i=1;i<=x;i++)sum+=i;return sum;}int main(){int a,b,c,d,i,j,m,n,t,sum,cot=1;;scanf("%d",&m);while(m--){sum=0;scanf("%d",&a);for(i=1;i<=a;i++)sum+=i*solve(i+1);printf("%d %d %d\n",cot++,a,sum);}return 0;}
0 0
- 南阳题目122-Triangular Sums
- 南阳oj 题目122 Triangular Sums
- 南阳122 Triangular Sums
- Triangular Sums(南阳122)
- 南阳ID:122 Triangular Sums
- 题目122 Triangular Sums
- 南阳oj Triangular Sums 语言入门
- nyoj 122 Triangular Sums
- NYOJ 122 Triangular Sums
- NYOJ 122 Triangular Sums
- nyoj 122 Triangular Sums
- NYOJ-122 Triangular Sums
- 122 Triangular Sums
- nyoj 122 Triangular Sums
- nyoj 122 triangular sums
- NYOJ 122 Triangular Sums
- nyoj 122Triangular Sums
- 【NYOJ】[122]Triangular Sums
- Java集合对象排序
- Pie(二分)
- Java并发:线程安全的单例模式
- PhoneGap&jQuery Mobile应用开发环境配置(For Android)
- WKWebView与Js实战(OC版)
- 南阳题目122-Triangular Sums
- 7.S5PV210启动过程详解
- MySQL数据库服务器搭建指南
- error C2054: 在“inline”之后应输入“(”
- Linux进阶指令
- Java基础之List实现篇
- 使用wait、notify简单实现并行计算
- 初学Hadoop
- 洛克和休谟