hdu 1316 How Many Fibs?

http://acm.hdu.edu.cn/showproblem.php?pid=1316

How Many Fibs?

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2354    Accepted Submission(s): 955

Problem Description

Recall the definition of the Fibonacci numbers:
f1 := 1
f2 := 2
fn := fn-1 + fn-2 (n >= 3)

Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a, b].

 

 

Input

The input contains several test cases. Each test case consists of two non-negative integer numbers a and b. Input is terminated by a = b = 0. Otherwise, a <= b <= 10^100. The numbers a and b are given with no superfluous leading zeros.

 

 

Output

For each test case output on a single line the number of Fibonacci numbers fi with a <= fi <= b.

 

 

Sample Input

10 100 1234567890 9876543210 0 0

 

 

Sample Output

5 4

 

 

Source

University of Ulm Local Contest 2000

 

 

Recommend

Eddy

 

import java.math.BigInteger;
import java.util.Scanner;


public class Main {
    public static void main(String[] args) {
        BigInteger f[]=new BigInteger[1010];
        int a[]=new int[1010];
        BigInteger aa,bb;
        Scanner cinScanner=new Scanner(System.in);
        f[1]=BigInteger.ONE;
        f[2]=BigInteger.valueOf(2);
        for(int i=3;i<1001;i++)
            f[i]=f[i-1].add(f[i-2]);
        int n;
        while(cinScanner.hasNext())
        {
            aa=cinScanner.nextBigInteger();
            bb=cinScanner.nextBigInteger();
            if(aa.compareTo(BigInteger.ZERO)==0&&bb.compareTo(BigInteger.ZERO)==0)
                break;
            if(aa.compareTo(BigInteger.ONE)==0&&bb.compareTo(BigInteger.ONE)==0)
            {
                System.out.println("1");
                continue;
            }
            int j=1;
            while(f[j].compareTo(aa)<0)
            {
                j++;
            }
            //System.out.println(j);
            int count=0;
            while((f[j]).compareTo(bb)<=0)
            {
                count++;
                j++;
            }
            System.out.println(count);
                
            
        }
        
        
    }

}