Submission #2124113

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<ll, int> P;
#define MOD (1000000007ll)
#define l_ength size

ll sq(ll x){
	return x*x;
}

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

bool isvowel(char c){
	int i;
	string v="aeiou";
	for(i = (v.size()-1); i>=0; --i){
		if(c == v[i]){
			return true;
		}
	}
	return false;
}

int main(void){
	int a,b,w,x,y;
	cin >> w >> a >> b;
	x = a+w;
	y = b+w;
	if(x<b){
		cout << (b-x) << endl;
	}else if(y<a){
		cout << (a-y) << endl;
	}else{
		cout << 0 << endl;
	}
	return 0;
}

Submission Info

Judge Result