How Many Fibs? 【java 处理高精度】

How Many Fibs?

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

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

代码

import java.util.Scanner;
import java.math.BigInteger;
import java.math.BigDecimal;
import java.text.DecimalFormat;

 class Main {
    public static  void main(String[] args){
        BigInteger[] arr=new BigInteger[10100];
        Scanner cin = new Scanner(System.in);
        arr[1]=BigInteger.ONE;arr[2]=BigInteger.valueOf(2);
        int num=10000;
        for(int i=3;i<num;i++) 
            arr[i]=arr[i-1].add(arr[i-2]);
        BigInteger a,b; 
        while(cin.hasNext()){
            a=cin.nextBigInteger();
            b=cin.nextBigInteger();
            if(a.compareTo(BigInteger.ZERO)==0&&b.compareTo(BigInteger.ZERO)==0) break;
            int cnt=0;
            for(int i=1;i<num;i++){
                if(arr[i].compareTo(a)>=0 &&arr[i].compareTo(b)<=0) cnt++;
            }
            System.out.println(cnt);
        }
    }
}