北大acm-题型分类的代码（Acm- code for classification of Peking University questions）

北大acm-型分类的代码（Acm- code for classification of Peking University questions） 北大acm-题型分类的代码(Acm- code for classification of Peking University questions) Mainstream algorithm: 1. / backtracking search 2.DP (dynamic programming) 3. greed 4. graph theory, //Dijkstra, minimum spanning tree, network flow 5. / / number solution mode of linear equations Area and perimeter and 6. computational geometry / convex hull, rectangular equivalent placement 7. combinatorial mathematics //Polya theorem 8. simulation 9. / / data structure and check collection, heap 10. game theory 1, sort 1423, 1694, 1723, 1727, 1763, 1788, 1828, 1838, 1840,, 2201, 2376,, 2377, 2380, 1318, 1877, 1928, 1971, 1974, 1990, 2001,, 2002, 2092, 2379, 1002 (need character processing, sorting rows can be 1007 (fast) stable sort (2159) as difficult (22312371) simple row Foreword) 2388 (sequential statistics algorithm) 2418 (two fork sort tree) 2, search, backtrack, traversal 1022111111181129, 1190156215641573, 1655218422252243, 2312236223782386 1010101110181020105410621256132113631501, 165016591664175320782083230323102329 Simple: 1128, 1166, 1176, 1231, 1256, 1270, 1321, 1543,, 1606, 1664,, 1731, 1742, 1745, 1847, 1915, 1950, 2038, 2157, 2182,, 2183, 2381, 2386, 2426, Not easy: 1024, 1054, 1117, 1167, 1708, 1746, 1775,, 1878, 1903, 1966, 2046, 2197, 2349, Recommendation: 1011, 1190, 1191, 1416, 1579, 1632, 1639, 1659, 1680,, 1683, 1691,, 1709, 1714, 1753, 1771, 1826, 1855, 1856, 1890, 1924, 1935, 1948, 1979,, 1980, 2170, 2339, 2288, 2331, 23401979 (similar to mazes) 1980 (higher for pruning) 3. Calendar 10082080 be careful about this question 4, enumeration 101210461387141122452326236323811054 (pruning requires higher), 1650 (decimal essence) Degree problem 5, the typical algorithm of data structure Easy: 1182, 1656, 2021, 2023, 2051, 2153,, 2227, 2236, 2247, 2352, 2395, Not easy: 1145, 1177, 1195, 1227, 1661, 1834, Recommendation: 1330, 1338, 1451, 1470, 1634, 1689, 1693, 1703, 1724,, 1988, 2004,, 2010, 2119, 2274, 1125 (Freud algorithm), 2421 (graph of minimum spanning tree) 6, dynamic programming 1037 A decorative fence, 1050 To the Max, 1088 skiing, 1125 Stockbroker Grapevine, 1141 Brackets Sequence, 1159 Palindrome, 1160 Post Office, 1163 The Triangle, 1458 Common Subsequence, 1579 Function Run Fun, 1887 Testing the CATCHER, 1953 World Cup Noise, 2386 Lake Counting 7, greed 1042, 1065, 1230, 1323, 1477, 205410171328, 1716, or 178413281755 (or in simplex), 1862192220542209231323252370. 8, simulation Easy: 1006, 1008, 1013, 1016, 1017, 1169, 1298, 1326,, 1350, 1363, 1676,, 1786, 1791, 1835, 1970, 2317, 2325, 2390, Not easy: 1012, 1082, 1099, 1114, 1642,, 1677, 1684, 1886128119282083, 21412015 9, recursive One thousand six hundred and sixty-four 10 string processing 1488, 1598, 1686, 1706, 1747, 1748, 1750, 1760, 1782,, 1790, 1866,, 1888, 1896, 1951, 2003, 2121, 2141, 2145, 2159, 2337, 2359,, 2372, 2406, 2408, 1016105111261318, 157219171936 2039208321362271, 2317233021212403 11, number theory 10061014102310611152118317302262 12 geometry related topics Convex hull: 1113, 1228, 1794, 2007, 21871113, wall, 2187, beauty, contest Easy: 1319, 1654, 1673, 1675, 1836,, 2074, 2137, 2318, Not easy: 1685, 1687, 1696, 1873, 1901,, 2172, 2333, 13, arbitrary precision operations, digital games, high-precision calculation 1001102310471060, 1079113111401142, 1207122012841289, 1306131613381405, 14541503 1504151915651650, 1969200020062081, 2247226223052316, 2389 1001, 1220, 1405, 15031001 (high precision multiplication), 2413 (high precision addition, and two points search) 14 probability statistics Ten million three hundred and seventy-one thousand and fifty 15, small cost, maximum flow, maximum flow 2195, going, home, 2400, supervisor, supervisee, 1087, a, plug, for, UNIX, 1149, PIGS, 1273, drainage Ditches, 1274, the, perfect, stall, 1325, machine, schedule, 1459, power, network, 2239 selecting Courses 16, compressed storage of DP 1038, bugs, integrated, Inc, 1185 artillery positions, 2430, lazy, cow 17, the longest common substring (LCS) 1080, human, gene, functions, 1159 palindrome, 1458 common subsequence, 2192 zipper 18 、 graph theory and Combinatorics 2421 Constructing Roads, 2369 Permutations, 2234 Matches Game, 2243 Knight Moves, 2249 Binomial Showdown, 2255 Tree Recovery, 2084 Game of Connections, 1906 Three powers, 1833 arrangement, 1850 Code, 1562 Oil Deposits, 1496 Word Index, 1306 Combinations, 1125 Stockbroker Grapevine, 1129 Channel Allocation, 1146 ID Codes, 1095, Trees, Made, to, Order, find the law 2247 Humble Numbers, 2309 BST, 2346 Lucky tickets, 2370 Democracy in danger, 2365 Rope, 2101, Honey, and, Milk, Land 2028, When, Can, We, Meet?, 2084 Game of Connections, 1915 Knight Moves, 1922 Ride to School, 1941 The Sierpinski Fractal, 1953 World Cup Noise, 1958, Strange, Towers, of, Hanoi, 1969 Count on Canton, 1806 Manhattan 2025, 1809 Regetni, 1844 Sum, 1870 Bee Breeding, 1702 Eva\'s Balance, 1728, A, flea, on, a, chessboard, 1604 Just the Facts, 1642 Stacking Cubes, 1656 Counting Black, 1657 Distance on Chessboard, 1662 CoIns, 1663 Number Steps, 1313 Booklet Printing, 1316 Self Numbers, 1320 Street Numbers, 1323 Game Prediction, 1338 Ugly Numbers, 1244 Slots of Fun, 1250 Tanning Salon, 1102 LC-Display, 1147 Binary codes, 1013 Counterfeit Dollar, 19, game category 1067 stone games, 1740, A, New, Stone, Game, 2234 Matches Game, 1082 Calendar Game, 2348 Euclid\'s Game, 2413, How, many, Fibs?, 2419 Forest 20, simple and simulated problems 1001 Exponentiation, 1002487-3279, 1003 Hangover, 1701 Dissatisfying Lift, 2301 Beat the Spread!, 2304 Combination Lock, 2328 Guessing Game, 2403 Hay Points, 2406 Power Strings, 2339 Rock, Scissors, Paper, 2350 Above Average, 2218, Does, This, Make, Me, Look, Fat?, 2260 Error Correction, 2262 Goldbach\'s Conjecture, 2272 Bullseye, 2136 Vertical Histogram, 2174 Decoding Task, 2183 Bovine Math Geniuses, 2000 Gold Coins, 2014 Flow Layout, 2051 Argus, 2081 Calendar, 1918 Ranking List, 1922 Ride to School, 1970 The Game, 1972 Dice Stacking, 1974 The Happy Worm, 1978 Hanafuda Shuffle, 1979红与黑， 1617个加密列， 1666糖果分享游戏， 1674按交换排序， 1503整数查询， 1504添加反号， 1528完善、 1546基本上讲， 1547土霸 1573机器人运动， 1575容易做Than Said,、 1581竞赛决定， 1590、回文 1454阶乘频率， 1363轨、 1218、醉卒 1281经理、 1132个边境、 1028网络导航， 21、初等数学 1003、宿醉 1045波特图 1254汉斯和格雷特、 1269相交线 1401的阶乘、 1410个路口、 2363块、 2365绳、 2242圆的周长， 2291根烂绳子， 2295 DP问题， 2126分解多项式 2191梅森合数、 2196专用四位数字， 1914克莱默定律， 1835宇航员、 1799一哈～、 1607甲板、 1244个有趣的地方， 1269相交线 1299极地探险家， 1183反正切函数的应用、 22、匹配 1274, 1422, 1469，1719, 2060, 2239， ----------------------------------------------------------- -------------------------------- 经典 1011(搜索好题) 1012(学会打) 一千零一十三 1019(它体现了很多此类问题的特点) 1050(绝对经典的DP) 1088(DP好题) 1157(花店，经典的DP) 1163(怎么经典的DP那么多呀,,,) 1328(贪心) 1458(最长公共子序列) 1647(很好的真题，考临场分析准确和下手迅速) 1654(学会多边形面积的三角形求法) 1655(一类无根树的DP问题) 1804(逆序对) 2084(经典组合数学问题) 2187(用凸包求最远点对，求出凸包后应该有O(n)的求法，可我就是调不出来) 2195(二分图的最佳匹配) 2242(计算几何经典) 2295(等式处理) 2353(DP，但要记录最佳路径) 2354(立体解析几何) 2362(搜索好题) 2410(读懂题是关键) 2411(经典DP) 趣味 1067(很难的数学，但仔细研究，是一片广阔的领域) 1147(有O(n)的算法，需要思考) 1240(直到一棵树的先序和后序遍历，那么有几种中序遍历呢,DP) 1426(是数论吗,错，是图论～) 1648(别用计算几何，用整点这个特点绕过精度的障碍吧) 1833(找规律) 1844(貌似DP或是搜索，其实是道有趣的数学题) 1922(贪心，哈哈) 二千二百三十一 2305(不需要高精度噢) 2328(要仔细噢) 2356(数论知识) 2359(约瑟夫问题变种) 2392(有趣的问题) 很繁的题 一千零一 一千零八 1087(构图很烦，还有二分图的最大匹配) 1128(USACO) 一千二百四十五 一千三百二十九 1550(考的是读题和理解能力) 1649(DP) 2200(字符串处理+枚举) 2358(枚举和避免重复都很烦) 2361(仔细仔细再仔细) 难题 1014(数学证明比较难，但有那种想法更重要) 1037(比较难的DP) 1405(高精度算法也分有等级之分，不断改进吧) 2002(不知道有没有比O(n ^ 2 * logN)更有的算法,) 2054(极难，很强的思考能力) 2085(组合数学) 2414(DP，但要剪枝) 2415(搜索) 2423(计算几何+统计) 多解题 1002(可以用排序，也可以用统计的) 1338(搜索和DP都可以) 1664(搜索和DP都练一练吧) 2082(这可是我讲的题噢) 2352(桶排和二叉树都行) 注: 1011:很经典的剪支 1014:难在数学上 1017:严格的数学证明貌似不容易 1021:有点繁， Investigate the rotation of graphics 1083:'s clever angle of thinking 1150: fractional parity discussion, LG (n) algorithm 1218: three line is enough, although simple, but there are pros and cons 1505: two points plus greed 1654: may be a lot of practice, I have to do with the area 1674: calculate the number of loops (graph) 1700: mathematical proof is not easy 1742: O (m*n) algorithm 1863: be patient and write slowly... ^_^ 1988: and check the set 2051: heap 2078: it's not difficult, but the scissors can do very well 2082:: O (n), did you think of that? Catalan numbers 2084: 2182: segment tree 2195: minimum cost maximum flow 2234: classic game algorithm 2236: and check the set 2299: two point thinking The extension of 2395: Kruskal minimum spanning tree 2406: KMP 2411: uses binary strings to represent states