hdustep 攻略（hdustep 攻略）.docVIP

hdustep 攻略（hdustep 攻略） One point one Basic input and output: LCY A+B 8 questions (1089~1096) One point two C language foundation: basic entry (21042088107620951061117033611197) One point three Sort, greedy: 1052, a very disgusting greedy question 3177, I recommend this problem seems to card a lot of people, according to the difference sort (123610842093211121871157) Two point one Simple math: GCD and prime generation make up a large part 1071 integral questions 1717 this question is more troublesome (110821382504121512861060) Two point two Recursive: Fibonacci, Joseph ring, what is the tower of Hanoi, recursion, for just fine, or find the law 1005, feel the law, there is a problem, it is recommended to use the matrix (1568144319971222103210131018) Two point three A large number of Catalan numbers: Java, what is the most happy (10021063121211301133113111341267) Three point one Recursive: push and push questions 2604 use the matrix in this question (2041204420462018205025012563) Three point two Simple DP: what is the number tower? (10031159108710581069208411762571) Three point three Backpack: all kinds of backpacks (26021114117128441059295512033466) Four point one Two points, three points: it doesnt feel like a search (21992899196922982438340015512178) Four point two BFS: an entry-level search 1175 see again and again, dfs+ cut the fastest 2531 previously thought of this model, do steps, only to find that someone has gone out, first sweep the map, into a single point of the situation (124112421548137213121495) Four point three Dfs:hh added a lot of nasty search to get in, and it was a lot of people 1010 entry-level DFS, reducing branches is very important 1426 Dlx water over ~! 2553, my evil ten tier for hit table, Matrix67 blog has status compression version these two questions are in this chapter, very few people, but it is not very difficult, DFS very soon, I was BFS do (1016329028212514) Five point one And check collection: collection and investigation o