A1369.[COCI-2008_2009-contest1]#6 SKOCIMIS
省选/NOI-
COCI
通过率:0%
时间限制:1.00s
内存限制:128MB
题目描述
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.
输入格式
Three integers A, B and C (0 < A < B < C < 100), the initial positions of the kangaroos.
输出格式
Output the largest number of moves the kangaroos can make.
输入输出样例
输入#1
2 3 5
输出#1
1
输入#2
3 5 9
输出#2
3