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 |
|---|---|---|---|---|---|---|---|
p02949 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 751,205 | 751,206 | u721367699 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define N 5050
typedef pair<int, int> pii;
typedef long long ll;
const ll inf = 1e18;
int n, m, p, head[N], nxt[N], to[N], w[N];
ll d[N];
void add_edge(int x, int y, int z, int id) {
to[id] = y, w[id] = z;
nxt[id] = head[x], head[x] = id;
}
queue<int> Q;
bool inq[N];
b... | #include <bits/stdc++.h>
using namespace std;
#define N 5050
typedef pair<int, int> pii;
typedef long long ll;
const ll inf = 1e18;
int n, m, p, head[N], nxt[N], to[N], w[N];
ll d[N];
void add_edge(int x, int y, int z, int id) {
to[id] = y, w[id] = z;
nxt[id] = head[x], head[x] = id;
}
queue<int> Q;
bool inq[N];
b... | [
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 751,216 | 751,217 | u074493292 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define ppi pair<pii, int>
#define pip pair<int, pii>
#define pdd pair<double, double>
#define f first
#define s second
#define MOD 1000000007
#defin... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define ppi pair<pii, int>
#define pip pair<int, pii>
#define pdd pair<double, double>
#define f first
#define s second
#define MOD 1000000007
#defin... | [] | 751,227 | 751,228 | u146724119 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | [
"call.add",
"call.arguments.change"
] | 751,244 | 751,245 | u901862155 | cpp |
p02950 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 751,255 | 751,256 | u190018920 | cpp |
p02950 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int, int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int, int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 751,263 | 751,264 | u839397805 | cpp |
p02950 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int, int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int, int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin... | [
"control_flow.branch.if.condition.change"
] | 751,263 | 751,265 | u839397805 | cpp |
p02950 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int, int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int, int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin... | [
"literal.number.change",
"call.arguments.change"
] | 751,268 | 751,267 | u839397805 | cpp |
p02950 | /*{{{*/
#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... | [
"expression.operation.unary.arithmetic.remove",
"call.arguments.change"
] | 751,273 | 751,274 | u284124505 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b, c;
cin >> a >> b >> c;
vector<ll> vec(3);
ll d = min(a + c, b);
cout << c - d + a << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b, c;
cin >> a >> b >> c;
vector<ll> vec(3);
ll d = min(a, b + c);
cout << c - d + b << endl;
return 0;
} | [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 751,281 | 751,282 | u883297128 | cpp |
p02951 | #include <bits/stdc++.h>
#define int long long
#define fast_io() \
; \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define int long long
#define fast_io() \
; \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"call.add",
"call.arguments.add"
] | 751,292 | 751,293 | u085634861 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i, a, b) for (int i = a; i <= b; ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i, a, b) for (int i = a; i <= b; ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
... | [
"call.add",
"call.arguments.change"
] | 751,294 | 751,295 | u128142444 | 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,302 | 751,303 | u596234104 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fastio ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fastio ... | [
"call.add",
"call.arguments.change"
] | 751,304 | 751,305 | u858929490 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = a - b;
int e = min(d, c);
int ans = d - e;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = a - b;
int e = min(d, c);
int ans = c - e;
cout << ans << endl;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 751,310 | 751,311 | u856957535 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = a - b;
int use = min(d, c);
int ans = d - use;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = a - b;
int e = min(d, c);
int ans = c - e;
cout << ans << endl;
}
| [
"variable_declaration.name.change",
"identifier.change",
"expression.operation.binary.change"
] | 751,312 | 751,311 | u856957535 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int A, B, C;
scanf("%d%d", &A, &B, &C);
printf("%d\n", max(0, C - A + B));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
int A, B, C;
scanf("%d%d%d", &A, &B, &C);
printf("%d\n", max(0, C - A + B));
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 751,313 | 751,314 | u208608367 | cpp |
p02951 | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unorder... | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unorder... | [
"call.arguments.add"
] | 751,319 | 751,320 | u539145601 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b >= c)
cout << a - b - c << endl;
else
cout << c - a + b << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b >= c)
cout << 0 << endl;
else
cout << c - a + b << endl;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"expression.operation.binary.remove"
] | 751,323 | 751,324 | u422506696 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9 + 7;
#define pi pair<int, int>
#define pl pair<lld, lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9 + 7;
#define pi pair<int, int>
#define pl pair<lld, lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n... | [
"call.add",
"call.arguments.change"
] | 751,327 | 751,328 | u118434175 | cpp |
p02951 | // Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
using namespace std;
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
... | // Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
using namespace std;
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
... | [
"call.add",
"call.arguments.change"
] | 751,329 | 751,330 | u572033996 | cpp |
p02951 | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int a, b, c, dif;
cin >> a >> b >> c;
dif = a - b;
c -= dif;
if (c < 0) {
cout << 0;
} else {
cout << c - dif;
}
return 0;
}
| #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int a, b, c, dif;
cin >> a >> b >> c;
dif = a - b;
c -= dif;
if (c < 0) {
cout << 0;
} else {
cout << c;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 751,340 | 751,341 | u701212130 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << B + C - A << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(B + C - A, 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 751,342 | 751,343 | u280966279 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
typedef long long ll;
const int Inf = 1e9;
const double EPS = 1e-9;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
typedef long long ll;
const int Inf = 1e9;
const double EPS = 1e-9;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 751,354 | 751,355 | u940569542 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << b + c - a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(b + c - a, 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 751,356 | 751,357 | u882098164 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
c = c + a - b;
if (c < 0)
cout << "0";
else
cout << c;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
c = c - a + b;
if (c < 0)
cout << "0";
else
cout << c;
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 751,365 | 751,366 | u086485448 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c = 0;
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 = 0;
cin >> a >> b >> c;
if (c - (a - b) > 0) {
cout << c - (a - b) << endl;
} else {
cout << "0" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 751,400 | 751,401 | u096025032 | cpp |
p02951 | #include <bits/stdc++.h>
#define lld long long int
#define vec vector<lld>
#define pll pair<lld, lld>
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
#define mod 1000000007
#define answer cout << endl << "answer : ";
#define maxn 100005
#define messi ... | #include <bits/stdc++.h>
#define lld long long int
#define vec vector<lld>
#define pll pair<lld, lld>
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
#define mod 1000000007
#define answer cout << endl << "answer : ";
#define maxn 100005
#define messi ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 751,404 | 751,405 | u606883845 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(a + c - b, 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(b + c - a, 0) << endl;
}
| [
"identifier.change",
"io.output.change"
] | 751,406 | 751,407 | u252211543 | 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(c - (a - b), 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 751,410 | 751,411 | u553321223 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef... | [
"expression.operation.binary.remove"
] | 751,424 | 751,425 | u934272719 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
int A, B, C;
cin >> A >> B >> C;
ans = C - (A - B);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
int A, B, C;
cin >> A >> B >> C;
ans = max(0, C - (A - B));
cout << ans << endl;
} | [
"call.add",
"call.arguments.change"
] | 751,426 | 751,427 | u446774692 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"call.add",
"call.arguments.change"
] | 751,439 | 751,440 | u110044127 | cpp |
p02951 | #include <iostream>
using namespace std;
int main(void) {
// 137
int A, B, C;
cin >> A >> B >> C;
if (A - B >= C) {
cout << "0" << endl;
} else if (A - B < C) {
cout << C - B << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
// 137
int A, B, C;
cin >> A >> B >> C;
if (A - B >= C) {
cout << "0" << endl;
} else if (A - B < C) {
cout << C - (A - B) << endl;
}
} | [] | 751,441 | 751,442 | u170558932 | cpp |
p02951 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
if (ans < 0) {
cout << "0" << endl;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
if (ans < 0) {
cout << "0" << endl;
} else {
cout << ans << endl;
}
return 0;
}
| [
"control_flow.branch.else.add"
] | 751,443 | 751,444 | u025892939 | cpp |
p02951 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int x;
x = b + c;
if (a < x) {
int ans;
ans = a - x;
cout << ans << endl;
} else
cout << "0" << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int x;
x = b + c;
if (a < x) {
int ans;
ans = x - a;
cout << ans << endl;
} else
cout << "0" << endl;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 751,445 | 751,446 | u178938628 | cpp |
p02951 | #include <iostream>
#include <math.h>
using namespace std;
int main(void) {
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
if (C < A - B) {
cout << A - C - B << endl;
}
if (C >= A - B) {
cout << 0 << endl;
return 0;
}
}
| #include <iostream>
#include <math.h>
using namespace std;
int main(void) {
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
if (C > A - B) {
cout << C - A + B << endl;
}
if (C <= A - B) {
cout << 0 << endl;
return 0;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 751,447 | 751,448 | u121251784 | cpp |
p02951 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int T;
T = B + C;
if (A >= T) {
cout << A - T << endl;
} else {
cout << T - A << endl;
}
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int T;
T = B + C;
if (A >= T) {
cout << 0 << endl;
} else {
cout << T - A << endl;
}
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"expression.operation.binary.remove"
] | 751,449 | 751,450 | u466018786 | cpp |
p02951 | /*
* cpp_filepath
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T> ostream &operator<<(ost... | /*
* cpp_filepath
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T> ostream &operator<<(ost... | [
"call.add",
"call.arguments.add"
] | 751,455 | 751,456 | u823862638 | cpp |
p02951 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define be(v) v.begin(), v.end()
#define ll long long
ll INF = 1e9;
ll mod = 1e9 + 7;
ll dp[10001];
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)
#define be(v) v.begin(), v.end()
#define ll long long
ll INF = 1e9;
ll mod = 1e9 + 7;
ll dp[10001];
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - min(c, a - b) << endl;
} | [
"call.add",
"call.arguments.add"
] | 751,463 | 751,464 | u769530239 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - a + b << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - a + b, 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 751,465 | 751,466 | u641900703 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | [
"expression.operation.binary.remove"
] | 751,469 | 751,470 | u832995587 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fast_io \
ios_base::sync_with_stdio(false); ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fast_io \
ios_base::sync_with_stdio(false); ... | [
"expression.operation.binary.remove"
] | 751,473 | 751,474 | u397886197 | cpp |
p02951 | #include <iostream>
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;
} | #include <iostream>
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);
} | [
"control_flow.branch.if.condition.change"
] | 751,475 | 751,476 | u509384866 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
int leave = a - b;
cout << max(a - b, 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
int leave = a - b;
cout << max(c - leave, 0) << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 751,481 | 751,482 | u442855610 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C;
D = min(B - A, C);
cout << C - D << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C;
D = min(A - B, C);
cout << C - D << endl;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 751,489 | 751,490 | u033273089 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c, N, ans = 0;
string S, T;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c, N, ans = 0;
string S, T;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 751,495 | 751,496 | u503052349 | cpp |
p02951 | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(... | [
"call.add",
"call.arguments.change"
] | 751,497 | 751,498 | u237054088 | 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,499 | 751,500 | u798950829 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, m) for (int i = n; i < m; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
using namespace std... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, m) for (int i = n; i < m; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
using namespace std... | [
"call.add",
"call.arguments.change"
] | 751,501 | 751,502 | u467480147 | cpp |
p02951 | /* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#define pi 2 * acos(0.0)
#define ll long long
#defin... | /* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#define pi 2 * acos(0.0)
#define ll long long
#defin... | [
"expression.operation.binary.remove"
] | 751,507 | 751,508 | u164081575 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 751,514 | 751,515 | u929156598 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - a - b < 0)
cout << "0";
else
cout << c - (a - b);
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - (a - b) < 0)
cout << "0";
else
cout << c - (a - b);
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 751,516 | 751,517 | u613326499 | 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"
] | 751,518 | 751,519 | u319965179 | 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 << 0 << endl;
} else {
cout << c - a + b << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - a + b < 0) {
cout << 0 << endl;
} else {
cout << c - a + b << endl;
}
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 751,524 | 751,525 | u453095051 | cpp |
p02951 | #include <bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a - (b + c);
if (ans > 0) {
cout << 0;
return 0;
}
if (ans < 0) {
cout << -1 * ans;
return 0;
}
} | #include <bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a - (b + c);
if (ans >= 0) {
cout << 0;
return 0;
}
if (ans < 0) {
cout << -1 * ans;
return 0;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 751,526 | 751,527 | u145562832 | 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;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - a + b) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 751,549 | 751,550 | u247123590 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b + c)
cout << c - a + b << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b + c)
cout << c - a + b << endl;
else
cout << 0 << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 751,551 | 751,552 | u945761460 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
if (ans < 0)
ans = 0;
cout << ans << endl;
return 0;
} | #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)
ans = 0;
cout << ans << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove"
] | 751,567 | 751,568 | u782700818 | cpp |
p02950 | #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.operator.change"
] | 751,579 | 751,580 | u309470177 | cpp |
p02950 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int p;
cin >> p;
auto mod = [&](int x) { return (x % p + p) % p; };
// Let g(x) = (x - x^p)/(x-1)
// Clearly g(x) = 0 for all x != 1.
// We can also write g as:
// g(x) = - x - x^2 - ... - x^{p-1}
/... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int p;
cin >> p;
auto mod = [&](int x) { return (x % p + p) % p; };
// Let g(x) = (x - x^p)/(x-1)
// Clearly g(x) = 0 for all x != 1.
// We can also write g as:
// g(x) = - x - x^2 - ... - x^{p-1}
/... | [
"expression.operation.binary.remove",
"call.arguments.change"
] | 751,585 | 751,586 | u813181182 | cpp |
p02950 | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | [
"literal.number.change",
"call.arguments.change"
] | 751,587 | 751,588 | u543167400 | cpp |
p02950 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int p;
cin >> p;
int b[p];
memset(b, 0, sizeof(b));
for (int i = 0; i < p; i++) {
int a;
cin >> a;
if (i == 0) {
b[0] += a;
continue;
}
int t = p - a;
for (int j = p - 1; j >= 1; j--) {
b[j]... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int p;
cin >> p;
int b[p];
memset(b, 0, sizeof(b));
for (int i = 0; i < p; i++) {
int a;
cin >> a;
if (i == 0) {
b[0] += a;
}
int t = p - a;
for (int j = p - 1; j >= 1; j--) {
b[j] = (b[j] + t) % ... | [] | 751,589 | 751,590 | u587665681 | cpp |
p02950 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
retu... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
retu... | [
"call.arguments.add"
] | 751,608 | 751,609 | u756088996 | cpp |
p02950 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)(n); ++i)
#defi... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)(n); ++i)
#defi... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 751,610 | 751,611 | u906208439 | cpp |
p02950 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)(n); ++i)
#defi... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)(n); ++i)
#defi... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 751,612 | 751,611 | u906208439 | cpp |
p02950 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
std::vector<ll> fac(510000, 1), finv(510000, 1), inv(510000, 1);
void c4_init(ll m) {
for (ll i... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
std::vector<ll> fac(510000, 1), finv(510000, 1), inv(510000, 1);
void c4_init(ll m) {
for (ll i... | [
"assignment.change"
] | 751,613 | 751,614 | u702996070 | cpp |
p02950 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#... | [
"expression.operation.binary.remove"
] | 751,615 | 751,616 | u516353059 | cpp |
p02950 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#... | [
"expression.operation.binary.remove",
"expression.operator.change"
] | 751,617 | 751,616 | u516353059 | cpp |
p02950 | #include <bits/stdc++.h>
using namespace std;
int n, ans[10010];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (i == 0)
ans[0] += x;
x = n - x;
for (int j = 1; j < n; j++) {
ans[n - j] = (ans[n - j] + x) % n;
x = (x * i) % n;
}
}
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int n, ans[10010];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (i == 0)
ans[0] += x;
x = n - x;
for (int j = 1; j < n; j++) {
ans[n - j] = (ans[n - j] + x) % n;
x = (x * i) % n;
}
}
for (int i = ... | [
"io.output.change"
] | 751,618 | 751,619 | u110464018 | cpp |
p02950 | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define PII pair<int, int>
#define FI first
#define SE second
... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define PII pair<int, int>
#define FI first
#define SE second
... | [
"assignment.value.change",
"call.arguments.change"
] | 751,622 | 751,623 | u297590902 | cpp |
p02950 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
// #include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
// const ll RA... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
// #include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
// const ll RA... | [
"expression.operation.binary.remove"
] | 751,626 | 751,627 | u653136790 | cpp |
p02950 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | [
"expression.operation.binary.remove"
] | 751,628 | 751,629 | u051493691 | cpp |
p02950 | #include <bits/stdc++.h>
using namespace std;
int n, A[10100], cnt[10010], ans[10100], C[3000][3000];
void init() {
C[0][0] = 1;
for (int i = 1; i <= n; i++) {
C[i][0] = 1;
for (int j = 1; j <= i; j++) {
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % n;
}
}
}
int main() {
scanf("%d", &n);
init(... | #include <bits/stdc++.h>
using namespace std;
int n, A[10100], cnt[10010], ans[10100], C[3000][3000];
void init() {
C[0][0] = 1;
for (int i = 1; i <= n; i++) {
C[i][0] = 1;
for (int j = 1; j <= i; j++) {
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % n;
}
}
}
int main() {
scanf("%d", &n);
init(... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 751,630 | 751,631 | u047371023 | cpp |
p02950 | #include <bits/stdc++.h>
#define Ms(a, b) memset(a, b, sizeof a)
#define db(x) cout << #x << "=" << x << endl;
#define db2(x, y) cout << #x << "=" << x << " " << #y << "=" << y << endl;
#define db3(x, y, z) \
cout << #x << "=" << x << " " << #y << "=" << y << ... | #include <bits/stdc++.h>
#define Ms(a, b) memset(a, b, sizeof a)
#define db(x) cout << #x << "=" << x << endl;
#define db2(x, y) cout << #x << "=" << x << " " << #y << "=" << y << endl;
#define db3(x, y, z) \
cout << #x << "=" << x << " " << #y << "=" << y << ... | [
"call.arguments.change"
] | 751,632 | 751,633 | u928673524 | cpp |
p02950 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 751,636 | 751,637 | u333917945 | cpp |
p02950 | #include <bits/stdc++.h>
#define MAX 3010
using namespace std;
int P;
int arr[MAX];
int poly[MAX];
inline int add(int a, int b) { return (a + b) % P; }
inline int prod(int a, int b) { return a * b % P; }
int main(void) {
cin >> P;
for (int i = 0; i < P; i++) {
int val;
cin >> val;
if (!val)
co... | #include <bits/stdc++.h>
#define MAX 3010
using namespace std;
int P;
int arr[MAX];
int poly[MAX];
inline int add(int a, int b) { return (a + b) % P; }
inline int prod(int a, int b) { return a * b % P; }
int main(void) {
cin >> P;
for (int i = 0; i < P; i++) {
int val;
cin >> val;
if (!val)
co... | [
"assignment.change"
] | 751,638 | 751,639 | u305757380 | cpp |
p02950 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [] | 751,642 | 751,643 | u838742270 | cpp |
p02950 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
#define INF 1ll << 59
ll Mod;
ll modinv(ll a) {
l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
#define INF 1ll << 59
ll Mod;
ll modinv(ll a) {
l... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 751,646 | 751,647 | u586567203 | cpp |
p02950 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | [
"expression.operation.unary.arithmetic.remove",
"call.arguments.change"
] | 751,648 | 751,649 | u759266806 | cpp |
p02950 | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll inf = 1 << 30;
const ll LINF = LONG_MAX;
const ll INF = 1LL <<... | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll inf = 1 << 30;
const ll LINF = LONG_MAX;
const ll INF = 1LL <<... | [
"assignment.change"
] | 751,652 | 751,653 | u398942100 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
// #define stop char nyaa;cin>>nyaa;
#define rep(i, n) for (int i =... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
// #define stop char nyaa;cin>>nyaa;
#define rep(i, n) for (int i =... | [
"call.add",
"call.arguments.add"
] | 751,662 | 751,663 | u132371041 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, n) for (ll i = 0; i <= n; i++)
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
c... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, n) for (ll i = 0; i <= n; i++)
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
c... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 751,664 | 751,665 | u575664976 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define sz(x) int(x.size())
#define pb push_back
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
const ll MOD = 1000000007, MOD2 = 998244353, INF = 1e18;
int main() {
int a, b, c;
cin >> a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define sz(x) int(x.size())
#define pb push_back
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
const ll MOD = 1000000007, MOD2 = 998244353, INF = 1e18;
int main() {
int a, b, c;
cin >> a... | [
"call.add",
"call.arguments.add"
] | 751,666 | 751,667 | u387221709 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (C <= A + B) {
cout << "0" << endl;
} else {
cout << C - (A + B) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
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",
"io.output.change"
] | 751,684 | 751,685 | u516876944 | 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,688 | 751,689 | u222625974 | cpp |
p02951 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << "\n";
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 751,690 | 751,691 | u762158020 | 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,692 | 751,693 | u125669112 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - a - b <= 0) {
cout << 0;
} else {
cout << c - a - b;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - (a - b) <= 0) {
cout << 0;
} else {
cout << c - (a - b);
}
}
| [
"control_flow.branch.if.condition.change"
] | 751,719 | 751,720 | u459025138 | cpp |
p02951 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
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>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
if (ans < 0)
ans = 0;
cout << ans << endl;
return 0;
}
| [] | 751,725 | 751,726 | u904995051 | 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"
] | 751,727 | 751,728 | u729703601 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
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 ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int a, b, c;
cin >> a >> ... | [
"call.add",
"call.arguments.add"
] | 751,729 | 751,730 | u455067221 | 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;
} else {
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 << b + c - a << endl;
} else {
cout << 0 << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 751,731 | 751,732 | u492660436 | cpp |
p02951 | // Template //
#include <bits/stdc++.h>
using namespace std;
// マクロ //
#define rep(i, N) for (int i = 0; i < N; i++)
#define all(x) x.begin(), x.end()
#define sort(x) sort(all(x))
#define uniq(x) x.erase(unique(all(x)), x.end())
#define vsum(x) accumulate(all(x), 0)
#define cou(x) cout << x << endl
#define y() cout <<... | // Template //
#include <bits/stdc++.h>
using namespace std;
// マクロ //
#define rep(i, N) for (int i = 0; i < N; i++)
#define all(x) x.begin(), x.end()
#define sort(x) sort(all(x))
#define uniq(x) x.erase(unique(all(x)), x.end())
#define vsum(x) accumulate(all(x), 0)
#define cou(x) cout << x << endl
#define y() cout <<... | [
"call.arguments.add"
] | 751,741 | 751,742 | u073983440 | 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 << c + b - a << 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 + b - a, 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 751,750 | 751,751 | u941313907 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(0, c - (a - b)) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 751,752 | 751,753 | u924451152 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
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,754 | 751,753 | u924451152 | cpp |
p02951 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = b - a;
if (d >= c)
cout << 0 << endl;
else
cout << c - d << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = a - b;
if (d >= c)
cout << 0 << endl;
else
cout << c - d << endl;
} | [
"expression.operation.binary.remove"
] | 751,757 | 751,758 | u481657940 | cpp |
p02951 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
#define eb(k, v) emplace_back... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
#define eb(k, v) emplace_back... | [
"call.add",
"call.arguments.change"
] | 751,759 | 751,760 | u673981655 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ll mod = 1e9 + 7;
// const ll mod = 998244353;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cer... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ll mod = 1e9 + 7;
// const ll mod = 998244353;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cer... | [
"call.add",
"call.arguments.add"
] | 751,761 | 751,762 | u895971408 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.