Candies(二分，模拟)

After passing a test, Vasya got himself a box of nn candies. He decided to eat an equal amount of candies each morning until there are no more candies. However, Petya also noticed the box and decided to get some candies for himself.

This means the process of eating candies is the following: in the beginning Vasya chooses a single integer kk, same for all days. After that, in the morning he eats kk candies from the box (if there are less than kk candies in the box, he eats them all), then in the evening Petya eats 10%10% of the candies remaining in the box. If there are still candies left in the box, the process repeats — next day Vasya eats kk candies again, and Petya — 10%10% of the candies left in a box, and so on.

If the amount of candies in the box is not divisible by 1010, Petya rounds the amount he takes from the box down. For example, if there were 9797 candies in the box, Petya would eat only 99 of them. In particular, if there are less than
1010 candies in a box, Petya won’t eat any at all.

Your task is to find out the minimal amount of kk that can be chosen by Vasya so that he would eat at least half of the nn candies he initially got. Note that the number kk must be integer.

Input
The first line contains a single integer nn (1≤n≤1018)(1≤n≤1018) — the initial amount of candies in the box.

Output
Output a single integer — the minimal amount of kk that would allow Vasya to eat at least half of candies he got.

Example
input
68

output
3

Note
In the sample, the amount of candies, with k=3k=3, would change in the following way (Vasya eats first):
68→65→59→56→51→48→44→41→37→34→31→28→26→23→21→18→17→14→13→10→9→6→6→3→3→068→65→59→56→51→48→44→41→37→34→31→28→26→23→21→18→17→14→13→10→9→6→6→3→3→0.
In total, Vasya would eat 39 candies, while Petya — 29

思路：
开始看数据的范围时比较大的，如果用暴力肯定会时间超限，所以便选这用二分查找求答案，10的18次方只需要找300多次。这题知道了用二分之后只需要模拟出每次怎么找就可以解决了。

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

//typedef long long ll;
long long n;
long long check( long long x )
{
    long long now, sum;
    now = n, sum = 0;
    while( now )
    {
        if( now <= x )
        {
            sum += now;
            break;
        }//如果剩下的糖小于k时
        now -= x;
        sum += x;
        now -= now / 10;
    }
    return sum;//sum是指Vasya吃的糖的数量。
}
int main()
{

    while( cin >> n )
    {
        long long l = 1, r = n, mid;
        while( l < r )
        {
            mid = ( l + r ) / 2;
            if( check(mid) >= ( n + 1 ) / 2 )//取中间的mid的值为k是vasya吃的糖比Petya的多时
            {
                r = mid;
            }
            else
            {
                l = mid + 1;
            }
        }
        cout << l << endl;
    }
    return 0;
}