Hdoj question category

Hdoj question category

 

/*
* 1: simple question
*/ 
1000: getting started;
1001: Use Gaussian summation formula to prevent overflow
1004: 1012:
1013: Get the remainder for 9
1017: 1021:
1027: Use next_permutation () in STL ()
1029: 1032: 1037: 1039: 1040: 1056: 1064: 1065:
1076: leap year

1084:
1085:
1095,109, 6: All A + B
1108: 1157: 1196:
1197: hexadecimal
1202: 1215: 1219: 1228: 1229: 1234: 1235: 1236: 1256: 1259: 1262: 1279: 1280: 1283:

1239:

1321: 1395: 1406:
1407: Because XYZ is symmetric, YZ does not need to start from 1.
1408: 1412: 1420:
1425: the complexity of N ^ 2 is stuck.
1562: 1587: 1594: 1701: 1713: 1718: 1785: 1860: 1862: 1877: 1976: 1984: 1985:
HDU 11 page entry is required
2101: 2304: 2309: 2502: 2503: 2504: 2519: 2520: 2547: 2548: 2549: 2550: 2561: 2562: 2564: 2565:

2566: 2567: 2568: 2950: 2959: 3040:

/*
* 2: graph Theory
*/
// 1. search:
* 1010: Search
1015: Search 5 for brute force attacks ?????
* 1016: Search
* 1072: Search: BFS past
1240: search for the most basic BFs, 3D. Note that the input coordinates are x, y, z, but map [Z] [y] [x]
* 1241: Search
* 1242: Search
1253: Search for BFs, the path to BFS is the shortest
* 1312: Search
* 1342: Search for DFS, and search for 6 for
1372: search is too classic, eight BFS directions
* 1496: a good search question
* 1548: Search | BFS in one dimension in graph theory, which is not marked at the beginning, resulting in MLE, I thought STL was not optimized. I wrote a dynamically allocated chain or MLE, and then marked the re-submit to prove that the internal memory of STL is smaller than the Chain team I wrote ...; it is said that the most short circuit can also be done ~
* 1728: Search

* 2181: Search
* 2660: Search
* 2952: Search
2717: search for BFs. Remember to mark the passed BFs. Otherwise, MLE
* 2102: Search
// 2. minimum Spanning Tree
? 1102: Minimum Spanning Tree
? 1162: min Spanning Tree
* 1233: min Spanning Tree
* 1301: min Spanning Tree
* 1875: min Spanning Tree
1863: minimum Spanning Tree
// 3. shortest Path
* 1690: Shortest Path
* 1874: Shortest Path
* 2544: Shortest Path
// 4. check
* 1213: and
* 1232: and
* 1272: And check
* 1856: and check
// 5. others

1053: Huffman tree

1285: Top sorting
* 1878: Euler's loop
* 3118: Bipartite Graph

/*
* 3. String:
*/ 
1020 1048 1062 1088 1106 1113 1161 1200 1591 1870 1982 2140 2203 S1 two
2206 this question data is very poor
2265 2487 2673 3125
* 1686 KMP
* 1075 dictionary tree
* 1181 dictionary tree
* 1800 the dictionary tree is said to be able to pass through hash
1804
* 1251 dictionary tree

/*
* 4. Simulation questions:
*/ 
1008:
* 1022: Simulate Stack
1049: 1170:
1237: Team, add or subtract to join the team, and calculate the Division
* 1873: 2816: 2832: 2919: 2957: 1702:

/*
* V. Number Theory:
*/ 
1014: similar to 1222
1019: multiple numbers of LCM
? 1098:
1222: Same as 1014, only the same with each other
3123:
? 2854: Table hitting

/*
* 6. Computational ry:
*/ 
? 1086: Line Segment Intersection
? 1115: polygon center of gravity
1221: intersection of a circle and a rectangle
* 1392: convex hull
? 2105: polygon center of gravity
? 2108: determines the concave and convex sides of a polygon.
? 2202: convex hull
? 2857: symmetric problem
? 3124: speculative

/*
* 7. mathematical Problems:
*/
1005: shows a period.
? 1018: calculate the number of digits of a factorial using the striling formula
? 1023: the number of Catalan stacks.
? 1060: leftmost digit
? 1061: rightmost digit
1071: Points
? 1130: the catalan number is used to calculate the number of Binary Trees.
? 1133: Catalan data application
? 1134: Catalan count
? 1178: Calculate the base number of the index
1205: 1239 :? 1249 :? 1290:
? 1465: error message
? 1466: 1555: 1570:
1593: Find concentric circles
? 1597: 1703: 1717: 1798 :? 2114 :? 2200: 2289 :? 2501 :? 2563 :? 2569 :? 2922:

/*
* 8. DP:
*/ 
* 1003: Maximum child segment and
* 1058:
* 1159: LCs (longest Public String, not continuous)
* 1160: sort first
* 1238:
* 1257: Minimum Interception System
* 1501:
* 2084: Classic
* 2668: Maximum length of different strings

/*
* 9. Others:
*/ 
1002: Large Number Addition template ~
1041: Large Number
1042: Big Data factorial
1212: Large Number
1250: Large Number
1715: Large Number
? 1865: large number of Fibonacci

1895: Hash
1009: greedy and greedy
* 1050: greedy
* 1097: A ^ B % m
1144: Hash
1201: Miscellaneous question date
1563: Hash
? 1564: Game
* 2602: backpack
* 2817: bipartite power
2946: Hash
? 2954: Game
* 2986: High Precision
* Number of sharding types in integer 1028

// Category is not absolute
// "*" Indicates a good question and needs to be reviewed multiple times
//"? "It indicates that the conclusion is correct, but it is still in the module level. It must be understood and proved.
// You can check the question.