CodeForces - 785C（二分逼近）

C. Anton and Fairy Tale

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 ≤ 10¹⁸) — 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.

二分逼近的思路，直接算回超出long long ;刚开始也是一脸懵逼，自己太菜。

介绍一下二分逼近：https://wenku.baidu.com/view/cb639f6f25c52cc58bd6be21.html

二分逼近可以用用于很多方面，是一种很好的方法。

对于这道题目：(1)如果n<=m,那么很明显第n天晚上粮仓变空，直接输出n。

                         (2)如果n>m,那么前m天粮仓都是满的；

                              第m+1天，粮仓粮食为n-m-1；

                              第m+2天，粮仓粮食为n-m-1-2；

                              类似可以推断出第m+t天粮仓粮食为n-m-（1+t）*t/2;

                              可以很明显的看出粮食数是单调减少的，既然是单调的，如果看过上方的网址，那么我们就可以很容易的运用二分逼近来解这道题目了。

见代码：

#include<cstdio>
#include<cmath>
using namespace std;
int main()
{
 long long m,n;
 scanf("%lld%lld",&n,&m);
 if(m>=n)
 {
 	printf("%lld\n",n);
 }else
 {
 	long long sum = n-m;
	long long l=1;
 	long long r=3e9;//其中r可以为任意其他较大值，例如2e9，并不是唯一的。
 	while(l<r)
 	{
 	  long long mid=(l+r)/2;
 	  if(mid*(mid+1)/2>=sum)//类似与二分查找的左右端点变化
 	  r = mid;
 	  else
 	  l = mid+1;
	}
 	printf("%lld\n",l+m);
 	
 }


 return 0;
} 

水波。