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;
} e... | #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 ... | [
"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 chma... | #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 chma... | [
"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... | #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... | [
"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 ... | #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 ... | [
"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 + ... | #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 + ... | [
"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"... | // 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"... | [
"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 l... | #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 l... | [
"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 l... | #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 l... | [
"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 ... | #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 ... | [
"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 n... | #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 n... | [] | 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 ... | #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 ... | [
"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) m... | /*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) m... | [
"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) me... | /*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) m... | [
"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>... | #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>... | [
"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>... | #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>... | [
"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 /| | | |
* |_| |_|_| (... | /***
* __ __ _ _ _
* | \/ | | | | | | |
* | \ / |_ __ | | | |_ __ | | ___ __ _____ ___ __
* | |\/| | '__| | | | | '_ \| |/ / '_ \ / _ \ \ /\ / / '_ \
* | | | | | _ | |__| | | | | <| | | | (_) \ V V /| | | |
* |_| |_|_| (... | [
"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... | #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... | [
"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) { ... | #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) { ... | [
"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 ... | /*
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 ... | [
"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 "=... | #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 "=... | [
"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)... |
#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)... | [
"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, ... | #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, ... | [
"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_popc... | #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_popc... | [
"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))
#de... | #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))
#de... | [
"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))
#de... | #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))
#de... | [
"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 <m... | #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 <m... | [
"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;... | #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;... | [
"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;
#defin... | #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;
#defin... | [
"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;
cou... | #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;
cou... | [
"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.