COCI 2008/2009, Contest #1
Three kangaroos are playing in the desert. They are playing on a number line, each occupying a different integer. In a single move, one of the outer kangaroos jumps into the space between the other two. At no point may two kangaroos occupy the same position.Help them play as long as possible.
InputThree integers A, B and C (0 < A < B < C < 100), the initial positions of the kangaroos.
OutputOutput the largest number of moves the kangaroos can make.
2 3 5
3 5 9
Point Value: 5
Time Limit: 1.00s
Memory Limit: 32M
Added: Oct 18, 2008
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3
However, I can't see anything wrong with your code except maybe you're going into an infinite loop. Try the smallest test cases, and then some bigger ones.
if so, can someone give me test cases?
the one on 1 cna jump any where between 3 and 5? or between 1 and 5??
if x<y<z then x can jump between z and y?
Does the question mean that these kangaroos cant jump away from one another? like can one of them go towards the end of the number line?