When are the authors of CodeForce Round #134 or anybody going to write the Editorial, I couldn't make Div2 D and I want to read the solution, but nobody has post it
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 155 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 150 |
10 | awoo | 147 |
When are the authors of CodeForce Round #134 or anybody going to write the Editorial, I couldn't make Div2 D and I want to read the solution, but nobody has post it
Name |
---|
If someone help to solve an editorial
2044609 there are some comments. Generally, you have to find all possible combinations of commands and chose the best of them.
first is better.
First step is T -> "1 1" . Last step is * -> "x r" or "r x". Check [1..r-1] for x. Calculate the number of commands "x r" -> "1 1" (when it's possible). Chose the best combination of commands.