码迷,mamicode.com
首页 > 其他好文 > 详细

hdu 1001 Sum Problem

时间:2017-09-05 13:26:33      阅读:149      评论:0      收藏:0      [点我收藏+]

标签:hdoj   for   lan   std   while   pac   integer   bsp   直接   

Sum Problem

Time Limit: 1000/500 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 487269    Accepted Submission(s): 123725


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.
 

 

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
1 100
 

 

Sample Output
1 5050
 
 
水题不加题解   可以直接看明白的
 1 #include<stdio.h>
 2 #include<cmath>
 3 #include<iostream>
 4 #include<cstring>
 5 #include<algorithm>
 6 #include<queue>
 7 using namespace std;
 8 int main ()
 9 {
10     long int n,i,sum;
11     while(scanf("%ld",&n)!=EOF)
12     { 
13      sum=0;
14      for(i=1;i<=n;i++)
15      {
16       sum+=i;
17      }
18      printf("%ld\n",sum);
19      printf("\n");
20     }
21 return 0;
22 }

 

hdu 1001 Sum Problem

标签:hdoj   for   lan   std   while   pac   integer   bsp   直接   

原文地址:http://www.cnblogs.com/52why/p/7478027.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!