UVA-1068 Sum-1-N之间所有数的和

1068. Sum

Time limit: 2.0 second
Memory limit: 64 MB
Your task is to find the sum of all integer numbers lying between 1 and N inclusive.
Input
The input consists of a single integer N that is not greater than 10000 by it's absolute value.
Output
Write a single integer number that is the sum of all integer numbers lying between 1 and N inclusive.
Sample
input output
-3
-5
Problem Source: 2000-2001 ACM Northeastern European Regional Programming Contest (test tour)
Tags: problem for beginners  (hide tags for unsolved problems)
Difficulty: 45    Printable version    Submit solution    Discussion (111)

My submissions    All submissions (72944)    All accepted submissions (29122)    Solutions rating (23734)

#include <iostream>
#include <stdio.h>
#include <cmath>
using namespace std;
int main()
{
    int n;
    cin>>n;
    if(n>0)
        cout<<(1+n)*n/2<<endl;
    else
        cout<<(1-n)*n/2+1<<endl;
    return 0;
}