[알고리즘] 백준 11034 - 캥거루 세마리 2 (C++)

[문제 링크] : https://www.acmicpc.net/problem/11034

#include <iostream>
using namespace std;

int A, B, C;

int main(){
    while(cin >> A >> B >> C){
        cout << max(B - A, C - B) - 1 << '\n';
    }
    return 0;
}