2019年3月20日
ACM1021：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 sequenc 阅读全文
posted @ 2019-03-20 19:06 烈焰蔷薇 阅读(179) 评论(0) 推荐(0) 编辑