ZOJ.1871 Steps【水，”英语题“】 2015/09/22

Steps

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

One steps through integer points of the straight line. The length of a step must be nonnegative and can be by one bigger than, equal to, or by one smaller than the length of the previous step.

What is the minimum number of steps in order to get from x to y? The length of the first and the last step must be 1.

Input

For each test case, a line follows with two integers: 0 <= x <= y < 2^31.

Output

For each test case, print a line giving the minimum number of steps to get from x to y.

Sample Input

45 48
45 49
45 50

Sample Output

3
3
4

---

Source: University of Waterloo Local Contest 2000.01.29
题意：从x走到y，第一步和最后一步必须是1，其他的可以比它前一步多走一步、少走一步、或者一样步，求最少要走多少次

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>

using namespace std;

int main(){
    int from,to;
    while( ~scanf("%d%d",&from,&to) ){
        int dis = to - from;
        if( !dis ){
            printf("0\n");
            continue;
        }
        int x = 0,i,step;
        for( i = 1 ; ; ++i ){
            if( x + i * 2 >= dis ) break;
            x += i*2;
        }
        step = i*2-2;
        if( x+i*2 == dis )
            printf("%d\n",step+2);
        else if( x+i >= dis )
            printf("%d\n",step+1);
        else printf("%d\n",step+2);
    }
    return 0;
}