搜索资源列表
2385_DP
- ACM pku 2385 解题报告 DP题
1157
- acm pku 1157题，代码加解题思路
00448151-14-1005
- www.acm.pku.edu.cn上的1005题-www.acm.pku.edu.cn of 1005 that
acm1
- ACM PKU(北大onlinejudge)试题AC代码 试题编号为：1007，1012，1013，1017，207 ACMER的最爱-ACM PKU (Peking University onlinejudge) Test AC code number for questions: 1007,1012,1013,1017,207 ACMER favorites
acm2
- ACM PKU 试题库AC代码，试题编号为 1017，1028，1050，1088（多种方法）-ACM PKU Test AC code, questions numbered 1017,1028,1050,1088 (multiple methods)
acm2
- ACM PKU试题库AC代码，ACMER的最爱， 试题编号：1102，1142，1159，1170-ACM PKU Test AC code, ACMER favorites, questions code: 1102,1142,1159,1170
acm2
- ACM PKU试题库AC代码，ACMER的最爱， 试题编号：1207，1218，1247，1298,1326-ACM PKU Test AC code, ACMER favorites, questions code: 1207,1218,1247,1298,1326
acm2
- ACM PKU试题库AC代码，ACMER的最爱， 试题编号：1503,1504,1517,1529,1552,1565-ACM PKU Test AC code, ACMER favorites, questions code: 1503,1504,1517,1529,1552,1565
1001
- pku acm 1001,dev-C++,完成题目-pku acm 1001, dev-C++, the completion of the subject
12364
- 北大的ACM题目解题报告！北 大的ACM题目解题报告！-North of the ACM problem-solving report topics! North of the ACM problem-solving report topics! North of the ACM problem-solving report topics!
1001
- pku acm 1001 Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems.
1029
- 这个也是本人做的pku acm里面的题目，希望对初学acm的人有帮助。-I do this is inside the title of pku acm, acm beginner would like to help people.
1199
- pku judgeonline 1199题源码（多个ac版本）非常适合acm和算法设计初学者-Source title pku judgeonline 1199 (ac version number) is ideal for beginners and algorithm design acm
1815
- acm pku 1815 求最小点割集 acm pku 1815 求最小点割集-acm pku 1815 求最小点割集 acm pku 1815 求最小点割集 acm pku 1815 求最小点割集
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
pkuACM
- PKU ACM 北大ACM集训队内部资料-the datas of PKU ACM
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.
1519
- The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are summed and the pr
1002
- ACM PKU源代码，信息学奥赛初学者可以借鉴-PKU 1002
PKUsource
- 郭华阳大牛的PKU程序解答,对于参加ACM比赛的同学非常受用-This it a solution set for problems on PKU online judge system