题目连接:uva 10183 - How Many Fibs? 题目大意:给出a和b,求出a~b中有几个数时斐波那契数。 解题思路:模拟斐波那契数,找到临界的标号,相减的到答案。(大数,直接摘模板了,会比较长) #include <stdio.h>#include <string.h>const int N = 105;struct bign {int len, s
10183 - How Many Fibs? Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=115&page=show_problem&problem=1124 Recall the definition of the Fi