Codeforces Round #404(Div. 2)C. Anton and Fairy Tale【二分】

C. Anton and Fairy Tale

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Anton likes to listen to fairy tales, especially when Danik, Anton's best friend, tells them. Right now Danik tells Anton a fairy tale:

"Once upon a time, there lived an emperor. He was very rich and had much grain. One day he ordered to build a huge barn to put there all his grain. Best builders were building that barn for three days and three nights. But they overlooked and there remained a little hole in the barn, from which every day sparrows came through. Here flew a sparrow, took a grain and flew away..."

More formally, the following takes place in the fairy tale. At the beginning of the first day the barn with the capacity of n grains was full. Then, every day (starting with the first day) the following happens:

• m grains are brought to the barn. If m grains doesn't fit to the barn, the barn becomes full and the grains that doesn't fit are brought back (in this problem we can assume that the grains that doesn't fit to the barn are not taken into account).
• Sparrows come and eat grain. In the i-th day i sparrows come, that is on the first day one sparrow come, on the second day two sparrows come and so on. Every sparrow eats one grain. If the barn is empty, a sparrow eats nothing.

Anton is tired of listening how Danik describes every sparrow that eats grain from the barn. Anton doesn't know when the fairy tale ends, so he asked you to determine, by the end of which day the barn will become empty for the first time. Help Anton and write a program that will determine the number of that day!

Input

The only line of the input contains two integers n and m (1 ≤ n, m ≤ 1018) — the capacity of the barn and the number of grains that are brought every day.

Output

Output one integer — the number of the day when the barn will become empty for the first time. Days are numbered starting with one.

Examples

input

5 2

output

4

input

8 1

output

5

Note

In the first sample the capacity of the barn is five grains and two grains are brought every day. The following happens:

• At the beginning of the first day grain is brought to the barn. It's full, so nothing happens.
• At the end of the first day one sparrow comes and eats one grain, so 5 - 1 = 4 grains remain.
• At the beginning of the second day two grains are brought. The barn becomes full and one grain doesn't fit to it.
• At the end of the second day two sparrows come. 5 - 2 = 3 grains remain.
• At the beginning of the third day two grains are brought. The barn becomes full again.
• At the end of the third day three sparrows come and eat grain. 5 - 3 = 2 grains remain.
• At the beginning of the fourth day grain is brought again. 2 + 2 = 4 grains remain.
• At the end of the fourth day four sparrows come and eat grain. 4 - 4 = 0 grains remain. The barn is empty.

So the answer is 4, because by the end of the fourth day the barn becomes empty.

题目大意：

一个容量为N的谷仓，每天会带来M颗谷子，第i天会被偷走i个。

每天先增加，再被偷，一开始谷仓是满的，谷仓空了之后，就没有然后了，问谷仓空的那天。

思路：

1、

①如果n<=m,那么一定是第n天谷仓变空。

②如果n>m，那么从第m+1天开始，相当于减少了1个谷子 ，第m+2天，相当于减少了2个谷子。第m+3天，相当于减少了3个谷子...............依次类推。

那么我们可以二分天数，按照二分出来的天数 ，看看减少的谷子量是否能够使得谷仓变空。

如果能够变空，那么减少天数，相反增加天数。

2、

注意右区间的大小。

1e9肯定GG.............................

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
#define ll __int64
ll n,m;
int Slove(ll mid)
{
    ll sum=(1+mid)*(mid)/2;
    if(sum>n)return 0;
    else return 1;
}
int main()
{
    while(~scanf("%I64d%I64d",&n,&m))
    {
        if(m>=n)
        {
            printf("%I64d\n",n);
            continue;
        }
        ll ans=0;
        n-=m+1;
        ll l=0;
        ll r=2000000000;
        while(r-l>=0)
        {
            ll mid=(l+r)/2;
            if(Slove(mid)==1)
            {
                ans=mid;
                l=mid+1;
            }
            else r=mid-1;
        }
        printf("%I64d\n",m+ans+1);
    }
}