Noip2018 popularity Group preliminary round question solving report

Solutions: I. multiple choice questions

(Answer: dddbbaaaababbbb)

1. All except D are input devices.

2. Except D, all others are equal to (617) 10, and D is (619) 10.

3. 1 MB = 1024kb = 1024 * 1024b

4. Wan, that is, wideareanetwork.

5. Baidu Encyclopedia: in 1984, Deng Xiaoping pointed out: "computer popularization should begin with dolls ." The Ministry of Education and the China Association for Science and Technology commissioned the China Computer Society to hold the National Computer Program Design Competition for teenagers (Noi)

6. output character sequence: a s d f a s d F. There are 8 loops, so the 81st characters are.

7. node Calculation of a K-tree with H depth (kH + 1-1)/(k-1 ).

8. The base sorting function is to distribute the elements to be sorted to some "buckets" based on some key-value information.

9. exclude other options.

10. Omitted

11. Charts available

12. still excluded

13. The factors of 10000 include 1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 80, 100, 125, 200, 250, 400, 500, 1000, 1250, 2000, 2500, 5000, 10000. Select B.

14. B changes the number after the first 1 on the Right of X to 0 (including 1)

15. Omitted

 

Ii. Problem Solving

(Answer: 1. I didn't go there, but it didn't rain. 2. 488)

1. logic problems. If Bing does, Ding does not go. And Ding did not go to bing, so Jia went. Ding does not go to B. Another Party B didn't go, but party A went there without rain on the weekend.

2. List

 

3. Read the program write results

(Answer: ruanhuomiantai; 4; 8; 6)

1. This program changes the uppercase letters in the string to the next letter in Lexicographic Order.

2. List available items

3. brute force computing is available

4. Simulated availability

 

4. Improve procedures

T1. Observe the sub-function.

Getdivisor, meaning to get the factor. Because the complexity is only O (√ N), the number of cycles is √ N, that is, I * I <= n. If n is divisible, that is, the factor of N, and whether N is I square, otherwise N/I is also the factor of N

GCD Recursive Maximum common divisor Template

In the main program.

Therefore, the answer is:

1. I * I

2. N/I

3. Return

4. A % B

5. ans + gcd (A [I], a [J])

T2, symmetric double linked list.

The answer is:

1. A [x] = I

2. I + 1

3. R [A [I]

4. A [I]

5. R [I]

 

Noip2018 popularity Group preliminary round question solving report