2020.08.07 A - MaratonIME stacks popcorn buckets

On a Friday afternoon, some members of MaratonIME decided to watch a movie at CinIME.
There were n members who received popcorn buckets numbered from 1 to n.
At a certain moment, bucket 1 had one popcorn, bucket 2 had two popcorns and so on until bucket n, which had n popcorns. As good competitive programmers, they always prefer to simplify things, and decided to gather all the popcorn in just one bucket.
They proceeded on the following way: In bucket 2, they gather the popcorn from buckets 1 and 2. Then, in bucket 3, those of bucket 2 and 3 and so on until the last bucket. Formally, they perform n - 1 movements, on the i-th movement they join the popcorn from buckets i and i + 1 on bucket i + 1. However, they are known to be clumsy and at each moment they join two buckets, they let a single popcorn fall to the ground, which they promptly throw in the trash.
Jiang, the Sharp, realized that maybe the last bucket would be too small to hold all of the popcorn. Therefore, he asked for your help to determine how much popcorn should remain in the last bucket.
Given n, the number of members who decided to watch the movie, print the amount of popcorn that would remain in bucket n. Keep in mind that exactly one popcorn is lost at each step.

Input
The first line contains the integer n (2 ≤ n ≤ 3 * 109) – the number of members from MaratonIME who decided to watch the movie.

Output
An integer: The amount of popcorn the last bucket should have.
Examples

Input
2

Output
2

Input
3

Output
4

Input
1000000

Output
499999500001

题目大意:
有n个桶来装爆米花,编号为i(1<=i<=n)的桶中有i粒爆米花,现在从i=1开始,将i桶中的爆米花倒入i+1号桶中,每次进行倒的动作都会撒一粒爆米花,输出最后n号桶中有多少粒爆米花。

题目链接

#include <bits/stdc++.h>
using namespace std;

int main()
{
    long long int n;
    scanf("%lld",&n);
    n=(n*(n+1))/2-n+1;
    printf("%lld\n",n);
    return 0;
}
©️2020 CSDN 皮肤主题: 1024 设计师:上身试试 返回首页