学步园

//寻找公式，思路是先列举每一跳所能跳的最远距离，然后发现规律,再注意下y-x=0时候的判断即可<br /> //结果得出数列<br /> //0,1,2,4,6,9,12,16,20,25,30.......<br /> //0,0+1,1+1,2+2,4+2,6+3,9+3,12+4,16+4.....<br /> #include<iostream><br /> using namespace std;<br /> int main()<br /> {<br /> int t,x,y,temp,cnt,ans;<br /> scanf("%d",&t);<br /> while(t--)<br /> {<br /> scanf("%d%d",&x,&y);<br /> temp = y - x;<br /> cnt = ans = 0;;<br /> if(temp > 0)<br /> {<br /> while(temp > 0)<br /> {<br /> temp -= ++cnt;<br /> ++ans;<br /> if(temp > 0)<br /> {<br /> temp -= cnt;<br /> ++ans;<br /> }<br /> }<br /> printf("%d/n",ans);<br /> }<br /> else printf("0/n");<br /> }<br /> return 0;<br /> }