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 8
values |
|---|---|---|---|---|---|---|---|
p03181 | #include <bits/stdc++.h>
using namespace std;
#define mod 998244353
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3fll
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
const int maxn = 1e5 + 10;
int n;
ll m;
ll dpin[maxn], dpout[maxn];
vector<int> g[maxn];
i... | #include <bits/stdc++.h>
using namespace std;
#define mod 998244353
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3fll
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
const int maxn = 1e5 + 10;
int n;
ll m;
ll dpin[maxn], dpout[maxn];
vector<int> g[maxn];
i... | [
"expression.unary.arithmetic.add"
] | 988,420 | 988,421 | u935538253 | cpp |
p03181 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
using namespace std;
const int maxn = 100100;
vector<int> g[maxn];
ll n, mod;
ll dp[maxn];
void dfs_zero(int node, int p) {
dp[node] = 1LL;
for (int i : g[node]) {
if (i == p)
continue;
d... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
using namespace std;
const int maxn = 100100;
vector<int> g[maxn];
ll n, mod;
ll dp[maxn];
void dfs_zero(int node, int p) {
dp[node] = 1LL;
for (int i : g[node]) {
if (i == p)
continue;
d... | [
"expression.unary.arithmetic.add"
] | 988,424 | 988,425 | u356738755 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(), (v).end()
const ll MOD... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(), (v).end()
const ll MOD... | [
"assignment.change"
] | 988,439 | 988,440 | u275786410 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void read(int &x) {
char ch = getchar();
x = 0;
for (; ch == ' ' || ch == '\n'; ch = getchar())
;
for (; ch != ' ' && ch != '\n'; x = x * 10 + ch - '0', ch = getchar())
;
}
void write(ll x) {
if (x > 9)
write(x / 10);
putchar(x ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void read(int &x) {
char ch = getchar();
x = 0;
for (; ch == ' ' || ch == '\n'; ch = getchar())
;
for (; ch != ' ' && ch != '\n'; x = x * 10 + ch - '0', ch = getchar())
;
}
void write(ll x) {
if (x > 9)
write(x / 10);
putchar(x ... | [
"variable_declaration.type.change",
"assignment.variable.change",
"identifier.change"
] | 988,443 | 988,442 | u937608388 | cpp |
p03181 | #include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define fio ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define mp make_pair
#define int long long
using namespace std;
const int INF = 1e9;
const int MAX = 1e5 + 3;
int MOD = 1e9 + 7;
int n, M;
vector<int> adj[MAX];
vector<in... | #include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define fio ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define mp make_pair
#define int long long
using namespace std;
const int INF = 1e9;
const int MAX = 1e5 + 3;
int MOD = 1e9 + 7;
int n, M;
vector<int> adj[MAX];
vector<in... | [
"expression.operation.binary.add"
] | 988,448 | 988,449 | u803465494 | cpp |
p03181 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int NNODES = 1e5 + 6;
vector<int> v[NNODES];
int fatherOf[NNODES];
ll down[NNODES];
ll up[NNODES];
ll prefix[NNODES], ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int NNODES = 1e5 + 6;
vector<int> v[NNODES];
int fatherOf[NNODES];
ll down[NNODES];
ll up[NNODES];
ll prefix[NNODES], ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 988,456 | 988,457 | u858033561 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 988,474 | 988,473 | u139031151 | cpp |
p03181 | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define emp emplace
using namespace std;
using ll = long long int;
using ii = pair<int, int>;
int MOD = 1000 * 1000 * 1000 + 7;
const int N = 100000;
std::vector<int> ad... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define emp emplace
using namespace std;
using ll = long long int;
using ii = pair<int, int>;
int MOD = 1000 * 1000 * 1000 + 7;
const int N = 100000;
std::vector<int> ad... | [
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 988,475 | 988,476 | u540942722 | cpp |
p03181 | /// __Macro's__
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define II pair<int, int>
#define III pair<int, II>
#define VL vector<ll>
#define VI vector<int>
#define VII vector<II>
#define VIII vector<III>
#define VVI vector<vector<int>>
#define VVII vector<vector<II>>
#define fr first
#define sc ... | /// __Macro's__
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define II pair<int, int>
#define III pair<int, II>
#define VL vector<ll>
#define VI vector<int>
#define VII vector<II>
#define VIII vector<III>
#define VVI vector<vector<int>>
#define VVII vector<vector<II>>
#define fr first
#define sc ... | [
"assignment.change"
] | 988,477 | 988,478 | u370875960 | cpp |
p03181 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define inside sl <= l &&r <= sr
#define outside r < sl || sr < l
#define INF 1000000009
//#define mod 1000000007
using namespace std;
typedef long long ll;
ll n, mod;
list<int> adj[100005];
ll dpust[100005];
ll dpalt[100005];
ll dp3[100005];
ll phi;... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define inside sl <= l &&r <= sr
#define outside r < sl || sr < l
#define INF 1000000009
//#define mod 1000000007
using namespace std;
typedef long long ll;
ll n, mod;
list<int> adj[100005];
ll dpust[100005];
ll dpalt[100005];
ll dp3[100005];
ll phi;... | [
"literal.number.change",
"call.arguments.change"
] | 988,490 | 988,491 | u310000702 | cpp |
p03181 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int lu;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<ll> sl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef pair<ll, ll> il;
#de... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int lu;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<ll> sl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef pair<ll, ll> il;
#de... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 988,493 | 988,494 | u545519496 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
#define white first
#define black second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 1e5 + 5;
int N, M;
vector<i... | #include <bits/stdc++.h>
using namespace std;
#define white first
#define black second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 1e5 + 5;
int N, M;
vector<i... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 988,502 | 988,503 | u738069880 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
#define black first
#define white second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 1e5 + 5;
int N, M;
vector<i... | #include <bits/stdc++.h>
using namespace std;
#define white first
#define black second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 1e5 + 5;
int N, M;
vector<i... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 988,504 | 988,503 | u738069880 | cpp |
p03181 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include ... |
#include <algorithm>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include ... | [] | 988,505 | 988,506 | u724732842 | cpp |
p03181 | #include <algorithm>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <... |
#include <algorithm>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include ... | [
"assignment.value.change",
"call.arguments.change"
] | 988,507 | 988,506 | u724732842 | cpp |
p03181 | // https://atcoder.jp/contests/dp/tasks/dp_v
// V - Subtree
#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
vector<vector<int>> adj;
vector<vector<int>> adj_count;
vector<long long> ans;
vector<bool> visited;
int M;
long long dfs1(int u) {
//... | // https://atcoder.jp/contests/dp/tasks/dp_v
// V - Subtree
#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
vector<vector<int>> adj;
vector<vector<int>> adj_count;
vector<long long> ans;
vector<bool> visited;
int M;
long long dfs1(int u) {
//... | [
"assignment.change"
] | 988,510 | 988,511 | u993688697 | cpp |
p03187 | #include <bits/stdc++.h>
#define PB push_back
#define LL long long
const int mod = 1000 * 1000 * 1000 + 7;
using namespace std;
int x[200005];
int y[200005];
LL xPref[200005], yPref[200005];
LL sumX(int l, int r) { return xPref[r] - (l ? xPref[l - 1] : 0); }
LL sumY(int l, int r) { return yPref[r] - (l ? yPref[l - 1] ... | #include <bits/stdc++.h>
#define PB push_back
#define LL long long
const int mod = 1000 * 1000 * 1000 + 7;
using namespace std;
int x[200005];
int y[200005];
LL xPref[200005], yPref[200005];
LL sumX(int l, int r) { return xPref[r] - (l ? xPref[l - 1] : 0); }
LL sumY(int l, int r) { return yPref[r] - (l ? yPref[l - 1] ... | [
"expression.operation.binary.remove"
] | 988,549 | 988,550 | u804093140 | cpp |
p03187 | #include <assert.h>
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const int N = (int)2e5 + 500;
const ll INF = (ll)1e18;
int n, l;
int num[2 * N];
ll psum[2 * N];
int lb, rb;
int main() {
scanf("%d%d", &l, &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &num[i]);
}
num[... | #include <assert.h>
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const int N = (int)2e5 + 500;
const ll INF = (ll)1e18;
int n, l;
int num[2 * N];
ll psum[2 * N];
int lb, rb;
int main() {
scanf("%d%d", &l, &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &num[i]);
}
num[... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 988,553 | 988,554 | u940865945 | cpp |
p03187 | #include <algorithm>
#include <iostream>
#define llint long long
using namespace std;
llint L, n;
llint x[200005];
llint d[200005], sumd[200005];
llint calc() {
llint ret = 0, sum = 0;
llint s = n - n / 2, l = 2 * s - n;
for (int i = s + 1, t = 0; i <= n; i++, t += 2)
sum += t * d[i];
for (int i = s, t =... | #include <algorithm>
#include <iostream>
#define llint long long
using namespace std;
llint L, n;
llint x[200005];
llint d[200005], sumd[200005];
llint calc() {
llint ret = 0, sum = 0;
llint s = n - n / 2, l = 2 * s - n;
for (int i = s + 1, t = 0; i <= n; i++, t += 2)
sum += t * d[i];
for (int i = s, t =... | [] | 988,555 | 988,556 | u319282133 | cpp |
p03187 | #include <cassert>
#include <iostream>
using namespace std;
typedef long long ll;
ll N, L, X[200010] = {0}, S[200010] = {0};
int main() {
cin >> L >> N;
for (int i = 1; i <= N; i++) {
cin >> X[i];
S[i] = S[i - 1] + X[i];
}
ll ans = 0;
for (ll i = 1; i < N; i++) {
ll now = 0, m = (i + N + 1) / 2;
... | #include <cassert>
#include <iostream>
using namespace std;
typedef long long ll;
ll N, L, X[200010] = {0}, S[200010] = {0};
int main() {
cin >> L >> N;
for (int i = 1; i <= N; i++) {
cin >> X[i];
S[i] = S[i - 1] + X[i];
}
ll ans = 0;
for (ll i = 1; i <= N; i++) {
ll now = 0, m = (i + N + 1) / 2;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change"
] | 988,559 | 988,560 | u623954643 | cpp |
p03187 | #include <bits/stdc++.h>
using namespace std;
#define D(x) x
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define REPR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> PII;
typedef vector<int... | #include <bits/stdc++.h>
using namespace std;
#define D(x) x
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define REPR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> PII;
typedef vector<int... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 988,561 | 988,562 | u373522564 | cpp |
p03187 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n)... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n)... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 988,570 | 988,571 | u764844841 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define llong long long int
#define ullong unsigned long long int
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
llong a, b, c;
cin >> a >> b >> c;
llong ans = 0;
if (a + b + c >= c)
ans = b + c;
els... | #include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define llong long long int
#define ullong unsigned long long int
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
llong a, b, c;
cin >> a >> b >> c;
llong ans = 0;
if (a + b + 1 >= c)
ans = b + c;
els... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 988,574 | 988,575 | u943004959 | cpp |
p03186 | #include <iostream>
using namespace std;
long a, b, c;
int main() {
cin >> a >> b >> c;
cout << b + max(c, a + b + 1) << endl;
} | #include <iostream>
using namespace std;
long a, b, c;
int main() {
cin >> a >> b >> c;
cout << b + min(c, a + b + 1) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 988,582 | 988,583 | u993619636 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vll = vector<vl>;
using vii = vector<vi>;
usin... | #include <bits/stdc++.h>
using namespace std;
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vll = vector<vl>;
using vii = vector<vi>;
usin... | [
"control_flow.branch.if.condition.change"
] | 988,589 | 988,590 | u394853232 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vll = vector<vl>;
using vii = vector<vi>;
usin... | #include <bits/stdc++.h>
using namespace std;
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vll = vector<vl>;
using vii = vector<vi>;
usin... | [
"control_flow.branch.if.condition.change"
] | 988,591 | 988,590 | u394853232 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sqrt(x) sqrt(abs(x))
#define re return
#define sz(x) ((int)(x).size())
#define prev PREV
#define next NEXT
using ll = long long;
using ii = pair<int... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sqrt(x) sqrt(abs(x))
#define re return
#define sz(x) ((int)(x).size())
#define prev PREV
#define next NEXT
using ll = long long;
using ii = pair<int... | [
"assignment.change"
] | 988,600 | 988,601 | u413502127 | cpp |
p03186 | #include <cstdio>
int main() {
int a, b, c;
while (scanf("%d %d %d", &a, &b, &c) != EOF) {
int health = a + b + 1;
int ans;
if (c >= health)
ans = b + c;
else
ans = b + health;
printf("%d", ans);
}
return 0;
} | #include <cstdio>
int main() {
int a, b, c;
while (scanf("%d %d %d", &a, &b, &c) != EOF) {
int health = a + b + 1;
int ans;
if (c <= health)
ans = b + c;
else
ans = b + health;
printf("%d", ans);
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,602 | 988,603 | u516708338 | cpp |
p03186 | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(),... | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(),... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 988,612 | 988,613 | u518348232 | cpp |
p03186 | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(),... | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(),... | [
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 988,614 | 988,613 | u518348232 | cpp |
p03186 | #include <iostream>
using namespace std;
main() {
int A, B, C;
cin >> A >> B >> C;
int ans = 0;
if ((A + B) >= C)
ans += C;
else
ans += A + B;
ans += B;
cout << ans << endl;
}
| #include <iostream>
using namespace std;
main() {
int A, B, C;
cin >> A >> B >> C;
int ans = 0;
if ((A + B) >= C)
ans += C;
else
ans += A + B + 1;
ans += B;
cout << ans << endl;
}
| [
"assignment.change"
] | 988,628 | 988,629 | u346834985 | cpp |
p03186 | #include <stdio.h>
int main() {
int a;
int b;
int c;
scanf("%d %d %d", &a, &b, &c);
if (a + b > c) {
printf("%d\n", b + c);
} else {
printf("%d\n", a + b + 1 + b);
}
} | #include <stdio.h>
int main() {
int a;
int b;
int c;
scanf("%d %d %d", &a, &b, &c);
if (a + b >= c) {
printf("%d\n", b + c);
} else {
printf("%d\n", a + b + 1 + b);
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,630 | 988,631 | u660489157 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A;
cin >> B;
cin >> C;
if (A + B >= C + 1) {
cout << B + C << endl;
return 0;
} else {
cout << B + A + B + 1 << endl;
return 0;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A;
cin >> B;
cin >> C;
if (A + B >= C - 1) {
cout << B + C << endl;
return 0;
} else {
cout << B + A + B + 1 << endl;
return 0;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 988,634 | 988,635 | u802977614 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A;
cin >> B;
cin >> C;
if (A + B >= C + 1) {
cout << B + C << endl;
return 0;
} else {
cout << B + A + 1 << endl;
return 0;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A;
cin >> B;
cin >> C;
if (A + B >= C - 1) {
cout << B + C << endl;
return 0;
} else {
cout << B + A + B + 1 << endl;
return 0;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 988,636 | 988,635 | u802977614 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
int caneat = 0;
cin >> A >> B >> C;
if (A + B >= C)
caneat += B + C;
else
caneat += (A + B + 1);
cout << caneat;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
int caneat = 0;
cin >> A >> B >> C;
if (A + B >= C)
caneat += B + C;
else
caneat += (A + B + 1) + B;
cout << caneat;
return 0;
} | [
"assignment.change"
] | 988,645 | 988,646 | u010393289 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int A, B, C, ans;
cin >> A >> B >> C;
if (A + B <= C) {
ans = B + A + B + 1;
} else {
ans = B + C;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C, ans;
cin >> A >> B >> C;
if (A + B < C) {
ans = B + A + B + 1;
} else {
ans = B + C;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,647 | 988,648 | u742662089 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c - 1)
cout << b + c;
else
cout << a + b + b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c - 1)
cout << b + c;
else
cout << a + b + b + 1;
return 0;
} | [
"expression.operation.binary.add"
] | 988,656 | 988,657 | u785897267 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << b + c;
else
cout << a + b + b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c - 1)
cout << b + c;
else
cout << a + b + b + 1;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 988,658 | 988,657 | u785897267 | cpp |
p03186 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int n;
if (a + b > c) {
n = a + b;
} else {
if (a + b < c) {
n = a + b + b + 1;
} else {
n = a + b + b;
}
}
cout << n << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int n;
if (a + b > c) {
n = c + b;
} else {
if (a + b < c) {
n = a + b + b + 1;
} else {
n = a + b + b;
}
}
cout << n << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 988,659 | 988,660 | u752364921 | cpp |
p03186 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
ll ans = 0;
if (a + b > c)
ans = c;
else if (a + b < c)
ans = a + b * 2 + 1;
else if (a + b == c)
... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
ll ans = 0;
if (a + b > c)
ans = b + c;
else if (a + b < c)
ans = a + b * 2 + 1;
else if (a + b ==... | [
"assignment.change"
] | 988,661 | 988,662 | u244459371 | cpp |
p03186 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
ll ans = 0;
if (a + b > c)
ans = b + c;
else if (a + b < c)
ans = a + b * 2 + 1;
else if (a + b ==... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
ll ans = 0;
if (a + b > c)
ans = b + c;
else if (a + b < c)
ans = a + b * 2 + 1;
else if (a + b ==... | [] | 988,663 | 988,662 | u244459371 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c << endl;
} else {
cout << b + c - 1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c << endl;
} else {
cout << a + 2 * b + 1 << endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 988,664 | 988,665 | u018434698 | cpp |
p03186 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long LL;
int main() {
LL A, B, C;
cin >> A >> B >> C;
if (C > A + B + 1)
cout << 2 * A + B + 1;
else
cout << B + C;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long LL;
int main() {
LL A, B, C;
cin >> A >> B >> C;
if (C > A + B + 1)
cout << 2 * B + A + 1;
else
cout << B + C;
return 0;
}
| [
"expression.operation.binary.remove"
] | 988,674 | 988,675 | u254634413 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
long long int a;
long long int b;
long long int c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c;
}
if (a + b <= c) {
cout << a + 1 + b * 2;
}
} | #include <iostream>
using namespace std;
int main() {
long long int a;
long long int b;
long long int c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c;
}
if (a + b < c) {
cout << a + 1 + b * 2;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,676 | 988,677 | u365178348 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int a, b, c, res;
int main() {
scanf("%d %d %d", &a, &b, &c);
if ((a + b + 1) >= c)
printf("%d\n", b + c);
else
printf("%d\n", a + b + 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b, c, res;
int main() {
scanf("%d %d %d", &a, &b, &c);
if ((a + b + 1) >= c)
printf("%d\n", b + c);
else
printf("%d\n", a + b + b + 1);
return 0;
} | [
"expression.operation.binary.add"
] | 988,684 | 988,685 | u057586044 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - 1 >= a + b) {
cout << a + b + 3;
} else {
cout << b + c;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - 2 >= a + b) {
cout << a + (2 * b) + 1;
} else {
cout << b + c;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 988,690 | 988,691 | u054759548 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - 2 >= a + b) {
cout << a + b + 3;
} else {
cout << b + c;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - 2 >= a + b) {
cout << a + (2 * b) + 1;
} else {
cout << b + c;
}
} | [
"literal.number.change",
"io.output.change"
] | 988,692 | 988,691 | u054759548 | cpp |
p03186 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
int A, B, C;
cin >> A >> B >> C;
int ret = 0;
if (C > A + B + 2) {
ret = A + B + 3;
} else {
ret = B + C;
... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
int A, B, C;
cin >> A >> B >> C;
int ret = 0;
if (C > A + B + 1) {
ret = A + B + 1 + B;
} else {
ret = B + C... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 988,695 | 988,696 | u165393068 | cpp |
p03186 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
int A, B, C;
cin >> A >> B >> C;
int ret = 0;
if (C >= A + B + 2) {
ret = A + B + 3;
} else {
ret = B + C;
... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
int A, B, C;
cin >> A >> B >> C;
int ret = 0;
if (C > A + B + 1) {
ret = A + B + 1 + B;
} else {
ret = B + C... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 988,697 | 988,696 | u165393068 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, ans;
cin >> a >> b >> c;
if (a + b > c)
ans = b + c;
else
ans = a + b + b + 1;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, ans;
cin >> a >> b >> c;
if (a + b >= c)
ans = b + c;
else
ans = a + b + b + 1;
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,700 | 988,701 | u414768457 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
if ((a + b) >= c)
cout << b + c << endl;
else
cout << min(a * 2, b + c) << endl;
} | #include <iostream>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
if ((a + b) >= c)
cout << b + c << endl;
else
cout << min(b * 2 + a + 1, b + c) << endl;
} | [
"identifier.change",
"io.output.change"
] | 988,702 | 988,703 | u269278772 | cpp |
p03186 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(a + b + 1, c) + b << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a + b + 1, c) + b << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 988,708 | 988,709 | u508026200 | cpp |
p03182 | // In the Name of Allah
// Ya Ali!
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
const ll maxn = 2e5 + 10;
const ll mod = 1e9 + 7;
const ll INF = 1e18;
ll n, m, dp... | // In the Name of Allah
// Ya Ali!
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
const ll maxn = 2e5 + 10;
const ll mod = 1e9 + 7;
const ll INF = 1e18;
ll n, m, dp... | [
"variable_declaration.value.change",
"expression.operation.unary.remove"
] | 988,742 | 988,743 | u265206075 | cpp |
p03182 | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i, m, n) for (ll i = (m); i < (n); i++)
#define rrep(i, m, n) for (ll i = (m); i >= (n); i--)
#define printa(x, n) ... | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i, m, n) for (ll i = (m); i < (n); i++)
#define rrep(i, m, n) for (ll i = (m); i >= (n); i--)
#define printa(x, n) ... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"call.function.change"
] | 988,752 | 988,751 | u218842729 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct P {
int l;
ll a;
};
ll L[200000], ans;
vector<P> R[200000];
const ll LINF = 1e18;
// BEGIN CUT HERE
template <typename T, typename E> struct SegmentTree {
using F = function<T(T, T)>;
using G = function<T(T, E)>;
using H = function<E... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct P {
int l;
ll a;
};
ll L[200001], ans;
vector<P> R[200001];
const ll LINF = 1e18;
// BEGIN CUT HERE
template <typename T, typename E> struct SegmentTree {
using F = function<T(T, T)>;
using G = function<T(T, E)>;
using H = function<E... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.change"
] | 988,758 | 988,757 | u942774736 | cpp |
p03182 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b... | [
"identifier.change",
"function.return_value.change",
"assignment.value.change"
] | 988,759 | 988,760 | u209713918 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> vals[200005], segment;
long long n, m, t, sum;
long long getmin(int a, int b, int curr, int l, int r) {
if (b < l || a > r) {
return 1000000000;
}
if (a <= l && b >= r) {
return segment[curr].first + segment[curr].second;
... | #include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> vals[200005], segment;
long long n, m, t, sum;
long long getmin(int a, int b, int curr, int l, int r) {
if (b < l || a > r) {
return 1000000000;
}
if (a <= l && b >= r) {
return segment[curr].first + segment[curr].second;
... | [
"expression.operation.binary.add"
] | 988,764 | 988,765 | u689442090 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> vals[200005], segment;
long long n, m, t, sum;
long long getmin(int a, int b, int curr, int l, int r) {
if (b < l || a > r) {
return 1000000000;
}
if (a <= l && b >= r) {
return segment[curr].first + segment[curr].second;
... | #include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> vals[200005], segment;
long long n, m, t, sum;
long long getmin(int a, int b, int curr, int l, int r) {
if (b < l || a > r) {
return 1000000000;
}
if (a <= l && b >= r) {
return segment[curr].first + segment[curr].second;
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 988,766 | 988,765 | u689442090 | cpp |
p03182 | /*
数据不清空，爆零两行泪。
多测不读完，爆零两行泪。
边界不特判，爆零两行泪。
贪心不证明，爆零两行泪。
D P 顺序错，爆零两行泪。
大小少等号，爆零两行泪。
变量不统一，爆零两行泪。
越界不判断，爆零两行泪。
调试不注释，爆零两行泪。
溢出不 l l，爆零两行泪。
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define X first
#define Y second
const int inf = 0x3f3f3f3f3f3f3f3f;
c... | /*
数据不清空，爆零两行泪。
多测不读完，爆零两行泪。
边界不特判，爆零两行泪。
贪心不证明，爆零两行泪。
D P 顺序错，爆零两行泪。
大小少等号，爆零两行泪。
变量不统一，爆零两行泪。
越界不判断，爆零两行泪。
调试不注释，爆零两行泪。
溢出不 l l，爆零两行泪。
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define X first
#define Y second
const int inf = 0x3f3f3f3f3f3f3f3f;
c... | [
"identifier.change",
"call.function.change"
] | 988,772 | 988,773 | u058625538 | cpp |
p03182 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 200100;
int n, q;
ll dp[maxn], result;
struct qry {
public:
int l, r;
ll value;
};
vector<qry> openings[maxn];
vector<qry> closings[maxn];
ll tree[4 * maxn], lazy[4 * maxn];
void push_u... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 200100;
int n, q;
ll dp[maxn], result;
struct qry {
public:
int l, r;
ll value;
};
vector<qry> openings[maxn];
vector<qry> closings[maxn];
ll tree[4 * maxn], lazy[4 * maxn];
void push_u... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 988,783 | 988,784 | u356738755 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POS... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POS... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 988,788 | 988,789 | u780122303 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define mkp make_pair
#define fi first
#define se second
void read(int &x) {
int res = 1;
char ch = getchar();
x = 0;
for (; ch == ' ' || ch == '\n'; ch = getchar())
;
if (ch == '-')
res = -1, ch = getchar(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define mkp make_pair
#define fi first
#define se second
void read(int &x) {
int res = 1;
char ch = getchar();
x = 0;
for (; ch == ' ' || ch == '\n'; ch = getchar())
;
if (ch == '-')
res = -1, ch = getchar(... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 988,798 | 988,799 | u937608388 | cpp |
p03182 | #include <bits/stdc++.h>
#define pii pair<int, int>
#define fir first
#define sec second
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define ll long long
using namespace std;
const int MAXN = 2e5 + 7;
ll T[MAXN << 2], lazy[MAXN << 2];
void pushup(int rt) { T[rt] = max(T[lson], T[rson]); }
void upd(int rt, ll v) {... | #include <bits/stdc++.h>
#define pii pair<int, int>
#define fir first
#define sec second
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define ll long long
using namespace std;
const int MAXN = 2e5 + 7;
ll T[MAXN << 2], lazy[MAXN << 2];
void pushup(int rt) { T[rt] = max(T[lson], T[rson]); }
void upd(int rt, ll v) {... | [
"call.add",
"call.arguments.add"
] | 988,804 | 988,805 | u366089652 | cpp |
p03182 | #include <bits/stdc++.h>
#define ll long long
#define maxn 200005
#define INF 1000000000000000005ll
using namespace std;
int n, m;
vector<pair<pair<ll, ll>, ll>> interval;
struct S {
ll mx, prop;
} tree[maxn * 3 + 5];
void add(int node, int b, int e, int i, int j, ll x) {
if (j < b || i > e)
return;
if (b >... | #include <bits/stdc++.h>
#define ll long long
#define maxn 200005
#define INF 1000000000000000005ll
using namespace std;
int n, m;
vector<pair<pair<ll, ll>, ll>> interval;
struct S {
ll mx, prop;
} tree[maxn * 3 + 5];
void add(int node, int b, int e, int i, int j, ll x) {
if (j < b || i > e)
return;
if (b >... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove"
] | 988,816 | 988,817 | u798648594 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
ll esq[200005], dir[200005], val[200005];
ll tree[800005], lazy[800005];
vector<ii> adj[200005];
ll left(ll u) { return (u << 1); }
ll right(ll u) { return (u << 1) + 1; }
void push(ll u, ll L, ll R) {
if (lazy[u])
tre... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
ll esq[200005], dir[200005], val[200005];
ll tree[800005], lazy[800005];
vector<ii> adj[200005];
ll left(ll u) { return (u << 1); }
ll right(ll u) { return (u << 1) + 1; }
void push(ll u, ll L, ll R) {
if (lazy[u])
tre... | [
"call.add",
"call.arguments.change"
] | 988,826 | 988,827 | u077712028 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | [
"call.add",
"call.arguments.change"
] | 988,837 | 988,838 | u139031151 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | [
"assignment.change"
] | 988,837 | 988,839 | u139031151 | cpp |
p03182 | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | [
"expression.operation.binary.add"
] | 988,844 | 988,845 | u283869437 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
typedef struct line {
int lp, rp, value;
bool operator<(const struct line &n) const { return rp < n.rp; }
} LINE, *PLINE;
LINE arr[200000];
long long linetree[1 << 19], lazy[1 << 19];
long long query(int index, int lb, int rb, int lq, int rq) {
if (lb == lq && rb == r... | #include <bits/stdc++.h>
using namespace std;
typedef struct line {
int lp, rp, value;
bool operator<(const struct line &n) const { return rp < n.rp; }
} LINE, *PLINE;
LINE arr[200000];
long long linetree[1 << 19], lazy[1 << 19];
long long query(int index, int lb, int rb, int lq, int rq) {
if (lb == lq && rb == r... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 988,869 | 988,870 | u952922991 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
typedef struct node {
int left, right, value;
bool operator<(const struct node &t) const { return right < t.right; }
} EDGE, *PEDGE;
int cnt = 0;
long long lazy[1 << 19];
EDGE arr[1 << 18];
long long tree[1 << 19];
long long search(int index, int lb, int rb, int lq, int... | #include <bits/stdc++.h>
using namespace std;
typedef struct node {
int left, right, value;
bool operator<(const struct node &t) const { return right < t.right; }
} EDGE, *PEDGE;
int cnt = 0;
long long lazy[1 << 19];
EDGE arr[1 << 18];
long long tree[1 << 19];
long long search(int index, int lb, int rb, int lq, int... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 988,871 | 988,872 | u397016646 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
typedef struct range {
int left, right, value;
bool operator<(const struct range &t) const { return right < t.right; }
} RANGE, *PRANGE;
long long tree[1 << 19], lazy[1 << 19];
RANGE arr[200001];
long long search(int index, int lb, int rb, int lq, int rq) {
if (lq == ... | #include <bits/stdc++.h>
using namespace std;
typedef struct range {
int left, right, value;
bool operator<(const struct range &t) const { return right < t.right; }
} RANGE, *PRANGE;
long long tree[1 << 19], lazy[1 << 19];
RANGE arr[200001];
long long search(int index, int lb, int rb, int lq, int rq) {
if (lq == ... | [
"control_flow.return.remove"
] | 988,873 | 988,874 | u379393519 | cpp |
p03182 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
#define N 200010
#define ll long long
using namespace std;
ll T[N * 8], tag[N * 8];
#define ls id << 1
#define rs id << 1 | 1
void add(int id, ll x) { tag[id] += x, T[id] += x; }
void pushdown(int id) {
if (tag[id] == 0)
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
#define N 200010
#define ll long long
using namespace std;
ll T[N * 8], tag[N * 8];
#define ls id << 1
#define rs id << 1 | 1
void add(int id, ll x) { tag[id] += x, T[id] += x; }
void pushdown(int id) {
if (tag[id] == 0)
... | [
"call.add",
"call.arguments.add"
] | 988,891 | 988,892 | u804173974 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define forlr(i, l, r) for (int i = int(l); i <= int(r); i++)
#define repeat(n) for (int hjfjke = 0; hjfjke < int(n); hjfjke++)
#define all(c) c.begin(), c.end()
#define ll long long
int mod = 10000... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define forlr(i, l, r) for (int i = int(l); i <= int(r); i++)
#define repeat(n) for (int hjfjke = 0; hjfjke < int(n); hjfjke++)
#define all(c) c.begin(), c.end()
#define ll long long
int mod = 10000... | [
"literal.number.change",
"variable_declaration.value.change"
] | 988,927 | 988,928 | u503820274 | cpp |
p03187 | #include <algorithm>
#include <iostream>
#include <vector>
using lint = long long;
int main() {
lint L;
int N;
std::cin >> L >> N;
std::vector<lint> A(N);
for (auto &a : A)
std::cin >> a;
std::vector<lint> rsum(N + 1, 0);
for (int i = 0; i < N; ++i)
rsum[i + 1] = rsum[i] + A[i];
// Aを左右反転させ... | #include <algorithm>
#include <iostream>
#include <vector>
using lint = long long;
int main() {
lint L;
int N;
std::cin >> L >> N;
std::vector<lint> A(N);
for (auto &a : A)
std::cin >> a;
std::vector<lint> rsum(N + 1, 0);
for (int i = 0; i < N; ++i)
rsum[i + 1] = rsum[i] + A[i];
// Aを左右反転させ... | [
"identifier.change",
"expression.operation.binary.change"
] | 988,943 | 988,944 | u059727354 | cpp |
p03187 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
Int solve(int L, int N, const vector<int> &X) {
vector<Int> Y(N + 1), Z(N + 1);
Y[0] = Z[0] = 0;
for (int i = 0; i < N; i++) {
Y[i + 1] = Y[i] + X[i];
Z[i + 1] = Z[i] + L - X[N - 1 - i];
}
Int ans = 0;
for (int i = 1; i < N; i++) {... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
Int solve(int L, int N, const vector<int> &X) {
vector<Int> Y(N + 1), Z(N + 1);
Y[0] = Z[0] = 0;
for (int i = 0; i < N; i++) {
Y[i + 1] = Y[i] + X[i];
Z[i + 1] = Z[i] + L - X[N - 1 - i];
}
Int ans = 0;
for (int i = 1; i <= N; i++) ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 988,953 | 988,954 | u449722246 | cpp |
p03187 | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define Repr(i, n, a) for (int i = (n); i >= (a); i--)
#define rep(i, n) Rep(i, 0, n)
#define repr(i, n) Repr(i, n, 0)
#define all(a) a.begin(), a.end()
using namespace std;
typedef pair<int, int> P;
typ... | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define Repr(i, n, a) for (int i = (n); i >= (a); i--)
#define rep(i, n) Rep(i, 0, n)
#define repr(i, n) Repr(i, n, 0)
#define all(a) a.begin(), a.end()
using namespace std;
typedef pair<int, int> P;
typ... | [
"identifier.replace.add",
"literal.replace.remove"
] | 988,955 | 988,956 | u869282786 | cpp |
p03187 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll L, N;
cin >> L >> N;
vector<ll> clock;
vector<ll> counterClock;
vector<ll> sum_a(N + 1, 0);
vector<ll> sum_b(N + 1, 0);
clock.resize(N);
counterClock.resize(N);
for (ll i = 0; i < N; ++i) {
ll num;... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll L, N;
cin >> L >> N;
vector<ll> clock;
vector<ll> counterClock;
vector<ll> sum_a(N + 1, 0);
vector<ll> sum_b(N + 1, 0);
clock.resize(N);
counterClock.resize(N);
for (ll i = 0; i < N; ++i) {
ll num;... | [
"assignment.change"
] | 988,965 | 988,966 | u045291627 | cpp |
p03187 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
#define int ll
const int N = 200005;
int L, n, x[N], ans, sum[N], tmp1, tmp2, np, p, Suf[N], Pre[N];
signed main() {
scanf("%lld%lld", &L, &n);
for (int i = 1; i <= n; i++)
scanf("%lld", &x[i]), Pre[i] = Pre[i - 1] + x[... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
#define int ll
const int N = 200005;
int L, n, x[N], ans, tmp1, tmp2, np, p, Suf[N], Pre[N];
signed main() {
scanf("%lld%lld", &L, &n);
for (int i = 1; i <= n; i++)
scanf("%lld", &x[i]), Pre[i] = Pre[i - 1] + x[i];
fo... | [
"variable_declaration.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 988,970 | 988,971 | u635760914 | cpp |
p03187 | #include <algorithm>
#include <cstdio>
using namespace std;
using ll = long long;
const int MAX = 200001;
int main() {
int L, N;
scanf("%d %d", &L, &N);
ll p1[MAX], p2[MAX];
for (int x, i = 1; i <= N; i++) {
scanf("%d", &x);
p1[i] = x;
p2[N + 1 - i] = L - x;
}
ll dp1[MAX] = {L - p1[N]}, dp2[... | #include <algorithm>
#include <cstdio>
using namespace std;
using ll = long long;
const int MAX = 200005;
int main() {
int L, N;
scanf("%d %d", &L, &N);
int p1[MAX], p2[MAX];
for (int x, i = 1; i <= N; i++) {
scanf("%d", &x);
p1[i] = x;
p2[N + 1 - i] = L - x;
}
ll dp1[MAX] = {L - p1[N]}, dp2... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.change",
"call.arguments.change"
] | 988,982 | 988,983 | u382864097 | cpp |
p03187 | #include <algorithm>
#include <cstdio>
using namespace std;
using ll = long long;
const int MAX = 200001;
int main() {
int L, N;
scanf("%d %d", &L, &N);
ll p1[MAX], p2[MAX];
for (int x, i = 1; i <= N; i++) {
scanf("%d", &x);
p1[i] = x;
p2[N + 1 - i] = L - x;
}
ll dp1[MAX] = {L - p1[N]}, dp2[... | #include <algorithm>
#include <cstdio>
using namespace std;
using ll = long long;
const int MAX = 200005;
int main() {
int L, N;
scanf("%d %d", &L, &N);
ll p1[MAX], p2[MAX];
for (int x, i = 1; i <= N; i++) {
scanf("%d", &x);
p1[i] = x;
p2[N + 1 - i] = L - x;
}
ll dp1[MAX] = {L - p1[N]}, dp2[... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 988,982 | 988,984 | u382864097 | cpp |
p03187 | // In the name of God
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define int ll
const int N = 2e5 + 10, mod = 1e9 + 7;
int x[N], L, n;
int go(int m, int l, int r, int id, int pos) {
if (id == 0) {
if (l < 0)
return L - x[pos];
return L - (x[pos]... | // In the name of God
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define int ll
const int N = 2e5 + 10, mod = 1e9 + 7;
int x[N], L, n;
int go(int m, int l, int r, int id, int pos) {
if (id == 0) {
if (l < 0)
return L - x[pos];
return L - (x[pos]... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 988,997 | 988,992 | u733809893 | cpp |
p03187 | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
using db = long double;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pdi = pair<double, int>;
template <class T> using mat = vector<vector<T>>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
... | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
using db = long double;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pdi = pair<double, int>;
template <class T> using mat = vector<vector<T>>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
... | [
"assignment.add"
] | 989,002 | 989,003 | u629015299 | cpp |
p03187 | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 989,008 | 989,009 | u239493918 | cpp |
p03187 | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"assignment.value.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change"
] | 989,010 | 989,009 | u239493918 | cpp |
p03187 | #include <bits/stdc++.h>
using namespace std;
vector<long long> v;
int n;
long long L;
long long kum[200009];
long long ans = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> L >> n;
for (int i = 1; i <= n; i++) {
long long szam;
cin >> szam;
v.push_back(szam);
kum[i] = kum[i - 1]... | #include <bits/stdc++.h>
using namespace std;
vector<long long> v;
int n;
long long L;
long long kum[200009];
long long ans = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> L >> n;
for (int i = 1; i <= n; i++) {
long long szam;
cin >> szam;
v.push_back(szam);
kum[i] = kum[i - 1]... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 989,014 | 989,015 | u226533718 | cpp |
p03192 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#de... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#de... | [
"control_flow.branch.if.condition.change"
] | 989,016 | 989,017 | u125669112 | cpp |
p03192 | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
int ans;
for (int i = 0; i < 4; i++) {
if (N[i] == '2')
++ans;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
int ans = 0;
for (int i = 0; i < 4; i++) {
if (N[i] == '2')
++ans;
}
cout << ans << endl;
} | [
"variable_declaration.value.change"
] | 989,019 | 989,020 | u418892821 | cpp |
p03192 | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
int ans;
for (int i = 0; i < 4; i++) {
if (N[i] == '2')
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
int ans = 0;
for (int i = 0; i < 4; i++) {
if (N[i] == '2')
++ans;
}
cout << ans << endl;
} | [
"variable_declaration.value.change"
] | 989,021 | 989,020 | u418892821 | cpp |
p03192 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int ans = 0;
for (int i = 0; i < str.size(); i++) {
if (str.at(0) == '2') {
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int ans = 0;
for (int i = 0; i < str.size(); i++) {
if (str.at(i) == '2') {
ans++;
}
}
cout << ans << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 989,025 | 989,026 | u785492958 | cpp |
p03192 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (int i = s; i < (int)(n); i++)
int main() {
string s;
int c = 0;
rep(i, 0, s.size()) if (s[i] == '2') c++;
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (int i = s; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int c = 0;
rep(i, 0, s.size()) if (s[i] == '2') c++;
cout << c << endl;
} | [] | 989,029 | 989,030 | u634967948 | cpp |
p03192 | #include <iostream>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= 4; ++i) {
if (n % 10 == 20)
ans++;
n /= 10;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= 4; ++i) {
if (n % 10 == 2)
ans++;
n /= 10;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 989,040 | 989,042 | u746292546 | cpp |
p03192 | #include <iostream>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= 4; ++i) {
if (n % 10 == 0)
ans++;
n /= 10;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= 4; ++i) {
if (n % 10 == 2)
ans++;
n /= 10;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 989,044 | 989,042 | u746292546 | cpp |
p03192 | #include <bits/stdc++.h>
using namespace std;
int a[10];
int ans;
int main() {
for (int i = 1; i <= 4; i++) {
scanf("%d", &a[i]);
if (a[i] == 2)
ans++;
}
printf("%d", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[10];
int ans;
int main() {
for (int i = 1; i <= 4; i++) {
scanf("%1d", &a[i]);
if (a[i] == 2)
ans++;
}
printf("%d", ans);
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 989,051 | 989,053 | u357154104 | cpp |
p03192 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i, n) for (in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i, n) for (in... | [
"control_flow.branch.if.condition.change"
] | 989,069 | 989,070 | u545364250 | cpp |
p03192 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
int count = 0;
for (int i = 0; i < n.size(); i++) {
if (n.at(i) == 2) {
count++;
}
}
cout << count;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
int count = 0;
for (int i = 0; i < n.size(); i++) {
if (n.at(i) == '2') {
count++;
}
}
cout << count;
} | [
"control_flow.branch.if.condition.change"
] | 989,083 | 989,084 | u955282280 | cpp |
p03192 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
typedef long long int ll;
using namespace std;
int main() {
char n[4];
ll ans = 0;
for (ll i = 0; i < 4; ++i) {
cin >> n[i];
if (n[1] == '2') {
ans += 1;
}
}
cout << ans << endl... | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
typedef long long int ll;
using namespace std;
int main() {
char n[4];
ll ans = 0;
for (ll i = 0; i < 4; ++i) {
cin >> n[i];
if (n[i] == '2') {
ans += 1;
}
}
cout << ans << endl... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 989,088 | 989,089 | u473023730 | cpp |
p03191 | #include <bits/stdc++.h>
const int MAXN = 310, MOD = 1e9 + 7;
inline int mul(int x, int y) { return 1LL * x * y % MOD; }
inline void Add(int &x, int y) { (x += y) >= MOD && (x -= MOD); }
inline void Mul(int &x, int y) { x = 1LL * x * y % MOD; }
int n, m, tot, QAQ;
int a[MAXN * 2], b[MAXN * 2], c[MAXN * 2], dp[MAXN * ... | #include <bits/stdc++.h>
const int MAXN = 310, MOD = 1e9 + 7;
inline int mul(int x, int y) { return 1LL * x * y % MOD; }
inline void Add(int &x, int y) { (x += y) >= MOD && (x -= MOD); }
inline void Mul(int &x, int y) { x = 1LL * x * y % MOD; }
int n, m, tot, QAQ;
int a[MAXN * 2], b[MAXN * 2], c[MAXN * 2], dp[MAXN * ... | [] | 989,050 | 989,052 | u965088197 | cpp |
p03191 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 305, mod = 1e9 + 7;
int n, tot, a[2 * N], mark[2 * N], tmp[2 * N], f[2 * N][N][N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= 2 * n; i++)
scanf("%d", &a[i]);
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i * 2 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 305, mod = 1e9 + 7;
int n, tot, a[2 * N], mark[2 * N], tmp[2 * N], f[2 * N][N][N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= 2 * n; i++)
scanf("%d", &a[i]);
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i * 2 ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 989,115 | 989,116 | u389628673 | cpp |
p03191 | #include <bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i, a, b) for (register sign i = (sign)(a); i <= (sign)(b); ++i)
#define Fordown(i, a, b) for (register sign i = (sign)(a); i >= (sign)(b); --i)
const int N = 600 + 5;
template <typename T> bool cmax(T &a, T b) { return (a ... | #include <bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i, a, b) for (register sign i = (sign)(a); i <= (sign)(b); ++i)
#define Fordown(i, a, b) for (register sign i = (sign)(a); i >= (sign)(b); --i)
const int N = 600 + 5;
template <typename T> bool cmax(T &a, T b) { return (a ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 989,125 | 989,126 | u332108407 | cpp |
p03191 | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long LL;
typedef double db;
int get() {
char ch;
while (ch = getchar(), (ch < '0' || ch > '9') && ch != '-')
;
if (ch == '-') {
int s = 0;
wh... | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long LL;
typedef double db;
int get() {
char ch;
while (ch = getchar(), (ch < '0' || ch > '9') && ch != '-')
;
if (ch == '-') {
int s = 0;
wh... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 989,129 | 989,130 | u150505183 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.