搜索资源列表
hdu1087
- hdu oj 1087 这个是复杂的背包问题 建议学一下-hdu oj 1087 This is the proposal of the complexity of the knapsack problem, learn about
2012.4.1
- 很详细的解题报告，很详细的注释，各大oj的-Very detailed answers report, very detailed notes, major oj
OJTEST
- 主要是在线评判的代码的内核测试代码，很有用，如果你对oj有兴趣的话，可以学习。-The online code judge kernel test code, and useful, if you are interested oj can learn.
code
- 一些oj的源代码 北大的居多，还有一些浙大的-Oj code
jieguo
- 100多道编程题答案，可以根据题目在OJ在找到题目。。答案都测试过通过-100 multi-channel programming answers can be based on the topics found in the OJ topic. . Answer tested by
FOJ_1683
- FOJ的1683题，采用二分矩阵乘法的实现，源代码已在OJ上测试通过-FOJ' s 1683 title, with the realization of the binary matrix multiplication, the source code has been tested in the OJ by
01bag-AGL
- 01背包问题基础代码，在各大oj上有相似题目-01 knapsack problem underlying code
OJ.tar
- codj,hdoj的源码（50-60题）-the source of hdoj/codj(50-60)
cqqp
- 这是典型的残缺棋盘oj题解决方案，采用简单的dp。-This is typical of the mutilated checkerboard the oj title solution, simple dp.
PAS900B
- 关于通讯的一个小程序，希望和大家交流心得，有不妥之处希望大家指正，谢谢。- PL/M-86 COMPILER PAS_MOD 11/02/ 2 11:11:51 PAGE 1 DOS 5.0 (038-N) PL/M-86 V2.7 COMPILATION OF MODULE PAS_MOD OBJECT MODULE PLACED I
1000
- 杭电oj第1000题答案Calculate A + B.-Hangzhou Xinhua oj 1000th answers Calculate A+ B.
lab-2
- 汽车加油行驶问题。线性规划与网络流24题之一，44ms过OJ。具有一定的参考性。-Car refueling traveling. Linear programming and network flow to one of the 24 questions, 44ms Accpted at OJ. Reference.
ACM_gametheory
- 有关博弈论的算法源码，有爱者可以参考，内附带有OJ题目号，可以上网找到题目。-On game theory algorithms, a love can refer to, included with OJ topic number, you can find topics on the Internet.
8588
- 表达式求值,就是华农的OJ上的题，没办法，为了激活帐号上传的。-Expression evaluation questions on agricultural OJ, no way, in order to activate the account to upload.
hdu
- 杭电OJ部分答案,可以很简单的解决a+b求和问题及其他问题。-answer for hdu
WebCtrl
- judge online在线测试程序，C#代码，用于OJ在线测试用。-judge online
COGS-by-Kingfree-master
- 这是一个php写的信息学在线评测系统原码-this is oj code
PKU-1200-1577
- 在北大的ACM OJ上的45个题的解题报告。全部通过的。-The ACM OJ at the university on 45 problem-solving report. All passed.
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
Brother-peanuts
- 交大ACM oj二哥种花生问题，动态规划解决C语言实现，已在线通过-National Chiao Tung University ACM oj brother peanuts problem, dynamic programming to solve the C language, has been online through