1297. How many Fibs?

单点时限: 2.0 sec

内存限制: 256 MB

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].

输入格式

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.

输出格式

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

样例

Input
10 100
1234567890 9876543210
0 0
Output
5
4

19 人解决,35 人已尝试。

27 份提交通过,共有 107 份提交。

5.8 EMB 奖励。

创建: 14 年,1 月前.

修改: 4 年前.

最后提交: 10 月前.

来源: Ulm Local 2000

题目标签