NYOJ122Triangular Sums
来源：互联网 发布：赛诺数据官网 编辑：程序博客网 时间：2024/05/29 05:12
原题链接
#include<stdio.h>int sum(int n){int i,t=0;for(i=1;i<=n+1;i++){t=t+i;}return t;}main(){int s,n,a,b=0,i;scanf("%d",&s);getchar();while(s--){a=0;scanf("%d",&n);b++;for(i=1;i<=n;i++){a=a+i*sum(i);}printf("%d %d %d\n",b,n,a);}} 847688hpu_ywTriangular Sums
Accepted56232C/C++05-02 15:24:24 0 0
- NYOJ122Triangular Sums
- nyoj122Triangular 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
- POJ1185:炮兵阵地(状态压缩)
- TOJ 2967: Job Hunt -- Bellman_Ford
- Google否认谷歌眼镜的硬件拆解成本预估
- slab分配器原理
- oacle 047其他学习资料
- NYOJ122Triangular Sums
- C++获取系统信息(IP地址、硬件信息等)
- ACM-尼姆博弈之取(m堆)石子游戏——hdu2176
- 图的遍历
- 配置vimrc文件
- Convert Sorted List to Binary Search Tree
- SDL学习入门
- 桥接模式
- 黑马程序员—多线程
