A - Children and Candies (ABC Edit)

思路：计算1~n的和

#include <bits/stdc++.h>
using namespace std;
int n;
int main(){
    cin >> n;
    int res = 0;
    for(int i=1;i<=n;i++) res += i;
    cout << res << endl;
    return 0;
}