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 | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | maroonrk | 155 |
6 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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://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 |
---|