10120 - Gift?!

All about problems in Volume 101. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

Post Reply
yiuyuho
A great helper
Posts: 325
Joined: Thu Feb 21, 2002 2:00 am
Location: United States
Contact:
Contact yiuyuho

Post 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? :)
Top
yiuyuho
A great helper
Posts: 325
Joined: Thu Feb 21, 2002 2:00 am
Location: United States
Contact:
Contact yiuyuho

Post 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).
Top
Post Reply

Return to “Volume 101 (10100-10199)”