50 questions (ACM learning recommendation questions)

Poj recommends 50 questions

1. You can take a look at the questions marked as "difficult" and "slightly difficult", think about them, and do not require them. Of course, competent students can cut them out directly.

2. The question marked as a and B is similar. We suggest you do it together. You can make a comparison and summary, and the two are counted as one question.

3. There are about 70 questions in the list. 50 of them are selected, and each type of question has a minimum limit.

4. Many questions here have code on bupt acm ftp. Please use resources properly.

5. 50 questions require that each question be summarized to form a good habit.

9. the purpose of this list is to give everyone an understanding of algorithms in various aspects, which may be demanding and doggy. Please forgive me. These are the lessons we have learned over the years, therefore, please respect the fruits of our work.

The first type of Dynamic Planning (at least 6 questions, 2479 and 2593 required)

2479 and 2593 1015 1042 (Greedy) 1141 1050 1080 1221 1260 2411 (slightly difficult) 1276

Category 2 search (at least 4 questions)

1011 1033 1129 2049 2056 2488 2492 (a little difficult, you can also check the Set)

Third Type greedy (at least 2 questions)

1065 2054 (difficult) 1521 2709

Category 4 Shortest Path (at least 3 questions)

1062 1125 1797 2253 2679 Bellman-Ford (hard)

Class 5 minimal spanning tree (at least 2 questions, and prim and Kruskal are used at least once)

1251 1258 1789 2485

Maximum stream of category 6 (at least 2 questions)

1087 1459 1149 2516 (maximum flow at minimum cost) (difficult)

Class 7 bipartite graph (at least 3 questions)

1325 1469 2195 (km algorithm or minimum cost Max stream) (hard) 2446 1422 and 2594

Class 8 concurrent queries (at least 2 questions)

1861 1182 (difficult) 1308 2524

Class 9 quick search (B-search, hash and so on) (at least 3 questions)

2503 2513 (+ Euler Loop determination) 1035 1200 2002

Class 10 number theory (at least 2 questions)

1061 1142 2262 2407 1811 (difficult) 2447 (difficult)

11th class line segment tree (no minimum number of questions required)

2352 (simple method available) 2528

12th class computational ry (at least 2 questions, 1113 convex hull algorithms required)

1113 1292 2148 (difficult) 2653 1584

13th categories of precision (at least 3 questions, 1001 required)

1001 1047 1131 1503 1504 and 1060 (polynomial) scu1002, 1996 4 (http://acm.scu.edu.cn/soj)

14th class simulation (at least 5 questions)

1029 and 1013 1083 and 2028 2234 and 1067 1012 1026 1068 1120 2271

15th class Mathematics (at least 4 questions)

2249 1023 2506 1079 1019 and 1095 1905 and 1064 (Binary)

The famous North mail ACM training team recommends 50 questions

All questions on poj

1000: it will teach you how to use an online judge.

1001: This question teaches you how to use high-precision computation, and you need to consider the high real number, so you need to record the decimal point location.

1002: simple questions: Get a preliminary understanding of the simulation questions in ACM. Simulation questions are questions that do not require any algorithms. They only need to be done step by step according to the requirements of the questions.

1003--1008: simple question, exercise online question preparation environment.

1012: the simplest form of Joseph's question.

1013: simple question.

1017: simple question.

1019: Mathematics + Simulation

1023: simple question.

1032: simple question.

1045: simple question.

1046: simple question.

1051: simple string simulation questions, recommended for beginners.

1054: troublesome simulation questions, used to familiarize yourself with the language environment.

1060: polynomial simulation questions.

1047: troublesome mathematical simulation.

1050: Basic DP.

1061: Extended Euclidean algorithm, classic question.

1067: simple question.

1068: Students with time can do this.

1080: simple DP.

1083: simple question.

1088: Classic DP.

1100: solving the equation, with templates.

1102: Simulation questions, very practical code skills.

1106: getting started with computational ry.

1132: simple question.

1150: what is the last non-zero digit? From this question, you can learn the general solutions for such problems.

1159: relatively simple DP, can give you a new idea.

1163: relatively simple DP.

1166: A simple simulated question.

1182

1183

1207

1218

1247 1298 1306 1308 1316 1317 1326 1331 1338 1363

1011: Deep Priority Search (DFS) may take a long time. It is worth more training.

Upgrade version at 1029:1013.

1014: greedy question?

1031: Computational ry

1458: Classic DP.

1401 1423 1426 1450 1455 1477 1488 1503 1504 1517

1035: string + simulation, which is troublesome.

1037: Classic Dynamic Planning (DP) is difficult.

1038: Classic DP, difficult.

1042: Classic greedy question.

1048: more complex simulation questions.

1519 1528 1543 1547 1552 1555 1565 1575 1580 1581

1065: Classic greedy question.

1077: Very classic 8 digital problem.

1091: high precision.

1095: catlan number, difficult to combine mathematical problems.

1099: typical simulation questions.

1589 1598 1606 1656 1658 1663 1674 1702 1723 1731

1107: Simulated string question.

1113: calculates the ry, convex hull + circle perimeter.

[Concept: convex hull: 1) convex hull of the Point Set Q refers to a smallest Convex Polygon that satisfies the points in Q, either on or on the side of the polygon. The polygon represented by a red line segment is the convex hull of the Point Set q = {P0, P1,... p12.

2) Find the smallest Convex Polygon that contains all points on a group of points on the plane. This is the problem of convex hull. This can be vividly thought like this: place some unmovable wooden piles on the ground and use a rope to enclose them as tightly as possible. This is a convex bag.]

1141: Classic DP.

1147: requires mathematical skills.

1149: Classic Network stream.

1753 1775 1799 1844 1851 1862 1915 1922 1936 1953

1165: Typical search questions.

1177: classic line segment tree.

1182: It is difficult to query the set.

1190: Classic search + mathematical formula.

1191: a strong mathematical DP.

1969 1979 2000 2001 2007 2013 2017 2027 2039 2070

1201: Differential constraint, Bellman-Ford algorithm.

1204: It is difficult to solve the typical string automatic machine problem.

1286: the simplest application of the polyA theorem, composite mathematics.

1312: Find a regular question and create a table.

1315: Classic DFS

50 questions (ACM learning recommendation questions)