# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Name |
---|
How to solve semifinal problem G? http://codeforces.net/gym/101192/problem/G
We can use Frame-Steward algorithm. It's mentioned in the Wikipedia article on the tower of Hanoi. A more detailed analysis is available here.
It's also possible to "guess" the structure of the answer by writing a recursive solution and staring at its output for small values of n. However, I think that it's pretty hard to prove it without any prior knowledge on this topic (and I wouldn't say that this algorithm is well-known), so this type of problems seems quite strange to me (you have to resort to either guessing the answer during the contest or not solving the problem altogether).
Are there any editorials available for these sets?
Yes, there is a video editorials, but in Russian. Coming soon. I hope that will be possible to understand the idea of the solution by pictures.
Are they ready?
Hmmmm. Good question. I'll look for.
How to solve problem B from final?
I need a captain here. What's BSUIR ? :D
Belarusian State University of Informatics and Radioelectronics
Thanks!