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 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.