Uva 10183 How many Fibs?

Problem: 10183: How many Fibs?

---

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 Specification

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¹⁰⁰. The numbers a and b are given with no superfluous leading zeros.

Output Specification

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

---

Description of the Solution:

---

1. This would predict that we would need 478 numbers to store the Fibonacci numbers with less than 100 digits, when we actually used 480.
2. First 0 must be ignored.

---

Code In C/C++:

---

---

Code In Java:

---