CodeForces 732C Sanatorium
来源:互联网 发布:optical flow算法介绍 编辑:程序博客网 时间:2024/06/17 12:37
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.
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.
Print single integer — the minimum possible number of meals which Vasiliy could have missed during his vacation.
3 2 1
1
1 0 0
0
1 1 1
0
1000000000000000000 0 1000000000000000000
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\n",ans); return 0;}
- [codeforces 732C]Sanatorium
- codeforces 732C - Sanatorium
- Codeforces 732C-Sanatorium
- CodeForces 732C Sanatorium
- CodeForces 732C Sanatorium
- 【43.26%】【codeforces 732C】Sanatorium
- CodeForces 732C 之 Sanatorium
- codeforces 732C Sanatorium(数学题)
- 【codeforces 732C】 Sanatorium【乱搞题 数学题】
- CodeForces-732C-Sanatorium(模拟)
- CodeForces 732 C.Sanatorium(水~)
- 【codeforces 723C C. Sanatorium】
- 732C. Sanatorium
- Sanatorium Codeforces Round#377-C(逻辑)
- Codeforces Round #377 (Div. 2) C. Sanatorium
- Codeforces Round #377 (Div. 2) C Sanatorium
- C. Sanatorium
- Codeforces Round #377 (Div. 2) C. Sanatorium 分类讨论
- MySQL的DISTINCT
- 使用QEmu调试Linux内核 “No symbol table is loaded.”
- 圆圆照片
- mysql联合主键
- 20161031的考试】模拟,暴力取模+矩阵快速幂,搜索脸的dp
- CodeForces 732C Sanatorium
- Codeforces 733B Parade暴力
- SSM实现秒杀系统案例
- 我的笔记
- Android SDK上手指南:Activity与生命周期
- EditText支持多行同时支持imeOptions设置
- js如何调用ocx控件
- oracle数据库的字符集更改(测试机上玩玩即可)
- 获取开始及结束日期间隔月份或年份列表