Hdu--pku topic Categories

HDU

Simulation questions, enumerating
1002 1004 1013 1015 1017 1020 1022 1029 1031 1033 1034 1035 1036 1037 1039 1042 1047 1048 1049 1050 1057 1062 1063 1064 10 70 1073 1075 1082 1083 1084 1088 1106 1107 1113 1117 1119 1128 1129 1144 1148 1157 1161 1170 1172 1177 1197 1200 1201 1202 1205 1209 1212 (large number modulo) 1216 (linked list) 1218 1219 1225 1228 1229 1230 1234 1235 1236 1237 1239 1250
1256 1259 1262 1263 1265 1266 1276 1279 1282 1283 1287 1296 1302 1303 1304 1305 1306 1309 1311 1314
Complex simulations

Search, Recursive solution
1010 1016 1026 1043 (Shuang Guang) 1044 (BFS+DFS) 1045 1067 1072 1104 1175 1180 1195 1208 1226 1238 1240 1241 1242 1258 1271 1312 131 7
Bo Game
1079

Dynamic planning
1003 1024 1025 1028 1051 1058 1059 1069 1074 1078 1080 1081 1085 1087 1114 1158 1159 1160 1171 1176 1181 1203 1224 1227 12 31 1244 1248 1253 1254 1283 1300

Mathematics, recursion, regularity
1005 1006 1012 1014 1018 1019 1021 1023 1027 1030 1032 1038 1041 1046 1059 1060 1061 1065 1066 1071 (Calculus) 1097 1098 1099 11 00 1108 1110 1112 1124 1130 1131 1132 1134 1141 1143 1152 1155 (physics problem) 1163 1165 1178 1194 1196 (lowbit) 1210 1214 1200 1221 1 223 1249 1261 1267 1273 1290 1291 1292 1294 1297 1313 1316
Arithmetical
1164 1211 1215 1222 1286 1299

Calculate geometry
1086 1115 1147
Greedy
1009 1052 1055 1257

and check Set
1198 1213 1232 1272
Segment tree, discretization
1199 1255
Graph theory
Shortest-circuit-related issues 1142 1162 1217 1301
Two-point graph problem 1054 1068 1150 1151 1281
Other
1053 (Huffman) 1102 (MST) 1116 (Euler loop) 1233 (MST) 1269 (strong connectivity)
Data
1103 (heap + analog) 1166 (number tree group) 1247 1251 1285 (Topol) 1298
Hanoi series
1207
Nearest vertex to 1007

DP
1501 DP
1502 DP or memory
1503 DP
1504 Simulation
1505 DP
1506 DP
1507 2 points Matching
1508 Memorization Easy Point
1509 simulation
1510 DP
1511 Search can be over
1512 left-leaning tree
1513 DP
1514 DP
1515 DFS
1516 DP
1517 Game
1518 Search
1519 DP (indeterminate)
1520 Tree-like DP
1521 math problems, female functions, whatever. Actually, they can.
1522 Stable marriage
1523 DP
1524 Games
1525 Games
1526 Maxflow
1527 Games
1528 2 points Matching
1529 Simple Questions
1530 Largest Group
1531 differential constraints
1532 Maxflow Entry Question
1533 KM Or Minimum charge flow
1534 differential constraints
1535 differential constraints
1536 Games
1537 simulation plus permutation group theory code can be shorter, in fact, no need ...
1538 very interesting topics. It's said to be the interview topic for Microsoft Asia President
1539 Search
1540 Segment Tree
1541 tree-like array
1542 Discrete, Segment tree
1543 segment Tree
1544 Simple
1545 DP http://acm.hdu.edu.cn/forum/htm_data/18/0608/2050.html
1546 Search
1547 Simulation
1548 Simulation
1551 2 points Answer
1553
1554
1555 Simple
1556 tricks. Mathematical
1557 Search
1558 and check + line sentence
1559 DP
1560 Minus branch + search
1561 Tree-like DP
1562 violent between and 9999
1563 Simple
1564 game.
1565 Status DP
1566 mathematics
1567 simulation
1568 Large numbers
1569 min cut
1570 Mathematics
1571 the most part of the road
1572 Search
1573 Mathematics
1574 DP
1575 2 min
1576 number theory
1577 simulation, processing accuracy
1579 Memory
1580 DP
1582 Search
1583 Simulation
1584 Search
1585
1586
1587 Simple Topics
1591 simulation
1592 simple
1593 Mathematics
1594 Mathematics
1595 graph theory
1596 graph theory
1597 graph theory
1598 graph theory
1599 graph theory

Basic questions: 1000, 1001, 1004, 1005, 1008, 1012, 1013, 1014, 1017, 1019, 1021, 1028, 1029, 1032, 1037, 1040, 1048, 1056, 1058, 1061, 1070, 1076, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1106, 1108, 1157, 1163, 1164, 1170, 1194, 1196, 1197, 1201, 1202, 1205, 1219, 1234, 1235, 1236, 1248, 1266, 1279, 1282, 1283, 1302, 1303, 1323, 1326, 1330, 1334, 1335, 1339, 1390, 1391, 1393, 1395, 1397, 1405, 1406, 1407, 1408, 1412, 1418, 1420, 1465, 1491, 1555, 1562, 1563, 1570, 1587, 1673, 1678, 1708, 1718, 1720, 1785, 1799, 1859, 1862, 1877, 1898, 1976, 1977, 1985, 1994, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026, 2027, 2028, 2029, 2030, 2031, 2032, 2033, 2034, 2035, 2039, 2040, 2042, 2043, 2048, 2049, 2051, 2053, 2055, 2056, 2057, 2060, 2061, 2071, 2073, 2075, 2076, 2078, 2081, 2083, 2088, 2090, 2092, 2093, 2095, 2096, 2097, 2098, 2099, 2101, 2103, 2106, 2107, 2109, 2113, 2114, 2115, 2123, 2131, 2132, 2133, 2135, 2136, 2137, 2138, 2139, 2143, 2148, 2153, 2156, 2161, 2162, 2164, 2178, 2186, 2192, 2200, 2201, 2212, 2304, 2309, 2317, 2401, 2500, 2502, 2503, 2504, 2519, 2520, 2521, 2523, 2524, 2535, 2537, 2539, 2547, 2548, 2549, 2550, 2551, 2552, 2555, 2560, 2561, 2562, 2566, 2567, 2568, 2700, 2710,

dp:1003, 1024, 1029, 1069, 1074, 1087, 1114, 1159, 1160, 1171, 1176, 1203, 1231, 1257, 1260, 1284, 1421, 1789, 1978, 2059, 2084, 2159, 2191, 2544, 2571, 2602, 2709,

Search: 1010, 1015, 1016, 1026, 1072, 1075, 1175, 1180, 1181, 1238, 1239, 1240, 1241, 1242, 1253, 1254, 1312, 1372, 1548, 1597, 1671, 1677, 1728, 1800, 1983, 2102, 2141, 2553, 2563, 2605, 2612, 2614, 1616, 2717

Greed: 1009, 1045, 1049, 1050, 1051, 1052, 1257, 1800, 2037, 2111, 2124, 2187, 2391, 2570

Math problems: 1018, 1065, 1071, 1115, 1141, 1162, 1212, 1220, 1492, 1593, 1701, 1722, 1798, 1840, 1999, 2036, 2080, 2086, 2089, 2105, 2108, 2134, 2303, 2393, 2438, 2529, 2547, 2548, 2552, 2554, 2601, 2603, 2701,

Recursion: 1133, 1143, 1207, 1249, 1267, 1284, 1290, 1297, 1396, 1992, 1995, 1996, 2013, 2014, 2044, 2045, 2046, 2047, 2050, 2064, 2065, 2067, 2068, 2070, 2077, 2085, 2151, 2154, 2160, 2190, 2501, 2512, 2563, 2569, 2709, 2716,

Strings: 1020, 1039, 1043, 1062, 1073, 1075, 1088, 1113, 1161, 1200, 1251, 1256, 1288, 1321, 1328, 1379, 1804, 1860, 1982, 1984, 2017, 2024, 2025, 2026, 2027, 2043, 2052, 2054, 2072, 2074, 2087, 2131, 2137, 2140, 2163, 2203, 2206, 2352, 2500, 2549, 2564, 2565, 2567, 2572, 2609, 2607, 2707, 2708, 2719, 2721, 2723,

Large number: 1002, 1042, 1133, 1250, 1297, 1715, 1753, 1865, 2100,

Screwing up: 1022, 1027, 1030, 1035, 1128, 1165, 1209, 1210, 1215, 1222, 1228, 1229, 1230, 1237, 1259, 1276, 1286, 1337, 1342, 1361, 1370, 1506, 1577, 1597, 1702, 1716, 1727, 1868, 1870, 1896, 1981, 1986, 1987, 1988, 1997, 1998, 1999, 2058, 2062, 2089, 2090, 2094, 2104, 2116, 2117, 2135, 2175, 2183, 2184, 2197, 2303, 2368, 2370, 2374, 2511, 2522, 2527, 2600, 2615, 2703, 2711, 2714, 2715, 2725,

Game: 1077, 1404, 1517, 1524, 1525, 1527, 1536, 1564, 1729, 1730, 1846, 1847, 1848, 1849, 1850, 2147, 2149, 2176, 2177, 2188

Female functions: 1085, 1171, 1398, 2079, 2082, 2110, 2152, 2189, 2566,

hash:1264, 1280, 1425, 1496, 1800, 2522, 2600

PKU

PKU OJ Mainstream algorithm:
1. Search//Backtracking
2.DP (Dynamic planning)
3. Greed
4. Graph theory//dijkstra, minimum spanning tree, network flow
5. Number theory//Chenmo linear equations
6. Calculate the area and perimeter of the geometry//convex hull, equal placement rectangle
7. Combinatorial Mathematical//polya theorem
8. Simulation
9. Data structure//and check set, heap
10. Game theory
1. Sorting
1423, 1694, 1723, 1727, 1763, 1788, 1828, 1838, 1840, 2201, 2376, 2377, 2380, 1318, 1877, 1928, 1971,

1974, 1990, 2001, 2002, 2092, 2379,
1002 (requires character processing, sorting with a quick line) 1007 (Stable sort) 2159 (test instructions more difficult to understand) 2231 2371 (Simple sort)

2388 (sequential statistical algorithm) 2418 (binary sort tree)
2. Search, backtracking, traversal
1022 1111d 1118 1129 1190 1562 1564 1573 1655 2184 2225 2243 2312 2362 2378 2386

1010,1011,1018,1020,1054,1062,1256,1321,1363,1501,1650,1659,1664,1753,2078
, 2083,2303,2310,2329
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,
Recommended: 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, 2288, 2331, 2339, 2340,1979 (and Maze-like) 1980 (for Pruning

Higher requirements)
3. Calendar
1008 2080 (Be careful with this question)
4. Enumeration
1012,1046, 1387, 1411, 2245, 2326, 2363, 2381,1054 (higher pruning requirements), 1650 (decimal precision problem

）
5, data structure of the typical algorithm
Easy: 1182, 1656, 2021, 2023, 2051, 2153, 2227, 2236, 2247, 2352, 2395,
Not easy: 1145, 1177, 1195, 1227, 1661, 1834,
Recommended: 1330, 1338, 1451, 1470, 1634, 1689, 1693, 1703, 1724, 1988, 2004, 2010, 2119, 2274, 1125 (Freud Count

method), 2421 (the minimum spanning tree of the graph)
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,
7. Greed
1042, 1065, 1230, 1323, 1477, 1716, 1784,1328 1755 (or Simplex method), 2054,1017, 1328,1862, 1922

, 2054, 2209, 2313, 2325, 2370.
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, 1886,1281 1928 2083 2141 2015
9. Recursion
1664
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, 1016 1051 1126 1318 1572 1917 1936 2039 2083 2136 2271 2317

2330,2121 2403
11. Number theory
1006,1014,1023,1061,1152,1183,1730,2262
12. Geometry-related Topics
Convex bag: 1113, 1228, 1794, 2187,1113 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 operation, digital game, high-precision calculation
1001 1023 1047 1060 1079 1131 1140 1142 1207 1220 1284 1289 1306 1316 1338 1405 1454 1503 1504

1519 1565 1650 1969 2000 2006 2081 2247 2262 2305 2316 2389 1001, 1220, 1405, 1503,1001 (high-precision multiplication)

2413 (High-precision addition, two-point search)
14. Probability statistics
1037,1050
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 position, 2430 lazy cow
17. The longest common substring (LCS)
Human gene functions,1159 palindrome,1458 common subsequence,2192 zipper
18. Graph Theory and combinatorial 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 permutations,
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 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 Class
1067 take the 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, simulation 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 Above Average,
2218 Does This do Me look Fat?
2260 Error Correction,
2262 goldbach\ ' s conjecture,
2272 Bullseye,
2136 Vertical Histogram,
2174 decoding Task,
2183 Bovine Math Geniuses,
Gold Coins,
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 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 decision,
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 application of the inverse tangent function,
22. Matching
1274, 1422, 1469, 1719, 2060, 2239,
-------------------------------------------------------------------------------------------
Classic
1011 (search for a good question)
1012 (Learn to play the table)
1013
1019 (It embodies many of the characteristics of such problems)
1050 (Absolute classic DP)
1088 (DP good question)
1157 (flower shop, classic DP)
1163 (How about the classic DP so much ah??? ）
1328 (greedy)
1458 (longest common sub-sequence)
1647 (very good real problem, accurate and quick analysis of the test)
1654 (triangular method for learning polygon area)
1655 (a type of DP problem with no root tree)
1804 (Reverse pair)
2084 (Classical combinatorial math problem)
2187 (with convex hull to find the farthest point pair, the convex hull should have an O (N) of the method, but I can not be adjusted out)
2195 (best match for binary graphs)
2242 (Computational geometry Classic)
2295 (Equation processing)
2353 (DP, but to record the best path)
2354 (solid analytic geometry)
2362 (search for a good question)
2410 (reading the question is the key)
2411 (classic DP)
Interesting
1067 (difficult mathematics, but careful study, is a vast field)
1147 (with O (n) algorithm, need to think)
1240 (until a tree's sequence and post-order traversal, then there are several middle sequence traversal it?) dp
1426 (Is it number theory?) Wrong, it's graph theory! ）
1648 (Do not use computational geometry, the whole point of this feature to bypass the obstacle of precision)
1833 (rule-finding)
1844 (seemingly DP or search, in fact, is an interesting math problem)
1922 (greedy, haha)
2231
2305 (no need for high precision OH)
2328 (Be careful OH)
2356 (number theory knowledge)
2359 (variant of the Joseph question)
2392 (Interesting question)
A very complex question.
1001
1008
1087 (the composition is annoying, there is the maximum match of the binary graph)
1128 (Usaco)
1245
1329
1550 (the exam is reading and understanding ability)
1649 (DP)
2200 (String Processing + enumeration)
2358 (enumerating and avoiding repetition are annoying)
2361 (carefully carefully again carefully)
Problem
1014 (mathematics proves to be difficult, but it is more important to have that idea)
1037 (more difficult DP)
1405 (high-precision algorithm is also divided into grades, and constantly improve it)
2002 (Do not know if there is more algorithm than O (N^2*LOGN)? ）
2054 (very difficult, very strong thinking ability)
2085 (Combinatorial mathematics)
2414 (DP, but to prune)
2415 (search)
2423 (Computational geometry + statistics)
More Problem Solving
1002 (can be sorted, can also be used as a statistical method)
1338 (both search and DP are available)
1664 (Search and DP both practice it)
2082 (This is the question I'm talking about.)
2352 (the barrel and the two fork tree are OK)
Note:
1011: Very classic scissors
1014: Difficult in mathematics
1017: Rigorous mathematical proof seems to be not easy
1021: A little complex, the study of the graphics of various rotation processing
1083: Smart Thinking angle
1150: Split-odd-even discussion, LG (n) algorithm
1218: Three line is enough, although simple, but also have the pros and cons of the
1505: two points plus greed
1654: The practice may be many, I use the area to do
1674: Count the number of loops (graph bar)
1700: Math proves not easy
1742:o (m*n) algorithm
1863: Be patient and slowly write ...
1988: and check Set
2051: Heap
2078: Not difficult, but the scissors can do very well
2082::o (n), do you have any idea?
2084: Number of Cattleya
2182: Segment Tree
2195: Minimum cost maximum flow
2234: Classical Game algorithm
2236: And check Set
2299: The dichotomy of thought
The extension of 2395:kruskal minimum spanning tree
2406:kmp
2411: In binary

Hdu--pku topic Categories