#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
int main() {
ll n;
scanf("%lld",&n);
ll x = (1 + n - n % 2) * n / 2;
if(n % 2 != 0) x += n;
printf("%lld",x);
return 0;
}
BEGIN-2 序列求和
最新推荐文章于 2021-12-05 15:13:46 发布