[code]:
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
 int a,b,step,num,n,n1,step1,step2,num1,num2;
 while(cin>>a>>b)
 {
	 step=0;
	 if(a==b||a==b+1||a==b+2)
		cout<<b-a<<endl;
      else
	  {   
		  num=b-a;
		  n1=int(sqrt(double(num)));
		  num1=int(sqrt(double(1+4*num)));
		  n=(-1+num1)/2;
		  num1=num-n1*n1;
		  num2=num-(n+1)*n;
		  if(n1>=num1)
		  {
			  step1=(n1-1)*2+1;
			  if(num1)step1++;
			  step=step1;
		  }
		 else if(n>=num2)
		  {
			  step2=n*2;
			  if(num2)step2++;
			  step=step2;
		  }
	
		  cout<<step<<endl;
	  }
 }
	  return 0;
 }


		  




	

• Re:在ZOJ上能过,为什么在POJ上便WA????HELP!!!! (789) suibian 2005-09-10 15:17:58
  • 请问 (0) hdm29682 2006-02-23 13:09:03
    • 请问楼主用的是什么原理？ (0) hdm29682 2006-02-23 13:09:22