As stated by title, I want to know if there's any formal proof for solution with minimum steps to solve Towers of Hanoi being unique or non-unique.
# | 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 |
As stated by title, I want to know if there's any formal proof for solution with minimum steps to solve Towers of Hanoi being unique or non-unique.
The official analysis is hard to understand. Any other explanations please?
See the solution timings and submissions carefully. Clearly 2 or more people are co-operating for this account. It's clear that this person was simultaneously coding solutions for F and B.
Here's another one ...
This guy's template is alternating between problems and it seems two people are also using this account.
I saw this for the first time.
Don't these guys get caught? Isn't there any alert system based on submission timings?
Solution Link : https://mirror.codeforces.com/contest/1486/submission/107850525
Can anyone find any TLE test case?
Is the new logo just a temporary replacement or is it permanent? Anyone knows with confirmation?
I am sure some of us are tired of seeing these posts again and again. Please MikeMirzayanov , make another space for these kind of blogs.
Name |
---|