Water hammer the real contest title
A
Operation \ (3 \) operation \ (2 \) will affect the operation of \ (1 \) , the operation \ (3 \) operation \ (2 \) independently of each other, the operation \ (1 \) only affected
First Processing \ (3 \) and \ (2 \) , then the processing \ (1 \) , and finally determines whether \ (1 \) on the line
B
Statistics mode \ (3 \) the number of the sense as \ (0 \) is not required tube
\ (1 \) and \ (2 \) to match each other, then the extra separate matching
C
By weight, respectively, into \ (6 \) a \ (SET \) inside
From each (4 \) \ out the collection of references that minimum, then sequentially incremented by the minimum meet matched positions behind \ (5 \) sets
Finally, the collection and the total remaining number is to be deleted
I do not know how to RE, and waste an hour
D
Is a prime number is put into a prime number greater than; otherwise into a smaller number than
Prime and non-prime number were placed in an array
Non-processed first prime number, since the non-prime number is not known to produce a non-prime number or a prime number, but the only limitation is smaller, the processing descending
Prime number is small to large processing
E
Tree answer must satisfy \ (\ FRAC {n-2}} {\) : not selected leaf node, determines whether or not the remaining subtrees greedy full enough unselected
FIG directly along No \ (DFS \) tree like manner as aboveAnnealing can feel too casual
F
Not look at the subject, to goo out