CodeForces 712C - Memory and De-Evolution 逆向思维

//http://codeforces.com/problemset/problem/712/C



#include <stdio.h>
#include <string>
#include <cstring>
#include <queue>
#include <algorithm>
#include <functional>
#include <vector>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <iostream>
#include <sstream>
#include <time.h>
#include <stack>
#include <set>
#include <map>
#include <time.h>
#include <list>
#include <bitset>
using namespace std;
int main()
{
    cin.sync_with_stdio(false);
    int x,y,Ans=0;
    cin>>x>>y;
    int L[3]={y,y,y};
    while (L[0]!=x)
    {
        L[0]=L[1]+L[2]-1;
        if (L[0]>x)
            L[0]=x;
        sort(L,L+3);
        Ans++;
    }
    cout<<Ans;
    return 0;
}