hdu 1001 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.

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
PS:这是比较容易理解的方法。而且不容易出错;
#include <iostream>
using namespace std;
int main()
{
    int n,i;
    int sum;

    while (cin>>n)
    {
        sum=0;
        for (i=1; i<=n; i++)
        {
            sum+=i;
        }
        cout<<sum<<endl;
        cout<<endl;
    }

    return 0;
}

PS:为了防止溢出可以采取的方法:判断n和n+1哪个是整数,先/2,后进行运算;
#include <iostream>
using namespace std;
int main()
{
    int n;
    int sum;
    while(cin>>n)
    {
        sum=0;
        if(n%2==0)
        {
            sum+=(n/2)*(n+1);
        }
        else
        {
            sum+=((n+1)/2)*n;
        }
        cout<<sum<<endl;
        cout<<endl;
    }
    return 0;
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值