ACM question type algorithm Classification summary

ACM question type algorithm Classification summary

Questions from: http://acm.pku.edu.cn/JudgeOnline/

Mainstream algorithms:
1. Search // trace back

2. DP (Dynamic Planning)

3. Greedy
4. Graph Theory // Dijkstra, Minimum Spanning Tree, and network stream

5. Number Theory // solves the modulus linear equation

6. Calculate the area and perimeter of the joint of the geometric/Convex Shell with the same placement of the rectangle

7. Composite math // polyA Theorem

8. Simulation

9. Data Structure // check the collection and heap

10. Game Theory

1. Sorting

1423,169 4, 1723,172 7, 1763,178 8, 1828,183 8, 1840,220 1, 2376,237 7, 2380,
1318,187 7, 1928,197 1, 1974,199 0, 2001,200 2, 2092,237 9,

1002 (character processing is required, and sorting can be done in a fast way) 1007 (stable sorting) 2159 (difficult to understand) 223
1 2371 (simple sorting) 2388 (sequence statistics algorithm) 2418 (Binary sorting tree)

2. Search, backtracking, and traversal

1022 1111d 1118 1129 1190 1562 1564 1573 1655 2184 2225 2243 2312 2362 2378 238
6 2078
, 2083,2303, 2310,2329

Simple: 1128,116 6, 1176,123 1, 1256,127 0, 1321,154 3, 1606,166 4, 1731,174 2,
1745,184 7, 1915,195 0, 2038,215 7, 2182,218 3, 2381,238 6, 2426,
Not easy: 1024,105 4, 1117,116 7, 1708,174 6, 1775,187 8, 1903,196 6, 2046,219 7,
2349,
Recommended: 1011,119 0, 1191,141 6, 1579,163 2, 1639,165 9, 1680,168 3, 1691,170 9,
1714,175 3, 1771,182 6, 1855,185 6, 1890,192 4, 1935,194 8, 1979,198 0, 2170,
2288,233 1, 2339,234 1980 (similar to the maze) (higher requirements for pruning)

3. Calendar

1008 2080 (Be careful with such questions)

4. Enumeration

1387,141, 2245,232, 2363,238 1, 6, (high pruning requirements), 16
50 (decimal precision problem)

5. Typical data structure Algorithms

Easy: 1182,165 6, 2021,202 3, 2051,215 3, 2227,223 6, 2247,235 2, 2395,
Not easy: 1145,117 7, 1195,122 7, 1661,183 4,
Recommended: 1330,133 8, 1451,147 0, 1634,168 9, 1693,170 3, 1724,198 8, 2004,201 0,
2119,227 4, 1125 (freuch algorithm), 2421 (minimum graph Spanning Tree)

6. Dynamic Planning

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. Greedy

1042,106 5, 1230,132 3, 1477,171 6, 1784,1328 1755 (or in simple form), 2054,10
17,132 1922,205, 2209,231 4, 2325,237 3, 0.

8. Simulation

Easy: 1006,100 8, 1013,101 6, 1017,116 9, 1298,132 6, 1350,136 3, 1676,178 6,
1791,183 5, 1970,231 7, 2325,239 0,

Not easy: 1012,108 2, 1099,111 4, 1642,167 7, 1684,188 6, 1281 1928 2083 2141 2015

9. Recursion

1664

10. string processing

1488,159 8, 1686,170 6, 1747,174 8, 1750,176 0, 1782,179 0, 1866,188 8, 1896,
1951,200 3, 2121,214 1, 2145,215 9, 2337,235 9, 2372,240 6, 2408,101 6 1051 11
26 1318 1572 1917 1936 2039 2083 2136 2271 2317 2403

11. Number Theory

1006,1014, 1023,1061, 1152,1183, 1730,2262

12. Geometric questions

Convex Hull: 1113,122 8, 1794,200 7, 2187,1113 wall, 2187 beauty contest

Easy: 1319,165 4, 1673,167 5, 1836,207 4, 2137,231 8,
Not easy: 1685,168 7, 1696,187 3, 1901,217 2, 2333

13. Any precision operations, digital games, and high-precision computing

1001 1023 1047 1060 1079 1131 1140 1142 1207 1220 1284 1289 1306 1316 1338 140
5 1454 1503 1504 1519 1565 1650 1969 2000 2006 2081 2247 2262 2305 2316 2389

1001,122 0, 1405,150 2413 (high-precision multiplication) (high-precision addition, and binary search)

14. Probability Statistics

1037,1050

15. Maximum Flow and maximum flow at a low cost

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. compress the stored DP

1038 bugs integrated Inc
1185 artillery positions
2430 lazy cow

17. Longest public substring (LCS)

1080 human gene functions
1159 palindrome
1458 common subsequence
2192 zipper

18. Graph Theory and composite mathematics

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 arrange,

1850 code,

1562 oil deposits,

1496 word index,

1306 combinations,

1125 stockbroker grapevine,

1129 channel allocation,

1146 ID codes,

1095 trees made to order and Search rules

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 uugly numbers,

1244 slots of fun,

1250 tanning salon,

1102 LC-display,

1147 binary codes,

1013 counterfeit dollar

19. Category

1067 stone game,

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 questions
1001 exponentiation,

1002 487-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 abve 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 AR,

1918 ranking list,

1922 ride to school,

1970 the game,

1972 dice stacking,

1974 the happy worm,

1978 hanafuda shuffle,

1979 red and black,

1617 crypto columns,

1666 candy sharing game,

1674 sorting by swapping,

1503 integer inquiry,

1504 adding reversed numbers,

1528 perfection,

1546 Basically speaking,

1547 clay bully,

1573 robot motion,

1575 Easier done than said? ,

1581 A contesting demo,

1590 palindromes,

1454 factorial frequencies,

1363 rails,

1218 the drunk jailer,

1281 manager,

1132 border,

1028 Web navigation

21. Elementary Mathematics

1003 hangover,

1045 Bode plot,

1254 Hansel and grethel,

1269 intersecting lines,

1401 factorial,

1410 intersection,

2363 blocks,

2365 rope,

2242 the circumference of the circle,

2291 rotten ropes,

2295 a DP problem,

2126 factoring a polynomial,

2191 Mersenne composite numbers,

2196 specialized four-digit numbers,

1914 Cramer \'s rule,

1835 astronauts,

1799 yeehaa! ,

1607 deck,

1244 slots of fun,

1269 intersecting lines,

1299 polar explorer,

1183 arc tangent function application,

22. Matching

1274,142 2, 1469,171 9, 2060,223 9,

------------------------------------------------------------------------------
-------------

Classic
1011 (search for good questions)
1012 (learn to create tables)
1013
1019 (it reflects the characteristics of many such problems)
1050 (absolutely classic DP)
1088 (DP)
1157 (flower shop, classic DP)
1163 (why is there so much classic DP ???)
1328 (Greedy)
1458 (longest common subsequence)
1647 (good real questions, accurate on-site analysis and quick start)
1654 (learning the Triangle Method of Polygon Area)
1655 (a non-root tree DP problem)
1804 (Reverse Order)
2084 (typical mathematical questions)
2187 (use a convex bag to find the farthest point. After finding the convex bag, there should be an O (n) method, but I just cannot tune it out)
2195 (optimal matching of bipartite images)
2242 (Computational geometric classic)
2295 (Equality processing)
2353 (DP, but the best path should be recorded)
2354 (three-dimensional analytic ry)
2362 (search for good questions)
2410 (Reading questions is the key)
2411 (Classic DP)

Fun
1067 (difficult mathematics, but careful research is a broad field)
1147 (an algorithm with O (n) needs to be considered)
1240 (until the first and last traversal of a tree, what kind of middle traversal? DP)
1426 (is it number theory? The error is graph theory !)
1648 (do not use computational ry. Use the whole point feature to bypass the obstacle of precision)
1833 (finding Rules)
1844 (it seems like DP or search is actually an interesting mathematical problem)
1922 (greedy, haha)
2231
2305 (high precision is not required)
2328 (please be careful)
2356 (number theory knowledge)
2359 (Joseph problem variant)
2392 (interesting question)

Very complex questions
1001
1008
1087 (the diagram is annoying, and there is also the maximum matching of the Bipartite Graph)
1128 (usaco)
1245
1329
1550 (reading and comprehension)
1649 (DP)
2200 (string processing + enumeration)
2358 (enumeration and avoiding repetition are annoying)
2361 (carefully and carefully)

Difficulties
1014 (it is difficult to prove mathematics, but it is more important to have that idea)
1037 (relatively difficult DP)
1405 (high-precision algorithms are classified into different levels. Keep improving)
2002 (I don't know if there are any more algorithms than O (N ^ 2 * logn ?)
2054 (extremely difficult, strong thinking ability)
2085 (combined mathematics)
2414 (DP, but pruning required)
2415 (Search)
2423 (calculation ry + statistics)

Multi-Solution
1002 (sorting or statistics can be used)
1338 (both search and DP are supported)
1664 (search and DP Practice)
2082 (this is my question)
2352 (both bucket and Binary Trees)

Note:
1011: Classic cut
1014: difficult in Mathematics
1017: strict mathematical proof seems not easy
1021
1083: clever thinking
1150: parity analysis, lg (n) Algorithm
1218: three rows are enough. Although simple, there are advantages and disadvantages.
1505: Binary and greedy
1654: there may be a lot of practices. I am using a directed area.
1674: Number of computation circles (graph)
1700: difficult to prove mathematics
1742: O (M * n) Algorithm
1863: Be patient and write... Pai_^
1988: Check the set
2051: heap
2078: not difficult, but cutting can do a good job.
2082: O (N), have you thought of it?
2084: catlands
2182: Line Segment tree
2195: Maximum Minimum fee Flow
2234: classic game Algorithm
2236: Check the set
2299: Binary thinking
2395: Expand the Minimum Spanning Tree of Kruskal
2406: KMP
2411: The status is represented by a binary string.