2413：How many Fibs?

题目描述

Recall the definition of the Fibonacci numbers:

f1 := 1 

f2 := 2 

fn := f_n-1 + f_n-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¹⁰⁰. 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

该题目是Virtual Judge题目，来自北京大学POJ

题目来源 Ulm Local 2000

源链接： POJ-2413

最后修改于 2020-10-29T06:31:53+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
1000	65536