Skocimis
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 [
] (0 < A < B < C < 100), the initial positions of the kangaroos. OutputOutput the largest number of moves the kangaroos can make.
Input
[c]2 3 5
Output
[c]2 3 5
Output
1Input
Output
3 5 9 Output
3Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.