[暖手][学习阶段-各路杂题][HDU-1021]Fibonacci Again
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 sequence of lines, each containing an i
原创
2015-01-28 22:25:24 ·
344 阅读 ·
0 评论