ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1789. Searching for the Dodecahedron

If to walk from 2nd pedestal toward (n-1)th pedestal and to touch dodecahedron on each pedestal twice?
F.e.:
n = 7
answer:
10
2 2 3 3 4 4 5 5 6 6
Can somebody give me an example demonstrating this way is wrong?
Nguyen Khac Tung Re: why this solution is not right? [1] // Problem 1789. Searching for the Dodecahedron 7 Aug 2011 09:30
For example,

n = 4

2 2 3 3 won't work when the stone at 4


The final stone will be 4->3->2->1->2 for example