← 返回题目

题库练习 [COCI-2008_2009-contest1]#6 SKOCIMIS

← 上一题下一题 →

A1149 | $[COCI-2008_2009-contest1]#6 SKOCIMIS$

来源COCI

时间限制1s

内存限制128MB

通过 / 提交0/0

题目描述

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

输入 #2

3 5 9

输出 #2

C++ 编辑器

输入

输出