Venue: \ (10 + 10 + 0 = 20 \)
T1:
Probability, just the 2H \ (the DP \) of formula, to give \ (f [i] = f [i-1] + f [i-2] + f [i-1] * (1-p) + .. . \) , and not simplification, and finally collapse.
Positive Solutions set f [i] represents the i-th stage to generate a desired cost sword.
Can be \ (f [i] = f
[i-1] + f [i-2] + (1-p) * (f [i] -f [i 2-]) \) solution of the equation can, to with the inverse (inverse of the examination room became directly \ (/ (k!) \) , and the need is \ (/ k \) ...)
T2:
First thought 50 minutes of violence, but also think that for every prime number separately seeking answers, and finally multiplying the result and hanging.
Positive Solutions The Chinese remainder theorem, for each prime number may request separate time \ (O (C * T * T * logM) \) , 80 minutes.
The sieve is then integrability (Euler mesh), we can approach \ (O (n) \) obtaining \ (. 1 \) ~ \ (n-\) a \ (m \) th power, in \ (% n \ ) in the sense.
T3:
Read \ (0.5h \) title, and finally understand about the subject content.
Probably chain is seeking a minimum, but do not know there is no after-effect.
Then no hit.
+ Positive solution is disjoint-set multiplication.
Due to mandatory online, we can directly update the update time, but do not have updated.
In query time for us to re-needed update.
Summary:
Try playing table to find the law.
Pay attention to details, not to have a small loophole.
To develop the habit of constant optimization.
Do not die on a topic.
Now: \ (100 + 100 + 100 = 300 \)