搜索资源列表
1316-How-Many-Fibs
- HDU ACM 1316 Problem Descr iption Recall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n >= 3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a, b].
HDU-2653--BFSPpriority_queue
- 这是算法题目代码,题目为杭州电子科技大学oj平台的2653题(HDU 2653),此题目用到了记忆化搜索和优先队列的算法,读题较为麻烦-This is the algorithm topic code, entitled Hangzhou University of Electronic Science and Technology 2653 oj platform title (HDU 2653), this topic uses the memory of search and priori
