Source code
#include <iostream>
#include<vector>
#include<string>
#include<math.h>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
/* ==================================================
| |
| Author: *** S. M. Sabiul Hajjaj Sabit *** |
| Last Edit: May,14,2019 |
================================================== */
///***global declaration***///
#define all(arr) arr.begin(),arr.end()
#define pb push_back
#define sz(x) x.size()
#define min3(a,b,c) min(min(a,b),c)
#define max3(a,b,c) max(max(a,b),c)
using namespace std;
int i,j,n,m,sum=0,ans=0;
template <typename T>long long int power(T a, T b)
{
long long int pow=1;
for(int i=0; i<b; i++)
{
pow *= a;
}
return pow;
}
///*********Write Code From Here*********///
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a+b>c && a+c>b && b+c>a)
{
cout<<0<<endl;
}
else
{
int _1st = min3(a,b,c);
int _3rd= max3(a,b,c);
int _2nd = (a+b+c) -(_1st+_3rd);
cout<<_3rd -(_1st +_2nd)+1<<endl;
}
}
Add your comment