CF - 785C. Anton and Fairy Tale - 二分+思维

1.题目描述：

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.

2.题意概述：

谷仓大小是n每天会增加m粒新收成的谷子，有鸟第一天来一只，第二天来两只，第n天来n只，并且它们每只最多吃1粒谷子，问你谷仓第一次为空的时间。

3.解题思路：

很容易想到二分时间。关键在如何判断上面。这里我是这样考虑，第m+1天之前，鸟对谷堆是不会产生影响的，因为吃的谷子数少于m的话，每次增加m相当于没吃，那么对于m+1天开始，相当于第m + i天对谷堆影响就是i，就是x[i] = (a[i] - m)。这样就是单调函数了，我们再去二分答案，然后答案再加上m（至少需要m天才能对谷堆产生影响）。

4.AC代码：

#include <bits/stdc++.h>
#define INF 0x7fffffff
#define maxn 100100
#define N 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e exp(1.0)
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
ll n, m;
bool check(ll x)
{
	ll num = (1 + x) * x / 2;
	return num  >= n - m;
}
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	long _begin_time = clock();
#endif
	while (~scanf("%lld%lld", &n, &m))
	{
		if (n <= m)
		{
			printf("%lld\n", n);
			continue;
		}
		ll l = 1, r = INF, mid, ans = 0;
		while (l <= r)
		{
			mid = l + r >> 1;
			if (check(mid))
			{
				ans = mid;
				r = mid - 1;
			}
			else
				l = mid + 1;
		}
		printf("%lld\n", ans + m);
	}

#ifndef ONLINE_JUDGE
	long _end_time = clock();
	printf("time = %ld ms.", _end_time - _begin_time);
#endif
	return 0;
}
close