Steps

Description

Steps

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 and Output 

Input consists of a line containing n, the number of test cases. For each test case, a line follows with two integers:  0xy < 2³¹. For each test case, print a line giving the minimum number of steps to get from  x to  y.

Sample Input 

3
45 48
45 49
45 50

Sample Output 

3
3
4

解题报告

一开始找规律找错了，一开始我认为的规律是y-x的差值在不同区域的取值不同
0=0,1=1,2=2,[3,4]=3,[5,7]=4,[8,11]=5,[12,16]=6...
原来规律是
0=0,1=1,2=2,[3,4]=3,[5,6]=4,[7,9]=5,[10,12]=6,[13,16]=7...
规律是找出来了，写不好写。。。

#include<stdio.h>
int main ()
{
    int n,x,y,i,j,d,s;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d %d",&x,&y);
        d=y-x;
        if(d==0)
        printf("0\n");
    
        else
        {
            s=0;j=1;i=1;
            for(;;)
            {
            s+=j;
            if(d<=s)
            break;
            if(i%2==0)
            j++;
            i++;
            }
            printf("%d\n",i);
        }
    }
    return 0;
}