本文共 3192 字，大约阅读时间需要 10 分钟。

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. Example 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-m（m<n时)，因为到了第m天鸟吃的谷物才为m,那么前m-1天都要少于这个值，而这m-1天又每天补充m个，那么前m-1天都谷仓都是满的，那么说明在第m天剩下n-m个，以后的每天分别吃m+1.m+2,m+3........而以后的每天补充的是m,m,m,.......就相当于每天吃1,2,3，,,,,,,,d一值到m天后的又d天吃完。

#include 
   
     #define ll long long using namespace std; ll n,m; ll binary_Search() {     ll mid,low=0,high=1e18;     while(low
    
     >n>>m;     if(m>=n)     {         cout<
     
      <
     
    
   

转载地址：http://thfai.baihongyu.com/