HD1001

最新推荐文章于 2021-02-16 15:43:34 发布

orz8005

最新推荐文章于 2021-02-16 15:43:34 发布

阅读量418

点赞数

本文链接：https://blog.csdn.net/orz8005/article/details/24738533

版权

杭电ACM 2014暑期集训队——选拔安排~

第一种AC，第二种可能会造成溢出。

解题关键点：

1、注意溢出，应先判断奇偶

2、 the range of32-bit signed integer。32位符号有效范围

3、样例中输出是隔行的

Sum Problem

Time Limit: 1000/500 MS (Java/Others) Mem

ory Limit: 65536/32768 K (Java/Others)Total Submission(s): 266380    Accepted Submission(s): 66255 
     
       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
        
        
        
        

        
        
        
        

        
        
        
        

        
        
        
        
         
         #include <iostream>
using namespace std;
int main()
{
	int a;
	while(cin>>a){
		if(a%2==0)
		cout<<a/2*(a+1)<<endl<<endl;
	else
		cout<<(1+a)/2*a<<endl<<endl;
	}
	return 0;

}