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 | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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
problem A
problem B
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.