【乱搞】Sanatorium

最新推荐文章于 2019-08-09 15:02:42 发布

Uletay

最新推荐文章于 2019-08-09 15:02:42 发布

阅读量176

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/weixin_42146061/article/details/96622615

算法专栏收录该内容

65 篇文章

订阅专栏

本文介绍了一道关于计算度假期间错过的餐次数量的问题。通过分析个人在度假村的早餐、午餐和晚餐次数，推断出至少错过了多少顿饭。文章提供了一个C++程序来解决这个问题。

Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation!

Every day there was a breakfast, a dinner and a supper in a dining room of the sanatorium (of course, in this order). The only thing that Vasiliy has now is a card from the dining room contaning notes how many times he had a breakfast, a dinner and a supper (thus, the card contains three integers). Vasiliy could sometimes have missed some meal, for example, he could have had a breakfast and a supper, but a dinner, or, probably, at some days he haven't been at the dining room at all.

Vasiliy doesn't remember what was the time of the day when he arrived to sanatorium (before breakfast, before dinner, before supper or after supper), and the time when he left it (before breakfast, before dinner, before supper or after supper). So he considers any of these options. After Vasiliy arrived to the sanatorium, he was there all the time until he left. Please note, that it's possible that Vasiliy left the sanatorium on the same day he arrived.

According to the notes in the card, help Vasiliy determine the minimum number of meals in the dining room that he could have missed. We shouldn't count as missed meals on the arrival day before Vasiliy's arrival and meals on the departure day after he left.

Input

The only line contains three integers b, d and s (0≤b,d,s≤1018,b+d+s≥1)− the number of breakfasts, dinners and suppers which Vasiliy had during his vacation in the sanatorium.

Output

Print single integer− the minimum possible number of meals which Vasiliy could have missed during his vacation.

Examples

Input

3 2 1

Output

Input

1 0 0

Output

Input

1 1 1

Output

Input

1000000000000000000 0 1000000000000000000

Output

999999999999999999

Note

In the first sample, Vasiliy could have missed one supper, for example, in case he have arrived before breakfast, have been in the sanatorium for two days (including the day of arrival) and then have left after breakfast on the third day.

In the second sample, Vasiliy could have arrived before breakfast, have had it, and immediately have left the sanatorium, not missing any meal.

In the third sample, Vasiliy could have been in the sanatorium for one day, not missing any meal.

题解

这题的题意就是给三个数是一个人在一个度假的地方吃的早、中、晚餐数，根据这三个数推断她在度假期间，没有在这个地方吃饭的最少可能次数。

解法：最小次数=（三餐中最大的数-1）与比它小的数差的总和。（查到的）

#include<iostream>
using namespace std;
int main()
{
    long long int b,l,d,s=0;
    cin>>b>>l>>d;
    long long int m=max(b,max(l,d));
    m--;
    if(m>b)
        s+=m-b;
    if(m>l)
        s+=m-l;
    if(m>d)
        s+=m-d;
    cout<<s<<endl;
    return 0;
}