problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); ... | [
"call.arguments.add"
] | 751,763 | 751,764 | u281168735 | cpp |
p02951 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - a + b << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - a + b) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 751,769 | 751,770 | u135957438 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A >= B + C) {
cout << "0" << endl;
} else {
cout << C - B + A << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A >= B + C) {
cout << "0" << endl;
} else {
cout << C - A + B << endl;
}
}
| [
"expression.operation.binary.remove"
] | 751,771 | 751,772 | u776280752 | cpp |
p02951 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << endl;
return 0;
... | [
"call.add",
"call.arguments.add"
] | 751,777 | 751,778 | u261538386 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using names... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using names... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 751,779 | 751,780 | u276969395 | cpp |
p02951 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 751,788 | 751,789 | u813728438 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - b + a) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c + b - a) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 751,796 | 751,797 | u176218583 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = c - (a - b);
if (d > 0) {
cout << d;
}
if (d < 0) {
cout << "0";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = c - (a - b);
if (d > 0) {
cout << d;
}
if (d <= 0) {
cout << "0";
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 751,798 | 751,799 | u173252932 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define strall(v) (v).cbegin(), (v).cend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, cl... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define strall(v) (v).cbegin(), (v).cend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, cl... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 751,804 | 751,805 | u106635407 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | [
"call.add",
"call.arguments.add"
] | 751,806 | 751,807 | u852862907 | cpp |
p02951 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + c < b) {
cout << 0;
} else {
cout << a + c - b;
}
cout << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c < a) {
cout << 0;
} else {
cout << b + c - a;
}
cout << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 751,810 | 751,811 | u992779443 | cpp |
p02951 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main()... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main()... | [
"call.add",
"call.arguments.add"
] | 751,829 | 751,830 | u729285002 | cpp |
p02951 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << B + C - A << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(B + C - A, 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 751,839 | 751,840 | u906839513 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = c - a - b;
if (x > 0)
cout << x;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = c - a + b;
if (x > 0)
cout << x;
else
cout << 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 751,847 | 751,848 | u411916435 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vvd = vector<vd>;
#define out(a) cout << a << endl
#define out1(a) cout << a
#define in(a) cin >> a
#define in2(a, b) cin ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vvd = vector<vd>;
#define out(a) cout << a << endl
#define out1(a) cout << a
#define in(a) cin >> a
#define in2(a, b) cin ... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 751,851 | 751,852 | u789673251 | cpp |
p02951 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#d... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#d... | [
"call.add",
"call.arguments.add"
] | 751,855 | 751,856 | u050698451 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define int long long
#defi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define int long long
#defi... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 751,859 | 751,860 | u809967037 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 751,861 | 751,862 | u459105164 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | [
"call.add",
"call.arguments.change"
] | 751,863 | 751,864 | u989306199 | cpp |
p02951 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
int D = A - B;
if (D > C) {
cout << C << endl;
} else {
cout << D << end... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
int D = A - B;
if (D > C) {
cout << 0 << endl;
} else {
cout << C - D <<... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 751,870 | 751,871 | u605901675 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"call.add",
"call.arguments.change"
] | 751,872 | 751,873 | u917049698 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = C - (B - A);
if (ans < 0) {
cout << 0 << endl;
} else {
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = C - (A - B);
if (ans < 0) {
cout << 0 << endl;
} else {
cout << ans << endl;
}
} | [
"expression.operation.binary.remove"
] | 751,886 | 751,887 | u050641473 | cpp |
p02951 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(0, c - (a - b)) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 751,890 | 751,891 | u611571299 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(a, b + c) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << b + c - min(a, b + c) << endl;
}
| [
"io.output.change"
] | 751,892 | 751,893 | u559578080 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, a - (b + c));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, (b + c) - a);
return 0;
} | [
"expression.operation.binary.remove"
] | 751,898 | 751,899 | u248554859 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b > c)
cout << 0;
else
cout << a - b - c;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b > c)
cout << 0;
else
cout << c - (a - b);
} | [
"io.output.change"
] | 751,904 | 751,905 | u873762144 | cpp |
p02951 | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define INF 1e9
#define LINF 1e17
#defin... | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define INF 1e9
#define LINF 1e17
#defin... | [
"call.add",
"call.arguments.change"
] | 751,906 | 751,907 | u705296057 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
}
| [
"call.arguments.change"
] | 751,908 | 751,909 | u718758485 | cpp |
p02951 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// int t=1 ; cin>>t ; while(t--)
{
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << '\n';
}
cerr << "Time elapsed : " << 1.0 * clock() / CLOCKS_PER_... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// int t=1 ; cin>>t ; while(t--)
{
int a, b, c;
cin >> a >> b >> c;
cout << max(0LL, c - (a - b)) << '\n';
}
cerr << "Time elapsed : " << 1.0 * clock() / C... | [
"call.add",
"call.arguments.change"
] | 751,917 | 751,918 | u514096386 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - (a - b) > 0) {
cout << c - (a - b) << endl;
} else
;
cout << 0 << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - (a - b) > 0) {
cout << c - (a - b) << endl;
} else {
cout << 0 << endl;
}
} | [] | 751,925 | 751,926 | u480172743 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int temp = a - b;
int ret = c - temp;
if (ret < 0)
cout << "0";
cout << ret << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int temp = a - b;
int ret = c - temp;
if (ret < 0)
cout << "0";
else
cout << ret << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 751,934 | 751,935 | u655908411 | cpp |
p02951 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c <= a + b) {
cout << 0 << endl;
} else {
cout << c - (a - b) << endl;
}
} | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c <= a - b) {
cout << 0 << endl;
} else {
cout << c - (a - b) << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 751,940 | 751,941 | u956853629 | cpp |
p02951 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 751,944 | 751,945 | u715366261 | cpp |
p02951 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random... | [
"expression.operation.binary.add"
] | 751,948 | 751,949 | u811004127 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 751,950 | 751,951 | u113298224 | cpp |
p02951 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 751,955 | 751,956 | u284124505 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define PB push_back
#define loop(i, x, y) for (int i = x; i < y; i++)
#define rloop(i, x, y) for (int i = x; i > y; i--)
#define NL cout << "\n"
#define ans(x) cout << x << "\n"
#define out(x) cout << x << " "
#define F first
#define S second
#define an... | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define PB push_back
#define loop(i, x, y) for (int i = x; i < y; i++)
#define rloop(i, x, y) for (int i = x; i > y; i--)
#define NL cout << "\n"
#define ans(x) cout << x << "\n"
#define out(x) cout << x << " "
#define F first
#define S second
#define an... | [] | 751,959 | 751,960 | u684763756 | cpp |
p02951 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
}
| [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 751,961 | 751,962 | u894339989 | cpp |
p02951 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - min((A - B), C) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 751,963 | 751,964 | u251410638 | cpp |
p02951 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 751,963 | 751,965 | u251410638 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b >= c) {
cout << c << endl;
return 0;
} else {
cout << c - a + b << endl;
return 0;
}
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b >= c) {
cout << 0 << endl;
return 0;
} else {
cout << c - a + b << endl;
return 0;
}
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 751,983 | 751,984 | u648009244 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a - b;
c = c - d;
if (c - d < 0) {
c = 0;
}
cout << c;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a - b;
d = c - d;
if (d < 0) {
d = 0;
}
cout << d;
return (0);
} | [
"assignment.variable.change",
"identifier.change",
"expression.operation.binary.remove",
"io.output.change"
] | 751,990 | 751,991 | u130985356 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a - b + c;
if (d > 0)
cout << d;
else
cout << 0;
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = -a + b + c;
if (d > 0)
cout << d;
else
cout << 0;
cout << endl;
return 0;
} | [
"assignment.change"
] | 751,996 | 751,997 | u340494803 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed <... | [
"assignment.change"
] | 751,998 | 751,999 | u774417629 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, w, h) rep(j, h) rep(i, w)
#define rrep(i, m, n) for (int i ... | #include <bits/stdc++.h>
using namespace std;
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, w, h) rep(j, h) rep(i, w)
#define rrep(i, m, n) for (int i ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 752,007 | 752,008 | u539011156 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 752,017 | 752,018 | u204973596 | cpp |
p02951 | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int r = a - b;
cout << c - r;
return 0;
}
| #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int r = a - b;
cout << max(0, c - r);
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,019 | 752,020 | u616461826 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, a, b) for (int i = a; i < b; ++i)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
//プロトタイプ宣言
int gcd(int, int);
void often(void);
int main() {
often();
int a, b, c;
cin >> a >... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, a, b) for (int i = a; i < b; ++i)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
//プロトタイプ宣言
int gcd(int, int);
void often(void);
int main() {
often();
int a, b, c;
cin >> a >... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 752,021 | 752,022 | u060965067 | cpp |
p02951 | #include <bits/stdc++.h>
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define pii pair<int, int>
#define REP(i, a) for (int(i) = 0; (i) < (a); (i)++)
#define RREP(i, a) for (int(i) = a - 1; (i) >= (0); (i)--)
#define REP2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define MOD 10000... | #include <bits/stdc++.h>
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define pii pair<int, int>
#define REP(i, a) for (int(i) = 0; (i) < (a); (i)++)
#define RREP(i, a) for (int(i) = a - 1; (i) >= (0); (i)--)
#define REP2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define MOD 10000... | [
"call.add",
"call.arguments.change"
] | 752,023 | 752,024 | u997020010 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | [] | 752,028 | 752,029 | u681869152 | cpp |
p02951 | #include <bits/stdc++.h>
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define rep(i, n) for (long long int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (long long int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (long long int i = (a); i > (b); i--)
using namespace std;
int main(... | #include <bits/stdc++.h>
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define rep(i, n) for (long long int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (long long int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (long long int i = (a); i > (b); i--)
using namespace std;
int main(... | [
"call.add",
"call.arguments.add"
] | 752,033 | 752,034 | u979078704 | cpp |
p02951 | /*
Author: Arham_doshi
@quote "Code like there's no tommorow!"
*************************************** UNAUTHORISED COPYING OF CODE
PROHIBITED **********************************
*/
#include <bits/stdc++.h>
#define int long long
#define double long double
#define pb push_back
#define pf push_front
#define pii pair... | /*
Author: Arham_doshi
@quote "Code like there's no tommorow!"
*************************************** UNAUTHORISED COPYING OF CODE
PROHIBITED **********************************
*/
#include <bits/stdc++.h>
#define int long long
#define double long double
#define pb push_back
#define pf push_front
#define pii pair... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 752,039 | 752,040 | u488763956 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > (a - b))
cout << c - (a - b);
if (c < (a - b))
cout << 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > (a - b))
cout << c - (a - b);
if (c <= (a - b))
cout << 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,041 | 752,042 | u365178348 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lo... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lo... | [
"call.add",
"call.arguments.change"
] | 752,046 | 752,047 | u371702445 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = c - (a - b);
if (d < 0)
d == 0;
cout << d;
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = c - (a - b);
if (d < 0)
d = 0;
cout << d;
cout << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 752,051 | 752,052 | u195132800 | cpp |
p02951 | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A - B - C) > 0)
cout << abs(A - B - C) << endl;
else
cout << "0" << endl;
return 0;
}
| #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A - B - C) < 0)
cout << abs(A - B - C) << endl;
else
cout << "0" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,057 | 752,058 | u163149221 | cpp |
p02951 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifndef orewabaka
#define f first
#define s second
#define minna(a) a.begin(), a.end()
#define ovse(a) a.rbegin(), a.rend()
#define pb push_back
#define endl aut '\n'... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifndef orewabaka
#define f first
#define s second
#define minna(a) a.begin(), a.end()
#define ovse(a) a.rbegin(), a.rend()
#define pb push_back
#define endl aut '\n'... | [
"variable_declaration.value.change",
"call.arguments.add"
] | 752,059 | 752,060 | u539322713 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | [
"expression.operation.binary.remove"
] | 752,068 | 752,069 | u861345985 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | [
"call.add",
"call.arguments.change"
] | 752,072 | 752,073 | u334351654 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = c - (a - b);
if (x < 0)
cout << "0" << endl;
else
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = c - (a - b);
if (x < 0)
cout << "0" << endl;
else
cout << x << endl;
} | [
"identifier.change",
"io.output.change"
] | 752,074 | 752,075 | u805397017 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 752,082 | 752,083 | u696290869 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"call.add",
"call.arguments.change"
] | 752,084 | 752,083 | u696290869 | cpp |
p02951 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>
#define int long long
using namespace std;
void Main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
}
int32_t main() {
Main();
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>
#define int long long
using namespace std;
void Main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(0LL, C - (A - B)) << endl;
}
int32_t main() {
Main();
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,085 | 752,086 | u790502959 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UI... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UI... | [
"call.add",
"call.arguments.change"
] | 752,091 | 752,092 | u275797573 | cpp |
p02951 | #include <iostream>
int main() {
int a, b, c, ans;
std::cin >> a >> b >> c;
if (a - b >= c) {
ans = 0;
} else {
ans == c - (a - b);
}
std::cout << ans << std::endl;
}
| #include <iostream>
int main() {
int a, b, c, ans;
std::cin >> a >> b >> c;
if (a - b >= c) {
ans = 0;
} else {
ans = c - (a - b);
}
std::cout << ans << std::endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 752,107 | 752,108 | u425830382 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans;
ans = c - (a - b);
if (ans < 0)
ans = -ans;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans;
ans = c - (a - b);
if (ans < 0)
ans = 0;
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"expression.operation.unary.remove"
] | 752,112 | 752,113 | u405620865 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long ll;
const int mod = 1e9 + 7;
const ll inf = 3e18 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
int sol = ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long ll;
const int mod = 1e9 + 7;
const ll inf = 3e18 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
int sol = ... | [
"call.add",
"call.arguments.add"
] | 752,116 | 752,117 | u788461451 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 752,128 | 752,129 | u688422725 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A + B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
} | [
"call.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"call.arguments.add"
] | 752,131 | 752,129 | u688422725 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (c - (a + b) < 0)
std::cout << "0";
else
std::cout << (c - a + b);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (c - (a - b) < 0)
std::cout << "0";
else
std::cout << (c - a + b);
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 752,134 | 752,135 | u063873990 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
C = C - (A - B);
if (C < 0) {
C = 0;
}
cout << C - (A - B) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
C = C - (A - B);
if (C < 0) {
C = 0;
}
cout << C << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 752,138 | 752,139 | u980909653 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (b - a)) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 752,140 | 752,141 | u813181182 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c >= a)
cout << 0 << endl;
else
cout << b + c - a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c <= a)
cout << 0 << endl;
else
cout << b + c - a << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,148 | 752,149 | u168774513 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - a > 0) {
cout << (c - a) + b << endl;
} else {
cout << 0 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - a + b > 0) {
cout << (c - a) + b << endl;
} else {
cout << 0 << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 752,152 | 752,153 | u280329066 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
int main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
int main(... | [
"identifier.change",
"io.output.change"
] | 752,154 | 752,155 | u657208344 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
template... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
template... | [
"expression.operation.binary.add"
] | 752,161 | 752,162 | u309470177 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
template... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
template... | [
"expression.operation.binary.add"
] | 752,163 | 752,162 | u309470177 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 752,166 | 752,167 | u915882515 | cpp |
p02951 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << std::max((c - (b - a)), 0) << "\n";
return 0;
} | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << std::max((c - (a - b)), 0) << "\n";
return 0;
} | [
"expression.operation.binary.remove"
] | 752,170 | 752,171 | u131209962 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = c - a - b;
if (ans < 0)
ans = 0;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
ans = c - (a - b);
if (ans < 0)
ans = 0;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.add"
] | 752,174 | 752,175 | u980485808 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 752,178 | 752,179 | u587665681 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, b + c - 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, b + c - a);
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 752,192 | 752,193 | u489172963 | cpp |
p02951 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A, B, C;
int s = max(0, C - (A - B));
cout << s;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int s = max(0, C - (A - B));
cout << s;
} | [] | 752,194 | 752,195 | u434355956 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, x;
cin >> a >> b >> c;
x = a - b;
if (x + c <= a) {
cout << 0;
}
else {
cout << c - x;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, x;
cin >> a >> b >> c;
x = a - b;
if (x > c) {
cout << 0;
}
else {
cout << c - x;
}
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 752,202 | 752,203 | u099297604 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << '\n';
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << '\n';
} | [
"call.add",
"call.arguments.change"
] | 752,204 | 752,205 | u452343113 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - b + a, 0) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - a + b, 0) << endl;
}
| [
"expression.operation.binary.remove"
] | 752,206 | 752,207 | u551813187 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
const ll in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
const ll in... | [
"call.add",
"call.arguments.change"
] | 752,208 | 752,209 | u620242073 | cpp |
p02951 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#defin... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#defin... | [
"call.add",
"call.arguments.add"
] | 752,226 | 752,227 | u340293807 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, S;
cin >> N >> M >> S;
N = N - M;
if (N - S < 0) {
cout << 0 << endl;
} else
cout << N - S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, S;
cin >> N >> M >> S;
N = N - M;
if (N - S > 0) {
cout << 0 << endl;
} else
cout << S - N << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 752,228 | 752,229 | u697858600 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - a + b << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - a + b) << endl;
} | [
"call.add",
"call.arguments.change"
] | 752,236 | 752,237 | u759721333 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
long long MOD = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
long long MOD = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,242 | 752,243 | u138597672 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c < a)
cout << c + b - a << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c > a)
cout << c + b - a << endl;
else
cout << 0 << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,249 | 752,250 | u319967566 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
a -= b;
cout << min(a, c) << '\n';
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
a -= b;
cout << c - min(a, c) << '\n';
return 0;
} | [
"expression.operation.binary.add"
] | 752,251 | 752,252 | u320367606 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define itn int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define range(a) a.begin(), a.end()
#define print(A, n) \
rep(i, 0, n) { cout << (i ? " " : "") << A[i]; } \
cout << e... | #include <bits/stdc++.h>
using namespace std;
#define itn int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define range(a) a.begin(), a.end()
#define print(A, n) \
rep(i, 0, n) { cout << (i ? " " : "") << A[i]; } \
cout << e... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,267 | 752,268 | u977554186 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,276 | 752,277 | u033602950 | cpp |
p02951 | #include <stdio.h>
int main(void) {
int A, B, C;
scanf("%d %d %d", &A, &B, &C);
if (B + C - A <= 0) {
printf("0");
printf("%d", B + C - A);
}
return 0;
} | #include <stdio.h>
int main(void) {
int A, B, C;
scanf("%d %d %d", &A, &B, &C);
if (B + C - A <= 0)
printf("0");
else {
printf("%d", B + C - A);
}
return 0;
}
| [
"control_flow.branch.else.add"
] | 752,278 | 752,279 | u195269284 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 752,284 | 752,285 | u424910800 | cpp |
p02951 | #include <iostream>
#include <string>
using namespace std;
int main() {
// 整数の入力
int a, b, c;
cin >> a >> b >> c;
int ret = c - (a - b);
cout << (ret >= 0) ? ret : 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
// 整数の入力
int a, b, c;
cin >> a >> b >> c;
int ret = c - (a - b);
cout << ((ret >= 0) ? ret : 0);
} | [] | 752,286 | 752,287 | u065261876 | cpp |
p02951 | #include <iostream>
#include <string>
using namespace std;
int main() {
// 整数の入力
int a, b, c;
cin >> a >> b >> c;
int ret = c - a - b;
cout << (ret >= 0) ? ret : 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
// 整数の入力
int a, b, c;
cin >> a >> b >> c;
int ret = c - (a - b);
cout << ((ret >= 0) ? ret : 0);
} | [] | 752,288 | 752,287 | u065261876 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - (a + b) > 0) {
cout << c - (a - b) << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - (a - b) > 0) {
cout << c - (a - b) << endl;
} else {
cout << 0 << endl;
}
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 752,295 | 752,296 | u959353968 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.