import java.math.BigInteger;
import java.util.Scanner;
public class Main
{
public static void main(String [] args)
{
Scanner cin=new Scanner(System.in);
BigInteger [] a=new BigInteger[501];
a[1]=new BigInteger("1");
a[2]=new BigInteger("2");
int i;
for(i=3;i<=500;i++)
a[i]=a[i-1].add(a[i-2]);
BigInteger zero=new BigInteger("0");
while(cin.hasNextBigInteger())
{
BigInteger s;
BigInteger t;
s=cin.nextBigInteger();
t=cin.nextBigInteger();
if(s.compareTo(zero)==0&&t.compareTo(zero)==0)
break;
int k=0;
for(i=1;i<=500;i++)
{
if(a[i].compareTo(s)>=0&&a[i].compareTo(t)<=0)
k++;
if(a[i].compareTo(t)>0)
break;
}
System.out.println(k);
}
}
}
HDOJ1316 大肥波数
最新推荐文章于 2019-01-23 15:37:45 发布