题意极其简单,但是有一种被玩的感觉,因为好久不做题了,WA了几次,才知道结果是32-bit但是中间过程却不一定,要用longlong保证一下
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<map>
#include<string.h>
#include<cmath>
#define mod 256
#define maxn 10005
#define PI acos(-1.0)
using namespace std;
string set[3][2]={{"1 3","5 7"},{"2 3","6 7"},\
{"4 5","6 7"}};
int main(){
long long n;
while(cin>>n)
{
cout<<n*(n+1)/2<<endl<<endl;
}
}