2012年5月22日
摘要: Problem DescriptionRecall 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]. InputThe input contains several test cases. Each test case consists of two non-negative integer nu 阅读全文
posted @ 2012-05-22 23:47 xinmenghuairi 阅读(324) 评论(0) 推荐(0) 编辑