
高精度
H煊
缓一会儿。。。
展开
-
2017图灵杯问题C 来简单地数个数(高精度)
题目描述这是一个斐波那契数列:f1 = 1 f2 = 2 fn = fn-1 + fn-2 (n>=3)蔡老板想知道,给你两个数a、b,你能否求出在区间[a,b]里有多少个斐波那契数。输入多组数据输入。一行为一组输入数据,包括两个非负整数a、b(a 输出对每组输入,输出单独一行,包含一个整数表示区间[a,b]里的斐波那契数个数原创 2017-06-15 11:45:35 · 579 阅读 · 0 评论 -
HDU 1250 Hat's Fibonacci()
Problem DescriptionA Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n原创 2017-06-15 12:03:53 · 195 阅读 · 0 评论