ACM HDOJ 1316 (How Many Fibs?)

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

public class Main {

public static void main(String[] args) {
BigInteger fibonacci[] = new BigInteger[479];
fibonacci[0] = BigInteger.ONE;
fibonacci[1] = BigInteger.valueOf(2);
for (int i = 2; i < 479; ++i) {
fibonacci[i] = fibonacci[i - 2].add(fibonacci[i - 1]);
}
Scanner scn = new Scanner(System.in);
while (scn.hasNext()) {
BigInteger number1 = scn.nextBigInteger();
BigInteger number2 = scn.nextBigInteger();
if (number1.equals(BigInteger.ZERO)
&& number2.equals(BigInteger.ZERO)) {
break;
}
int count = 0;
for (int i = 0; i < 479; ++i) {
if (-1 != fibonacci[i].compareTo(number1)
&& 1 != fibonacci[i].compareTo(number2)) {
++count;
}
}
System.out.println(count);
}
scn.close();
}

}