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>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B - A + C > 0)
cout << A - B - C << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B - A + C > 0)
cout << B - A + C << endl;
else
cout << 0 << endl;
} | [
"expression.operation.binary.remove"
] | 752,857 | 752,858 | u804980376 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
namespace mine {
typedef long long ll;
#define pr pair<int, int>
#define FR first
#de... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
namespace mine {
typedef long long ll;
#define pr pair<int, int>
#define FR first
#de... | [
"expression.operation.binary.remove"
] | 752,865 | 752,866 | u960093366 | cpp |
p02951 | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,869 | 752,870 | u010004797 | cpp |
p02951 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define N 10010
using namespace std;
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
printf("%d", k - (n - m));
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define N 10010
using namespace std;
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
printf("%d", max(k - (n - m), 0));
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,871 | 752,872 | u588366417 | cpp |
p02951 | //#define NDEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <vecto... | //#define NDEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <vecto... | [
"call.add",
"call.arguments.change"
] | 752,879 | 752,880 | u495072453 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a;
int b;
int c;
cin >> a >> b ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a;
int b;
int c;
cin >> a >> b ... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 752,888 | 752,889 | u931191237 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, tmp;
cin >> a >> b >> c;
tmp = c - (a - b);
cout << tmp << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, tmp;
cin >> a >> b >> c;
tmp = max(c - (a - b), 0);
cout << tmp << endl;
}
| [
"call.add",
"call.arguments.add"
] | 752,898 | 752,899 | u059207724 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
int c;
cin >> a;
cin >> b;
cin >> c;
if (b + c < a) {
cout << a - b - c << endl;
} else {
cout << "0" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
int c;
cin >> a;
cin >> b;
cin >> c;
if (b + c > a) {
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",
"expression.operator.arithmetic.change",
"io.output.change"
] | 752,900 | 752,901 | u991863667 | cpp |
p02951 | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define MP make_pair
#define vii vector<pii>
#define vi vector<int>
#define ll long long
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << b + c - a << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define MP make_pair
#define vii vector<pii>
#define vi vector<int>
#define ll long long
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << max(b + c - a, 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,905 | 752,906 | u785897267 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int d = 0;
cin >> a >> b >> c;
if (c >= a - b)
cout << c - (a - b) << endl;
if (c <= a - b)
cout << d << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int d = 0;
cin >> a >> b >> c;
if (c >= a - b)
cout << c - (a - b) << endl;
if (c < a - b)
cout << d << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,908 | 752,909 | u282060653 | 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 - (a - b) << 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;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,910 | 752,911 | u952865396 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define u128 __int128
#define ff first
#define ss second
#define pb push_back
#define PI 3.141592653589793
#define MOD 1000000007
#define N 100100
#define M 1000010
int n, m;
int a[N];
int main() {
ios::sync_with_stdio(f... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define u128 __int128
#define ff first
#define ss second
#define pb push_back
#define PI 3.141592653589793
#define MOD 1000000007
#define N 100100
#define M 1000010
int n, m;
int a[N];
int main() {
ios::sync_with_stdio(f... | [
"call.add",
"call.arguments.change"
] | 752,932 | 752,933 | u060049558 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define For(i, l, r) for (int i = (l); i <= (r); ++i)
typedef long long LL;
typedef pair<int, int> Pii;
const int inf = 0x3f3f3f3f;
const LL infLL = 0x3f3f3f3f3f3f3f3fLL;
int main() {
int a, b, c;
cin >> a >> b >> c;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define For(i, l, r) for (int i = (l); i <= (r); ++i)
typedef long long LL;
typedef pair<int, int> Pii;
const int inf = 0x3f3f3f3f;
const LL infLL = 0x3f3f3f3f3f3f3f3fLL;
int main() {
int a, b, c;
cin >> a >> b >> c;
... | [
"call.add",
"call.arguments.add"
] | 752,934 | 752,935 | u033288617 | 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.add"
] | 752,938 | 752,939 | u607746177 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int... | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int... | [
"identifier.change",
"io.output.change"
] | 752,949 | 752,950 | u973991908 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int... | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 752,951 | 752,950 | u973991908 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a - b;
if (d >= c) {
cout << c << endl;
} else if (d < c) {
cout << c - d << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a - b;
if (d >= c) {
cout << "0" << endl;
} else if (d < c) {
cout << c - d << endl;
}
return 0;
} | [
"io.output.change"
] | 752,952 | 752,953 | u248241157 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0);
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,954 | 752,955 | u038569501 | 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;
}
return 0;
}
| #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;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 752,958 | 752,959 | u575207957 | cpp |
p02951 | #include <bits/stdc++.h>
typedef long long ll;
#define pair <int, int> P
#define sc(N) scanf("%lld", &N);
using namespace std;
int main() {
ll A, B, C;
sc(A);
sc(B);
sc(C);
cout << C - A + B << '\n';
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
#define pair <int, int> P
#define sc(N) scanf("%lld", &N);
using namespace std;
int main() {
ll A, B, C;
sc(A);
sc(B);
sc(C);
cout << max(C - A + B, 0ll) << '\n';
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 752,960 | 752,961 | u014289849 | 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(0, c - (a - b)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 752,967 | 752,968 | u423832505 | 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;
cout << min(a - b, c) << endl;
}
| #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;
cout << c - min(a - b, c) << endl;
}
| [
"expression.operation.binary.add"
] | 752,975 | 752,976 | u366974105 | cpp |
p02951 | #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e18) // 1234567890987654321
#define INF 1234567890ll
#def... | #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e18) // 1234567890987654321
#define INF 1234567890ll
#def... | [
"call.add",
"call.arguments.change"
] | 752,977 | 752,978 | u844961982 | cpp |
p02951 | #include <bits/stdc++.h>
#define pp pair<int, int>
#define fi first
#define se second
#define maxx 400012
#define ll long long
#define pb push_back
#define mp make_pair
#define lb lower_bound
const int mod = 998244353;
using namespace std;
int a, b, c;
void input() {
// freopen("TEST.INP","r",stdin);
// fre... | #include <bits/stdc++.h>
#define pp pair<int, int>
#define fi first
#define se second
#define maxx 400012
#define ll long long
#define pb push_back
#define mp make_pair
#define lb lower_bound
const int mod = 998244353;
using namespace std;
int a, b, c;
void input() {
// freopen("TEST.INP","r",stdin);
// fre... | [
"call.add",
"call.arguments.add"
] | 752,981 | 752,982 | u309723391 | cpp |
p02951 | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
using i64 = int64_t;
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (C - (A - B)) << endl;
return 0;
} | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
using i64 = int64_t;
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.add"
] | 752,983 | 752,984 | u936555566 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
cout << min(c - (a - b), (long long)0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), (long long)0) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 753,000 | 753,001 | u206489571 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#d... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#d... | [
"call.remove"
] | 753,009 | 753,010 | u702142173 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#d... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#d... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"call.remove"
] | 753,011 | 753,010 | u702142173 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#d... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#d... | [
"identifier.change",
"call.function.change",
"io.output.change",
"call.arguments.add"
] | 753,012 | 753,010 | u702142173 | cpp |
p02951 | #include <iostream>
using namespace std;
int a, b, c;
int ans;
int main() {
cin >> a >> b >> c;
ans = c + b - a;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int a, b, c;
int ans;
int main() {
cin >> a >> b >> c;
ans = max(c + b - a, 0);
cout << ans << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 753,021 | 753,022 | u860830353 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, a, b, c, ans;
cin >> a >> b >> c;
i = a - b;
ans = c - i;
if (c < 0) {
ans = 0;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, a, b, c, ans;
cin >> a >> b >> c;
i = a - b;
ans = c - i;
if (ans < 0) {
ans = 0;
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 753,025 | 753,026 | u018807058 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%d", max(c - (b - a), 0));
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%d", max(c - (a - b), 0));
} | [
"expression.operation.binary.remove"
] | 753,035 | 753,036 | u582434836 | cpp |
p02951 | #include <bits/stdc++.h>
#include <cstdio>
#define PI acos(-1)
#define pb push_back
#define endl "\n"
#define mostrar(x, y) cout << x << " " << y << endl;
#define f first
#define s second
#define mod 1000000007
#define EPS 1e-9
#define llenar(a, val) memset(a, val, sizeof(a))
using namespace std;
typedef pair<int, int>... | #include <bits/stdc++.h>
#include <cstdio>
#define PI acos(-1)
#define pb push_back
#define endl "\n"
#define mostrar(x, y) cout << x << " " << y << endl;
#define f first
#define s second
#define mod 1000000007
#define EPS 1e-9
#define llenar(a, val) memset(a, val, sizeof(a))
using namespace std;
typedef pair<int, int>... | [
"call.add",
"call.arguments.change"
] | 753,047 | 753,048 | u594272051 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
int x;
cin >> a >> b >> c;
x = a - b - c;
if (x < 0)
cout << x << endl;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
int x;
cin >> a >> b >> c;
x = a - b - c;
if (x < 0)
cout << -x << endl;
else
cout << 0 << endl;
return 0;
} | [
"expression.operation.unary.add"
] | 753,049 | 753,050 | u787972656 | cpp |
p02951 | // Created by liszt on 2019/08/04.
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
} | // Created by liszt on 2019/08/04.
#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"
] | 753,053 | 753,054 | u370447425 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int a, b, c;
int main(void) {
// Here your code !
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", max(0, c - (b - a)));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int a, b, c;
int main(void) {
// Here your code !
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", max(0, c - (a - b)));
return 0;
}
| [
"expression.operation.binary.remove"
] | 753,057 | 753,058 | u497422208 | 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)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, (b + c) - a) << endl;
}
| [
"expression.operation.binary.remove"
] | 753,059 | 753,060 | u577552796 | cpp |
p02951 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | [
"call.add",
"call.arguments.change"
] | 753,061 | 753,062 | u519950235 | cpp |
p02951 | #include <bits/stdc++.h>
#define ls(x) (x) << 1
#define rs(x) (x) << 1 | 1
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
#define ll rt << 1
#define rr rt << 1 | 1
#define PI acos(-1)
#define MM int m = (l + r) >> 1;
#define fu(i, r, t) for (int i = r; i <= t; i++)
#define fd(i, r, t) for (int i = r; i >... | #include <bits/stdc++.h>
#define ls(x) (x) << 1
#define rs(x) (x) << 1 | 1
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
#define ll rt << 1
#define rr rt << 1 | 1
#define PI acos(-1)
#define MM int m = (l + r) >> 1;
#define fu(i, r, t) for (int i = r; i <= t; i++)
#define fd(i, r, t) for (int i = r; i >... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 753,067 | 753,068 | u020160935 | 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"
] | 753,071 | 753,072 | u258907785 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b));
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 753,073 | 753,074 | u996142393 | cpp |
p02951 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (c - a - b > 0)
cout << c - a - b << endl;
else
cout << 0 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (c - (a - b) > 0)
cout << c - (a - b) << endl;
else
cout << 0 << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 753,077 | 753,078 | u467561544 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int i;
cin >> a >> b >> c;
int ans;
ans = c - (a - b);
if (ans < -1) {
ans = 0;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int i;
cin >> a >> b >> c;
int ans;
ans = c - (a - b);
if (ans < 0) {
ans = 0;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 753,083 | 753,084 | u108540384 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include<unordered_map>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int MAXN = 100005;
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include<unordered_map>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int MAXN = 100005;
#de... | [
"call.add",
"call.arguments.change"
] | 753,085 | 753,086 | u666161993 | cpp |
p02951 | #include <bits/stdc++.h>
//#include <tr1/unordered_map>
#define debug(x) (cout << "#x = " << (x) << endl)
#define lowbit(x) (x & -x)
#define Set(x, i) memset(x, i, sizeof x)
#define R register
#define For(i, j, k) for (R int i = (j); i <= (k); ++i)
#define Rep(i, j, k) for (R int i = (j); i >= (k); --i)
#define Cross(i... | #include <bits/stdc++.h>
//#include <tr1/unordered_map>
#define debug(x) (cout << "#x = " << (x) << endl)
#define lowbit(x) (x & -x)
#define Set(x, i) memset(x, i, sizeof x)
#define R register
#define For(i, j, k) for (R int i = (j); i <= (k); ++i)
#define Rep(i, j, k) for (R int i = (j); i >= (k); --i)
#define Cross(i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 753,091 | 753,092 | u031514160 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (B + C - A) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (max(B + C - A, 0)) << endl;
} | [
"call.arguments.add"
] | 753,095 | 753,096 | u598710706 | cpp |
p02951 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define pll pair<ll, ll>
#pragma GCC optimize("O3")
using namespace std;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#else
ios::sync_with_stdio(false);
... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define pll pair<ll, ll>
#pragma GCC optimize("O3")
using namespace std;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#else
ios::sync_with_stdio(false);
... | [
"call.add",
"call.arguments.change"
] | 753,099 | 753,100 | u042208369 | cpp |
p02951 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int... | [
"call.add",
"call.arguments.change"
] | 753,103 | 753,104 | u608965386 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int a, b,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int a, b,... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 753,105 | 753,106 | u703214333 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
cout << max(ans, 0);
} | [
"call.add",
"call.arguments.add"
] | 753,113 | 753,114 | u425858059 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
namespace fastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
// fread->read
bool IOerror = 0;
// inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
inline char nc() {
static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
if (p1 =... | #include <bits/stdc++.h>
using namespace std;
namespace fastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
// fread->read
bool IOerror = 0;
// inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
inline char nc() {
static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
if (p1 =... | [
"call.arguments.add",
"call.arguments.change"
] | 753,115 | 753,116 | u709755864 | cpp |
p02951 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (i = a; i < b; i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define vi vector<ll int>
#define CLR(a) memset((a), 0, sizeof(a))
#define mp make_pair
#define hell 1000000007
using namespace std;
void sol... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (i = a; i < b; i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define vi vector<ll int>
#define CLR(a) memset((a), 0, sizeof(a))
#define mp make_pair
#define hell 1000000007
using namespace std;
void sol... | [
"call.add",
"call.arguments.add"
] | 753,121 | 753,122 | u216069198 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int a, b, c, ans = 0;
cin >> a >> b >> c;
ans = c - (a - b);
cout << ans <<... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int a, b, c, ans = 0;
cin >> a >> b >> c;
ans = max(c - (a - b), 0);
cout <... | [
"call.add",
"call.arguments.add"
] | 753,127 | 753,128 | u480806810 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define pii pair<int, int>
#define plli pair<lli, lli>
#define F(i, n) for (lli(i) = 0; (i) < (n);... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define pii pair<int, int>
#define plli pair<lli, lli>
#define F(i, n) for (lli(i) = 0; (i) < (n);... | [
"call.add",
"call.arguments.add"
] | 753,133 | 753,134 | u201489353 | cpp |
p02951 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(0, C - (A - B)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 753,135 | 753,136 | u266059249 | cpp |
p02951 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b, c) << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (c - min(a - b, c)) << endl;
}
| [
"call.arguments.change"
] | 753,139 | 753,140 | u508729896 | cpp |
p02951 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
printf("%d\n", c - (a - b));
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
printf("%d\n", max(c - (a - b), 0));
return 0;
} | [
"call.add",
"call.arguments.add"
] | 753,141 | 753,142 | u553807330 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define all(v) v.begin(), v.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define all(v) v.begin(), v.end()
#defin... | [
"call.add",
"call.arguments.add"
] | 753,145 | 753,146 | u996003680 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
typede... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
typede... | [
"call.add",
"call.arguments.change"
] | 753,151 | 753,152 | u462078186 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
// priority_queue<int, vector<int>, greater<int> > pq;
const int N = 1000300;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begi... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
// priority_queue<int, vector<int>, greater<int> > pq;
const int N = 1000300;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begi... | [
"call.add",
"call.arguments.change"
] | 753,153 | 753,154 | u278557567 | cpp |
p02951 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define int64 long long
#define pii pair<int64, int64>
#define fr first
#define sc second
#define he... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define int64 long long
#define pii pair<int64, int64>
#define fr first
#define sc second
#define he... | [
"call.add",
"call.arguments.change"
] | 753,159 | 753,160 | u217917732 | 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 REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | #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 REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | [
"call.add",
"call.arguments.change"
] | 753,161 | 753,162 | u239375815 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SZ(a) ((int)a.size())
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define fst first
#define snd second
void dout() { cerr << endl; }
template <typename Head, typename... Tail> void dout... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SZ(a) ((int)a.size())
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define fst first
#define snd second
void dout() { cerr << endl; }
template <typename Head, typename... Tail> void dout... | [
"call.add",
"call.arguments.change"
] | 753,165 | 753,166 | u340474328 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true... | [
"call.add",
"call.arguments.add"
] | 753,169 | 753,170 | u540491484 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << b + c - a;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << max(b + c - a, 0);
return 0;
} | [
"call.add",
"call.arguments.add"
] | 753,171 | 753,172 | u088044957 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<ll, ll> P;
const int MAX = 1e5 + 10;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int A, B, C;
int main() {
cin >> A >> B >> C;
cout << C - (A - B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<ll, ll> P;
const int MAX = 1e5 + 10;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int A, B, C;
int main() {
cin >> A >> B >> C;
cout << max(0, C - (A - B)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 753,173 | 753,174 | u992875223 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | [
"call.add",
"call.arguments.change"
] | 753,175 | 753,176 | u366644013 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // p... | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // p... | [
"call.add",
"call.arguments.add"
] | 753,177 | 753,178 | u933068010 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 753,181 | 753,182 | u950721652 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
int main() {
int a, b, c;
cin >> a >> b >> c;
c -= b - a;
cout << max(c, 0);
return 0;
}
// 5 1 5 -10 -10 -10 5 7
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
int main() {
int a, b, c;
cin >> b >> a >> c;
c -= b - a;
cout << max(c, 0);
return 0;
}
// 5 1 5 -10 -10 -10 5 7
| [
"expression.operation.binary.remove"
] | 753,189 | 753,190 | u188000196 | cpp |
p02951 | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(1e9 + 7)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
... | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(1e9 + 7)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
... | [
"expression.operation.binary.remove"
] | 753,191 | 753,192 | u055148700 | cpp |
p02951 | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const int MOD =... | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const int MOD =... | [
"call.add",
"call.arguments.add"
] | 753,199 | 753,200 | u067267922 | cpp |
p02951 | /***************************************************************
File name: A.cpp
Author: ljfcnyali
Create time: 2019年08月04日 星期日 19时56分49秒
***************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a), _end_... | /***************************************************************
File name: A.cpp
Author: ljfcnyali
Create time: 2019年08月04日 星期日 19时56分49秒
***************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a), _end_... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 753,201 | 753,202 | u192982222 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define mad(a, b) a = (a + b) % mod;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0... | #include <algorithm>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define mad(a, b) a = (a + b) % mod;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << max(0LL, c - (a - b)) << endl;
... | [
"call.add",
"call.arguments.change"
] | 753,203 | 753,204 | u924885571 | cpp |
p02951 | #include <bits/stdc++.h>
#include <iomanip> // std::setprecision
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define bit(x, i) (x & (1 << i)) // select the bit of position i of x
#define lowbit(x) ((x) & ((x) ^ ((x)-1))) // get the lowest bit of x
#define hBit(msb, n) ... | #include <bits/stdc++.h>
#include <iomanip> // std::setprecision
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define bit(x, i) (x & (1 << i)) // select the bit of position i of x
#define lowbit(x) ((x) & ((x) ^ ((x)-1))) // get the lowest bit of x
#define hBit(msb, n) ... | [
"call.add",
"call.arguments.change"
] | 753,205 | 753,206 | u381312634 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
int k = a - b;
c = min(c - k, 0);
cout << c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
int k = a - b;
c = max(c - k, 0);
cout << c << endl;
return 0;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 753,211 | 753,212 | u965377001 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
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) << '\n';
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << '\n';
retu... | [
"call.add",
"call.arguments.add"
] | 753,213 | 753,214 | u941934550 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setp... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setp... | [
"expression.operation.binary.add"
] | 753,217 | 753,218 | u524343822 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n < 10)
cout << "n" << endl;
else if (n >= 10 && n < 100)
cout << "9" << endl;
else if (n >= 100 && n < 1000)
cout << n - 100 + 10 << endl;
else if (n >= 1000 && n < 10000)
cout << "909" << endl;
else if (n >= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n < 10)
cout << n << endl;
else if (n >= 10 && n < 100)
cout << "9" << endl;
else if (n >= 100 && n < 1000)
cout << n - 100 + 10 << endl;
else if (n >= 1000 && n < 10000)
cout << "909" << endl;
else if (n >= 10... | [] | 753,223 | 753,224 | u516876944 | cpp |
p02952 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n + 1; i++) {
string s = to_string(i);
int cmp = s.length();
if (cmp % 2... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
string s = to_string(i);
int cmp = s.length();
if (cmp % 2 == ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 753,230 | 753,231 | u188332959 | cpp |
p02952 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 753,245 | 753,246 | u272628953 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
// 別解
int main() {
// 考え方メモ
// N < 10^5 のため、forループで全ての数を見た場合(O(N))でも、10^5 <
// 10^8（AtCoderの制約）を満たす 全検索を行う
int N;
cin >> N;
int res;
for (int i = 1; i <= N; i++) {
if (to_string(i).length() % 2) {
res++;
}
}
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// 別解
int main() {
// 考え方メモ
// N < 10^5 のため、forループで全ての数を見た場合(O(N))でも、10^5 <
// 10^8（AtCoderの制約）を満たす 全検索を行う
int N;
cin >> N;
int res = 0;
for (int i = 1; i <= N; i++) {
if (to_string(i).length() % 2) {
res++;
}
}
cout << res << endl;
r... | [
"variable_declaration.value.change",
"io.output.newline.add"
] | 753,255 | 753,256 | u475280305 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
// 別解
int main() {
// 考え方メモ
// N < 10^5 のため、forループで全ての数を見た場合(O(N))でも、10^5 <
// 10^8（AtCoderの制約）を満たす 全検索を行う
int N;
cin >> N;
int res;
for (int i = 1; i <= N; i++) {
if (to_string(i).length() % 2) {
res++;
}
}
cout << res << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
// 別解
int main() {
// 考え方メモ
// N < 10^5 のため、forループで全ての数を見た場合(O(N))でも、10^5 <
// 10^8（AtCoderの制約）を満たす 全検索を行う
int N;
cin >> N;
int res = 0;
for (int i = 1; i <= N; i++) {
if (to_string(i).length() % 2) {
res++;
}
}
cout << res << endl;
r... | [
"variable_declaration.value.change"
] | 753,257 | 753,256 | u475280305 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
// 別解
int main() {
// 考え方メモ
// N < 10^5 のため、forループで全ての数を見た場合(O(N))でも、10^5 <
// 10^8（AtCoderの制約）を満たす 全検索を行う
int N;
cin >> N;
int res;
for (int i = 1; i <= N; i++) {
if (to_string(i).size() % 2)
res++;
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// 別解
int main() {
// 考え方メモ
// N < 10^5 のため、forループで全ての数を見た場合(O(N))でも、10^5 <
// 10^8（AtCoderの制約）を満たす 全検索を行う
int N;
cin >> N;
int res = 0;
for (int i = 1; i <= N; i++) {
if (to_string(i).length() % 2) {
res++;
}
}
cout << res << endl;
r... | [
"variable_declaration.value.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 753,258 | 753,256 | u475280305 | cpp |
p02952 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename A, typename B> bool chmin(A &a, const B &b) {
return b < a ... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename A, typename B> bool chmin(A &a, const B &b) {
return b < a ... | [
"variable_declaration.value.change"
] | 753,268 | 753,269 | u535565217 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | [
"expression.operation.binary.remove"
] | 753,275 | 753,276 | u644224332 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int i;
int count = 0;
for (i = 1; i < N; i++) {
string s = to_string(i);
int size = s.size();
if (size % 2 == 1) {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int i;
int count = 0;
for (i = 1; i <= N; i++) {
string s = to_string(i);
int size = s.size();
if (size % 2 == 1) {
count++;
}
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,279 | 753,280 | u594983000 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i < n; i++) {
if (to_string(i).size() % 2 == 1)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (to_string(i).size() % 2 == 1)
ans++;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,284 | 753,285 | u347397127 | cpp |
p02952 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 753,297 | 753,298 | u580593895 | cpp |
p02952 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int k = 0; //合計
int j = 0; //桁数
int a = 0;
for (int n = 1; n <= N; n++) {
a = n;
while (a != 0) {
a /= 10;
j++;
}
if (j % 2 == 1) {
k++;
}
j = 1;
}
cout << k << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int k = 0; //合計
int j = 0; //桁数
int a = 0;
for (int n = 1; n <= N; n++) {
a = n;
while (a != 0) {
a /= 10;
j++;
}
if (j % 2 == 1) {
k++;
}
j = 0;
}
cout << k << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 753,299 | 753,300 | u657538941 | cpp |
p02952 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int k = 0; //合計
int j = 1; //桁数
int a = 0;
for (int n = 1; n <= N; n++) {
a = n;
while (a != 0) {
a /= 10;
j++;
}
if (j % 2 == 1) {
k++;
}
j = 1;
}
cout << k << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int k = 0; //合計
int j = 0; //桁数
int a = 0;
for (int n = 1; n <= N; n++) {
a = n;
while (a != 0) {
a /= 10;
j++;
}
if (j % 2 == 1) {
k++;
}
j = 0;
}
cout << k << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 753,301 | 753,300 | u657538941 | cpp |
p02952 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i <= n; i++) {
if (i / 10 == 0)
count++;
else if ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i <= n; i++) {
if (i / 10 == 0)
count++;
else if ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 753,308 | 753,309 | u412057008 | cpp |
p02952 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, no_odd = 0;
cin >> n;
for (int i = 0; i < n; i++) {
if (to_string(i).length() % 2 == 1) {
no_odd++;
}
}
cout << no_odd;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, no_odd = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
if (to_string(i).length() % 2 == 1) {
no_odd++;
}
}
cout << no_odd;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 753,310 | 753,311 | u323819429 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int power(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
int keta(int N) {
int j;
for (int i = 1; i <= 7; i++) {
if (N >= power(10, i) && N < power(10, i + 1)) {
j = i + 1;... | #include <bits/stdc++.h>
using namespace std;
int power(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
int keta(int N) {
int j = 0;
for (int i = 0; i <= 7; i++) {
if (N >= power(10, i) && N < power(10, i + 1)) {
j = i ... | [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 753,312 | 753,313 | u527311983 | cpp |
p02952 | #include <iostream>
int main() {
int n;
std::cin >> n;
int cnt = 0;
for (int i = 0; i < n; ++i) {
int j = i;
int keta = 0;
while (j > 0) {
j /= 10;
keta++;
}
if (keta % 2 != 0)
cnt++;
}
std::cout << cnt << std::endl;
}
| #include <iostream>
int main() {
int n;
std::cin >> n;
int cnt = 0;
for (int i = 1; i <= n; ++i) {
int j = i;
int keta = 0;
while (j > 0) {
j /= 10;
keta++;
}
if (keta % 2 != 0)
cnt++;
}
std::cout << cnt << std::endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 753,360 | 753,361 | u089888152 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
ll b = 0;
ll c = 10;
for (ll i = 1; i < 7; i++) {
if (a < c) {
b = i;
break;
}
c = c * 10;
}
ll d = 0;
if (b == 1) {
d = a;
} else {
ll e = 9;
for (ll i = 1; i <= b - 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
ll b = 0;
ll c = 10;
for (ll i = 1; i < 7; i++) {
if (a < c) {
b = i;
break;
}
c = c * 10;
}
ll d = 0;
if (b == 1) {
d = a;
} else {
ll e = 9;
for (ll i = 1; i <= b - 1... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 753,369 | 753,370 | u883297128 | cpp |
p02952 | /*
* Project: AtCoder Beginners Contest 136 B - Uneven Numbers
* Author: toms74209200 <https://github.com/toms74209200>
*
* Created on 2020/09/08
* Copyright (c) 2020 toms74209200
*
* This software is released under the MIT License.
* http://opensource.org/licenses/mit-license.php
*/
#include <cstdint>
#includ... | /*
* Project: AtCoder Beginners Contest 136 B - Uneven Numbers
* Author: toms74209200 <https://github.com/toms74209200>
*
* Created on 2020/09/08
* Copyright (c) 2020 toms74209200
*
* This software is released under the MIT License.
* http://opensource.org/licenses/mit-license.php
*/
#include <cstdint>
#includ... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,376 | 753,377 | u781458283 | cpp |
p02952 | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 753,378 | 753,379 | u244839008 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
bool f(int x) {
int keta = 0;
while (x) {
keta++;
x /= 10;
}
return keta % 2 == 1;
}
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
if (f(i))
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool f(int x) {
int keta = 0;
while (x) {
keta++;
x /= 10;
}
return keta % 2 == 1;
}
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (f(i))
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 753,380 | 753,381 | u497715246 | cpp |
p02952 | #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 ... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 753,393 | 753,394 | u858929490 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.