三只袋鼠正在沙漠中玩耍。它们在一条数轴上，每只袋鼠都占据一个不同的整数位置。在单次移动中，位于外侧的一只袋鼠会跳到另外两只袋鼠之间的空位中。在任何时候，两只袋鼠都不能占据相同的位置。
请帮助它们玩尽可能长的时间（即最大化移动次数）。
输入格式
输入三个整数 $A$，$B$ 和 $C$（$0 < A < B < C < 100$），表示袋鼠的初始位置。
输出格式
输出袋鼠最多可以进行的移动次数。
样例
输入样例 1
2 3 5
输出样例 1
1
输入样例 2
3 5 9
输出样例 2
3
QOJ.ac
QOJ
Time Limit: 1.0 s
Memory Limit: 32 MB
Total points: 30
#17060. SKOCIMIS
Statistics
The problem was used in the following contests:
AI Translation —
This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.
Discussions
About Discussions
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
Open Discussions 0
No discussions in this category.
Issues
About Issues
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines:
- This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
- Do not submit duplicated issues.
- Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.