搜索资源列表
pojtijie
- poj上的一些重要类型的题目的相关课件，可以用来学习辅导，也可以用来对答案-poj on some of the important types of topics related to courseware, can be used to study and counseling, can also be used to answer
KMP
- poj 上的几道kmp 题的解题报告 sourse code of kmp algorithm -sourse code of kmp algorithm
Desktop
- 北大ACM试题poj 第3067 3071题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 30,673,071 question Question poj source code, good code, and want to help students engage in ACM
code
- POJ 1955 置换群 模拟 POJ 1792 蜜蜂问题 组合数学 杨辉三角 Pibonacci Java代码 组合数学经典问题 HOJ 2007 java 代码 组合数学 POJ 3243 Clever Y Baby-step算法-POJ 1955 permutation group simulation POJ 1792 issue of combinatorial mathematics Bee Yang Hui Triangle Pibonacci Java code
POJ_2482_1195_3321_3254_3368
- POJ上上述5题自己做的解题，小菜鸟学习间断，希望大家体涵-POJ these five questions on their own to do problem-solving
POJ_1691_1170_3280_2029_1925
- POJ上的几道DP题，小弟刚学，各位大牛勿见笑-POJ on the DP with a few questions, little brother just learning, you big cow Do not laughed
poj1200
- poj 1200 高效算法 poj 1200 高效算法-poj 1200 Efficient Algorithm poj 1200 Efficient Algorithm
3016886_AC_998MS_24392K
- 适合acmer，poj 3476 的代码，强烈推荐学习此代码-Suitable for acmer, poj 3476 code, it is strongly recommended to study this code
POJ1000-1010
- ACM 相关的，POJ 1000-1010的全部解答，程序十分完备 部分还有文字说明-ACM-related, POJ 1000-1010 all the answers, procedures, and there is still a very complete text descr iption
ACMPOJ
- ACM POJ 2247.cpp 2051.cpp 1656.c 1326.cpp 1016.cpp保证正确-ACM POJ 2247.cpp 2051.cpp 1656.c 1326.cpp 1016.cpp
jihe
- 三道几何题：hdu 1007、hdu 2289、poj 3714-Three geometry question: hdu 1007, hdu 2289, poj 3714
dingqianbeicotestcode
- poj3748-3752，“顶嵌杯”全国嵌入式系统C语言编程大赛初赛高质量代码。仅供参考。-code for poj
my_code
- 我的poj 的一些代码,都能过,仅供参考,使用G++编译器-Poj some of my code, can be had for reference purposes only, use the G++ compiler
123456ACM
- ACM POJ上的源码~~1000-3217一共719道题，这是网站http://acm.pku.edu.cn/JudgeOnline/，非常好的C++源码-ACM POJ on the source code ~ ~ 1000-3217 a total of 719 questions, this is the site http://acm.pku.edu.cn/JudgeOnline/, a very good C++ source code ~ ~
ACM1065
- POJ 1065 木棍问题 JAVA 编写 POJ通过-POJ 1065 sticks BY JAVA CROSS POJ
3041
- poj 第3041_Asteroids题，最小顶点覆盖 网络流 最小割 邻接表-poj first 3041_Asteroids problem, minimum vertex cover network flow minimum cut adjacency list
RedandBlack1979
- 北大poj Red and Black1979 解题源码-poj Red and Black1979 answer
2533
- poj上的第2533题，用dp实现求一个字符串的最长递增子序列，时间是O(n)，语言是C-poj the first 2533 title, with dp achieve demand a string of the longest increasing subsequence, the time is O (n), the language is C++
POJ
- 这是关于POJ一些题目介绍，可是照着其中的题目分类做-This is some of the topics introduced on the POJ, but according the subject of classification in which to do
POJ200
- poj最全解答,含有可运行VC文件，有助于初学者提高编程水平及兴趣-the answer of poj