Page 2 of 2

Posted: Thu Oct 26, 2006 8:58 pm
by yiuyuho
Yarin wrote:
In this problem you can handle big inputs in a special way; if there are enough stones it's always possible to reach a certain stone. Why this is so I don't want to prove :)
Can you prove it please? :)

Posted: Fri Oct 27, 2006 2:05 am
by yiuyuho
Ha,

I worked out a proof, posed it on algorithmists:

http://www.algorithmist.com/index.php/UVa_10120

It's longer then it needs to be, but it does the job (I hope).