aropan's blog

A little bit BSUIR Open into gym
By aropan, 8 years ago, translation, In English

BSUIR Open Archives (polygon contests packages and statements)

  • Vote: I like it
  • +182
  • Vote: I do not like it

»
8 years ago, # |
  Vote: I like it +10 Vote: I do not like it

How to solve semifinal problem G? http://mirror.codeforces.com/gym/101192/problem/G

→ Reply
  • »
    »
    8 years ago, # ^ |
    ← Rev. 2   Vote: I like it +27 Vote: I do not like it

    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).

    → Reply
»
8 years ago, # |
  Vote: I like it +14 Vote: I do not like it

Are there any editorials available for these sets?

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    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.

    → Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve problem B from final?

→ Reply
»
8 years ago, # |
  Vote: I like it -7 Vote: I do not like it

I need a captain here. What's BSUIR ? :D

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +14 Vote: I do not like it

    Belarusian State University of Informatics and Radioelectronics

    → Reply