搜索资源列表
1008
- poj1008代码，没学过数据结构也能做出来的超水题，看看，也许有个启示-code for poj 1008
1974TheHappyWorm
- poj 1974 the happy worm
1318WordAmalgamation
- poj 1318WordAmalgamation.zip
poj
- pku 3613 Cow Relays 题意：给一个无向图，求从起点s到终点e尽力n条边的路径最小值。 边的数量2<=t<=100(每条边可以重复遍历) 算法：利用dp求出 path[ l ] [ i ] [ k ]=MIN(path[ l ][ i ] [ k ] , path[ l ][ i ] [ j ] + path[ l ][ j ] [ k ]) l 表示的是2的指数，假设 i 到 k 要途径 2^l 条边，那么他可以被分为两段 途径2
2594
- 北大ACM试题poj 第2594题源码，很好的代码，希望对搞ACM的同学有帮助-Peking University ACM Chapter 2594 question Question poj source code, good code, and want to help students engage in ACM
2602
- 北大ACM试题poj 第2602题源码，很好的代码，希望对搞ACM的同学有帮助-Peking University ACM Chapter 2602 question Question poj source code, good code, and want to help students engage in ACM
Desktop
- 北大ACM试题poj 第3056，3060题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Question poj first question 3056,3060 source code, good code, and want to help students engage in ACM
3057
- 北大ACM试题poj 第3057题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3057 question Question poj source code, good code, and want to help students engage in ACM
3058
- 北大ACM试题poj 第3058题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3058 question Question poj source code, good code, and want to help students engage in ACM
3063
- 北大ACM试题poj 第3063题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3063 question Question poj source code, good code, and want to help students engage in ACM
3065
- 北大ACM试题poj 第3065题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3065 question Question poj source code, good code, and want to help students engage in ACM
3061
- 北大ACM试题poj 第3061题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3061 question Question poj source code, good code, and want to help students engage in ACM
3072
- 北大ACM试题poj 第3072题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3072 question Question poj source code, good code, and want to help students engage in ACM
3068
- 北大ACM试题poj 第3068题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3068 question Question poj source code, good code, and want to help students engage in ACM
Desktop
- 北大ACM试题poj 第3066 3069题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 30,663,069 question Question poj source code, good code, and want to help students engage in ACM
main
- poj2109:Power of Cryptography.贪心算法.正确程序.-poj2109:Power of Cryptography.Greedy algorithm.accepted program.
PKUACMreport
- 这是北京大学ACM在线POJ的一些重要题目的解题报告，其中在PPT中有详细的源码。一共100个左右。-This is the Peking University ACM online POJ some of the important topics of the problem-solving report, which are detailed in the PPT source. A total of about 100.
2251POJ
- POJ2251 AC源码 language c-POJ 2251 Accepted Source Code
poj2593
- poj 2593 高效算法 poj 2593 高效算法-poj 2593 Efficient Algorithm
ProgramowanieObiektowe1-3
- Zadaniem tego moduł u jest zapoznanie studentów z paradygmatem programowania obiektowego. Omówione zostaną cechy programowania obiektowego oraz jego fundamentalne poję cia: klasy i obiektu-Zadaniem tego moduł u jest zapoznanie student