zoukankan      html  css  js  c++  java
  • CodeForces 732C Sanatorium

    C. Sanatorium
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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 bd 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
    1
    

    input
    1 0 0
    
    output
    0
    

    input
    1 1 1
    
    output
    0
    

    input
    1000000000000000000 0 1000000000000000000
    
    output
    999999999999999999
    
    #include <iostream>
    #include <stdlib.h>
    #include <algorithm>
    #include <stdio.h>
    #include <math.h>
    #include <stack>
    
    
    using namespace std;
    typedef long long int LL;
    LL  b,d,s;
    LL max(LL a,LL b)
    {
        if(a>=b)
            return a;
        return b;
    }
    int main()
    {
        LL ans=0;
        scanf("%lld%lld%lld",&b,&d,&s);
        if(max(b,max(d,s))==b)
        {
    		  ans=max(0,b-s-1)+max(0,b-d-1);
                                                                           
        }
        else if(max(b,max(d,s))==s)
        {
            ans=max(0,s-b-1)+max(0,s-d-1);
        }
        else
        {
            ans=max(0,d-b-1)+max(0,d-s-1);
        }
        printf("%lld
    ",ans);
        return 0;
    }


    
    

  • 相关阅读:
    [AHOI 2005]COMMON 约数研究
    [AHOI 2016初中组]迷宫
    [HNOI 2002]营业额统计
    [HAOI 2012]音量调节
    [HAOI 2010]软件安装
    [NOI 2015]荷马史诗
    浏览器同源政策
    docker 进程 转载:https://www.cnblogs.com/ilinuxer/p/6188303.html
    docker 进程 转载:
    redis 缓存问题,转载:https://www.cnblogs.com/liangsonghua/p/www_liangsonghua_me_22.html
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228574.html
Copyright © 2011-2022 走看看