problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define to_s to_string
#define len(v) (ll) v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define drop(x) cout << (x) << '\n', exit(0)
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef vector<vector<vector<ll>>> vec3;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll MOD = 1e9 + 7;
ll devc(ll x, ll y) { return 1 + (x - 1) / y; }
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
ll A, B, C;
cin >> A >> B >> C;
drop(C - (A - B));
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define to_s to_string
#define len(v) (ll) v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define drop(x) cout << (x) << '\n', exit(0)
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef vector<vector<vector<ll>>> vec3;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll MOD = 1e9 + 7;
ll devc(ll x, ll y) { return 1 + (x - 1) / y; }
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
ll A, B, C;
cin >> A >> B >> C;
drop(max(C - (A - B), 0LL));
return 0;
} | [
"call.arguments.add"
] | 751,763 | 751,764 | u281168735 | cpp |
p02951 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - a + b << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - a + b) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 751,769 | 751,770 | u135957438 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A >= B + C) {
cout << "0" << endl;
} else {
cout << C - B + A << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A >= B + C) {
cout << "0" << endl;
} else {
cout << C - A + B << endl;
}
}
| [
"expression.operation.binary.remove"
] | 751,771 | 751,772 | u776280752 | cpp |
p02951 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 751,777 | 751,778 | u261538386 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for ((i) = 0; (i) < (int)(n); (i)++)
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b < c) {
cout << c - (a - b) << endl;
} else if (a - b > c) {
cout << 0 << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for ((i) = 0; (i) < (int)(n); (i)++)
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b < c) {
cout << c - (a - b) << endl;
} else if (a - b >= c) {
cout << 0 << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 751,779 | 751,780 | u276969395 | cpp |
p02951 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
// ----GCC ONLY---- //
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// ---- ---- //
#define ll long long
#define MOD 10000007
#define PB push_back
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
if (ans > 0) {
cout << ans << endl;
} else if (ans < 0) {
cout << 0 << endl;
}
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
// ----GCC ONLY---- //
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// ---- ---- //
#define ll long long
#define MOD 10000007
#define PB push_back
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
if (ans > 0) {
cout << ans << endl;
} else if (ans <= 0) {
cout << 0 << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 751,788 | 751,789 | u813728438 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - b + a) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c + b - a) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 751,796 | 751,797 | u176218583 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = c - (a - b);
if (d > 0) {
cout << d;
}
if (d < 0) {
cout << "0";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = c - (a - b);
if (d > 0) {
cout << d;
}
if (d <= 0) {
cout << "0";
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 751,798 | 751,799 | u173252932 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define strall(v) (v).cbegin(), (v).cend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u> void chmin(t &a, u b) {
if (b < a)
a = b;
}
// const long long INF = 1LL << 60;
int INF = 500000;
int MAX = 2050;
ll mod = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
cout << ((c < 0) ? 0 : ans) << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define strall(v) (v).cbegin(), (v).cend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u> void chmin(t &a, u b) {
if (b < a)
a = b;
}
// const long long INF = 1LL << 60;
int INF = 500000;
int MAX = 2050;
ll mod = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
cout << ((ans < 0) ? 0 : ans) << endl;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 751,804 | 751,805 | u106635407 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> U COUNT(const T &a, const U &v) {
return count(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
//---------------------------------------------------------------------------------------------------
template <int MOD> struct ModInt {
static const int Mod = MOD;
unsigned x;
ModInt() : x(0) {}
ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
int get() const { return (int)x; }
ModInt &operator+=(ModInt that) {
if ((x += that.x) >= MOD)
x -= MOD;
return *this;
}
ModInt &operator-=(ModInt that) {
if ((x += MOD - that.x) >= MOD)
x -= MOD;
return *this;
}
ModInt &operator*=(ModInt that) {
x = (unsigned long long)x * that.x % MOD;
return *this;
}
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
ModInt inverse() const {
long long a = x, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return ModInt(u);
}
bool operator==(ModInt that) const { return x == that.x; }
bool operator!=(ModInt that) const { return x != that.x; }
ModInt operator-() const {
ModInt t;
t.x = x == 0 ? 0 : Mod - x;
return t;
}
};
template <int MOD> ostream &operator<<(ostream &st, const ModInt<MOD> a) {
st << a.get();
return st;
};
template <int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
ModInt<MOD> r = 1;
while (k) {
if (k & 1)
r *= a;
a *= a;
k >>= 1;
}
return r;
}
template <typename T, int FAC_MAX> struct Comb {
vector<T> fac, ifac;
Comb() {
fac.resize(FAC_MAX, 1);
ifac.resize(FAC_MAX, 1);
FOR(i, 1, FAC_MAX - 1) fac[i] = fac[i - 1] * i;
ifac[FAC_MAX - 1] = T(1) / fac[FAC_MAX - 1];
for (int i = FAC_MAX - 2; i >= 1; i--)
ifac[i] = ifac[i + 1] * T(i + 1);
}
T aPb(int a, int b) {
if (b < 0 || a < b)
return T(0);
return fac[a] * ifac[a - b];
}
T aCb(int a, int b) {
if (b < 0 || a < b)
return T(0);
return fac[a] * ifac[a - b] * ifac[b];
}
T nHk(int n, int k) {
if (n == 0 && k == 0)
return T(1);
if (n <= 0 || k < 0)
return 0;
return aCb(n + k - 1, k);
} // nHk = (n+k-1)Ck : n is separator
T pairCombination(int n) {
if (n % 2 == 1)
return T(0);
return fac[n] * ifac[n / 2] / (T(2) ^ (n / 2));
}
// combination of paris for n
};
typedef ModInt<1000000007> mint;
long long int mod_pow(long long int x, long long int n, long long int mod) {
long long int res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
#define Sort(a) sort(a.begin(), a.end())
vector<int> enum_div(int n) {
vector<int> ret;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
int digsum(int n) {
int res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
int main(void) {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
cout << b + c - a << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> U COUNT(const T &a, const U &v) {
return count(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
//---------------------------------------------------------------------------------------------------
template <int MOD> struct ModInt {
static const int Mod = MOD;
unsigned x;
ModInt() : x(0) {}
ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
int get() const { return (int)x; }
ModInt &operator+=(ModInt that) {
if ((x += that.x) >= MOD)
x -= MOD;
return *this;
}
ModInt &operator-=(ModInt that) {
if ((x += MOD - that.x) >= MOD)
x -= MOD;
return *this;
}
ModInt &operator*=(ModInt that) {
x = (unsigned long long)x * that.x % MOD;
return *this;
}
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
ModInt inverse() const {
long long a = x, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return ModInt(u);
}
bool operator==(ModInt that) const { return x == that.x; }
bool operator!=(ModInt that) const { return x != that.x; }
ModInt operator-() const {
ModInt t;
t.x = x == 0 ? 0 : Mod - x;
return t;
}
};
template <int MOD> ostream &operator<<(ostream &st, const ModInt<MOD> a) {
st << a.get();
return st;
};
template <int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
ModInt<MOD> r = 1;
while (k) {
if (k & 1)
r *= a;
a *= a;
k >>= 1;
}
return r;
}
template <typename T, int FAC_MAX> struct Comb {
vector<T> fac, ifac;
Comb() {
fac.resize(FAC_MAX, 1);
ifac.resize(FAC_MAX, 1);
FOR(i, 1, FAC_MAX - 1) fac[i] = fac[i - 1] * i;
ifac[FAC_MAX - 1] = T(1) / fac[FAC_MAX - 1];
for (int i = FAC_MAX - 2; i >= 1; i--)
ifac[i] = ifac[i + 1] * T(i + 1);
}
T aPb(int a, int b) {
if (b < 0 || a < b)
return T(0);
return fac[a] * ifac[a - b];
}
T aCb(int a, int b) {
if (b < 0 || a < b)
return T(0);
return fac[a] * ifac[a - b] * ifac[b];
}
T nHk(int n, int k) {
if (n == 0 && k == 0)
return T(1);
if (n <= 0 || k < 0)
return 0;
return aCb(n + k - 1, k);
} // nHk = (n+k-1)Ck : n is separator
T pairCombination(int n) {
if (n % 2 == 1)
return T(0);
return fac[n] * ifac[n / 2] / (T(2) ^ (n / 2));
}
// combination of paris for n
};
typedef ModInt<1000000007> mint;
long long int mod_pow(long long int x, long long int n, long long int mod) {
long long int res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
#define Sort(a) sort(a.begin(), a.end())
vector<int> enum_div(int n) {
vector<int> ret;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
int digsum(int n) {
int res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
int main(void) {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
cout << max(b + c - a, 0) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 751,806 | 751,807 | u852862907 | cpp |
p02951 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + c < b) {
cout << 0;
} else {
cout << a + c - b;
}
cout << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c < a) {
cout << 0;
} else {
cout << b + c - a;
}
cout << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 751,810 | 751,811 | u992779443 | cpp |
p02951 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
cout << max(ans, 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 751,829 | 751,830 | u729285002 | cpp |
p02951 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << B + C - A << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(B + C - A, 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 751,839 | 751,840 | u906839513 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = c - a - b;
if (x > 0)
cout << x;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = c - a + b;
if (x > 0)
cout << x;
else
cout << 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 751,847 | 751,848 | u411916435 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vvd = vector<vd>;
#define out(a) cout << a << endl
#define out1(a) cout << a
#define in(a) cin >> a
#define in2(a, b) cin >> a >> b
#define in3(a, b, c) cin >> a >> b >> c
#define rep(i, N) for (ll i = 0; i < (ll)N; i++)
#define rep1(i, N) for (ll i = 1; i <= (ll)N; i++)
#define repi(i, j, N) for (ll j = (ll)i + 1; j < (ll)N; j++)
#define all(v) v.begin(), v.end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
constexpr int inf = 1e9;
constexpr ll linf = 1e18;
constexpr ll mod = 1e9 + 7;
void solve();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
void solve() {
int a, b, c;
in3(a, b, c);
int ans = min(b + c - a, 0);
out(ans);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vvd = vector<vd>;
#define out(a) cout << a << endl
#define out1(a) cout << a
#define in(a) cin >> a
#define in2(a, b) cin >> a >> b
#define in3(a, b, c) cin >> a >> b >> c
#define rep(i, N) for (ll i = 0; i < (ll)N; i++)
#define rep1(i, N) for (ll i = 1; i <= (ll)N; i++)
#define repi(i, j, N) for (ll j = (ll)i + 1; j < (ll)N; j++)
#define all(v) v.begin(), v.end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
constexpr int inf = 1e9;
constexpr ll linf = 1e18;
constexpr ll mod = 1e9 + 7;
void solve();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
void solve() {
int a, b, c;
in3(a, b, c);
int ans = max(b + c - a, 0);
out(ans);
} | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 751,851 | 751,852 | u789673251 | cpp |
p02951 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort(ALL(x))
#define CLR(a) memset((a), 0, sizeof(a))
#define PB push_back
#define MP make_pair
#define SP << " " <<
const int INF = 1001001001;
const ll LINF = 100100100100100100;
const double EPS = 1e-10;
const double PI = acos(-1.0);
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
void solve() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort(ALL(x))
#define CLR(a) memset((a), 0, sizeof(a))
#define PB push_back
#define MP make_pair
#define SP << " " <<
const int INF = 1001001001;
const ll LINF = 100100100100100100;
const double EPS = 1e-10;
const double PI = acos(-1.0);
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
void solve() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << endl;
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 751,855 | 751,856 | u050698451 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<long, long>
#define INF 1000000000000000000
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long MOD = 1000000007;
using namespace std;
typedef long long ll;
map<int, int> mp;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
class Union_Find {
private:
vector<int> par;
vector<int> rank;
public:
Union_Find(int n) {
rep(i, n) {
par.push_back(i);
rank.push_back(0);
}
}
int find(int x) {
if (par.at(x) == x)
return x;
else
return par.at(x) = find(par.at(x));
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank.at(x) < rank.at(y)) {
par.at(x) = y;
} else {
par.at(y) = x;
if (rank.at(x) == rank.at(y))
rank.at(x)++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
};
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (b + c >= a)
cout << 0 << endl;
else
cout << b + c - a << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<long, long>
#define INF 1000000000000000000
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long MOD = 1000000007;
using namespace std;
typedef long long ll;
map<int, int> mp;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
class Union_Find {
private:
vector<int> par;
vector<int> rank;
public:
Union_Find(int n) {
rep(i, n) {
par.push_back(i);
rank.push_back(0);
}
}
int find(int x) {
if (par.at(x) == x)
return x;
else
return par.at(x) = find(par.at(x));
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank.at(x) < rank.at(y)) {
par.at(x) = y;
} else {
par.at(y) = x;
if (rank.at(x) == rank.at(y))
rank.at(x)++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
};
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (b + c <= a)
cout << 0 << endl;
else
cout << b + c - a << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 751,859 | 751,860 | u809967037 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 751,861 | 751,862 | u459105164 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 751,863 | 751,864 | u989306199 | cpp |
p02951 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
int D = A - B;
if (D > C) {
cout << C << endl;
} else {
cout << D << endl;
}
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
int D = A - B;
if (D > C) {
cout << 0 << endl;
} else {
cout << C - D << endl;
}
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 751,870 | 751,871 | u605901675 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll a, b, c;
in3(a, b, c);
out(c - (a - b));
memi;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll a, b, c;
in3(a, b, c);
out(max(0ll, c - (a - b)));
memi;
} | [
"call.add",
"call.arguments.change"
] | 751,872 | 751,873 | u917049698 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = C - (B - A);
if (ans < 0) {
cout << 0 << endl;
} else {
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = C - (A - B);
if (ans < 0) {
cout << 0 << endl;
} else {
cout << ans << endl;
}
} | [
"expression.operation.binary.remove"
] | 751,886 | 751,887 | u050641473 | cpp |
p02951 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(0, c - (a - b)) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 751,890 | 751,891 | u611571299 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(a, b + c) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << b + c - min(a, b + c) << endl;
}
| [
"io.output.change"
] | 751,892 | 751,893 | u559578080 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, a - (b + c));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, (b + c) - a);
return 0;
} | [
"expression.operation.binary.remove"
] | 751,898 | 751,899 | u248554859 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b > c)
cout << 0;
else
cout << a - b - c;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b > c)
cout << 0;
else
cout << c - (a - b);
} | [
"io.output.change"
] | 751,904 | 751,905 | u873762144 | cpp |
p02951 | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define ALL(a) (a).begin(), (a).end()
#define sort_v(a) sort(a.begin(), a.end())
#define fi first
#define se second
void print(bool c) {
if (c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void Print(bool c) {
if (c)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
ll gcdll(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (b == 0)
break;
a %= b;
}
return a;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
bool cmp(const pii &a, const pii &b) {
if (a.second != b.second)
return a.second < b.second;
return a.first < b.first;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
}
| #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define ALL(a) (a).begin(), (a).end()
#define sort_v(a) sort(a.begin(), a.end())
#define fi first
#define se second
void print(bool c) {
if (c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void Print(bool c) {
if (c)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
ll gcdll(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (b == 0)
break;
a %= b;
}
return a;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
bool cmp(const pii &a, const pii &b) {
if (a.second != b.second)
return a.second < b.second;
return a.first < b.first;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 751,906 | 751,907 | u705296057 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
}
| [
"call.arguments.change"
] | 751,908 | 751,909 | u718758485 | cpp |
p02951 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// int t=1 ; cin>>t ; while(t--)
{
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << '\n';
}
cerr << "Time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// int t=1 ; cin>>t ; while(t--)
{
int a, b, c;
cin >> a >> b >> c;
cout << max(0LL, c - (a - b)) << '\n';
}
cerr << "Time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 751,917 | 751,918 | u514096386 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - (a - b) > 0) {
cout << c - (a - b) << endl;
} else
;
cout << 0 << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - (a - b) > 0) {
cout << c - (a - b) << endl;
} else {
cout << 0 << endl;
}
} | [] | 751,925 | 751,926 | u480172743 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int temp = a - b;
int ret = c - temp;
if (ret < 0)
cout << "0";
cout << ret << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int temp = a - b;
int ret = c - temp;
if (ret < 0)
cout << "0";
else
cout << ret << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 751,934 | 751,935 | u655908411 | cpp |
p02951 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c <= a + b) {
cout << 0 << endl;
} else {
cout << c - (a - b) << endl;
}
} | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c <= a - b) {
cout << 0 << endl;
} else {
cout << c - (a - b) << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 751,940 | 751,941 | u956853629 | cpp |
p02951 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 751,944 | 751,945 | u715366261 | cpp |
p02951 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define int long long
#define all(a) (a).begin(), (a).end()
#define EPS (1e-13)
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i, j, k) mkp(i, mkp(j, k))
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define mkp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define crdcomp(b) \
sort(all((b))); \
(b).erase(unique(all((b))), (b).end())
#define ssp(i, n) (i == n - 1 ? "\n" : " ")
const int mod = 1e9 + 7;
const int Mod = 998244353;
const ll Inf = 3 * 1e18;
const int inf = 15 * 1e8;
ll read() {
ll u, k = scanf("%lld", &u);
return u;
}
ll gcd(ll i, ll j) {
if (i > j)
swap(i, j);
if (i == 0)
return j;
return gcd(j % i, i);
}
ll mod_pow(ll x, ll n, ll p) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
}
ll bitcount(ll x) {
int sum = 0;
for (int i = 0; i < 20; i++)
if ((1ll << i) & x)
sum++;
return sum;
}
/*const int fn_ = 2000000;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll Mod = mod) {
if (!fact_[0]) {
fact_[0] = 1; comp_[0] = 1;
for (int i = 1; i < fn_; i++) {
fact_[i] = fact_[i - 1] * i % Mod;
comp_[i] = mod_pow(fact_[i], Mod - 2, Mod);
}
}
if (x < y) return 0;
return fact_[x] * comp_[x - y] % Mod * comp_[y] % Mod;
}*/
//---------------------------------------------------
signed main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a, b + c) << endl;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define int long long
#define all(a) (a).begin(), (a).end()
#define EPS (1e-13)
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i, j, k) mkp(i, mkp(j, k))
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define mkp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define crdcomp(b) \
sort(all((b))); \
(b).erase(unique(all((b))), (b).end())
#define ssp(i, n) (i == n - 1 ? "\n" : " ")
const int mod = 1e9 + 7;
const int Mod = 998244353;
const ll Inf = 3 * 1e18;
const int inf = 15 * 1e8;
ll read() {
ll u, k = scanf("%lld", &u);
return u;
}
ll gcd(ll i, ll j) {
if (i > j)
swap(i, j);
if (i == 0)
return j;
return gcd(j % i, i);
}
ll mod_pow(ll x, ll n, ll p) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
}
ll bitcount(ll x) {
int sum = 0;
for (int i = 0; i < 20; i++)
if ((1ll << i) & x)
sum++;
return sum;
}
/*const int fn_ = 2000000;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll Mod = mod) {
if (!fact_[0]) {
fact_[0] = 1; comp_[0] = 1;
for (int i = 1; i < fn_; i++) {
fact_[i] = fact_[i - 1] * i % Mod;
comp_[i] = mod_pow(fact_[i], Mod - 2, Mod);
}
}
if (x < y) return 0;
return fact_[x] * comp_[x - y] % Mod * comp_[y] % Mod;
}*/
//---------------------------------------------------
signed main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - min(a, b + c) + b << endl;
} | [
"expression.operation.binary.add"
] | 751,948 | 751,949 | u811004127 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 751,950 | 751,951 | u113298224 | cpp |
p02951 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
int A, B, C;
R(A, B, C);
W(min(C, A - B));
return 0;
}
| /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
int A, B, C;
R(A, B, C);
W(max(C - (A - B), 0));
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 751,955 | 751,956 | u284124505 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define PB push_back
#define loop(i, x, y) for (int i = x; i < y; i++)
#define rloop(i, x, y) for (int i = x; i > y; i--)
#define NL cout << "\n"
#define ans(x) cout << x << "\n"
#define out(x) cout << x << " "
#define F first
#define S second
#define ansf(x, y) cout << fixed << setprecision(y) << x << endl;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
void solve() {
int a, b, c;
cin >> a >> b, c;
ans(max((int)0, c - (a - b)));
}
signed main() {
// FAST;
int T = 1;
// cin>>T;
while (T--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define PB push_back
#define loop(i, x, y) for (int i = x; i < y; i++)
#define rloop(i, x, y) for (int i = x; i > y; i--)
#define NL cout << "\n"
#define ans(x) cout << x << "\n"
#define out(x) cout << x << " "
#define F first
#define S second
#define ansf(x, y) cout << fixed << setprecision(y) << x << endl;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
void solve() {
int a, b, c;
cin >> a >> b >> c;
ans(max((int)0, c - (a - b)));
}
signed main() {
// FAST;
int T = 1;
// cin>>T;
while (T--)
solve();
return 0;
} | [] | 751,959 | 751,960 | u684763756 | cpp |
p02951 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
}
| [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 751,961 | 751,962 | u894339989 | cpp |
p02951 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - min((A - B), C) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 751,963 | 751,964 | u251410638 | cpp |
p02951 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 751,963 | 751,965 | u251410638 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b >= c) {
cout << c << endl;
return 0;
} else {
cout << c - a + b << endl;
return 0;
}
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b >= c) {
cout << 0 << endl;
return 0;
} else {
cout << c - a + b << endl;
return 0;
}
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 751,983 | 751,984 | u648009244 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a - b;
c = c - d;
if (c - d < 0) {
c = 0;
}
cout << c;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a - b;
d = c - d;
if (d < 0) {
d = 0;
}
cout << d;
return (0);
} | [
"assignment.variable.change",
"identifier.change",
"expression.operation.binary.remove",
"io.output.change"
] | 751,990 | 751,991 | u130985356 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a - b + c;
if (d > 0)
cout << d;
else
cout << 0;
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = -a + b + c;
if (d > 0)
cout << d;
else
cout << 0;
cout << endl;
return 0;
} | [
"assignment.change"
] | 751,996 | 751,997 | u340494803 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(12);
int a, b, c;
cin >> a >> b >> c;
int ans = min(c, a - b);
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(12);
int a, b, c;
cin >> a >> b >> c;
int ans = c - min(c, a - b);
cout << ans;
return 0;
}
| [
"assignment.change"
] | 751,998 | 751,999 | u774417629 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, w, h) rep(j, h) rep(i, w)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define VEC(type, name, n) \
std::vector<type> a(n); \
rep(i, n) std::cin >> a[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sum accumulate
#define keta fixed << setprecision
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<int>(n, a)));
typedef long long ll;
const int INF = 2000000000;
const long INF64 = 1000000000000000ll;
const ll MOD = 1000000007LL;
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a + b >= c) {
std::cout << c + b - a << std::endl;
} else {
std::cout << 0 << std::endl;
}
} | #include <bits/stdc++.h>
using namespace std;
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, w, h) rep(j, h) rep(i, w)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define VEC(type, name, n) \
std::vector<type> a(n); \
rep(i, n) std::cin >> a[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sum accumulate
#define keta fixed << setprecision
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<int>(n, a)));
typedef long long ll;
const int INF = 2000000000;
const long INF64 = 1000000000000000ll;
const ll MOD = 1000000007LL;
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a - b <= c) {
std::cout << c + b - a << std::endl;
} else {
std::cout << 0 << std::endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 752,007 | 752,008 | u539011156 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 752,017 | 752,018 | u204973596 | cpp |
p02951 | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int r = a - b;
cout << c - r;
return 0;
}
| #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int r = a - b;
cout << max(0, c - r);
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,019 | 752,020 | u616461826 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, a, b) for (int i = a; i < b; ++i)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
//プロトタイプ宣言
int gcd(int, int);
void often(void);
int main() {
often();
int a, b, c;
cin >> a >> b >> c;
cout << ((c < (a - b)) ? c - (a - b) : 0) << endl;
}
//以下、ライブラリ
int gcd(auto a, auto b) { return b ? gcd(b, a % b) : a; } //ユークリッドの互除法
void often(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, a, b) for (int i = a; i < b; ++i)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
//プロトタイプ宣言
int gcd(int, int);
void often(void);
int main() {
often();
int a, b, c;
cin >> a >> b >> c;
cout << ((c > (a - b)) ? c - (a - b) : 0) << endl;
}
//以下、ライブラリ
int gcd(auto a, auto b) { return b ? gcd(b, a % b) : a; } //ユークリッドの互除法
void often(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 752,021 | 752,022 | u060965067 | cpp |
p02951 | #include <bits/stdc++.h>
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define pii pair<int, int>
#define REP(i, a) for (int(i) = 0; (i) < (a); (i)++)
#define RREP(i, a) for (int(i) = a - 1; (i) >= (0); (i)--)
#define REP2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define m0(x) memset(x, 0, sizeof(x))
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B);
return 0;
} | #include <bits/stdc++.h>
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define pii pair<int, int>
#define REP(i, a) for (int(i) = 0; (i) < (a); (i)++)
#define RREP(i, a) for (int(i) = a - 1; (i) >= (0); (i)--)
#define REP2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define m0(x) memset(x, 0, sizeof(x))
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int A, B, C;
cin >> A >> B >> C;
cout << max(0, C - (A - B));
return 0;
} | [
"call.add",
"call.arguments.change"
] | 752,023 | 752,024 | u997020010 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(), greater<int>())
#define INF 1000000007
typedef long long ll;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; };
int lcm(int a, int b) { return a * b / gcd(a, b); };
int month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > a - b)
cout << c - a << endl;
else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(), greater<int>())
#define INF 1000000007
typedef long long ll;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; };
int lcm(int a, int b) { return a * b / gcd(a, b); };
int month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > a - b)
cout << c - (a - b) << endl;
else
cout << 0 << endl;
return 0;
}
| [] | 752,028 | 752,029 | u681869152 | cpp |
p02951 | #include <bits/stdc++.h>
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define rep(i, n) for (long long int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (long long int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (long long int i = (a); i > (b); i--)
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
}
| #include <bits/stdc++.h>
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define rep(i, n) for (long long int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (long long int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (long long int i = (a); i > (b); i--)
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 752,033 | 752,034 | u979078704 | cpp |
p02951 | /*
Author: Arham_doshi
@quote "Code like there's no tommorow!"
*************************************** UNAUTHORISED COPYING OF CODE
PROHIBITED **********************************
*/
#include <bits/stdc++.h>
#define int long long
#define double long double
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define piii pair<int, pair<int, int>>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define x first
#define y second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 998244353
#define PI 3.141592653589
#define bs(v, n) binary_search(all((v)), (n))
#define lb(v, n) lower_bound(all((v)), (n))
#define ub(v, n) upper_bound(all((v)), (n))
#define fo(i, l, u) for (i = l; i < u; i++)
#define rfo(i, l, u) for (i = l; i >= u; i--)
#define allfo(s) for (auto it = (s).begin(); it != (s).end(); it++)
#define _init(b) memset(b, -1, sizeof(b))
#define _init0(b) memset(b, 0, sizeof(b))
#define MOD 1000000007
#define ef else if
using namespace std;
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
bool mod(double a, double b) { return a / b - floor(a / b); }
int occurs(vi v, int n) {
auto it = lb(v, n);
auto it1 = ub(v, n);
int x = it1 - it;
return x;
}
int logb(int base, int x) { return (log(x) / log(base)); }
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int i, j, x, a, b, c;
cin >> a >> b >> c;
if ((b - a) > c)
cout << 0;
else
cout << c + (b - a);
return 0;
} | /*
Author: Arham_doshi
@quote "Code like there's no tommorow!"
*************************************** UNAUTHORISED COPYING OF CODE
PROHIBITED **********************************
*/
#include <bits/stdc++.h>
#define int long long
#define double long double
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define piii pair<int, pair<int, int>>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define x first
#define y second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 998244353
#define PI 3.141592653589
#define bs(v, n) binary_search(all((v)), (n))
#define lb(v, n) lower_bound(all((v)), (n))
#define ub(v, n) upper_bound(all((v)), (n))
#define fo(i, l, u) for (i = l; i < u; i++)
#define rfo(i, l, u) for (i = l; i >= u; i--)
#define allfo(s) for (auto it = (s).begin(); it != (s).end(); it++)
#define _init(b) memset(b, -1, sizeof(b))
#define _init0(b) memset(b, 0, sizeof(b))
#define MOD 1000000007
#define ef else if
using namespace std;
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
bool mod(double a, double b) { return a / b - floor(a / b); }
int occurs(vi v, int n) {
auto it = lb(v, n);
auto it1 = ub(v, n);
int x = it1 - it;
return x;
}
int logb(int base, int x) { return (log(x) / log(base)); }
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int i, j, x, a, b, c;
cin >> a >> b >> c;
if ((a - b) > c)
cout << 0;
else
cout << c + (b - a);
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 752,039 | 752,040 | u488763956 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > (a - b))
cout << c - (a - b);
if (c < (a - b))
cout << 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > (a - b))
cout << c - (a - b);
if (c <= (a - b))
cout << 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,041 | 752,042 | u365178348 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<char> vc;
typedef set<int> si;
typedef set<string> ss;
typedef queue<int> qi;
typedef queue<long long> qll;
typedef queue<string> qs;
typedef queue<char> qc;
typedef struct board board;
typedef pair<int, int> pi;
typedef pair<long long, long long> pll;
typedef pair<int, pair<int, int>> pii;
#define eb emplace_back
#define ppb pop_back
#define clr(a) a.clear()
#define F first
#define S second
#define mkp make_pair
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define left(x) x * 2
#define right(x) x * 2 + 1
#define meme(a, b, c) fill(a + 1, a + 1 + b, c)
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a > b ? b : a)
#define abs(a) (a > 0 ? a : -(a))
#define move(s) s += "#"
#define fr(i, a, b) for (ll i = a; i <= b; ++i)
#define rf(i, a, b) for (ll i = a; i >= b; --i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__);
void to_pray() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr << "Ready\n";
}
const int N = 4e6 + 10;
const int NN = 1e3 + 10;
const int NNN = 2e3 + 9;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll LLINF = 1e12 + 7;
const ll P = 53;
const int EPS = 1e-9 - 8;
const int vN = 2e4 + 10;
const int sz = (1 << 22) - 1;
const double PI = acos(-1);
int main() {
to_pray();
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b);
cout << '\n';
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<char> vc;
typedef set<int> si;
typedef set<string> ss;
typedef queue<int> qi;
typedef queue<long long> qll;
typedef queue<string> qs;
typedef queue<char> qc;
typedef struct board board;
typedef pair<int, int> pi;
typedef pair<long long, long long> pll;
typedef pair<int, pair<int, int>> pii;
#define eb emplace_back
#define ppb pop_back
#define clr(a) a.clear()
#define F first
#define S second
#define mkp make_pair
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define left(x) x * 2
#define right(x) x * 2 + 1
#define meme(a, b, c) fill(a + 1, a + 1 + b, c)
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a > b ? b : a)
#define abs(a) (a > 0 ? a : -(a))
#define move(s) s += "#"
#define fr(i, a, b) for (ll i = a; i <= b; ++i)
#define rf(i, a, b) for (ll i = a; i >= b; --i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__);
void to_pray() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr << "Ready\n";
}
const int N = 4e6 + 10;
const int NN = 1e3 + 10;
const int NNN = 2e3 + 9;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll LLINF = 1e12 + 7;
const ll P = 53;
const int EPS = 1e-9 - 8;
const int vN = 2e4 + 10;
const int sz = (1 << 22) - 1;
const double PI = acos(-1);
int main() {
to_pray();
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b));
cout << '\n';
return 0;
} | [
"call.add",
"call.arguments.change"
] | 752,046 | 752,047 | u371702445 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = c - (a - b);
if (d < 0)
d == 0;
cout << d;
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = c - (a - b);
if (d < 0)
d = 0;
cout << d;
cout << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 752,051 | 752,052 | u195132800 | cpp |
p02951 | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A - B - C) > 0)
cout << abs(A - B - C) << endl;
else
cout << "0" << endl;
return 0;
}
| #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A - B - C) < 0)
cout << abs(A - B - C) << endl;
else
cout << "0" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,057 | 752,058 | u163149221 | cpp |
p02951 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifndef orewabaka
#define f first
#define s second
#define minna(a) a.begin(), a.end()
#define ovse(a) a.rbegin(), a.rend()
#define pb push_back
#define endl aut '\n'
#define ar vector
#define var auto
#define rand() (((rand() << 15) + rand()) & INT32_MAX)
#define ain cin,
#define aut cout,
#define $(a) (i64) a.size()
#define in insert
#define fusrodah return
#define mp make_pair
#define rep(i, n) for (i64 i = 0; i < (n); i++)
#define rep1(i, n) for (i64 i = 1; i < (n); i++)
#define fro2(i, a, b) for (i64 i = (a); i < (b); i++)
#define elif else if
typedef int i32;
typedef unsigned u32;
typedef long long i64;
typedef unsigned long long u64;
typedef pair<i32, i32> p32;
typedef pair<i64, i64> p64;
typedef double lf;
typedef long double ld;
typedef tree<p64, null_type, less<p64>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
namespace shyutsuryoku {
const i32 STRSZ = 3e6 + 13;
char inbufer[STRSZ];
inline void cscan(string &i) {
i32 c = getc(stdin), cnt = 0;
while (c <= 32)
c = getc(stdin);
while (c > 32)
*(inbufer + cnt) = c, c = getc(stdin), ++cnt;
*(cnt + inbufer) = 0;
i = inbufer;
}
inline void cprint(string &i) {
char *s = new char[i.size() + 1];
strcpy(s, i.c_str());
while (*s)
putchar(*s), s++;
}
inline void cprint(const char *&i) {
i32 cnt = 0;
while (*(i + cnt))
putc(*(i + cnt), stdout), cnt++;
}
inline void cscan(i32 &i) {
i = 0;
i32 c = getc(stdin), b = 0;
while (c <= 32)
c = getc(stdin);
if (c == '-')
b = 1, c = getc(stdin);
while (c >= '0' && c <= '9')
i *= 10, i += c - '0', c = getc(stdin);
if (b)
i = -i;
}
inline void cprint(i32 i) {
if (i < 0)
putc('-', stdout), i = -i;
i32 sz = 0;
char ans[13];
while (i || !sz)
ans[sz++] = i % 10 + '0', i /= 10;
while (sz--)
putc(ans[sz], stdout);
}
inline void cscan(i64 &i) {
i = 0;
i32 c = getc(stdin), b = 1;
while (c <= 32)
c = getc(stdin);
if (c == '-')
b = -1, c = getc(stdin);
while (c >= '0' && c <= '9')
i *= 10, i += c - '0', c = getc(stdin);
i *= b;
}
inline void cprint(i64 i) {
if (i < 0)
putc('-', stdout), i = -i;
i32 sz = 0;
char ans[21];
while (i || !sz)
ans[sz++] = i % 10 + '0', i /= 10;
while (sz--)
putc(ans[sz], stdout);
}
inline void cscan(u32 &i) {
i = 0;
i32 c = getc(stdin);
while (c <= 32)
c = getc(stdin);
while (c >= '0' && c <= '9')
i *= 10, i += c - '0', c = getc(stdin);
}
inline void cprint(u32 i) {
i32 sz = 0;
char ans[12];
while (i || !sz)
ans[sz++] = i % 10 + '0', i /= 10;
while (sz--)
putc(ans[sz], stdout);
}
inline void cscan(u64 &i) {
i = 0;
i32 c = getc(stdin);
while (c <= 32)
c = getc(stdin);
while (c >= '0' && c <= '9')
i *= 10, i += c - '0', c = getc(stdin);
}
inline void cprint(u64 i) {
i32 sz = 0;
char ans[21];
while (i || !sz)
ans[sz++] = i % 10 + '0', i /= 10;
while (sz--)
putc(ans[sz], stdout);
}
inline void cscan(lf &i) { scanf("%lf", &i); }
inline void cprint(lf i) { printf("%.20lf", i); }
inline void cprint(char i) { putc(i, stdout); }
inline void cscan(char &i) {
i32 b = getc(stdin);
while (b <= 32)
b = getc(stdin);
i = b;
}
template <class T, class K> inline void cscan(pair<T, K> &i) {
cscan(i.f);
cscan(i.s);
}
template <class T, class K> inline void cprint(pair<T, K> &i) {
cprint('(');
cprint(i.f);
cprint(' ');
cprint(i.s);
cprint(')');
}
template <class T> inline void cscan(ar<T> &i) {
for (var &j : i)
cscan(j);
}
template <class T> inline void cprint(ar<T> &i) {
for (var &j : i)
cprint(j), cprint(' ');
}
template <class T> inline void cprint(ar<ar<T>> &i) {
for (var &j : i)
cprint(j), cprint('\n');
}
} // namespace shyutsuryoku
template <class T> ostream &operator,(ostream &os, T v) {
shyutsuryoku::cprint(v); // cprint(' ');
return os;
}
template <class T> istream &operator,(istream &is, T &v) {
shyutsuryoku::cscan(v);
return is;
}
#endif
void misaka_mikoto_is_the_best_girl_ever();
i32 main() {
#ifdef tavan_sersyv
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
srand(time(0));
misaka_mikoto_is_the_best_girl_ever();
#ifdef tavan_sersyv
aut '\n', (lf)clock() / CLOCKS_PER_SEC, " 秒\n";
#endif
fusrodah 0;
}
void misaka_mikoto_is_the_best_girl_ever() {
i32 a, b, c;
ain a, b, c;
aut c - (a - b);
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifndef orewabaka
#define f first
#define s second
#define minna(a) a.begin(), a.end()
#define ovse(a) a.rbegin(), a.rend()
#define pb push_back
#define endl aut '\n'
#define ar vector
#define var auto
#define rand() (((rand() << 15) + rand()) & INT32_MAX)
#define ain cin,
#define aut cout,
#define $(a) (i64) a.size()
#define in insert
#define fusrodah return
#define mp make_pair
#define rep(i, n) for (i64 i = 0; i < (n); i++)
#define rep1(i, n) for (i64 i = 1; i < (n); i++)
#define fro2(i, a, b) for (i64 i = (a); i < (b); i++)
#define elif else if
typedef int i32;
typedef unsigned u32;
typedef long long i64;
typedef unsigned long long u64;
typedef pair<i32, i32> p32;
typedef pair<i64, i64> p64;
typedef double lf;
typedef long double ld;
typedef tree<p64, null_type, less<p64>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
namespace shyutsuryoku {
const i32 STRSZ = 3e6 + 13;
char inbufer[STRSZ];
inline void cscan(string &i) {
i32 c = getc(stdin), cnt = 0;
while (c <= 32)
c = getc(stdin);
while (c > 32)
*(inbufer + cnt) = c, c = getc(stdin), ++cnt;
*(cnt + inbufer) = 0;
i = inbufer;
}
inline void cprint(string &i) {
char *s = new char[i.size() + 1];
strcpy(s, i.c_str());
while (*s)
putchar(*s), s++;
}
inline void cprint(const char *&i) {
i32 cnt = 0;
while (*(i + cnt))
putc(*(i + cnt), stdout), cnt++;
}
inline void cscan(i32 &i) {
i = 0;
i32 c = getc(stdin), b = 0;
while (c <= 32)
c = getc(stdin);
if (c == '-')
b = 1, c = getc(stdin);
while (c >= '0' && c <= '9')
i *= 10, i += c - '0', c = getc(stdin);
if (b)
i = -i;
}
inline void cprint(i32 i) {
if (i < 0)
putc('-', stdout), i = -i;
i32 sz = 0;
char ans[13];
while (i || !sz)
ans[sz++] = i % 10 + '0', i /= 10;
while (sz--)
putc(ans[sz], stdout);
}
inline void cscan(i64 &i) {
i = 0;
i32 c = getc(stdin), b = 1;
while (c <= 32)
c = getc(stdin);
if (c == '-')
b = -1, c = getc(stdin);
while (c >= '0' && c <= '9')
i *= 10, i += c - '0', c = getc(stdin);
i *= b;
}
inline void cprint(i64 i) {
if (i < 0)
putc('-', stdout), i = -i;
i32 sz = 0;
char ans[21];
while (i || !sz)
ans[sz++] = i % 10 + '0', i /= 10;
while (sz--)
putc(ans[sz], stdout);
}
inline void cscan(u32 &i) {
i = 0;
i32 c = getc(stdin);
while (c <= 32)
c = getc(stdin);
while (c >= '0' && c <= '9')
i *= 10, i += c - '0', c = getc(stdin);
}
inline void cprint(u32 i) {
i32 sz = 0;
char ans[12];
while (i || !sz)
ans[sz++] = i % 10 + '0', i /= 10;
while (sz--)
putc(ans[sz], stdout);
}
inline void cscan(u64 &i) {
i = 0;
i32 c = getc(stdin);
while (c <= 32)
c = getc(stdin);
while (c >= '0' && c <= '9')
i *= 10, i += c - '0', c = getc(stdin);
}
inline void cprint(u64 i) {
i32 sz = 0;
char ans[21];
while (i || !sz)
ans[sz++] = i % 10 + '0', i /= 10;
while (sz--)
putc(ans[sz], stdout);
}
inline void cscan(lf &i) { scanf("%lf", &i); }
inline void cprint(lf i) { printf("%.20lf", i); }
inline void cprint(char i) { putc(i, stdout); }
inline void cscan(char &i) {
i32 b = getc(stdin);
while (b <= 32)
b = getc(stdin);
i = b;
}
template <class T, class K> inline void cscan(pair<T, K> &i) {
cscan(i.f);
cscan(i.s);
}
template <class T, class K> inline void cprint(pair<T, K> &i) {
cprint('(');
cprint(i.f);
cprint(' ');
cprint(i.s);
cprint(')');
}
template <class T> inline void cscan(ar<T> &i) {
for (var &j : i)
cscan(j);
}
template <class T> inline void cprint(ar<T> &i) {
for (var &j : i)
cprint(j), cprint(' ');
}
template <class T> inline void cprint(ar<ar<T>> &i) {
for (var &j : i)
cprint(j), cprint('\n');
}
} // namespace shyutsuryoku
template <class T> ostream &operator,(ostream &os, T v) {
shyutsuryoku::cprint(v); // cprint(' ');
return os;
}
template <class T> istream &operator,(istream &is, T &v) {
shyutsuryoku::cscan(v);
return is;
}
#endif
void misaka_mikoto_is_the_best_girl_ever();
i32 main() {
#ifdef tavan_sersyv
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
srand(time(0));
misaka_mikoto_is_the_best_girl_ever();
#ifdef tavan_sersyv
aut '\n', (lf)clock() / CLOCKS_PER_SEC, " 秒\n";
#endif
fusrodah 0;
}
void misaka_mikoto_is_the_best_girl_ever() {
i32 a, b, c;
ain a, b, c;
aut max(c - (a - b), 0);
} | [
"variable_declaration.value.change",
"call.arguments.add"
] | 752,059 | 752,060 | u539322713 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MEM(a, b) memset((a), (b), sizeof(a))
const LL INF = 1e9 + 7;
const int N = 2e5 + 10;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (b - a)) << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MEM(a, b) memset((a), (b), sizeof(a))
const LL INF = 1e9 + 7;
const int N = 2e5 + 10;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 752,068 | 752,069 | u861345985 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(s.size()) - 1)
cout << endl;
else
cout << " ";
}
}
int main() {
cin.tie(0);
cout << fixed << setprecision(10);
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(s.size()) - 1)
cout << endl;
else
cout << " ";
}
}
int main() {
cin.tie(0);
cout << fixed << setprecision(10);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 752,072 | 752,073 | u334351654 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = c - (a - b);
if (x < 0)
cout << "0" << endl;
else
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = c - (a - b);
if (x < 0)
cout << "0" << endl;
else
cout << x << endl;
} | [
"identifier.change",
"io.output.change"
] | 752,074 | 752,075 | u805397017 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
c -= max(c, a - b);
cout << c << "\n";
return 0;
}
| #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
c -= min(c, a - b);
cout << c << "\n";
return 0;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 752,082 | 752,083 | u696290869 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
c -= a - b;
cout << c << "\n";
return 0;
}
| #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
c -= min(c, a - b);
cout << c << "\n";
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,084 | 752,083 | u696290869 | cpp |
p02951 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>
#define int long long
using namespace std;
void Main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
}
int32_t main() {
Main();
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>
#define int long long
using namespace std;
void Main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(0LL, C - (A - B)) << endl;
}
int32_t main() {
Main();
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,085 | 752,086 | u790502959 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UINT = unsigned long long;
unsigned gcd(unsigned a, unsigned b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
const UINT mod = 1000000007;
UINT PowMod(UINT x, UINT y) {
if (y == 0) {
return 1;
} else if (y == 1) {
return x % mod;
} else if (y % 2 == 0) {
auto tmp = PowMod(x, y / 2);
return tmp * tmp % mod;
} else {
auto tmp = PowMod(x, y / 2);
return (tmp * tmp % mod) * x % mod;
}
}
UINT getModInv(UINT N) { return PowMod(N, mod - 2); }
struct uf {
vector<INT> p;
uf(INT n) : p(n) {
for (size_t i = 0; i < n; i++) {
p[i] = i;
}
}
INT rt(INT n) { return p[n] == n ? n : p[n] = rt(p[n]); }
void un(INT n, INT m) { p[rt(n)] = p[rt(m)]; }
bool eq(INT n, INT m) { return rt(n) == rt(m); }
};
int main() {
INT a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UINT = unsigned long long;
unsigned gcd(unsigned a, unsigned b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
const UINT mod = 1000000007;
UINT PowMod(UINT x, UINT y) {
if (y == 0) {
return 1;
} else if (y == 1) {
return x % mod;
} else if (y % 2 == 0) {
auto tmp = PowMod(x, y / 2);
return tmp * tmp % mod;
} else {
auto tmp = PowMod(x, y / 2);
return (tmp * tmp % mod) * x % mod;
}
}
UINT getModInv(UINT N) { return PowMod(N, mod - 2); }
struct uf {
vector<INT> p;
uf(INT n) : p(n) {
for (size_t i = 0; i < n; i++) {
p[i] = i;
}
}
INT rt(INT n) { return p[n] == n ? n : p[n] = rt(p[n]); }
void un(INT n, INT m) { p[rt(n)] = p[rt(m)]; }
bool eq(INT n, INT m) { return rt(n) == rt(m); }
};
int main() {
INT a, b, c;
cin >> a >> b >> c;
cout << max(0LL, c - (a - b)) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 752,091 | 752,092 | u275797573 | cpp |
p02951 | #include <iostream>
int main() {
int a, b, c, ans;
std::cin >> a >> b >> c;
if (a - b >= c) {
ans = 0;
} else {
ans == c - (a - b);
}
std::cout << ans << std::endl;
}
| #include <iostream>
int main() {
int a, b, c, ans;
std::cin >> a >> b >> c;
if (a - b >= c) {
ans = 0;
} else {
ans = c - (a - b);
}
std::cout << ans << std::endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 752,107 | 752,108 | u425830382 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans;
ans = c - (a - b);
if (ans < 0)
ans = -ans;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans;
ans = c - (a - b);
if (ans < 0)
ans = 0;
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"expression.operation.unary.remove"
] | 752,112 | 752,113 | u405620865 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long ll;
const int mod = 1e9 + 7;
const ll inf = 3e18 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
int sol = a - b;
c -= sol;
cout << c;
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long ll;
const int mod = 1e9 + 7;
const ll inf = 3e18 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
int sol = a - b;
c -= sol;
cout << max(c, 0);
} | [
"call.add",
"call.arguments.add"
] | 752,116 | 752,117 | u788461451 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 752,128 | 752,129 | u688422725 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A + B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
} | [
"call.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"call.arguments.add"
] | 752,131 | 752,129 | u688422725 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (c - (a + b) < 0)
std::cout << "0";
else
std::cout << (c - a + b);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (c - (a - b) < 0)
std::cout << "0";
else
std::cout << (c - a + b);
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 752,134 | 752,135 | u063873990 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
C = C - (A - B);
if (C < 0) {
C = 0;
}
cout << C - (A - B) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
C = C - (A - B);
if (C < 0) {
C = 0;
}
cout << C << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 752,138 | 752,139 | u980909653 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (b - a)) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 752,140 | 752,141 | u813181182 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c >= a)
cout << 0 << endl;
else
cout << b + c - a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c <= a)
cout << 0 << endl;
else
cout << b + c - a << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,148 | 752,149 | u168774513 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - a > 0) {
cout << (c - a) + b << endl;
} else {
cout << 0 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - a + b > 0) {
cout << (c - a) + b << endl;
} else {
cout << 0 << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 752,152 | 752,153 | u280329066 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
int water, ans;
water = b + c;
if (water > a)
ans = water - a;
else
ans = 0;
cout << water << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
int water, ans;
water = b + c;
if (water > a)
ans = water - a;
else
ans = 0;
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 752,154 | 752,155 | u657208344 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
template <class S, class T>
ostream &operator<<(ostream &o, const pair<S, T> &p) {
return o << "(" << p.fs << "," << p.sc << ")";
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &vc) {
o << "{";
for (const T &v : vc)
o << v << ",";
o << "}";
return o;
}
using ll = long long;
template <class T> using V = vector<T>;
template <class T> using VV = vector<vector<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
#ifdef LOCAL
#define show(x) \
cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define show(x) true
#endif
int main() {
cin.tie(0);
ios::sync_with_stdio(false); // DON'T USE scanf/printf/puts !!
cout << fixed << setprecision(20);
int a, b, c;
cin >> a >> b >> c;
cout << c - min(a, b + c) << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
template <class S, class T>
ostream &operator<<(ostream &o, const pair<S, T> &p) {
return o << "(" << p.fs << "," << p.sc << ")";
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &vc) {
o << "{";
for (const T &v : vc)
o << v << ",";
o << "}";
return o;
}
using ll = long long;
template <class T> using V = vector<T>;
template <class T> using VV = vector<vector<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
#ifdef LOCAL
#define show(x) \
cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define show(x) true
#endif
int main() {
cin.tie(0);
ios::sync_with_stdio(false); // DON'T USE scanf/printf/puts !!
cout << fixed << setprecision(20);
int a, b, c;
cin >> a >> b >> c;
cout << b + c - min(a, b + c) << endl;
}
| [
"expression.operation.binary.add"
] | 752,161 | 752,162 | u309470177 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
template <class S, class T>
ostream &operator<<(ostream &o, const pair<S, T> &p) {
return o << "(" << p.fs << "," << p.sc << ")";
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &vc) {
o << "{";
for (const T &v : vc)
o << v << ",";
o << "}";
return o;
}
using ll = long long;
template <class T> using V = vector<T>;
template <class T> using VV = vector<vector<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
#ifdef LOCAL
#define show(x) \
cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define show(x) true
#endif
int main() {
cin.tie(0);
ios::sync_with_stdio(false); // DON'T USE scanf/printf/puts !!
cout << fixed << setprecision(20);
int a, b, c;
cin >> a >> b >> c;
cout << min(a, b + c) << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
template <class S, class T>
ostream &operator<<(ostream &o, const pair<S, T> &p) {
return o << "(" << p.fs << "," << p.sc << ")";
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &vc) {
o << "{";
for (const T &v : vc)
o << v << ",";
o << "}";
return o;
}
using ll = long long;
template <class T> using V = vector<T>;
template <class T> using VV = vector<vector<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
#ifdef LOCAL
#define show(x) \
cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define show(x) true
#endif
int main() {
cin.tie(0);
ios::sync_with_stdio(false); // DON'T USE scanf/printf/puts !!
cout << fixed << setprecision(20);
int a, b, c;
cin >> a >> b >> c;
cout << b + c - min(a, b + c) << endl;
}
| [
"expression.operation.binary.add"
] | 752,163 | 752,162 | u309470177 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,166 | 752,167 | u915882515 | cpp |
p02951 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << std::max((c - (b - a)), 0) << "\n";
return 0;
} | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << std::max((c - (a - b)), 0) << "\n";
return 0;
} | [
"expression.operation.binary.remove"
] | 752,170 | 752,171 | u131209962 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = c - a - b;
if (ans < 0)
ans = 0;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
ans = c - (a - b);
if (ans < 0)
ans = 0;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.add"
] | 752,174 | 752,175 | u980485808 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 752,178 | 752,179 | u587665681 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, b + c - 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, b + c - a);
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 752,192 | 752,193 | u489172963 | cpp |
p02951 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A, B, C;
int s = max(0, C - (A - B));
cout << s;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int s = max(0, C - (A - B));
cout << s;
} | [] | 752,194 | 752,195 | u434355956 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, x;
cin >> a >> b >> c;
x = a - b;
if (x + c <= a) {
cout << 0;
}
else {
cout << c - x;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, x;
cin >> a >> b >> c;
x = a - b;
if (x > c) {
cout << 0;
}
else {
cout << c - x;
}
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 752,202 | 752,203 | u099297604 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << '\n';
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << '\n';
} | [
"call.add",
"call.arguments.change"
] | 752,204 | 752,205 | u452343113 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - b + a, 0) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - a + b, 0) << endl;
}
| [
"expression.operation.binary.remove"
] | 752,206 | 752,207 | u551813187 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
const ll inf = 1e9 + 7;
ll gcd(ll a, ll b) { return (b ? gcd(b, a % b) : a); }
ll lcm(ll a, ll b) { return a / (gcd(a, b)) * b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
const ll inf = 1e9 + 7;
ll gcd(ll a, ll b) { return (b ? gcd(b, a % b) : a); }
ll lcm(ll a, ll b) { return a / (gcd(a, b)) * b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 752,208 | 752,209 | u620242073 | cpp |
p02951 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << B + C - A << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(B + C - A, 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,226 | 752,227 | u340293807 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, S;
cin >> N >> M >> S;
N = N - M;
if (N - S < 0) {
cout << 0 << endl;
} else
cout << N - S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, S;
cin >> N >> M >> S;
N = N - M;
if (N - S > 0) {
cout << 0 << endl;
} else
cout << S - N << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 752,228 | 752,229 | u697858600 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - a + b << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - a + b) << endl;
} | [
"call.add",
"call.arguments.change"
] | 752,236 | 752,237 | u759721333 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
long long MOD = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
long long MOD = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,242 | 752,243 | u138597672 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c < a)
cout << c + b - a << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c > a)
cout << c + b - a << endl;
else
cout << 0 << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,249 | 752,250 | u319967566 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
a -= b;
cout << min(a, c) << '\n';
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
a -= b;
cout << c - min(a, c) << '\n';
return 0;
} | [
"expression.operation.binary.add"
] | 752,251 | 752,252 | u320367606 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define itn int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define range(a) a.begin(), a.end()
#define print(A, n) \
rep(i, 0, n) { cout << (i ? " " : "") << A[i]; } \
cout << endl;
#define pprint(A, m, n) \
rep(j, 0, m) { print(A[j], n); }
const long mod = 1e9 + 7;
const int size = 1e5;
const int INF = 1e9;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(0, C - A + B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define itn int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define range(a) a.begin(), a.end()
#define print(A, n) \
rep(i, 0, n) { cout << (i ? " " : "") << A[i]; } \
cout << endl;
#define pprint(A, m, n) \
rep(j, 0, m) { print(A[j], n); }
const long mod = 1e9 + 7;
const int size = 1e5;
const int INF = 1e9;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(0, C - A + B) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,267 | 752,268 | u977554186 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define sz(x) int(x.size())
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(0, c - (a - b)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define sz(x) int(x.size())
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,276 | 752,277 | u033602950 | cpp |
p02951 | #include <stdio.h>
int main(void) {
int A, B, C;
scanf("%d %d %d", &A, &B, &C);
if (B + C - A <= 0) {
printf("0");
printf("%d", B + C - A);
}
return 0;
} | #include <stdio.h>
int main(void) {
int A, B, C;
scanf("%d %d %d", &A, &B, &C);
if (B + C - A <= 0)
printf("0");
else {
printf("%d", B + C - A);
}
return 0;
}
| [
"control_flow.branch.else.add"
] | 752,278 | 752,279 | u195269284 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 752,284 | 752,285 | u424910800 | cpp |
p02951 | #include <iostream>
#include <string>
using namespace std;
int main() {
// 整数の入力
int a, b, c;
cin >> a >> b >> c;
int ret = c - (a - b);
cout << (ret >= 0) ? ret : 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
// 整数の入力
int a, b, c;
cin >> a >> b >> c;
int ret = c - (a - b);
cout << ((ret >= 0) ? ret : 0);
} | [] | 752,286 | 752,287 | u065261876 | cpp |
p02951 | #include <iostream>
#include <string>
using namespace std;
int main() {
// 整数の入力
int a, b, c;
cin >> a >> b >> c;
int ret = c - a - b;
cout << (ret >= 0) ? ret : 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
// 整数の入力
int a, b, c;
cin >> a >> b >> c;
int ret = c - (a - b);
cout << ((ret >= 0) ? ret : 0);
} | [] | 752,288 | 752,287 | u065261876 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - (a + b) > 0) {
cout << c - (a - b) << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - (a - b) > 0) {
cout << c - (a - b) << endl;
} else {
cout << 0 << endl;
}
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 752,295 | 752,296 | u959353968 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.