杭电ACM 1001 sum problem
来源:互联网 发布:战龙三国张郺进阶数据 编辑:程序博客网 时间:2024/06/02 00:35
Sum Problem
Problem Description
Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).
In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n.
In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n.
Input
The input will consist of a series of integers n, one integer per line.
Output
For each case, output SUM(n) in one line, followed by a blank line. You may assume the result will be in the range of 32-bit signed integer.
Sample Input
1100
Sample Output
15050
//这道题没有什么技术含量,但是要注意输出格式不要被测试数据骗了,题目要求输出的每一行后面都有空格,否则会PE!
AC代码:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main()
{
int n,i,j,c;
int a[101000],b[101000];
memset(a,0,sizeof(a));
a[0]=0;
a[1]=1;
for(i=2;i<=100000;i++)
{
a[i]=a[i-1]+i;
}
// i=0;
while(scanf("%d",&n)!=EOF)
{
//if(i==0)
printf("%d\n",a[n]);
// else
// {
printf("\n");
// printf("%d\n",a[n]);
// }
// i++;
}
return 0;
}
#include<string.h>
#include<stdlib.h>
int main()
{
int n,i,j,c;
int a[101000],b[101000];
memset(a,0,sizeof(a));
a[0]=0;
a[1]=1;
for(i=2;i<=100000;i++)
{
a[i]=a[i-1]+i;
}
// i=0;
while(scanf("%d",&n)!=EOF)
{
//if(i==0)
printf("%d\n",a[n]);
// else
// {
printf("\n");
// printf("%d\n",a[n]);
// }
// i++;
}
return 0;
}
0 0
- 杭电ACM 1001(Sum Problem)
- 杭电ACM 1001 Sum Problem
- 杭电acm 1001 Sum Problem
- 杭电ACM 1001:Sum Problem
- 杭电ACM----------1001 Sum problem
- 杭电ACM 1001 sum problem
- 杭电ACM第1001题——Sum Problem
- (java)杭电acm 题号:1001 Sum Problem
- 杭电ACM 2058 The sum problem
- acm 杭电 1001 sum
- 杭电1001 Sum Problem
- 杭电 1001 Sum Problem
- 杭电1001 - Sum Problem
- 杭电1001 Sum Problem
- 杭电1001-Sum Problem
- 【杭电】[1001]Sum Problem
- 杭电1001:Sum Problem
- 【杭电】 1001 Sum Problem
- debian7 系统安装配置
- svn 清空
- IOS获取两个时间的毫秒差
- hdoj.2519 新生晚会 20140724
- 如何使用boost对各个类型进行转化
- 杭电ACM 1001 sum problem
- hdu 1267 下沙的沙子有几粒?
- “逃离朋友圈”能否催生新微信
- LeetCode-Word Break II
- 第三方API的调用开发
- hibernate的简单配置
- 关于Build Active Architecture Only属性
- Android系统启动流程 -- android层
- MongoDB在CentOS 7上的systemctl服务配置