CodeForces712C Memory and De-Evolution 数学+贪心

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.
Examples
input
6 3
output
4
input
8 5
output
3
input
22 4
output
6



从大到小很难考虑怎么样变小，但是从小到大考虑的话很好办，因为如果这样操作，放成最大的边不得超过其余两边之和，同时由于要步数最小，故每次将最小边放大。

#include <iostream>
#include <cstdio>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long LL;
int main()
{std :: ios :: sync_with_stdio (false);
    int x,y;
    while(cin>>x>>y){
        x^=y;
        y^=x;
        x^=y;
        int i=0;
        int a=x;
        int b=2*x-1;
        while(b<y){
            int t=b;
            b=a+b-1;
            a=t;
            i++;
        }
        cout<<i+3<<endl;
    }
    return 0;
}