import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
       public static void main(String args[])
       {
    	   Scanner cin=new Scanner(System.in);
    	   BigInteger f[]=new BigInteger[505];
    	   f[1]=BigInteger.valueOf(1);
    	   f[2]=BigInteger.valueOf(2);
    	   for(int i=3;i<505;i++)
    	   {
    		   f[i]=f[i-1].add(f[i-2]);
    	   }
    	   BigInteger a,b;
    	   while(cin.hasNextBigInteger())
    	   {
    		   a=cin.nextBigInteger();
    		   b=cin.nextBigInteger();
    		   if(a.compareTo(BigInteger.ZERO)==0&&b.compareTo(BigInteger.ZERO)==0)
    		   {
    			   break;
    		   }
    		   int count=0;
    		   for(int i=1;i<505;i++)
    		   {
    			   if(f[i].compareTo(b)>0)
    				   break;
    			   if(f[i].compareTo(a)>=0&&f[i].compareTo(b)<=0)
    			   {
    				   count++;
    			   }
    		   }
    		   System.out.println(count);
    	   }
       }
}

  

相关文章:

  • 2021-12-30
  • 2022-12-23
  • 2022-12-23
  • 2021-04-28
  • 2022-12-23
  • 2021-09-16
  • 2021-05-23
猜你喜欢
  • 2022-12-23
  • 2022-12-23
  • 2021-06-10
  • 2021-11-11
  • 2022-12-23
  • 2021-07-14
  • 2022-02-02
相关资源
相似解决方案