http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=2467&cid=1131

Steps

Time Limit: 3000MS Memory limit: 65536K

题目描述

 

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 fromx to y? The length of the first and the last step must be 1.

输入

Input consists of a line containing n, the number of test cases. For each test case, a line follows with two integers: 0<= x <= y < 2³¹

输出

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

示例输入

345 4845 4945 50

示例输出

334

#include<iostream>#include<stdio.h>using namespace std;int main(){    int n,x,y;    scanf("%d",&n);    while(n--)    {        scanf("%d%d",&x,&y);        int dis=y-x,ans=0,flag=1,sum=0,k=0;        while(ans<dis)        {            if(flag==1)k++;            ans+=k;            flag*=-1;            sum++;        }        printf("%d\n",sum);    }}