poj2590

#include<iostream>
#include<math.h>
using namespace std;


int main()
{
double  k,x[1000],y[1000];
double a,b;
int i,count,stepnum;
cin>>count;
for(i=0;i<count;i++)
cin>>x[i]>>y[i];
for(i=0;i<count;i++)
{  
if(x[i]==y[i])
{
cout<<0<<endl;
continue;
}


if(x[i]!=y[i])
{
k=y[i]-x[i];
a=(long) sqrt(k);//最大的脚步长
if(a*a==k)stepnum=2*a-1; 
else if(a*a+a>=k&&k>a*a)stepnum=2*a;
else if(k<(a+1)*(a+1)&&k>a*a+a)stepnum=2*a+1;
}//while
cout<<stepnum<<endl;
}//for
return 0;
}