随笔分类 -  数据结构---字典树

UVA - 12333 Revenge of Fibonacci （大数 字典树）
摘要：The well-known Fibonacci sequence is defined as following: F(0) = F(1) = 1 F(n) = F(n − 1) + F(n − 2) ∀n ≥ 2 Here we regard n as the index of the Fibo 阅读全文
posted @ 2017-07-28 10:46 wydxry 阅读(317) 评论(0) 推荐(0) 编辑

Live2D