hdu 1021 斐波那契数列取模（循环节）

• butterfly0120 发布于
• 1755 收藏

http://acm.hdu.edu.cn/showproblem.php?pid=1021 Problem Description There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).   Input Input consists of a se...