A. Make a triangle!

最新推荐文章于 2022-03-29 14:53:17 发布

chen_zan_yu_

最新推荐文章于 2022-03-29 14:53:17 发布

阅读量584

点赞数

分类专栏： CF

本文链接：https://blog.csdn.net/chen_zan_yu_/article/details/83099358

版权

CF 专栏收录该内容

99 篇文章 0 订阅

订阅专栏

A. Make a triangle!

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Masha has three sticks of length aa, bb and cc centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.

What is the minimum number of minutes she needs to spend increasing the stick's length in order to be able to assemble a triangle of positive area. Sticks should be used as triangle's sides (one stick for one side) and their endpoints should be located at triangle's vertices.

Input

The only line contains tree integers aa, bb and cc (1≤a,b,c≤1001≤a,b,c≤100) — the lengths of sticks Masha possesses.

Output

Print a single integer — the minimum number of minutes that Masha needs to spend in order to be able to make the triangle of positive area from her sticks.

Examples

input

Copy

3 4 5

output

Copy

input

Copy

2 5 3

output

Copy

input

Copy

100 10 10

output

Copy

Note

In the first example, Masha can make a triangle from the sticks without increasing the length of any of them.

In the second example, Masha can't make a triangle of positive area from the sticks she has at the beginning, but she can spend one minute to increase the length 22 centimeter stick by one and after that form a triangle with sides 33, 33 and 55 centimeters.

In the third example, Masha can take 3333 minutes to increase one of the 1010 centimeters sticks by 3333 centimeters, and after that take 4848minutes to increase another 1010 centimeters stick by 4848 centimeters. This way she can form a triangle with lengths 4343, 5858 and 100100centimeters in 8181 minutes. One can show that it is impossible to get a valid triangle faster.

要让这个三角形合法，只需满足三角形不等式

即a+b>ca+b>c，设c=max{a,b,c}c=max{a,b,c}，上式转化为c<a+bc<a+b

如果已经满足，不需消耗代价

否则消耗c−a−b+1c−a−b+1的代价

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<stdlib.h>
using namespace std;
int main()
{
    int a,b,c;
    cin>>a>>b>>c;
    int t=max(a,max(c,b));
    if(2*t<c+b+a)
        printf("0\n");
    else printf("%d\n",2*t-(c+a+b)+1);
    return 0;
}