Memory and De-Evolution（CodeForces 712C）

Description

Memory is now interested in the de-evolution of objects, specifically triangles. He starts with an equilateral triangle of side length x, and he wishes to perform operations to obtain an equilateral triangle of side length y.

In a single second, he can modify the length of a single side of the current triangle such that it remains a non-degenerate triangle (triangle of positive area). At any moment of time, the length of each side should be integer.

What is the minimum number of seconds required for Memory to obtain the equilateral triangle of side length y?

Input

The first and only line contains two integers x and y (3 ≤ y < x ≤ 100 000) — the starting and ending equilateral triangle side lengths respectively.

Output

Print a single integer — the minimum number of seconds required for Memory to obtain the equilateral triangle of side length y if he starts with the equilateral triangle of side length x.

Sample Input

Input

6 3

Output

4

Input

8 5

Output

3

Input

22 4

Output

6

Hint

In the first sample test, Memory starts with an equilateral triangle of side length 6 and wants one of side length 3. Denote a triangle with sides a, b, and c as (a, b, c). Then, Memory can do .

In the second sample test, Memory can do .

In the third sample test, Memory can do: 

题解：一开始,正常人的想法就是如何改变边长为n的等边三角形的边,使得其变为边长为m的等边三角形。但是在不断尝试过程中,就会发现,貌似不是非常好处理。根据定理"三角形两边之和大于第三边,两边之差小于第三边"，就很难确定最初应该把x减少为多少合适,如果减少太多,势必会使得另外两条边减少速度过慢

(22,22,22)→(4,22,22)→(4,19,22)→(4,19,16)→(4,13,16)→(4,13,10)→(4,7,10)→(4,7,4)→(4,4,4)

但如果减少太少,同样会影响速率。应该是个怎么样的度,总是把握不好。这时,把问题反过来想想,发现有出路。减法控制不好,相对来说加法就简单得多。为了尽快使y->x,那每秒都要使得y增加得尽可能多，所以每次选取最短边,将其变为另两条边之和-1("三角形两边之和大于第三边")，直到三条边都大于等于x为止。

代码如下：

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<algorithm>
#define max(a,b)   (a>b?a:b)
#define min(a,b)   (a<b?a:b)
#define swap(a,b)  (a=a+b,b=a-b,a=a-b)
#define maxn 320007
#define N 100000000
#define INF 0x3f3f3f3f
#define mod 1000000009
#define e  2.718281828459045
#define eps 1.0e18
#define PI acos(-1)
#define lowbit(x) (x&(-x))
#define read(x) scanf("%d",&x)
#define put(x) printf("%d\n",x)
#define memset(x,y) memset(x,y,sizeof(x))
#define Debug(x) cout<<x<<" "<<endl
#define lson i << 1,l,m
#define rson i << 1 | 1,m + 1,r
#define ll long long
//std::ios::sync_with_stdio(false);
//cin.tie(NULL);
using namespace std;

int a[4];
int main()
{
    int n,m;
    cin>>n>>m;
    a[0]=m,a[1]=m,a[2]=m;
    int sum=0;
    while(1)
    {
        if(a[0]==n&&a[1]==n&&a[2]==n)
            break;
        sum++;
        sort(a,a+3);
        a[0]=a[1]+a[2]-1;
        if(a[0]>=n)
            a[0]=n;
    }
    cout<<sum<<endl;
    return 0;
}