大数斐波那契比较 杭电1316 JAVA

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 1001234567890 98765432100 0

Sample Output

54
import java.math.BigInteger;import java.util.Scanner;class Main {public static void main(String[] args) {int sum = 0;BigInteger []b = new BigInteger[1005];b[1] = BigInteger.valueOf(1);b[2] = BigInteger.valueOf(2);for(int i=3;i<1005;i++){b[i] = b[i-1].add(b[i-2]);}Scanner s = new Scanner(System.in);while(s.hasNextBigInteger()){BigInteger n = s.nextBigInteger();BigInteger m = s.nextBigInteger();if(n.compareTo(BigInteger.ZERO)==0&&m.compareTo(BigInteger.ZERO)==0) return;if(n.compareTo(m)>0){BigInteger tt = n;n = m;m = tt;}for(int i=1;i<1005;i++){if(b[i].compareTo(n)>=0&&b[i].compareTo(m)<=0){sum++;}}System.out.println(sum);sum = 0;}}}