2011华南农业大学校赛.docVIP

South China Agricultural University Collegiate Programming Contest, 2011 目录 Problem A: Password 2 Problem B: Prison break 2 Problem C: Trees And Numbers 4 Problem D: How much area？ 5 Problem E: Geovisualization 8 Problem F: Valentines Day 9 Problem G: List Expression 10 Problem H: M Nondecreasing Substring 12 Problem I: Farjuli sequence 13 Problem J: The Least Distance 14 Problem K: Machinarium 14 Problem A: Password Description Maybe, how to remember a lot of passwords is a big problem for someone. Today, Xiaoming forgot the password of his bank card. The password is made of 6 digits. He only remembers that the password is a multiple of his lucky number. And he also knows that his lucky number is a multiple of the sum of every digits of the password. Now, given the lucky number, can you tell Xiaoming how many passwords satisfy the requirement? Input The input is just one line which contains a number, the lucky number. Output Outputs the number of passwords satisfy the requirement. Sample Input Sample Output 87 3 Hint There are 3 passwords satisfy the requirement. They are 002001, 020010, and 200100. Problem B: Prison break Description Mike was going to escape from the prison when he knew how to do it. However, many other people realized his secret and asked him for help. But, to avoid being caught by guards, Mike could only take one people with him. By thinking for a minute, an idea came out in his mind to choose one from all the people who wanted to break the prison: Let all the n people (assuming they are numbered from 0 to n-1) gather together in a circle and play a game, the one who wins in the end might have a chance to escape with Mike. Here is the rule of the game: Select two people adjacent to each other in the circle randomly, and then they might fight between each other. The loser in the fight has to quit the game and the winner can stay. Repeat this step until there is only one person left and this person can go with Mike. As Mike was a clever man