Test 3: Friday, 1 September 2000, 7pm, to Sunday, 3 September 2000, 7pm. Test 3 consists of ten Local Judge questions 113-122 covering some or all of Dynamic Programming, Divide and Conquer, Geometry, Greedy Method, DFS/BFS, Backtracking, Articulation Point. Test 3 is worth 250 marks, 25 marks for each question. Please note the formatting requirements: All output lines must end with \n with no leading/trailing spaces, and all output items on the same line must be separated by exactly one space.