Integration of noip semi-finals questions over the years

In the morning, I plan to repeat all the questions over the years, and sort out which direction I will take the test, what I will take, and not to mention too much. Let's get started.

 

2013:

Day1:

T1 round robin game: a fast power (the key is to play a fast power)

Thought: because every time we enter M bits, it is equivalent to adding m to X every time, that is, X advances M * 10 ^ K in total;

The answer is (x + M * 10 ^ K) mod n.

T2 match queuing: discrete-> convert to Reverse Order Model

T3 freight car transportation: Spanning Tree Problems

Model: Bottleneck (For details, refer to p343, a classic competition entry)

 

Day2:

T1 building block competition: the most idiotic idea is recursive Simulation

T2 craftsman: greedy or DP (in fact, the idea is to find the biggest monotonic)

T3 HuaRong Road: preprocessing + shortest Circuit

 

2012:

Day1:

T1 Vigenere password: String

King game t2: greedy + high-precision multiplication + high-precision division and Low-precision (mainly to prove)

T3 driving travel: preprocessing + doubling

Day2:

T1 cool equation: Solving cool equation (number theory)

T2 borrow classroom:

T3 epidemic control:

 

Unfinished ....

Integration of noip semi-finals questions over the years