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 <iostream>
using namespace std;
int main() {
int a, b, c;
int ans;
cin >> a >> b >> c;
if (ans = c - (a - b) <= 0) {
cout << 0 << endl;
} else {
cout << ans << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
int ans;
cin >> a >> b >> c;
if ((ans = c - (a - b)) <= 0) {
cout << 0 << endl;
} else {
cout << ans << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 752,305 | 752,306 | u761994361 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = 0; i < 1; i++) {
int d = a - b;
if (c - d < 0) {
cout << 0;
}
cout << c - d;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = 0; i < 1; i++) {
int d = a - b;
if (c - d < 0) {
cout << 0;
} else {
cout << c - d;
}
}
return 0;
} | [
"control_flow.branch.else.add"
] | 752,307 | 752,308 | u484351040 | cpp |
p02951 | #include <bits/stdc++.h>
// compiling code: g++ test.cpp(file) -o script(output) -std=c++11(version)
// -O2(make it 2x faster)
using namespace std;
int main() {
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
if (C + B == A) {
cout << A - C;
} else if (C + B > A) {
cout << C + B - A;
} else if (C + B < A) {
cout << 0;
}
return 0;
} | #include <bits/stdc++.h>
// compiling code: g++ test.cpp(file) -o script(output) -std=c++11(version)
// -O2(make it 2x faster)
using namespace std;
int main() {
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
if (C + B == A) {
cout << 0;
} else if (C + B > A) {
cout << C + B - A;
} else if (C + B < A) {
cout << 0;
}
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"expression.operation.binary.remove"
] | 752,311 | 752,312 | u267944403 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0LL) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 752,331 | 752,332 | u708590262 | cpp |
p02951 | #include <iostream>
int main() {
unsigned int bottle_a, bottle_b, bottle_c;
std::cin >> bottle_a >> bottle_b >> bottle_c;
int mm_left = bottle_a - bottle_b;
if (bottle_c - mm_left >= 0) {
std::cout << bottle_c - mm_left;
} else {
std::cout << "0";
}
return 0;
} | #include <iostream>
int main() {
signed int bottle_a, bottle_b, bottle_c;
std::cin >> bottle_a >> bottle_b >> bottle_c;
signed int mm_left = bottle_a - bottle_b;
if (bottle_c - mm_left >= 0) {
std::cout << bottle_c - mm_left;
} else {
std::cout << "0";
}
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 752,343 | 752,344 | u193604609 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - a + b;
if (c < 0)
cout << "0" << endl;
else
cout << ans << endl;
} | #include <iostream>
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;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 752,345 | 752,346 | u346214077 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - a + b;
if (c < 0)
cout << 0 << endl;
else
cout << ans << endl;
} | #include <iostream>
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;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 752,347 | 752,346 | u346214077 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
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;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
#define max_3(a, b, c) max(a, max(b, c))
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
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;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
#define max_3(a, b, c) max(a, max(b, c))
typedef long long ll;
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,352 | 752,353 | u170650966 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int A, B, C;
int main() {
cin >> A >> B >> C;
cout << B + C - max(A, B + C) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int A, B, C;
int main() {
cin >> A >> B >> C;
cout << B + C - min(A, B + C) << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,356 | 752,357 | u488352661 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - A + B << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
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"
] | 752,358 | 752,359 | u970738863 | cpp |
p02951 | // ABC136
// A - Transfer
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
}
| // ABC136
// A - Transfer
#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,362 | 752,363 | u178392375 | cpp |
p02951 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
} | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 752,368 | 752,369 | u918357423 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define ll long long
#define M 100000007
#define fr first
#define sc second
#define endl "\n"
#define vc vector
#define pb push_back
#define pii pair<ll, ll>
#define psi pair<string, ll>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define PI 3.14159265
#define r0 return 0
/* typedef vector< int > vi;
typedef vector< vi > vvi;
typedef pair< int,int > ii;
*/
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (typeof((c)).begin() i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
using namespace std;
int main() {
fast int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b);
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define ll long long
#define M 100000007
#define fr first
#define sc second
#define endl "\n"
#define vc vector
#define pb push_back
#define pii pair<ll, ll>
#define psi pair<string, ll>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define PI 3.14159265
#define r0 return 0
/* typedef vector< int > vi;
typedef vector< vi > vvi;
typedef pair< int,int > ii;
*/
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (typeof((c)).begin() i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
using namespace std;
int main() {
fast int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0);
}
| [
"call.add",
"call.arguments.add"
] | 752,374 | 752,375 | u668165118 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define NREP(i, n) for (int i = 1; i <= (n); i++)
#define SREP(i, s) for (int i = 0; i < (s.size()); i++)
#define SORT(v, n) sort(v, v + n);
#define GSORT(v, n) sort(v, v + n, greater<int>());
#define VSORT(v) sort(v.begin(), v.end());
#define VGSORT(v) sort(v.begin(), v.end(), greater<int>());
#define REV(a) reverse(begin(a), end(a));
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(7);
////////////////////////////////////////////
int a, b, c;
cin >> a >> b >> c;
cout << b + c - a << endl;
///////////////////////////////////////////
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define NREP(i, n) for (int i = 1; i <= (n); i++)
#define SREP(i, s) for (int i = 0; i < (s.size()); i++)
#define SORT(v, n) sort(v, v + n);
#define GSORT(v, n) sort(v, v + n, greater<int>());
#define VSORT(v) sort(v.begin(), v.end());
#define VGSORT(v) sort(v.begin(), v.end(), greater<int>());
#define REV(a) reverse(begin(a), end(a));
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(7);
////////////////////////////////////////////
int a, b, c;
cin >> a >> b >> c;
cout << max(0, b + c - a) << endl;
///////////////////////////////////////////
}
| [
"call.add",
"call.arguments.change"
] | 752,393 | 752,394 | u398211442 | cpp |
p02951 | #include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P_ii;
typedef pair<string, int> P_si;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(C - (A - B), 0) << endl;
return 0;
}
| #include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P_ii;
typedef pair<string, int> P_si;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,397 | 752,398 | u095756391 | cpp |
p02951 | #include <iostream>
using namespace std;
#define ll int
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll lt = a - b;
if (lt >= c)
cout << c;
else
cout << lt;
} | #include <iostream>
using namespace std;
#define ll int
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll lt = a - b;
if (lt >= c)
cout << 0;
else
cout << c - lt;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 752,405 | 752,406 | u989087939 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - a + b;
} | #include <bits/stdc++.h>
using namespace std;
main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - a + b, 0);
} | [
"call.add",
"call.arguments.add"
] | 752,407 | 752,408 | u059570092 | cpp |
p02951 | // Charan Sriramula
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll lg = 22;
const ll N = 1e5 + 5;
const ll M = 16;
const ll INF = 1e18;
const ll mod = 1e9 + 7;
const double PI = 3.14159265358979323846;
#define is(n) scanf("%d", &n)
#define io(n) printf("%d\n", n)
#define ls(n) scanf("%lld", &n)
#define lo(n) printf("%lld\n", n)
#define f first
#define s second
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
#define GCD(a, b) __gcd((a), (b))
#define all(v) v.begin(), v.end()
#define bits(x) __builtin_popcount(x)
#define LCM(a, b) ((a) * (b)) / GCD((a), (b))
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
template <typename T> T power(T x, T y, ll m) {
T ans = 1;
while (y > 0) {
if (y & 1LL)
ans = (ans * x) % m;
y >>= 1LL;
x = (x * x) % m;
}
return ans % m;
}
inline ll mul(ll a, ll b, ll p) { return (a * 1ll * b) % p; }
inline ll sub(ll a, ll b, ll p) {
ll c = a - b;
if (c < 0)
c += p;
return c;
}
inline ll add(ll a, ll b, ll p) {
ll c = a + b;
if (c > p)
c -= p;
return c;
}
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
} | // Charan Sriramula
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll lg = 22;
const ll N = 1e5 + 5;
const ll M = 16;
const ll INF = 1e18;
const ll mod = 1e9 + 7;
const double PI = 3.14159265358979323846;
#define is(n) scanf("%d", &n)
#define io(n) printf("%d\n", n)
#define ls(n) scanf("%lld", &n)
#define lo(n) printf("%lld\n", n)
#define f first
#define s second
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
#define GCD(a, b) __gcd((a), (b))
#define all(v) v.begin(), v.end()
#define bits(x) __builtin_popcount(x)
#define LCM(a, b) ((a) * (b)) / GCD((a), (b))
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
template <typename T> T power(T x, T y, ll m) {
T ans = 1;
while (y > 0) {
if (y & 1LL)
ans = (ans * x) % m;
y >>= 1LL;
x = (x * x) % m;
}
return ans % m;
}
inline ll mul(ll a, ll b, ll p) { return (a * 1ll * b) % p; }
inline ll sub(ll a, ll b, ll p) {
ll c = a - b;
if (c < 0)
c += p;
return c;
}
inline ll add(ll a, ll b, ll p) {
ll c = a + b;
if (c > p)
c -= p;
return c;
}
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << max(0LL, c - (a - b)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 752,411 | 752,412 | u416273217 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int A, B, C;
int main() {
cin >> A >> B >> C;
int sa = A - B;
if (C <= sa)
cout << C - sa << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int A, B, C;
int main() {
cin >> A >> B >> C;
int sa = A - B;
if (C >= sa)
cout << C - sa << endl;
else
cout << 0 << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,427 | 752,428 | u231416581 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
long long dp[3][100100] = {};
const long long INF = 1LL << 60;
#define MOD 1000000007
#define Int int64_t
#define PI 3.14159265358979
#define dump(a) cout << a << endl;
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;
}
/**
* @fn
* ζ倧ε€γεγγΎγ.Vector<int>γζΈ‘γγγ¨.
*/
long long int imax(vector<int> a) {
int MAX = -10000000;
for (int i = 0; i < a.size(); i++) {
if (MAX < a.at(i))
MAX = a.at(i);
}
return MAX;
}
/**
* @fn
* ζε°ε€γεγγΎγ.Vector<int>γζΈ‘γγγ¨.
*/
long long int imin(vector<int> a) {
int MIN = 1000000000;
for (int i = 0; i < a.size(); i++) {
if (MIN > a.at(i))
MIN = a.at(i);
}
return MIN;
}
/**
* @fn
* θͺηΆζ°γ«γ€γγ¦γζ‘ζ°γζ±γγ
*/
Int getDigit(Int num) { return (Int)(log10(num)) + 1; }
int get2Digit(Int num) {
int cnt = 0;
while (num > 0) {
if (num % 2 != 0) {
return cnt;
}
cnt++;
num /= 2;
}
}
long long int absmin(vector<int> a, long long int b) {
int mini = 100000000;
int d = 0;
for (int i = 0; i < a.size(); i++) {
if (mini > abs(a.at(i) - b)) {
mini = abs(a.at(i) - b);
d = i;
}
}
return d;
}
long long int absmax(vector<int> a, long long int b) {
int max = -100000000;
int d = 0;
for (int i = 0; i < a.size(); i++) {
if (max < abs(a.at(i) - b)) {
max = abs(a.at(i) - b);
d = i;
}
}
return d;
}
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b < 1)
return -1;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
void haerobatya(int start, int end, char level) {
if (start > end)
swap(start, end);
for (int i = start; i <= end; i++) {
if (i < 100) {
cout << "https://atcoder.jp/contests/abc0" << i << "/tasks/abc0" << i
<< "_" << level << endl;
} else {
cout << "https://atcoder.jp/contests/abc" << i << "/tasks/abc" << i << "_"
<< level << endl;
}
}
}
long long int cntmod(long long int warareru, long long int mod) {
long long int i = 0;
for (i = 0; true; i++) {
if (warareru % mod == 0 && warareru >= mod) {
warareru /= mod;
} else {
return i;
}
}
}
void ansYes(bool a) {
if (a == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ansYES(bool a) {
if (a == true)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
Int euclidean_gcd(Int a, Int b) {
while (true) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
typedef pair<int, int> pai;
//γγγΎγ§γ©γ€γγ©γͺ
//γγγγζ¬ζ
int main() {
int a, b, c;
cin >> a >> b >> c;
dump(c - min(c, c - (a - b)) - 1);
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
long long dp[3][100100] = {};
const long long INF = 1LL << 60;
#define MOD 1000000007
#define Int int64_t
#define PI 3.14159265358979
#define dump(a) cout << a << endl;
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;
}
/**
* @fn
* ζ倧ε€γεγγΎγ.Vector<int>γζΈ‘γγγ¨.
*/
long long int imax(vector<int> a) {
int MAX = -10000000;
for (int i = 0; i < a.size(); i++) {
if (MAX < a.at(i))
MAX = a.at(i);
}
return MAX;
}
/**
* @fn
* ζε°ε€γεγγΎγ.Vector<int>γζΈ‘γγγ¨.
*/
long long int imin(vector<int> a) {
int MIN = 1000000000;
for (int i = 0; i < a.size(); i++) {
if (MIN > a.at(i))
MIN = a.at(i);
}
return MIN;
}
/**
* @fn
* θͺηΆζ°γ«γ€γγ¦γζ‘ζ°γζ±γγ
*/
Int getDigit(Int num) { return (Int)(log10(num)) + 1; }
int get2Digit(Int num) {
int cnt = 0;
while (num > 0) {
if (num % 2 != 0) {
return cnt;
}
cnt++;
num /= 2;
}
}
long long int absmin(vector<int> a, long long int b) {
int mini = 100000000;
int d = 0;
for (int i = 0; i < a.size(); i++) {
if (mini > abs(a.at(i) - b)) {
mini = abs(a.at(i) - b);
d = i;
}
}
return d;
}
long long int absmax(vector<int> a, long long int b) {
int max = -100000000;
int d = 0;
for (int i = 0; i < a.size(); i++) {
if (max < abs(a.at(i) - b)) {
max = abs(a.at(i) - b);
d = i;
}
}
return d;
}
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b < 1)
return -1;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
void haerobatya(int start, int end, char level) {
if (start > end)
swap(start, end);
for (int i = start; i <= end; i++) {
if (i < 100) {
cout << "https://atcoder.jp/contests/abc0" << i << "/tasks/abc0" << i
<< "_" << level << endl;
} else {
cout << "https://atcoder.jp/contests/abc" << i << "/tasks/abc" << i << "_"
<< level << endl;
}
}
}
long long int cntmod(long long int warareru, long long int mod) {
long long int i = 0;
for (i = 0; true; i++) {
if (warareru % mod == 0 && warareru >= mod) {
warareru /= mod;
} else {
return i;
}
}
}
void ansYes(bool a) {
if (a == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ansYES(bool a) {
if (a == true)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
Int euclidean_gcd(Int a, Int b) {
while (true) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
typedef pair<int, int> pai;
//γγγΎγ§γ©γ€γγ©γͺ
//γγγγζ¬ζ
int main() {
int a, b, c;
cin >> a >> b >> c;
dump(c - min(c, a - b));
} | [
"expression.operation.binary.remove",
"call.arguments.change"
] | 752,429 | 752,430 | u959822889 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
long long dp[3][100100] = {};
const long long INF = 1LL << 60;
#define MOD 1000000007
#define Int int64_t
#define PI 3.14159265358979
#define dump(a) cout << a << endl;
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;
}
/**
* @fn
* ζ倧ε€γεγγΎγ.Vector<int>γζΈ‘γγγ¨.
*/
long long int imax(vector<int> a) {
int MAX = -10000000;
for (int i = 0; i < a.size(); i++) {
if (MAX < a.at(i))
MAX = a.at(i);
}
return MAX;
}
/**
* @fn
* ζε°ε€γεγγΎγ.Vector<int>γζΈ‘γγγ¨.
*/
long long int imin(vector<int> a) {
int MIN = 1000000000;
for (int i = 0; i < a.size(); i++) {
if (MIN > a.at(i))
MIN = a.at(i);
}
return MIN;
}
/**
* @fn
* θͺηΆζ°γ«γ€γγ¦γζ‘ζ°γζ±γγ
*/
Int getDigit(Int num) { return (Int)(log10(num)) + 1; }
int get2Digit(Int num) {
int cnt = 0;
while (num > 0) {
if (num % 2 != 0) {
return cnt;
}
cnt++;
num /= 2;
}
}
long long int absmin(vector<int> a, long long int b) {
int mini = 100000000;
int d = 0;
for (int i = 0; i < a.size(); i++) {
if (mini > abs(a.at(i) - b)) {
mini = abs(a.at(i) - b);
d = i;
}
}
return d;
}
long long int absmax(vector<int> a, long long int b) {
int max = -100000000;
int d = 0;
for (int i = 0; i < a.size(); i++) {
if (max < abs(a.at(i) - b)) {
max = abs(a.at(i) - b);
d = i;
}
}
return d;
}
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b < 1)
return -1;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
void haerobatya(int start, int end, char level) {
if (start > end)
swap(start, end);
for (int i = start; i <= end; i++) {
if (i < 100) {
cout << "https://atcoder.jp/contests/abc0" << i << "/tasks/abc0" << i
<< "_" << level << endl;
} else {
cout << "https://atcoder.jp/contests/abc" << i << "/tasks/abc" << i << "_"
<< level << endl;
}
}
}
long long int cntmod(long long int warareru, long long int mod) {
long long int i = 0;
for (i = 0; true; i++) {
if (warareru % mod == 0 && warareru >= mod) {
warareru /= mod;
} else {
return i;
}
}
}
void ansYes(bool a) {
if (a == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ansYES(bool a) {
if (a == true)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
Int euclidean_gcd(Int a, Int b) {
while (true) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
typedef pair<int, int> pai;
//γγγΎγ§γ©γ€γγ©γͺ
//γγγγζ¬ζ
int main() {
int a, b, c;
cin >> a >> b >> c;
dump(c - min(c, c - (a - b)));
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
long long dp[3][100100] = {};
const long long INF = 1LL << 60;
#define MOD 1000000007
#define Int int64_t
#define PI 3.14159265358979
#define dump(a) cout << a << endl;
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;
}
/**
* @fn
* ζ倧ε€γεγγΎγ.Vector<int>γζΈ‘γγγ¨.
*/
long long int imax(vector<int> a) {
int MAX = -10000000;
for (int i = 0; i < a.size(); i++) {
if (MAX < a.at(i))
MAX = a.at(i);
}
return MAX;
}
/**
* @fn
* ζε°ε€γεγγΎγ.Vector<int>γζΈ‘γγγ¨.
*/
long long int imin(vector<int> a) {
int MIN = 1000000000;
for (int i = 0; i < a.size(); i++) {
if (MIN > a.at(i))
MIN = a.at(i);
}
return MIN;
}
/**
* @fn
* θͺηΆζ°γ«γ€γγ¦γζ‘ζ°γζ±γγ
*/
Int getDigit(Int num) { return (Int)(log10(num)) + 1; }
int get2Digit(Int num) {
int cnt = 0;
while (num > 0) {
if (num % 2 != 0) {
return cnt;
}
cnt++;
num /= 2;
}
}
long long int absmin(vector<int> a, long long int b) {
int mini = 100000000;
int d = 0;
for (int i = 0; i < a.size(); i++) {
if (mini > abs(a.at(i) - b)) {
mini = abs(a.at(i) - b);
d = i;
}
}
return d;
}
long long int absmax(vector<int> a, long long int b) {
int max = -100000000;
int d = 0;
for (int i = 0; i < a.size(); i++) {
if (max < abs(a.at(i) - b)) {
max = abs(a.at(i) - b);
d = i;
}
}
return d;
}
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b < 1)
return -1;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
void haerobatya(int start, int end, char level) {
if (start > end)
swap(start, end);
for (int i = start; i <= end; i++) {
if (i < 100) {
cout << "https://atcoder.jp/contests/abc0" << i << "/tasks/abc0" << i
<< "_" << level << endl;
} else {
cout << "https://atcoder.jp/contests/abc" << i << "/tasks/abc" << i << "_"
<< level << endl;
}
}
}
long long int cntmod(long long int warareru, long long int mod) {
long long int i = 0;
for (i = 0; true; i++) {
if (warareru % mod == 0 && warareru >= mod) {
warareru /= mod;
} else {
return i;
}
}
}
void ansYes(bool a) {
if (a == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ansYES(bool a) {
if (a == true)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
Int euclidean_gcd(Int a, Int b) {
while (true) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
typedef pair<int, int> pai;
//γγγΎγ§γ©γ€γγ©γͺ
//γγγγζ¬ζ
int main() {
int a, b, c;
cin >> a >> b >> c;
dump(c - min(c, a - b));
} | [
"expression.operation.binary.remove",
"call.arguments.change"
] | 752,431 | 752,430 | u959822889 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int t = c - (a - b);
if (c < 0)
c = 0;
cout << c << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int t = c - (a - b);
if (t < 0)
t = 0;
cout << t << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"io.output.change"
] | 752,432 | 752,433 | u192541825 | 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,436 | 752,437 | u525974535 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
#define ALL(x) x.begin(), x.end()
#define X first
#define Y second
#define ACCEL \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef pair<pll, lli> p3l;
typedef vector<int> vcI;
typedef vector<lli> vcL;
typedef vector<pii> vPI;
typedef vector<pll> vPL;
typedef vector<p3l> v3L;
typedef vector<vcL> vvL;
// typedef priority_queue<T> prior_S<T>;
// typedef priority_queue< T, vector<T>, greater<T> > prior_B<T>;
const double PI = 3.141592653589793;
const lli I_MAX = 1LL << 60;
lli mod = 1000000007;
/// templates ///
const lli maxN = 2E5;
vcL inv(maxN + 5, 1);
vcL fac(maxN + 5, 1);
void ADD(lli &x, lli y) {
x += y;
if (x >= mod)
x -= mod;
if (x < 0)
x += mod;
}
void MUL(lli &x, lli y) {
x *= y;
x = (x % mod + mod) % mod;
}
lli mypow(lli b, lli e) {
lli ans = 1;
while (e) {
if (e & 1)
MUL(ans, b);
MUL(b, b);
e >>= 1;
}
return ans;
}
lli modinv(lli n) { return mypow(n, mod - 2); }
void calcInv(lli n) {
for (int i = 2; i <= n; ++i) {
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
}
}
void calcFac(lli n) {
for (int i = 2; i <= n; ++i) {
fac[i] = fac[i - 1] * i % mod;
}
}
lli cm(lli a, lli b) {
lli ans = 1;
if (a < b)
return 0;
MUL(ans, inv[fac[a - b]]);
MUL(ans, inv[fac[b]]);
MUL(ans, fac[a]);
return ans;
}
lli Lucas(lli n, lli m) {
if (m == 0)
return 1;
return cm(n % mod, m % mod) * Lucas(n / mod, m / mod) % mod;
}
lli doLucas(lli n, lli m) {
calcInv(mod);
calcFac(mod);
return Lucas(n, m);
}
/// coding area ///
const lli maxn = 1E5;
void precal() { return; }
void solve() {
lli a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << '\n';
}
int main() {
precal();
int t = 1;
#ifdef LOCAL
t = INT_MAX;
#else
ACCEL;
#endif
// cin >> t;
for (int i = 1; i <= t; ++i) {
// printf("Case #%d: ", i );
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
#define ALL(x) x.begin(), x.end()
#define X first
#define Y second
#define ACCEL \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef pair<pll, lli> p3l;
typedef vector<int> vcI;
typedef vector<lli> vcL;
typedef vector<pii> vPI;
typedef vector<pll> vPL;
typedef vector<p3l> v3L;
typedef vector<vcL> vvL;
// typedef priority_queue<T> prior_S<T>;
// typedef priority_queue< T, vector<T>, greater<T> > prior_B<T>;
const double PI = 3.141592653589793;
const lli I_MAX = 1LL << 60;
lli mod = 1000000007;
/// templates ///
const lli maxN = 2E5;
vcL inv(maxN + 5, 1);
vcL fac(maxN + 5, 1);
void ADD(lli &x, lli y) {
x += y;
if (x >= mod)
x -= mod;
if (x < 0)
x += mod;
}
void MUL(lli &x, lli y) {
x *= y;
x = (x % mod + mod) % mod;
}
lli mypow(lli b, lli e) {
lli ans = 1;
while (e) {
if (e & 1)
MUL(ans, b);
MUL(b, b);
e >>= 1;
}
return ans;
}
lli modinv(lli n) { return mypow(n, mod - 2); }
void calcInv(lli n) {
for (int i = 2; i <= n; ++i) {
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
}
}
void calcFac(lli n) {
for (int i = 2; i <= n; ++i) {
fac[i] = fac[i - 1] * i % mod;
}
}
lli cm(lli a, lli b) {
lli ans = 1;
if (a < b)
return 0;
MUL(ans, inv[fac[a - b]]);
MUL(ans, inv[fac[b]]);
MUL(ans, fac[a]);
return ans;
}
lli Lucas(lli n, lli m) {
if (m == 0)
return 1;
return cm(n % mod, m % mod) * Lucas(n / mod, m / mod) % mod;
}
lli doLucas(lli n, lli m) {
calcInv(mod);
calcFac(mod);
return Lucas(n, m);
}
/// coding area ///
const lli maxn = 1E5;
void precal() { return; }
void solve() {
lli a, b, c;
cin >> a >> b >> c;
cout << max(0LL, c - (a - b)) << '\n';
}
int main() {
precal();
int t = 1;
#ifdef LOCAL
t = INT_MAX;
#else
ACCEL;
#endif
// cin >> t;
for (int i = 1; i <= t; ++i) {
// printf("Case #%d: ", i );
solve();
}
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,443 | 752,444 | u516708338 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(obj) (obj).begin, (obj).end()
#define SORT(list) sort(ALL((list)));
using namespace std;
using ll = long long;
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;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(obj) (obj).begin, (obj).end()
#define SORT(list) sort(ALL((list)));
using namespace std;
using ll = long long;
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;
} | [] | 752,445 | 752,446 | u988076584 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int A, B, C;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> A >> B >> C;
cout << C - (A - B) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int A, B, C;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 752,456 | 752,457 | u482969053 | cpp |
p02951 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min({c, c - (a - b), 0});
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b));
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"call.arguments.change"
] | 752,463 | 752,464 | u488087935 | cpp |
p02951 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min({c, c - (a - b)});
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b));
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"call.arguments.change"
] | 752,465 | 752,464 | u488087935 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define debug(x) cerr << #x << " = " << x << "\n"
#define debugv(x) \
rep(i, x.size()) cerr << x[i] << (i == x.size() - 1 ? "\n" : " ")
#define all(x) x.begin(), x.end()
#define int long long
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = ((1LL << 30) + (1LL << 29));
const int MOD = 1000000007;
//=============================
int N, M, K;
string S, T;
vector<int> A;
vector<int> B;
//=============================
void input() { cin >> N >> M >> K; }
//=============================
void func() {}
//=============================
void solve() {
int a, b, c;
a = N;
b = M;
c = K;
int hairu = a - b;
cout << c - hairu << endl;
}
//=============================
signed main() {
input();
solve();
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define debug(x) cerr << #x << " = " << x << "\n"
#define debugv(x) \
rep(i, x.size()) cerr << x[i] << (i == x.size() - 1 ? "\n" : " ")
#define all(x) x.begin(), x.end()
#define int long long
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = ((1LL << 30) + (1LL << 29));
const int MOD = 1000000007;
//=============================
int N, M, K;
string S, T;
vector<int> A;
vector<int> B;
//=============================
void input() { cin >> N >> M >> K; }
//=============================
void func() {}
//=============================
void solve() {
int a, b, c;
a = N;
b = M;
c = K;
int hairu = a - b;
cout << max(0LL, c - hairu) << endl;
}
//=============================
signed main() {
input();
solve();
return 0;
} | [
"call.add",
"call.arguments.change"
] | 752,466 | 752,467 | u265065462 | cpp |
p02951 | /*input
12 3 7
*/
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vpll vector<pair<long long, long long>>
#define fill(a, val) memset(a, val, sizeof(a))
#define sort_unique(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define mp make_pair
#define pb push_back
#define f first
#define se second
#define all(cont) cont.begin(), cont.end()
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MAX 1e9
#define MIN -1e9
typedef map<long long int, long long int> mpi;
typedef set<long long int> seti;
typedef multiset<long long int> mseti;
typedef priority_queue<long long int> pq;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define rep(i, n) for (long long int i = 0; i < (n); ++i)
#define repA(i, a, n) for (ll i = a; i <= (n); ++i)
#define repD(i, a, n) for (ll i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
#define repn(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define PI 3.14159265
#define dbg(x) cerr << "\n" << (#x) << " = " << (x) << endl;
//#define cerr if(false)cerr
#define mod 998244353
struct node {
ll val;
};
struct Interval {
int start, end;
};
bool compare(struct node n1, struct node n2) { return (n1.val < n2.val); }
int main() {
ll a, b, c;
cin >> b >> a >> c;
ll fila = b - a;
ll used = min(fila, c);
cout << min(0LL, c - fila) << endl;
return 0;
}
| /*input
12 3 7
*/
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vpll vector<pair<long long, long long>>
#define fill(a, val) memset(a, val, sizeof(a))
#define sort_unique(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define mp make_pair
#define pb push_back
#define f first
#define se second
#define all(cont) cont.begin(), cont.end()
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MAX 1e9
#define MIN -1e9
typedef map<long long int, long long int> mpi;
typedef set<long long int> seti;
typedef multiset<long long int> mseti;
typedef priority_queue<long long int> pq;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define rep(i, n) for (long long int i = 0; i < (n); ++i)
#define repA(i, a, n) for (ll i = a; i <= (n); ++i)
#define repD(i, a, n) for (ll i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
#define repn(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define PI 3.14159265
#define dbg(x) cerr << "\n" << (#x) << " = " << (x) << endl;
//#define cerr if(false)cerr
#define mod 998244353
struct node {
ll val;
};
struct Interval {
int start, end;
};
bool compare(struct node n1, struct node n2) { return (n1.val < n2.val); }
int main() {
ll a, b, c;
cin >> b >> a >> c;
ll fila = b - a;
ll used = min(fila, c);
cout << max(0LL, c - fila) << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,468 | 752,469 | u627347690 | cpp |
p02951 | /*input
1 100
*/
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vpll vector<pair<long long, long long>>
#define fill(a, val) memset(a, val, sizeof(a))
#define sort_unique(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define mp make_pair
#define pb push_back
#define f first
#define se second
#define all(cont) cont.begin(), cont.end()
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MAX 1e9
#define MIN -1e9
typedef map<long long int, long long int> mpi;
typedef set<long long int> seti;
typedef multiset<long long int> mseti;
typedef priority_queue<long long int> pq;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define rep(i, n) for (long long int i = 0; i < (n); ++i)
#define repA(i, a, n) for (ll i = a; i <= (n); ++i)
#define repD(i, a, n) for (ll i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
#define repn(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define PI 3.14159265
#define dbg(x) cerr << "\n" << (#x) << " = " << (x) << endl;
//#define cerr if(false)cerr
#define mod 998244353
struct node {
ll val;
};
struct Interval {
int start, end;
};
bool compare(struct node n1, struct node n2) { return (n1.val < n2.val); }
int main() {
ll a, b, c;
cin >> b >> a >> c;
ll fila = b - a;
ll used = min(fila, c);
cout << c - fila << endl;
return 0;
}
| /*input
12 3 7
*/
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vpll vector<pair<long long, long long>>
#define fill(a, val) memset(a, val, sizeof(a))
#define sort_unique(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define mp make_pair
#define pb push_back
#define f first
#define se second
#define all(cont) cont.begin(), cont.end()
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MAX 1e9
#define MIN -1e9
typedef map<long long int, long long int> mpi;
typedef set<long long int> seti;
typedef multiset<long long int> mseti;
typedef priority_queue<long long int> pq;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define rep(i, n) for (long long int i = 0; i < (n); ++i)
#define repA(i, a, n) for (ll i = a; i <= (n); ++i)
#define repD(i, a, n) for (ll i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
#define repn(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define PI 3.14159265
#define dbg(x) cerr << "\n" << (#x) << " = " << (x) << endl;
//#define cerr if(false)cerr
#define mod 998244353
struct node {
ll val;
};
struct Interval {
int start, end;
};
bool compare(struct node n1, struct node n2) { return (n1.val < n2.val); }
int main() {
ll a, b, c;
cin >> b >> a >> c;
ll fila = b - a;
ll used = min(fila, c);
cout << max(0LL, c - fila) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,470 | 752,469 | u627347690 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b);
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0);
} | [
"call.add",
"call.arguments.add"
] | 752,473 | 752,474 | u208357890 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin(), X.end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define shosu(X) fixed << setprecision(X)
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 - (min(a, b + c) - a) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin(), X.end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define shosu(X) fixed << setprecision(X)
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 - (min(a, b + c) - b) << endl;
} | [
"identifier.change",
"io.output.change"
] | 752,475 | 752,476 | u086355897 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin(), X.end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define shosu(X) fixed << setprecision(X)
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 << min(a, b + c) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin(), X.end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define shosu(X) fixed << setprecision(X)
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 - (min(a, b + c) - b) << endl;
} | [
"expression.operation.binary.add"
] | 752,477 | 752,476 | u086355897 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B + C > A)
cout << A - B - C << 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 << B + C - A << endl;
else
cout << 0 << endl;
}
| [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 752,497 | 752,498 | u732571394 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
//--
cout << (C - (A - B));
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
//--
cout << max(0, (C - (A - B)));
}
| [
"call.add",
"call.arguments.change"
] | 752,507 | 752,508 | u206133536 | cpp |
p02951 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int A, B, C;
void solve() {
int result = C - (A - B);
if (result > 0)
printf("%d", result);
else
printf(0);
}
int main() {
scanf("%d %d %d", &A, &B, &C);
solve();
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int A, B, C;
void solve() {
int result = C - (A - B);
if (result > 0)
printf("%d", result);
else
printf("%d", 0);
}
int main() {
scanf("%d %d %d", &A, &B, &C);
solve();
} | [
"call.arguments.add"
] | 752,509 | 752,510 | u835561357 | 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);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b));
} | [
"expression.operation.binary.remove"
] | 752,511 | 752,512 | u427083104 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int c, a, b;
cin >> a >> b >> c;
cout << min(c - a + b, 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int c, a, b;
cin >> a >> b >> c;
cout << max(c - a + b, 0) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,516 | 752,517 | u727223350 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int c, a, b;
cin >> c >> a >> b;
if (c > (a - b))
cout << b + c - a << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int c, a, b;
cin >> a >> b >> c;
if (c > (a - b))
cout << b + c - a << endl;
else
cout << 0 << endl;
} | [
"expression.operation.binary.remove"
] | 752,518 | 752,519 | u727223350 | 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;
else
cout << C - (A - B);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B + C < A)
cout << 0;
else
cout << C - (A - B);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,522 | 752,523 | u131357627 | cpp |
p02951 | #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 <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"
] | 752,526 | 752,527 | u193690465 | 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,528 | 752,527 | u193690465 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > 0)
cout << c - a + b;
else
cout << 0;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - a + b > 0)
cout << c - a + b;
else
cout << 0;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 752,529 | 752,530 | u621527413 | cpp |
p02951 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int a, s, d;
cin >> a >> s >> d;
d -= a;
d += s;
if (d > 0) {
cout << d - a + s << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int a, s, d;
cin >> a >> s >> d;
d -= a;
d += s;
if (d > 0) {
cout << d << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 752,536 | 752,537 | u116662310 | cpp |
p02951 | /***
* __ __ _ _ _
* | \/ | | | | | | |
* | \ / |_ __ | | | |_ __ | | ___ __ _____ ___ __
* | |\/| | '__| | | | | '_ \| |/ / '_ \ / _ \ \ /\ / / '_ \
* | | | | | _ | |__| | | | | <| | | | (_) \ V V /| | | |
* |_| |_|_| (_) \____/|_| |_|_|\_\_| |_|\___/ \_/\_/ |_| |_|
*
*
***/
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
/*---------------for_stuff-------------------*/
#define f(i, a, b) for (int i = a; i <= b; i++)
#define f_(i, a, b) for (int i = a; i >= b; i--)
/*---------------pair_stuff------------------*/
#define MP make_pair
#define ii pair<int, int>
#define Iii pair<int, ii>
#define ill pair<int, ll>
#define lli pair<ll, int>
#define iiI pair<ii, int>
#define llll pair<ll, ll>
#define fi first
#define se second
/*--------------vector_stuff-----------------*/
#define pb push_back
#define ppb pop_back
/*--------------const_stuff-----------------*/
const ll mod = 1000000007;
/*--------------map_stuff--------------------*/
// why do you think I should write something in this part? :v
int a, b, c;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
cin >> a >> b >> c;
cout << c - (a - b);
return 0;
} | /***
* __ __ _ _ _
* | \/ | | | | | | |
* | \ / |_ __ | | | |_ __ | | ___ __ _____ ___ __
* | |\/| | '__| | | | | '_ \| |/ / '_ \ / _ \ \ /\ / / '_ \
* | | | | | _ | |__| | | | | <| | | | (_) \ V V /| | | |
* |_| |_|_| (_) \____/|_| |_|_|\_\_| |_|\___/ \_/\_/ |_| |_|
*
*
***/
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
/*---------------for_stuff-------------------*/
#define f(i, a, b) for (int i = a; i <= b; i++)
#define f_(i, a, b) for (int i = a; i >= b; i--)
/*---------------pair_stuff------------------*/
#define MP make_pair
#define ii pair<int, int>
#define Iii pair<int, ii>
#define ill pair<int, ll>
#define lli pair<ll, int>
#define iiI pair<ii, int>
#define llll pair<ll, ll>
#define fi first
#define se second
/*--------------vector_stuff-----------------*/
#define pb push_back
#define ppb pop_back
/*--------------const_stuff-----------------*/
const ll mod = 1000000007;
/*--------------map_stuff--------------------*/
// why do you think I should write something in this part? :v
int a, b, c;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
cin >> a >> b >> c;
cout << max(c - (a - b), 0);
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,548 | 752,549 | u108124198 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define int64_t long long
constexpr int64_t MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
int a, b, c;
cin >> a >> b >> c;
cout << (c - (a - b)) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int64_t long long
constexpr int64_t MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, (c - (a - b))) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,550 | 752,551 | u333874529 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << c - a + b;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - a + b);
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,552 | 752,553 | u759497274 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << min(b + c - a, 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(b + c - a, 0) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,554 | 752,555 | u594742844 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, c;
cin >> a >> b >> c;
ll res = 0;
res = c - a + b;
if (res > 0)
cout << res << '\n';
else
cout << "0n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, c;
cin >> a >> b >> c;
ll res = 0;
res = c - a + b;
if (res > 0)
cout << res << '\n';
else
cout << "0\n";
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 752,556 | 752,557 | u624892251 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, c;
cin >> a >> b >> c;
ll res = 0;
res = a - c + b;
if (res > 0)
cout << res << '\n';
else
cout << "0n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, c;
cin >> a >> b >> c;
ll res = 0;
res = c - a + b;
if (res > 0)
cout << res << '\n';
else
cout << "0\n";
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change",
"literal.string.change",
"io.output.change"
] | 752,558 | 752,557 | u624892251 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int n;
int main() {
cin >> a >> b >> c;
n = b + c;
if (n <= a)
cout << 0 << endl;
else
cout << a - n << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int n;
int main() {
cin >> a >> b >> c;
n = b + c;
if (n <= a)
cout << 0 << endl;
else
cout << n - a << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 752,561 | 752,562 | u194031646 | cpp |
p02951 | using namespace std;
#include <algorithm>
#include <iostream>
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
ll mod = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
}
| using namespace std;
#include <algorithm>
#include <iostream>
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
ll 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,567 | 752,568 | u981068718 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MAX_INT 10e9
int main() {
int a, b, c;
cin >> a >> b >> c;
int remain = b - a;
if (c > remain)
cout << c - remain;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MAX_INT 10e9
int main() {
int a, b, c;
cin >> a >> b >> c;
int remain = a - b;
if (c > remain)
cout << c - remain;
else
cout << 0 << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 752,569 | 752,570 | u293991054 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<ll, ll> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<Pll> vp;
typedef vector<bool> vb;
#define rep(i, a, n) for (ll i = (a); i < (n); ++i)
#define rrep(i, a, n) for (ll i = (a); i > (n); --i)
#define erep(i, a, n) for (ll i = (a); i <= (n); ++i)
#define rerep(i, a, n) for (ll i = (a); i >= (n); --i)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define mp make_pair
#define sz(x) ((int)x.size())
#define SORT(x) sort(all(x))
#define RSORT(x) sort(all(x), greater<ll>())
#define vec_max(V) *max_element(all(V))
#define vec_min(V) *min_element(all(V))
#define vec_sum(V) accumulate(all(V), 0LL)
#define print(X) cout << (X) << "\n"
#define _ << " " <<
#define Yes print("Yes")
#define No print("No")
static const int INF = 1e+9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - a - b > 0)
print(c - a - b);
else
print(0);
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<ll, ll> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<Pll> vp;
typedef vector<bool> vb;
#define rep(i, a, n) for (ll i = (a); i < (n); ++i)
#define rrep(i, a, n) for (ll i = (a); i > (n); --i)
#define erep(i, a, n) for (ll i = (a); i <= (n); ++i)
#define rerep(i, a, n) for (ll i = (a); i >= (n); --i)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define mp make_pair
#define sz(x) ((int)x.size())
#define SORT(x) sort(all(x))
#define RSORT(x) sort(all(x), greater<ll>())
#define vec_max(V) *max_element(all(V))
#define vec_min(V) *min_element(all(V))
#define vec_sum(V) accumulate(all(V), 0LL)
#define print(X) cout << (X) << "\n"
#define _ << " " <<
#define Yes print("Yes")
#define No print("No")
static const int INF = 1e+9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - (a - b) > 0)
print(c - (a - b));
else
print(0);
return 0;
}
| [
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 752,578 | 752,579 | u103539599 | 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;
else
cout << c;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > a - b)
cout << c - a + b;
else
cout << 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 752,584 | 752,585 | u400251600 | cpp |
p02951 | #include <iostream>
using namespace std;
int a, b, c;
void solve() { cout << max(b + c - a, 0) << endl; }
int main() { cin >> a >> b >> c; } | #include <iostream>
using namespace std;
int a, b, c;
void solve() { cout << max(b + c - a, 0) << endl; }
int main() {
cin >> a >> b >> c;
solve();
} | [
"call.add"
] | 752,589 | 752,590 | u550178285 | cpp |
p02951 | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int A, B, C;
scanf("%d%d%d", &A, &B, &C);
printf("%d\n", min(0, C - (A - B)));
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int A, B, C;
scanf("%d%d%d", &A, &B, &C);
printf("%d\n", max(0, C - (A - B)));
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 752,591 | 752,592 | u962441451 | cpp |
p02951 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, kq;
cin >> a >> b >> c;
kq = c - (a - b) > 0 ? c - (a - b) > 0 : 0;
cout << kq << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, kq;
cin >> a >> b >> c;
kq = c - (a - b) > 0 ? c - (a - b) : 0;
cout << kq << endl;
}
| [
"expression.operation.binary.remove"
] | 752,597 | 752,598 | u151224155 | cpp |
p02951 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
int d;
cin >> a >> b >> c;
d = c - (a - b);
if (d < 0)
d == 0;
cout << d << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
int d;
cin >> a >> b >> c;
d = c - (a - b);
if (d < 0)
d = 0;
cout << d << endl;
return 0;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 752,599 | 752,600 | u796377207 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
max(b + c - a, 0);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(b + c - a, 0);
} | [
"io.output.change"
] | 752,610 | 752,611 | u589381719 | cpp |
p02951 | // JSD
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a - b, c);
return 0;
} | // JSD
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - min(a - b, c);
return 0;
} | [
"expression.operation.binary.add"
] | 752,633 | 752,634 | u436019023 | cpp |
p02951 | #include <bits/stdc++.h>
#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;
int d = a - b;
if (c <= d)
cout << a << endl;
else
cout << (c - d) << 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;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = a - b;
if (c <= d)
cout << 0 << endl;
else
cout << (c - d) << endl;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 752,638 | 752,639 | u558073934 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define range(i, l, r) for (int i = (int)l; i < (int)(r); ++(i))
#define rrange(i, l, r) for (int i = ((int)(r)-1); i >= (int)l; --(i))
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
#define rwhole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(rbegin(whole), rend(whole), ##__VA_ARGS__); \
})(x)
#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl
using int32 = int;
using int64 = long long;
const int mod = 1e9 + 7;
const int32 inf = 1001001001;
const int64 infll = 1001001001001001001ll;
const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1},
dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};
const string YES = "YES", NO = "NO", Yes = "Yes", No = "No", yes = "yes",
no = "no";
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(16);
cerr << fixed << setprecision(16);
}
} iosetup;
template <typename T = int64> T input() {
T x;
cin >> x;
return x;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); }
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
os << p.fs << " " << p.sc;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.fs >> p.sc;
return is;
}
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void solver() {
int A = input(), B = input(), C = input();
cout << C - (A - B) << endl;
}
signed main(int argc, char *argv[]) { solver(); }
| #include <bits/stdc++.h>
using namespace std;
#define range(i, l, r) for (int i = (int)l; i < (int)(r); ++(i))
#define rrange(i, l, r) for (int i = ((int)(r)-1); i >= (int)l; --(i))
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
#define rwhole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(rbegin(whole), rend(whole), ##__VA_ARGS__); \
})(x)
#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl
using int32 = int;
using int64 = long long;
const int mod = 1e9 + 7;
const int32 inf = 1001001001;
const int64 infll = 1001001001001001001ll;
const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1},
dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};
const string YES = "YES", NO = "NO", Yes = "Yes", No = "No", yes = "yes",
no = "no";
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(16);
cerr << fixed << setprecision(16);
}
} iosetup;
template <typename T = int64> T input() {
T x;
cin >> x;
return x;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); }
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
os << p.fs << " " << p.sc;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.fs >> p.sc;
return is;
}
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void solver() {
int A = input(), B = input(), C = input();
cout << max(0, C - (A - B)) << endl;
}
signed main(int argc, char *argv[]) { solver(); }
| [
"call.add",
"call.arguments.change"
] | 752,649 | 752,650 | u802071009 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(C + B - A, 0) << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C + B - A, 0) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,660 | 752,661 | u058186113 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
#define ALL(x) (x.begin(), x.end())
using namespace std;
int main() {
ll a, b, c;
cin >> a >> b >> c;
auto d = c - (b - a);
if (d >= 0)
cout << d << endl;
else
cout << 0 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
#define ALL(x) (x.begin(), x.end())
using namespace std;
int main() {
ll a, b, c;
cin >> a >> b >> c;
auto d = c - (a - b);
if (d >= 0)
cout << d << endl;
else
cout << 0 << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 752,673 | 752,674 | u546736430 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int a, b, c;
cin >> a >> b >> c;
a -= b;
cout << min(0, c - a) << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int a, b, c;
cin >> a >> b >> c;
a -= b;
cout << max(0, c - a) << '\n';
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,678 | 752,679 | u617619153 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int a, b, c;
cin >> a >> b >> c;
a -= b;
cout << c - a << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int a, b, c;
cin >> a >> b >> c;
a -= b;
cout << max(0, c - a) << '\n';
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,680 | 752,679 | u617619153 | cpp |
p02951 | /*
Rohit645
Rohit Kumar
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using pll = pair<ll, ll>;
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define fastIo() \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
const int MOD = 1e9 + 7, INF = INT_MAX, N = 1e5 + 10;
int main() {
fastIo();
ll a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | /*
Rohit645
Rohit Kumar
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using pll = pair<ll, ll>;
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define fastIo() \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
const int MOD = 1e9 + 7, INF = INT_MAX, N = 1e5 + 10;
int main() {
fastIo();
ll a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0ll) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,689 | 752,690 | u206390872 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = a - b;
cout << max(0, 3 - x);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = a - b;
cout << max(0, c - x);
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 752,709 | 752,710 | u006069211 | cpp |
p02951 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c, ans;
cin >> a >> b >> c;
int buf = a - b;
cout << (buf < c) ? c - buf : 0;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c, ans;
cin >> a >> b >> c;
int buf = a - b;
cout << ((buf < c) ? c - buf : 0);
}
| [] | 752,711 | 752,712 | u784849232 | cpp |
p02951 | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
i64 a, b, c;
cin >> a >> b >> c;
cout << max(0LL, c - a - b) << endl;
return 0;
}
| #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
i64 a, b, c;
cin >> a >> b >> c;
cout << max(0LL, c - a + b) << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 752,718 | 752,719 | u623115612 | cpp |
p02951 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, ret;
cin >> a >> b >> c;
ret = max(c - (b - a), 0);
cout << ret << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, ret;
cin >> a >> b >> c;
ret = max(c - (a - b), 0);
cout << ret << endl;
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 752,722 | 752,723 | u601718430 | cpp |
p02951 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = (c - (a - b) > 0) ? c - (a - b) : 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = (c - (a - b) > 0) ? c - (a - b) : 0;
cout << ans;
}
| [] | 752,724 | 752,725 | u754576689 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define maxch(x, y) x = mmax(x, y)
#define minch(x, y) x = mmin(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt __builtin_popcountll
#define INF 1e16
#define mod 1000000007
ll a, b, c;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define maxch(x, y) x = mmax(x, y)
#define minch(x, y) x = mmin(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt __builtin_popcountll
#define INF 1e16
#define mod 1000000007
ll a, b, c;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b >> c;
cout << max(0LL, c - (a - b)) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,732 | 752,733 | u762921614 | cpp |
p02951 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define debug(x) cerr << #x << ": " << x << endl;
const int MOD = 1e9 + 7;
signed main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define debug(x) cerr << #x << ": " << x << endl;
const int MOD = 1e9 + 7;
signed main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << max(0ll, c - (a - b)) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 752,736 | 752,737 | u076865901 | cpp |
p02951 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - a - b) << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - a + b) << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 752,744 | 752,745 | u359856428 | cpp |
p02951 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << min(0, c - a - b) << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
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",
"expression.operator.arithmetic.change"
] | 752,746 | 752,745 | u359856428 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b));
}
| [
"call.add",
"call.arguments.change"
] | 752,753 | 752,754 | u542075673 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ft first
#define sd second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define db long double
#define vbi vector<bool>
#define vlli vector<long long int>
#define mp make_pair
#define ms(x, v) memset(x, v, sizeof x)
#define cnl printf("\n");
#define fr(i, b) for (ll i = 0; i <= b; i++)
#define frr(i, b) for (ll i = 0; i < b; i++)
#define fb(i, b) for (ll i = b - 1; i >= 0; i--)
#define PI 3.14159265
const int maxn = 100000;
ll i, j, k;
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll d = a - b;
if (d > c)
cout << c << endl;
else
cout << (c - d) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ft first
#define sd second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define db long double
#define vbi vector<bool>
#define vlli vector<long long int>
#define mp make_pair
#define ms(x, v) memset(x, v, sizeof x)
#define cnl printf("\n");
#define fr(i, b) for (ll i = 0; i <= b; i++)
#define frr(i, b) for (ll i = 0; i < b; i++)
#define fb(i, b) for (ll i = b - 1; i >= 0; i--)
#define PI 3.14159265
const int maxn = 100000;
ll i, j, k;
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll 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"
] | 752,762 | 752,763 | u126288554 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a, b + c);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (b + c) - min(a, b + c);
return 0;
} | [
"expression.operation.binary.add"
] | 752,771 | 752,772 | u433162241 | cpp |
p02951 | #include <bits/stdc++.h>
//#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_popcountll(n)
using namespace std;
// using namespace __gnu_cxx;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const double PI = acos(-1.0), EPS = 1e-6;
const long long inf = 2e12 + 12;
const int MAXN = 400005, MAXM = 102, Mod = 1000000007, MAXLog = 20;
int main() {
#ifndef ONLINE_JUDGE
// freopen("input.txt", "rt", stdin);
// freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0), cout.precision(9),
cout << fixed;
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << '\n';
return 0;
}
| #include <bits/stdc++.h>
//#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_popcountll(n)
using namespace std;
// using namespace __gnu_cxx;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const double PI = acos(-1.0), EPS = 1e-6;
const long long inf = 2e12 + 12;
const int MAXN = 400005, MAXM = 102, Mod = 1000000007, MAXLog = 20;
int main() {
#ifndef ONLINE_JUDGE
// freopen("input.txt", "rt", stdin);
// freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0), cout.precision(9),
cout << fixed;
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << '\n';
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,777 | 752,778 | u381626581 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define INF LLONG_MAX
#define PI acos(-1)
const ll MOD = 1e9 + 7;
#define fir first
#define sec second
#define all(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(c, a, b) for (ll c = a; c < b; c++)
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define min_heap priority_queue<pll, vector<pll>, greater<pll>>
ll dx4[] = {-1, 1, 0, 0};
ll dy4[] = {0, 0, -1, 1};
ll dx8[] = {-1, -1, -1, 0, 1, 1, 1, 0};
ll dy8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
ll a[200][200];
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(c - a + b, 0);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define INF LLONG_MAX
#define PI acos(-1)
const ll MOD = 1e9 + 7;
#define fir first
#define sec second
#define all(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(c, a, b) for (ll c = a; c < b; c++)
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define min_heap priority_queue<pll, vector<pll>, greater<pll>>
ll dx4[] = {-1, 1, 0, 0};
ll dy4[] = {0, 0, -1, 1};
ll dx8[] = {-1, -1, -1, 0, 1, 1, 1, 0};
ll dy8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
ll a[200][200];
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - a + b, 0);
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,779 | 752,780 | u152447503 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define INF LLONG_MAX
#define PI acos(-1)
const ll MOD = 1e9 + 7;
#define fir first
#define sec second
#define all(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(c, a, b) for (ll c = a; c < b; c++)
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define min_heap priority_queue<pll, vector<pll>, greater<pll>>
ll dx4[] = {-1, 1, 0, 0};
ll dy4[] = {0, 0, -1, 1};
ll dx8[] = {-1, -1, -1, 0, 1, 1, 1, 0};
ll dy8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
ll a[200][200];
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << c - a + b;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define INF LLONG_MAX
#define PI acos(-1)
const ll MOD = 1e9 + 7;
#define fir first
#define sec second
#define all(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(c, a, b) for (ll c = a; c < b; c++)
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define min_heap priority_queue<pll, vector<pll>, greater<pll>>
ll dx4[] = {-1, 1, 0, 0};
ll dy4[] = {0, 0, -1, 1};
ll dx8[] = {-1, -1, -1, 0, 1, 1, 1, 0};
ll dy8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
ll a[200][200];
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - a + b, 0);
} | [
"variable_declaration.type.change",
"call.add",
"call.arguments.add"
] | 752,781 | 752,780 | u152447503 | cpp |
p02951 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A, B, C;
int aaa = A - B;
if (aaa > C) {
cout << 0 << endl;
} else {
cout << C - aaa << endl;
}
}
| #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int aaa = A - B;
if (aaa > C) {
cout << 0 << endl;
} else {
cout << C - aaa << endl;
}
}
| [] | 752,782 | 752,783 | u725345450 | cpp |
p02951 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A, B, C;
int aaa = A - B;
if (aaa >= C) {
cout << 0 << endl;
} else {
cout << C - aaa << endl;
}
}
| #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int aaa = A - B;
if (aaa > C) {
cout << 0 << endl;
} else {
cout << C - aaa << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,785 | 752,783 | u725345450 | cpp |
p02951 | #ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#if !defined(LOCAL) && !defined(DEBUG)
#pragma GCC optimize("Ofast")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#define stdin_filename "stdin.txt"
#define stdout_filename "stdout.txt"
#define stderr_filename "stderr.txt"
#define iostream_untie true
#define stdout_precision 10
#define stderr_precision 10
#define itrep(i, v) for (auto i = begin(v); i != end(v); ++i)
#define ritrep(i, v) for (auto i = rbegin(v); i != rend(v); ++i)
#define rep(i, n) for (int_fast64_t i = 0; i < (int_fast64_t)(n); ++i)
#define rrep(i, n) for (int_fast64_t i = (int_fast64_t)(n)-1; i >= 0; --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcount
using namespace std;
using i64 = int_fast64_t;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pll = pair<int_fast64_t, int_fast64_t>;
template <class T> using heap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T>
constexpr T inf = numeric_limits<T>::max() / (T)2 - (T)123456;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double Pi = 3.1415926535897932384626433832;
constexpr long double Golden = 1.61803398874989484820;
namespace setup {
struct setupper {
setupper() {
if (iostream_untie) {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
std::cerr.tie(nullptr);
}
std::cout << std::fixed << std::setprecision(stdout_precision);
std::cerr << std::fixed << std::setprecision(stderr_precision);
#ifdef LOCAL
if (!freopen(stderr_filename, "wt", stderr)) {
freopen("CON", "wt", stderr);
std::cerr << "Failed to open the stderr file\n";
}
if (!freopen(stdout_filename, "wt", stdout)) {
freopen("CON", "wt", stdout);
std::cerr << "Failed to open the stdout file\n";
}
if (!freopen(stdin_filename, "rt", stdin)) {
freopen("CON", "rt", stdin);
std::cerr << "Failed to open the stdin file.\n";
}
// auto print_atexit = []() {
// std::cerr << "Exec time : " << clock() / (double)CLOCKS_PER_SEC *
// 1000.0 << "ms\n"; std::cerr << "------------\n";
// };
// atexit((void(*)())print_atexit);
#endif
}
} __setupper;
} // namespace setup
namespace std {
template <class RAitr> void rsort(RAitr __first, RAitr __last) {
sort(__first, __last, greater<>());
}
template <class T> void hash_combine(size_t &seed, T const &key) {
seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
template <class T, class U> struct hash<pair<T, U>> {
size_t operator()(pair<T, U> const &pr) const {
size_t seed = 0;
hash_combine(seed, pr.first);
hash_combine(seed, pr.second);
return seed;
}
};
template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1>
struct hashval_calc {
static void apply(size_t &seed, tuple_t const &t) {
hashval_calc<tuple_t, index - 1>::apply(seed, t);
hash_combine(seed, get<index>(t));
}
};
template <class tuple_t> struct hashval_calc<tuple_t, 0> {
static void apply(size_t &seed, tuple_t const &t) {
hash_combine(seed, get<0>(t));
}
};
template <class... T> struct hash<tuple<T...>> {
size_t operator()(tuple<T...> const &t) const {
size_t seed = 0;
hashval_calc<tuple<T...>>::apply(seed, t);
return seed;
}
};
} // namespace std
template <class T, class U> istream &operator>>(istream &s, pair<T, U> &p) {
return s >> p.first >> p.second;
}
template <class T, class U>
ostream &operator<<(ostream &s, const pair<T, U> p) {
return s << p.first << " " << p.second;
}
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &e : v) {
s >> e;
}
return s;
}
template <class T> ostream &operator<<(ostream &s, const vector<T> &v) {
for (size_t i = 0; i < v.size(); ++i) {
s << (i ? " " : "") << v[i];
}
return s;
}
template <class tuple_t, size_t index> struct tupleos {
static ostream &apply(ostream &s, const tuple_t &t) {
tupleos<tuple_t, index - 1>::apply(s, t);
return s << " " << get<index>(t);
}
};
template <class tuple_t> struct tupleos<tuple_t, 0> {
static ostream &apply(ostream &s, const tuple_t &t) { return s << get<0>(t); }
};
template <class... T> ostream &operator<<(ostream &s, const tuple<T...> &t) {
return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(s, t);
}
template <> ostream &operator<<(ostream &s, const tuple<> &t) { return s; }
#ifdef DEBUG
#define dump(...) \
cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ \
<< " : ", \
dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
template <class T> void dump_func(T x) { cerr << x << '\n'; }
template <class T, class... Rest> void dump_func(T x, Rest... rest) {
cerr << x << ",";
dump_func(rest...);
}
template <class T> void write(T x) { cout << x << '\n'; }
template <class T, class... Rest> void write(T x, Rest... rest) {
cout << x << ' ';
write(rest...);
}
void writeln() {}
template <class T, class... Rest> void writeln(T x, Rest... rest) {
cout << x << '\n';
writeln(rest...);
}
#define esc(...) writeln(__VA_ARGS__), exit(0)
template <class P> void read(P __first, P __second) {
for (P i = __first; i != __second; ++i)
cin >> *i;
}
namespace updater {
template <class T> static void add(T &x, const T &y) { x += y; }
template <class T> static void ext_add(T &x, const T &y, size_t w) {
x += y * w;
}
template <class T> static void mul(T &x, const T &y) { x *= y; }
template <class T> static void ext_mul(T &x, const T &y, size_t w) {
x *= (T)pow(y, w);
}
template <class T> static bool chmax(T &x, const T &y) {
return x < y ? x = y, true : false;
}
template <class T> static bool chmin(T &x, const T &y) {
return x > y ? x = y, true : false;
}
}; // namespace updater
using updater::add;
using updater::chmax;
using updater::chmin;
using updater::mul;
template <class T> constexpr T minf(const T &x, const T &y) {
return min(x, y);
}
template <class T> constexpr T maxf(const T &x, const T &y) {
return max(x, y);
}
constexpr bool bit(i64 n, int e) { return (n >> e) & 1; }
constexpr int_fast64_t mask(int_fast64_t n, int e) {
return n & ((1 << e) - 1);
}
constexpr int ilog(int_fast64_t x, int_fast64_t b = 2) {
return x ? 1 + ilog(x / b, b) : -1;
}
int_fast64_t binry(int_fast64_t ok, int_fast64_t ng,
const function<bool(int_fast64_t)> &fn) {
while (abs(ok - ng) > 1) {
int_fast64_t mid = (ok + ng) / 2;
(fn(mid) ? ok : ng) = mid;
}
return ok;
}
template <class A, size_t N, class T> void init(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
template <class T> vector<int> cmprs(const vector<T> &v) {
vector<T> tmp = v;
vector<int> ret;
sort(begin(tmp), end(tmp));
tmp.erase(unique(begin(tmp), end(tmp)), end(tmp));
for (T i : v)
ret.emplace_back(lower_bound(begin(tmp), end(tmp), i) - begin(tmp));
return ret;
}
template <class T> vector<int> cmprs(const T *__first, const T *__last) {
return cmprs(vector<T>(__first, __last));
}
void for_subset(int_fast64_t s, const function<void(int_fast64_t)> &fn) {
int_fast64_t tmp = s;
do {
fn(tmp);
} while ((--tmp &= s) != s);
}
/* The main code follows. */
int a, b, c;
void solve() { cout << min(a, b + c) - b << endl; }
signed main() {
cin >> a >> b >> c;
solve();
}
| #ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#if !defined(LOCAL) && !defined(DEBUG)
#pragma GCC optimize("Ofast")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#define stdin_filename "stdin.txt"
#define stdout_filename "stdout.txt"
#define stderr_filename "stderr.txt"
#define iostream_untie true
#define stdout_precision 10
#define stderr_precision 10
#define itrep(i, v) for (auto i = begin(v); i != end(v); ++i)
#define ritrep(i, v) for (auto i = rbegin(v); i != rend(v); ++i)
#define rep(i, n) for (int_fast64_t i = 0; i < (int_fast64_t)(n); ++i)
#define rrep(i, n) for (int_fast64_t i = (int_fast64_t)(n)-1; i >= 0; --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcount
using namespace std;
using i64 = int_fast64_t;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pll = pair<int_fast64_t, int_fast64_t>;
template <class T> using heap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T>
constexpr T inf = numeric_limits<T>::max() / (T)2 - (T)123456;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double Pi = 3.1415926535897932384626433832;
constexpr long double Golden = 1.61803398874989484820;
namespace setup {
struct setupper {
setupper() {
if (iostream_untie) {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
std::cerr.tie(nullptr);
}
std::cout << std::fixed << std::setprecision(stdout_precision);
std::cerr << std::fixed << std::setprecision(stderr_precision);
#ifdef LOCAL
if (!freopen(stderr_filename, "wt", stderr)) {
freopen("CON", "wt", stderr);
std::cerr << "Failed to open the stderr file\n";
}
if (!freopen(stdout_filename, "wt", stdout)) {
freopen("CON", "wt", stdout);
std::cerr << "Failed to open the stdout file\n";
}
if (!freopen(stdin_filename, "rt", stdin)) {
freopen("CON", "rt", stdin);
std::cerr << "Failed to open the stdin file.\n";
}
// auto print_atexit = []() {
// std::cerr << "Exec time : " << clock() / (double)CLOCKS_PER_SEC *
// 1000.0 << "ms\n"; std::cerr << "------------\n";
// };
// atexit((void(*)())print_atexit);
#endif
}
} __setupper;
} // namespace setup
namespace std {
template <class RAitr> void rsort(RAitr __first, RAitr __last) {
sort(__first, __last, greater<>());
}
template <class T> void hash_combine(size_t &seed, T const &key) {
seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
template <class T, class U> struct hash<pair<T, U>> {
size_t operator()(pair<T, U> const &pr) const {
size_t seed = 0;
hash_combine(seed, pr.first);
hash_combine(seed, pr.second);
return seed;
}
};
template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1>
struct hashval_calc {
static void apply(size_t &seed, tuple_t const &t) {
hashval_calc<tuple_t, index - 1>::apply(seed, t);
hash_combine(seed, get<index>(t));
}
};
template <class tuple_t> struct hashval_calc<tuple_t, 0> {
static void apply(size_t &seed, tuple_t const &t) {
hash_combine(seed, get<0>(t));
}
};
template <class... T> struct hash<tuple<T...>> {
size_t operator()(tuple<T...> const &t) const {
size_t seed = 0;
hashval_calc<tuple<T...>>::apply(seed, t);
return seed;
}
};
} // namespace std
template <class T, class U> istream &operator>>(istream &s, pair<T, U> &p) {
return s >> p.first >> p.second;
}
template <class T, class U>
ostream &operator<<(ostream &s, const pair<T, U> p) {
return s << p.first << " " << p.second;
}
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &e : v) {
s >> e;
}
return s;
}
template <class T> ostream &operator<<(ostream &s, const vector<T> &v) {
for (size_t i = 0; i < v.size(); ++i) {
s << (i ? " " : "") << v[i];
}
return s;
}
template <class tuple_t, size_t index> struct tupleos {
static ostream &apply(ostream &s, const tuple_t &t) {
tupleos<tuple_t, index - 1>::apply(s, t);
return s << " " << get<index>(t);
}
};
template <class tuple_t> struct tupleos<tuple_t, 0> {
static ostream &apply(ostream &s, const tuple_t &t) { return s << get<0>(t); }
};
template <class... T> ostream &operator<<(ostream &s, const tuple<T...> &t) {
return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(s, t);
}
template <> ostream &operator<<(ostream &s, const tuple<> &t) { return s; }
#ifdef DEBUG
#define dump(...) \
cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ \
<< " : ", \
dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
template <class T> void dump_func(T x) { cerr << x << '\n'; }
template <class T, class... Rest> void dump_func(T x, Rest... rest) {
cerr << x << ",";
dump_func(rest...);
}
template <class T> void write(T x) { cout << x << '\n'; }
template <class T, class... Rest> void write(T x, Rest... rest) {
cout << x << ' ';
write(rest...);
}
void writeln() {}
template <class T, class... Rest> void writeln(T x, Rest... rest) {
cout << x << '\n';
writeln(rest...);
}
#define esc(...) writeln(__VA_ARGS__), exit(0)
template <class P> void read(P __first, P __second) {
for (P i = __first; i != __second; ++i)
cin >> *i;
}
namespace updater {
template <class T> static void add(T &x, const T &y) { x += y; }
template <class T> static void ext_add(T &x, const T &y, size_t w) {
x += y * w;
}
template <class T> static void mul(T &x, const T &y) { x *= y; }
template <class T> static void ext_mul(T &x, const T &y, size_t w) {
x *= (T)pow(y, w);
}
template <class T> static bool chmax(T &x, const T &y) {
return x < y ? x = y, true : false;
}
template <class T> static bool chmin(T &x, const T &y) {
return x > y ? x = y, true : false;
}
}; // namespace updater
using updater::add;
using updater::chmax;
using updater::chmin;
using updater::mul;
template <class T> constexpr T minf(const T &x, const T &y) {
return min(x, y);
}
template <class T> constexpr T maxf(const T &x, const T &y) {
return max(x, y);
}
constexpr bool bit(i64 n, int e) { return (n >> e) & 1; }
constexpr int_fast64_t mask(int_fast64_t n, int e) {
return n & ((1 << e) - 1);
}
constexpr int ilog(int_fast64_t x, int_fast64_t b = 2) {
return x ? 1 + ilog(x / b, b) : -1;
}
int_fast64_t binry(int_fast64_t ok, int_fast64_t ng,
const function<bool(int_fast64_t)> &fn) {
while (abs(ok - ng) > 1) {
int_fast64_t mid = (ok + ng) / 2;
(fn(mid) ? ok : ng) = mid;
}
return ok;
}
template <class A, size_t N, class T> void init(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
template <class T> vector<int> cmprs(const vector<T> &v) {
vector<T> tmp = v;
vector<int> ret;
sort(begin(tmp), end(tmp));
tmp.erase(unique(begin(tmp), end(tmp)), end(tmp));
for (T i : v)
ret.emplace_back(lower_bound(begin(tmp), end(tmp), i) - begin(tmp));
return ret;
}
template <class T> vector<int> cmprs(const T *__first, const T *__last) {
return cmprs(vector<T>(__first, __last));
}
void for_subset(int_fast64_t s, const function<void(int_fast64_t)> &fn) {
int_fast64_t tmp = s;
do {
fn(tmp);
} while ((--tmp &= s) != s);
}
/* The main code follows. */
int a, b, c;
void solve() { cout << c - min(a, b + c) + b << endl; }
signed main() {
cin >> a >> b >> c;
solve();
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 752,787 | 752,788 | u629015299 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - a + b;
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);
return 0;
} | [
"call.add",
"call.arguments.change"
] | 752,791 | 752,792 | u058348416 | cpp |
p02951 | #include <bits/stdc++.h>
#define ll long long
#define FOR(i, l, r) for (int i = l; i <= r; ++i)
#define inf 1 << 30
#define EPS (1e-9)
#define ALL(T) T.begin(), T.end()
#define lson(i) i << 1
#define rson(i) (i << 1 | 1)
using namespace std;
typedef pair<int, int> pii;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << b + c - a << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define FOR(i, l, r) for (int i = l; i <= r; ++i)
#define inf 1 << 30
#define EPS (1e-9)
#define ALL(T) T.begin(), T.end()
#define lson(i) i << 1
#define rson(i) (i << 1 | 1)
using namespace std;
typedef pair<int, int> pii;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, b + c - a) << endl;
} | [
"call.add",
"call.arguments.change"
] | 752,793 | 752,794 | u704309145 | cpp |
p02951 | #include <iostream>
int main() {
int A = 0;
int B = 0;
int C = 0;
std::cin >> A >> B >> C;
int tmp = (A - B);
if (tmp <= C) {
std::cout << C - tmp << std::endl;
} else {
std::cout << C << std::endl;
}
}; | #include <iostream>
int main() {
int A = 0;
int B = 0;
int C = 0;
std::cin >> A >> B >> C;
int tmp = (A - B);
if (tmp < C) {
std::cout << C - tmp << std::endl;
} else {
std::cout << 0 << std::endl;
}
}; | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 752,804 | 752,805 | u607139498 | cpp |
p02951 | #include <iostream>
int main() {
int A = 0;
int B = 0;
int C = 0;
std::cin >> A >> B >> C;
int tmp = (A - B);
if (tmp < C) {
std::cout << C - tmp << std::endl;
} else {
std::cout << C << std::endl;
}
}; | #include <iostream>
int main() {
int A = 0;
int B = 0;
int C = 0;
std::cin >> A >> B >> C;
int tmp = (A - B);
if (tmp < C) {
std::cout << C - tmp << std::endl;
} else {
std::cout << 0 << std::endl;
}
}; | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 752,806 | 752,805 | u607139498 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int Bottle1, Bottle2, Bottle3;
int ans;
cin >> Bottle1 >> Bottle2 >> Bottle3;
ans = Bottle3 + Bottle2 - Bottle1;
if (ans >= 0) {
cout << "0";
cout << endl;
} else {
cout << ans;
cout << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int Bottle1, Bottle2, Bottle3;
int ans;
cin >> Bottle1 >> Bottle2 >> Bottle3;
ans = Bottle3 + Bottle2 - Bottle1;
if (ans <= 0) {
cout << "0";
cout << endl;
} else {
cout << ans;
cout << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,809 | 752,810 | u233411376 | cpp |
p02951 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - b + a) << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c + b - a) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 752,819 | 752,820 | u352642493 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - a + b;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - a + b, 0);
} | [
"call.add",
"call.arguments.add"
] | 752,825 | 752,826 | u222252114 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 1; i <= (n); i++)
#define rep0(i, n) for (ll i = 0; i < (n); i++)
const ll INF = 1e9 + 7;
int main() {
/*freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 1; i <= (n); i++)
#define rep0(i, n) for (ll i = 0; i < (n); i++)
const ll INF = 1e9 + 7;
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));
return 0;
} | [
"call.add",
"call.arguments.change"
] | 752,831 | 752,832 | u698284709 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
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;
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,840 | 752,841 | u197878507 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int a, b, c;
int ans;
int main() {
cin >> a >> b >> c;
ans = c - (a - b);
if (ans <= 0) {
cout << ans << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int a, b, c;
int ans;
int main() {
cin >> a >> b >> c;
ans = c - (a - b);
if (ans >= 0) {
cout << ans << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,842 | 752,843 | u694422786 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A - B < C) {
cout << C - (A - B) << endl;
}
if (A - B > C) {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A - B < C) {
cout << C - (A - B) << endl;
}
if (A - B >= C) {
cout << 0 << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,852 | 752,853 | u372512262 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b;
cout << max(c + b - a, 0) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c + b - a, 0) << endl;
}
| [
"expression.operation.binary.add"
] | 752,854 | 752,855 | u339937125 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b;
cout << max(a + b - c, 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c + b - a, 0) << endl;
}
| [
"identifier.change",
"io.output.change"
] | 752,856 | 752,855 | u339937125 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.