33 人解决，40 人已尝试。
39 份提交通过，共有 106 份提交。
4.1 EMB 奖励。
单点时限: 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.
10 100 1234567890 9876543210 0 0
5 4
33 人解决，40 人已尝试。
39 份提交通过，共有 106 份提交。
4.1 EMB 奖励。
创建: 16 年，5 月前.
修改: 7 年，2 月前.
最后提交: 3 年，10 月前.
来源: N/A