搜索资源列表
ABCD
- 西北工业大学POJ答案，希望大家能合理利用，不要一味的抄袭-Northwestern Polytechnical University POJ answer, I hope you can reasonably use, do not blindly copy
1003-Hangover
- POJ 1003 Hang Over 源码-POJ 1003 Hang Over Resource Files
code-of-c
- 西工大2013年poj c语言程序设计 部分代码-code of poj
code-of-poj
- 西工大C语言100题答案 2012年-NPU C-100 questions answers 2012
zui_duan_lu
- poj的几题最短路，都是ac过的-Shortest poj few questions are ac before. .
agsdagdsf
- poj的几道图论 poj的几道图论-asdg dag ad
poj3945
- poj 3945 bfs,状态转化 On a small planet named Bandai, a landing party of the starship Tadamigawa discovered colorful cubes traveling on flat areas of the planet surface, which the landing party named beds. A cube appears at a certain position on a be
poj3943
- poj 3943 Taro attempts to tell digits to Hanako by putting straight bars on the floor. Taro wants to express each digit by making one of the forms shown in Figure 2. Since Taro may not have bars of desired lengths, Taro cannot always make forms
poj3941
- poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback
poj3911
- poj 3911 Descr iption A group of N Internet Service Provider companies (ISPs) use a private communication channel that has a maximum capacity of C traffic units per second. Each company transfers T traffic units per second through the channel
poj3910
- poj 3910 nput The input file contains several test cases. Each test case starts with an integer n (0 < n < 1000), that stands for the cardinality of S. The next line contains the numbers of S: x1, x2, ..., xn. It is known that each xi is
Wheres-Waldorf
- a+b 问题 poj 1000 a+b 问题-a+b problem
1003
- 这个小程序是我对于POJ1003这道大水题的解决方案-My solution of 1003 problem on POJ
1521.cpp
- huffman编码 数据结构 poj 1521 acm-huffman coding datastructure poj 1521 acm
3278
- poj 3278 Catch That Cow采用广度优先搜索实现-poj 3278 Catch That Cow using breadth-first search to achieve
POJ2017
- POJ2017中的答案，希望能对喜欢在POJ中做题的人有所帮助-POJ2017 the answer, hoping to do questions like POJ help people
POJ_3131
- POJ 3131 双向BFS解立体八数码问题-POJ 3131 bi-dimensional eight digital BFS Solutions
stl
- 上传的代码是北京大学在线评测系统poj 3096的AC代码-Code is uploaded Peking University' s online evaluation system poj 3096 AC code
1469
- poj 1469 COURSES二分图的最大匹配问题 -poj 1469 COURSES largest bipartite graph matching problem
2771
- poj 2771一道关于二分图的最大匹配-poj 2771 on the maximum bipartite graph matching