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.
思路：對于m>=n的情況，前n-1天肯定都是滿的，第n天來n只小鳥后就變成0了。
對于m<n的情況，第m天之前肯定都是滿的，從第m+1天開始，假設x天吃完，那么小鳥吃了(m+1+m+x)*x/2粒谷子，一共增加了x *m粒谷子，之前還剩下n-m粒谷子，這樣也就是(m+1+m+x)*x/2>=n-m+x *m.這是一個開口向上的二次函數，但是呢我們發現他的對稱軸是在x軸左邊的，也就是說，在正數范圍內，是單調遞增的。這樣的話，就可以二分來做了。
代碼如下：

#include<bits/stdc++.h> #define ll long long using namespace std;ll n,m;int main() {scanf("%lld%lld",&n,&m);if(m>=n) cout<<n<<endl;else{ll l=1,r=1e10,mid;ll ans=0;while(l<=r){mid=l+r>>1ll;if(mid*mid+mid-2ll*n+2ll*m<0) l=mid+1;else ans=mid,r=mid-1;}cout<<ans+m<<endl;}return 0; }

努力加油a啊，(^o)/~

總結

以上是生活随笔為你收集整理的Anton and Fairy Tale CodeForces - 785C（二分+思维）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。