How many Fibs?

2020年1月17日 929点热度 0人点赞 0条评论

How many Fibs?

时间: 1ms        内存:64M

描述:

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<=10100. 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 f i with a<=fi<=b.

示例输入:

10 100
1234567890 9876543210
0 0

示例输出:

5
4

提示:

参考答案:

解锁文章

没有看到答案?微信扫描二维码可免费解锁文章

微信扫描二维码解锁

使用微信扫描二维码打开广告页面后可以立即关闭,再刷新此页面即可正常浏览此文章

所跳转广告均由第三方提供,并不代表本站观点!

已经扫描此二维码?点此立即跳转

code

这个人很懒,什么都没留下

文章评论