The first ACM University Student Program Design Competition (original title) Review 4.18

Phone number topic Link: http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=2151&cid=1172 Test instructions is very simple: give the n line phone numbers, Look for a string is another string of prefixes, some words output no, of course, two is the same no: no prefix 0, directly with the two-dimensional array, cycle on the line, with strcmp comparison equal. does not time out. Hello world!title Link: http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=2158&cid=1172Sample input

31 22 32 30

Sample output

Case 1:2 3-1-1-1-1

Test instructions: Give n number of pairs, to 0<R,C≤300 and all the input number pairs to compare, if there are more than this two, the output is all large number pairs, there is no output-1, if the two number pairs are large number of multiple, the line is the smallest priority, the row has more than one, the column is the least priority. The puzzle: At that time did not think of the use of the same pair,stl or unskilled, with the array storage pairs, if the comparison is OK. ShoppingTopic Links:http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=2154&cid=1172 Sample Input

424 13 89 3767 30 41 14 39 420

Sample output

15270

Test instructions: A person to go shopping malls, parked in the smallest store location, stroll through all shopping malls, in return to the car to seek the length of the route. Solving: order, maximum minus 2. Balloons Topic Link: http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=2152&cid=1172 Sample input

511001001001111111010100100

Sample output

Case 1:3 2

Test instructions: The number of four connected blocks and eight blocks of 1. Puzzle: Full DFS template, four-connected block can be added if cut off 4 directions.

The first ACM University Student Program Design Competition (original title) Review 4.18