搜索资源列表
poj2696
- POJ 2692:假币问题 时间限制: 1000ms 内存限制: 65536kB 描述 赛利有12枚银币。其中有11枚真币和1枚假币。假币看起来和真币没有区别,但是重量不同。但赛利不知道假币比真币轻还是重。于是他向朋友借了一架天平。朋友希望赛利称三次就能找出假币并且确定假币是轻是重。例如:如果赛利用天平称两枚硬币,发现天平平衡,说明两枚都是真的。如果赛利用一枚真币与另一枚银币比较,发现它比真币轻或重,说明它是假币。经过精心安排每次的称量,赛利保证在称三次
poj1146
- poj 1146 源代码。已经测试通过,AC-poj 1146 source code. Has been tested, AC
zoj-1051-A-New-Growth-Industry
- poj 1051 源代码。已经测试通过 AC-poj 1051 source code. Has been tested by AC
2533
- poj 2533 Longest Ordered Subsequence 简单的动态规划题目-poj 2533 Longest Ordered Subsequence simple dynamic programming topics
pojcodefor(1000-1099)
- poj从题号1000到1099道题目的源码,可能会有几道没有,但是近100道题目。每道题目至少有一道AC的代码,除了AC的还有很多效率不是很高的以及wa的代码,信息量很大,很好用。-poj from Question No. 1000-1099 subject source, may Jidao not, but nearly 100 questions. Each subject at least one AC code, in addition to the efficiency of AC
pojcodefor(1100-1199)
- poj从题号1100到1199道题目的源码,可能会有几道没有,但是近80道题目。每道题目至少有一道AC的代码,除了AC的还有很多效率不是很高的以及wa的代码,信息量很大,很好用。-poj from Question No. 1100-1199 subject source, may Jidao not, but nearly 80 topics. Each subject at least one AC code, in addition to the efficiency of AC was
pojcodefor(1200-1999)
- poj从题号1200到1999道题目的源码,共近140道题目。每道题目至少有一道AC的代码,除了AC的还有很多效率不是很高的以及wa的代码,信息量很大,很好用。-poj from Question No. 1200-1999 subject source, a total of nearly 140 topics. Each subject at least one AC code, in addition to the efficiency of AC was also not very hi
pojcodefor(2000-2999)
- poj从题号2000到2999道题目的源码,可能会有一些没有,但是近170道题目。每道题目至少有一道AC的代码,除了AC的还有很多效率不是很高的以及wa的代码,信息量很大,很好用。-poj from Question No. 2000-2999 subject of the source, there may be some not, but nearly 170 topics. Each subject at least one AC code, in addition to the effi
pojcodefor(3000-3799)
- poj从题号3000到3799道题目的源码,可能会有一些没有,但是近180道题目。每道题目至少有一道AC的代码,除了AC的还有很多效率不是很高的以及wa的代码,信息量很大,很好用。-poj from Question No. 3000-3799 subject of the source, there may be some not, but nearly 180 topics. Each subject at least one AC code, in addition to the effi
1067
- POJ题目1067的具体答案,调试通过,提交也通过-1067 POJ specific answers to questions, debug through, the author also through
2247
- 这是poj上2247丑数的代码 是自己写的-This is poj ugly numbers on the 2247 code is written in their own
Spiderman
- 北京大学程序在线评测系统(POJ)题号为1925_Spiderman的解题程序及报告-Peking University program online evaluation system (POJ) Question for the problem solving process 1925_Spiderman
network
- 北京大学程序在线评测系统(POJ)中关于网络问题的一个解题程序-Peking University program online evaluation system (POJ) on a network problem solving process
Programming-Grid
- POJ若干问题源码,多边形游戏,地板覆盖,lining up-lining up……
ABC
- POJ 1006 1017 1028 1799 2262源码 简单的算法-POJ 1006 1017 1028 1799 2262 Source simple algorithm
poj1816
- poj上1816题,用静态trie树这个数据结构实现-poj on the 1816 title, with the static trie tree data structure to achieve this
poj1112
- poj上1112题,综合性较强,先求出补图,再求每个连通分量的两种类别的点数,最后dp-poj on the 1112 title, more integrated, first find the complement, and then find each connected component of the two categories of points, the last dp
summercool
- 北京大学 部分 ACM 题目源代码 可以直接运行在c开发平台的无误代码-There are some code of beijing university POJ project .
1008
- poj acm 1008题,写得不好,提供借鉴-poj acm no1008,not good enough ..
poj1286
- POJ 1286 Polya定理 经典poj题目,便于大家理解polya定理。谢谢啦-POJ 1286 Polya