搜索资源列表
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].
1
- hdu 上的题 继续畅通工程 可以AC 初学者的水平 请见谅-hdu
hdu1016
- hdu的acm题目源码 可以参考一下 不过只有一个-acm topic hdu source of reference but only a
hdu3031
- hdu 3031 可合并堆 左偏树 动态实现-hdu 3031 can be combined to achieve dynamic heap left-side tree
KMO(n^3)(HDU2853)
- KM算法O(n^3)的代码实现。给出的是哈尔滨赛区C题（HDU 2853）的源码-the code of KM algorithm with the complexity O(n^3). It provides a solution to the problem 2853 in HDU online judge.
chenzulong
- 很好的ACM资料,这是我自己在HDU上做的题目-A very Good thisngs for ACM
HDU1010
- 这题是杭电ACM 1010 Tempter of the Bone (DFS+回溯)-This question is Hangzhou Xinhua ACM 1010 Tempter of the Bone (DFS+ back)
hdu1020
- Hdu 1020解题报告，http://acm.hdu.edu.cn/showproblem.php?pid=1020
bfs
- hdu 3085 一道bfs题 一点值得注意的，鬼魅先走，mm与gg后走，直接模拟这个这个场景，突出时间的先后性，一秒与一秒的区别。。。这样模拟很难出错-hdu 3085 an ACM question.it is about bfs
HDU1026
- HDU1026题目的题目代码 这是道记忆化搜索题 要输出搜索路径的 网址是：http://acm.hdu.edu.cn/showproblem.php?pid=1026-HDU1026 topic subject code is Road to the output memory search title search path of URLs is: http://acm.hdu.edu.cn/showproblem.php?pid=1026
hdu1035
- 杭电OJ1035题的答案，可以完全AC，并且算法采取最优解-Hangzhou Xinhua OJ1035 answer questions, can be fully AC, and the algorithm to the optimal solution
DP
- 动态规划DP题解 POJ HDU部分动态规划DP题解-Dynamic programming DP problem solutions POJ HDU problem solution part of dynamic programming DP
hdu
- 我写的hdu上的一些题AC的题的代码 也许你会有用-I wrote some questions on the AC hdu the questions you may have to use the code
code
- The 35th ACM/ICPC Asia Regional Chengdu Site —— Online Contest B-number http://acm.hdu.edu.cn/showproblem.php?pid=3652
hdu
- 杭电OJ部分答案,可以很简单的解决a+b求和问题及其他问题。-answer for hdu
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
hdu-page-11-answer
- 基础算法类 ACM 入门 杭电OJ 11页题目题解，算法入门的时候刷题可以参考 搜集整理起来了比单个去搜题解方便快捷-hdu OJ page 11 answer
hdu 1019
- hdu solve problem in c
hdu 1205
- acm刷题,刷题测试 刷题hdu上的题目写的代码(ACM brushes, brush questions and test the code on the title HDU)
HDU 4517
- acm刷题,刷题测试 刷题hdu上的题目写的代(ACM brushes, brush questions and test the code on the title)