斐波那契数列+高精度
import java.math.BigInteger;
import java.util.Scanner;
public class hdu1316 {
static Scanner input=new Scanner(System.in);
public static void main(String[]str)
{
BigInteger[] fib=new BigInteger[501];
BigInteger zero=new BigInteger("0");
fib[1]=new BigInteger("1");
fib[2]=new BigInteger("2");
for(int i=3;i<501;i++)
fib[i]=fib[i-1].add(fib[i-2]);
while(input.hasNext())
{
BigInteger a,b;
a=input.nextBigInteger();
b=input.nextBigInteger();
if(0==a.compareTo(zero)&&0==b.compareTo(zero))
break;
int count=0;
for(int i=1;i<=500;i++)
{
if(a.compareTo(fib[i])<=0&&b.compareTo(fib[i])>=0)
count++;
if(fib[i].compareTo(b)>0)
break;
}
System.out.println(count);
}
}
}