随笔分类 -  算法

摘要:题目描述: 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 阅读全文
posted @ 2021-08-21 19:53 芝士宇治抹茶 阅读(74) 评论(0) 推荐(0)