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 |
|---|---|---|---|---|---|---|---|
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, count, num, num_boll = 0;
cin >> N;
vector<int> array(N + 1), bolls(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> array.at(i);
}
for (int i = N; i > 0; i--) {
count = 2;
num = 0;
for (int j = i * count; j < ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, count, num, num_boll = 0;
cin >> N;
vector<int> array(N + 1), bolls(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> array.at(i);
}
for (int i = N; i > 0; i--) {
count = 2;
num = 0;
for (int j = i * count; j < ... | [
"assignment.value.change",
"identifier.change"
] | 778,279 | 778,280 | u247407965 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, count, num, num_boll = 0;
cin >> N;
vector<int> array(N + 1), bolls(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> array.at(i);
}
for (int i = N; i > 0; i--) {
count = 2;
num = 0;
for (int j = i * count; j < ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, count, num, num_boll = 0;
cin >> N;
vector<int> array(N + 1), bolls(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> array.at(i);
}
for (int i = N; i > 0; i--) {
count = 2;
num = 0;
for (int j = i * count; j < ... | [
"assignment.value.change",
"identifier.change"
] | 778,281 | 778,280 | u247407965 | cpp |
p02972 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
typedef long long int ll;
using namespace std;
int n;
int main() {
cin >> n;
vector<int> a(n + 1);
vector<int> ans;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i >= 1; i--) {
for (int j = i + i; j < n; j += i) {
... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
typedef long long int ll;
using namespace std;
int n;
int main() {
cin >> n;
vector<int> a(n + 1);
vector<int> ans;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i >= 1; i--) {
for (int j = i + i; j <= n; j += i) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,282 | 778,283 | u628262476 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Int n;
Int a[200005], b[200005];
cin >> n;
for (Int i = 1; i <= n; i++) {
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Int n;
Int a[200005], b[200005];
cin >> n;
for (Int i = 1; i <= n; i++) {
cin >> a[i];
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,287 | 778,288 | u026620445 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m) for (ll i = 0; i < m; i++)
#define FOR(i, n, m) for (ll i = n; i < m; i++)
#define INF 1000000007
#define INFL (1LL << 60)
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define pb push_back
#define ll long long int... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m) for (ll i = 0; i < m; i++)
#define FOR(i, n, m) for (ll i = n; i < m; i++)
#define INF 1000000007
#define INFL (1LL << 60)
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define pb push_back
#define ll long long int... | [
"control_flow.loop.condition.change",
"assignment.change"
] | 778,293 | 778,294 | u773548422 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define inputInt(a) \
int a; \
cin >> a;
#define inputInt2(a, b) \
int a; ... | #include <bits/stdc++.h>
using namespace std;
#define inputInt(a) \
int a; \
cin >> a;
#define inputInt2(a, b) \
int a; ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,297 | 778,298 | u135358384 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
static int A[200010], X[200010] = {};
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = N; i >= 1; i--) {
int COUNT = 0;
for (int j = 2; i * j <= N; j++) {
COUNT += X[j];
}
if (COUNT % 2 == A[i])
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
static int A[200010], X[200010] = {};
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = N; i >= 1; i--) {
int COUNT = 0;
for (int j = 2; i * j <= N; j++) {
COUNT += X[i * j];
}
if (COUNT % 2 == A[i])
... | [
"assignment.change"
] | 778,305 | 778,306 | u454087021 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,307 | 778,308 | u117734686 | cpp |
p02972 | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll N, M = 0;
ll i, j;
ll tmp;
cin >> N;
ll a[N + 1], b[N + 1];
for (i = 1; i <= N; i++) {
cin >> a[i];
b[i] = 0;
}
for (i = N; i > 0; i--) {
tmp = 0;
j = i;
while (tmp <= N) {
tmp = (tmp + b[j]) % 2;
... | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll N, M = 0;
ll i, j;
ll tmp;
cin >> N;
ll a[N + 1], b[N + 1];
for (i = 1; i <= N; i++) {
cin >> a[i];
b[i] = 0;
}
for (i = N; i > 0; i--) {
tmp = 0;
j = i;
while (j <= N) {
tmp = (tmp + b[j]) % 2;
... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 778,309 | 778,310 | u770161743 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
int n;
cin >> n;
vector<int> a(n + 1);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
int n;
cin >> n;
vector<int> a(n + 1);
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 778,311 | 778,312 | u292106243 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define loop(i, n) rep(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0);
rep(i, 1, 1 + n) cin >> a[i];
int cnt = 0;
for (int i = n; i > 0; --i) {
int... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define loop(i, n) rep(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0);
rep(i, 1, 1 + n) cin >> a[i];
int cnt = 0;
for (int i = n; i > 0; --i) {
int... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"identifier.change"
] | 778,313 | 778,314 | u350561621 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define loop(i, n) rep(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0);
rep(i, 1, 1 + n) cin >> a[i];
int cnt = 0;
for (int i = n; i > 0; --i) {
int... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define loop(i, n) rep(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0);
rep(i, 1, 1 + n) cin >> a[i];
int cnt = 0;
for (int i = n; i > 0; --i) {
int... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 778,315 | 778,314 | u350561621 | cpp |
p02972 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,318 | 778,319 | u020746846 | cpp |
p02972 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,320 | 778,319 | u020746846 | cpp |
p02972 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 778,321 | 778,322 | u169580012 | cpp |
p02972 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 778,323 | 778,322 | u169580012 | cpp |
p02972 | #include <cstdio>
#include <iostream>
#define N 200005
using namespace std;
int n, c, s, a[N], ans[N];
int main() {
int i, j;
cin >> n;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = n; i >= 1; i--) {
s = 0;
for (j = 2; i * j <= n; j++)
s += ans[j];
ans[i] = s % 2 != a[i];
c +=... | #include <cstdio>
#include <iostream>
#define N 200005
using namespace std;
int n, c, s, a[N], ans[N];
int main() {
int i, j;
cin >> n;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = n; i >= 1; i--) {
s = 0;
for (j = 2; i * j <= n; j++)
s += ans[i * j];
ans[i] = s % 2 != a[i];
... | [
"assignment.change"
] | 778,330 | 778,331 | u230265105 | cpp |
p02972 | #include <cstdio>
#include <iostream>
#define N 200005
using namespace std;
int n, c, s, a[N], ans[N];
int main() {
int i, j;
cin >> n;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = n; i >= 1; i--) {
for (j = 2; i * j <= n; j++)
s += ans[j];
ans[i] = s % 2 != a[i];
c += ans[i];
... | #include <cstdio>
#include <iostream>
#define N 200005
using namespace std;
int n, c, s, a[N], ans[N];
int main() {
int i, j;
cin >> n;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = n; i >= 1; i--) {
s = 0;
for (j = 2; i * j <= n; j++)
s += ans[i * j];
ans[i] = s % 2 != a[i];
... | [
"assignment.add",
"assignment.change"
] | 778,332 | 778,331 | u230265105 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin ... | [
"assignment.value.change",
"identifier.change"
] | 778,337 | 778,338 | u129667379 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin ... | [
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,339 | 778,338 | u129667379 | cpp |
p02972 | #include <iostream>
using namespace std;
int main() {
int N, a[200001], k[200001];
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
int m = 0;
for (int i = N; i > 0; i--) {
int j = 0, n = 0;
while (j <= N) {
n += k[j];
j += i;
}
if (n % 2 != a[i]) {
k[i] = 1;
... | #include <iostream>
using namespace std;
int main() {
int N, a[200001], k[200001];
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
int m = 0;
for (int i = N; i > 0; i--) {
int j = 0, n = 0;
while (j <= N) {
n += k[j];
j += i;
}
if (n % 2 != a[i]) {
k[i] = 1;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change",
"literal.string.change"
] | 778,349 | 778,350 | u204523044 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
c... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
c... | [] | 778,356 | 778,357 | u397070717 | cpp |
p02972 | #include <cstdio>
const int MAXN = 2e5 + 5;
int A[MAXN]{};
int B[MAXN]{};
int M, N;
int count_up(int i) {
int sum = 0;
for (int j = i; 1LL * j * j <= N; j += i) {
if (B[j])
sum ^= 1;
}
return sum;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
}
M = 0;... | #include <cstdio>
const int MAXN = 2e5 + 5;
int A[MAXN]{};
int B[MAXN]{};
int M, N;
int count_up(int i) {
int sum = 0;
for (int j = i; j <= N; j += i) {
if (B[j])
sum ^= 1;
}
return sum;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
}
M = 0;
for (in... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 778,368 | 778,369 | u801608329 | cpp |
p02972 | #include <cstdio>
const int MAXN = 2e5 + 5;
int A[MAXN]{};
int B[MAXN]{};
int M, N;
int count_up(int i) {
int sum = 0;
for (int j = i; j * j <= N; j += i) {
if (B[j])
sum ^= 1;
}
return sum;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
}
M = 0;
for... | #include <cstdio>
const int MAXN = 2e5 + 5;
int A[MAXN]{};
int B[MAXN]{};
int M, N;
int count_up(int i) {
int sum = 0;
for (int j = i; j <= N; j += i) {
if (B[j])
sum ^= 1;
}
return sum;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
}
M = 0;
for (in... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 778,370 | 778,369 | u801608329 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1, 0);
vector<int> ans(n + 1, 0);
for (int i =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1, 0);
vector<int> ans(n + 1, 0);
for (int i =... | [
"assignment.value.change",
"identifier.change"
] | 778,375 | 778,376 | u007567244 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; ++i)
cin >> A[i];
int box[N];
for (int i = 0; i < N; ++i)
box[i] = 0;
int ball = 0;
for (int i = N - 1; i >= N / 2; --i) {
if (A[i] != 0) {
box[i] = 1;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; ++i)
cin >> A[i];
int box[N];
for (int i = 0; i < N; ++i)
box[i] = 0;
int ball = 0;
for (int i = N - 1; i >= N / 2; --i) {
if (A[i] != 0) {
box[i] = 1;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 778,377 | 778,378 | u816645498 | cpp |
p02972 | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,379 | 778,380 | u209713918 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, ansnum = 0;
cin >> n;
vector<int> a(n + 1, 0);
vector<int> ans(n + 1, 0);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
ll sum = 0;
for (ll j = i; j < n; j += i) {
... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, ansnum = 0;
cin >> n;
vector<int> a(n + 1, 0);
vector<int> ans(n + 1, 0);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
ll sum = 0;
for (ll j = 2 * i; j <= n; j += ... | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,385 | 778,384 | u778738287 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
REP(i, N) cin >> a[i + 1];
vector<int> b(N + 1);
for... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
REP(i, N) cin >> a[i + 1];
vector<int> b(N + 1);
for... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,386 | 778,387 | u689844566 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int A[N + 1];
for (int i = 1; i <= N; i++)
cin >> A[i];
int B[N + 1];
for (int i = N / 2 + 1; i <= N; i++) {
B[i] = A[i];
}
for (int i = N / 2; i >= 1; i--) {
int k = 2 * i;
int flag = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int A[N + 1];
for (int i = 1; i <= N; i++)
cin >> A[i];
int B[N + 1];
for (int i = N / 2 + 1; i <= N; i++) {
B[i] = A[i];
}
for (int i = N / 2; i >= 1; i--) {
int k = 2 * i;
int flag = 0;
... | [] | 778,388 | 778,389 | u138486156 | cpp |
p02972 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(... | [] | 778,394 | 778,395 | u596276291 | cpp |
p02972 | #include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
const int N = 2e5 + 5, mod = 1e9 + 7;
int val[N];
int main() {
int n;
cin >> n;
int a[n + 1];
vector<int> vec;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i > 0; i--) {
int sum = 0;
... | #include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
const int N = 2e5 + 5, mod = 1e9 + 7;
int val[N];
int main() {
int n;
cin >> n;
int a[n + 1];
vector<int> vec;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i > 0; i--) {
int sum = 0;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 778,400 | 778,399 | u951561009 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, begin, end) for (ll i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (ll i = (begin)-1; i >= (end); i--)
#define IREP(i, n) IFOR(i, n, 0)
#define SORT(a) sort(a.begin(), a.end())
#define ISORT(a) sort(a.begin(), a.en... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, begin, end) for (ll i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (ll i = (begin)-1; i >= (end); i--)
#define IREP(i, n) IFOR(i, n, 0)
#define SORT(a) sort(a.begin(), a.end())
#define ISORT(a) sort(a.begin(), a.en... | [] | 778,417 | 778,418 | u973797979 | cpp |
p02972 | #include <bits/stdc++.h>
#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 ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
REP(i, n) scanf("%d", &a[i]);
int box[... | #include <bits/stdc++.h>
#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 ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
REP(i, n) scanf("%d", &a[i]);
int box[... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 778,419 | 778,420 | u283907492 | cpp |
p02972 | #include <bits/stdc++.h>
#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 ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
REP(i, n) scanf("%d", &a[i]);
int box[... | #include <bits/stdc++.h>
#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 ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
REP(i, n) scanf("%d", &a[i]);
int box[... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 778,421 | 778,420 | u283907492 | cpp |
p02972 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
vector<int> res;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1];
a[0] = 0;
b[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
b[i + 1] = 0;
}
int sum;
for (int i = n; i > 0; i--) {
sum = 0;
for (in... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
vector<int> res;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1];
a[0] = 0;
b[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
b[i + 1] = 0;
}
int sum;
for (int i = n; i > 0; i--) {
sum = 0;
for (in... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 778,429 | 778,428 | u767785562 | cpp |
p02972 | #include <bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++)
cin >> a[i];
vector<int> ans(N... | #include <bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++)
cin >> a[i];
vector<int> ans(N... | [] | 778,432 | 778,433 | u149468221 | cpp |
p02972 | #include <cstdio>
#include <iostream>
using namespace std;
int n, cnt;
int a[200005];
int b[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = n; i >= 1; i--) {
bool v = a[i];
for (int j = i * 2; j <= n; j++) {
v ^= b[j];
}
b[i] ... | #include <cstdio>
#include <iostream>
using namespace std;
int n, cnt;
int a[200005];
int b[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = n; i >= 1; i--) {
bool v = a[i];
for (int j = i * 2; j <= n; j += i) {
v ^= b[j];
}
b[... | [] | 778,434 | 778,435 | u307227472 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = ... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = ... | [
"literal.number.change",
"assignment.value.change"
] | 778,438 | 778,439 | u110336920 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = ... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"assignment.value.change"
] | 778,440 | 778,439 | u110336920 | cpp |
p02972 | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<int> a(N + 1), ans(N + 1, 0);
int ans_cnt = 0;
for (size_t i = 1; i <= N; i++) {
scanf("%d", &a[i]);
}
for (int i = N; i >= 1; i--) {
int sum = 0;
fo... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<int> a(N + 1), ans(N + 1, 0);
int ans_cnt = 0;
for (size_t i = 1; i <= N; i++) {
scanf("%d", &a[i]);
}
for (int i = N; i >= 1; i--) {
int sum = 0;
fo... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 778,441 | 778,442 | u115259771 | cpp |
p02972 | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<int> a(N + 1), ans(N + 1, 0);
int ans_cnt = 0;
for (size_t i = 1; i <= N; i++) {
scanf("%d", &a[i]);
}
for (int i = N; i >= 1; i--) {
int sum = 0;
fo... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<int> a(N + 1), ans(N + 1, 0);
int ans_cnt = 0;
for (size_t i = 1; i <= N; i++) {
scanf("%d", &a[i]);
}
for (int i = N; i >= 1; i--) {
int sum = 0;
fo... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 778,443 | 778,442 | u115259771 | cpp |
p02972 | // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<c... | // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<c... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,444 | 778,445 | u884379688 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> va(n), ans(n);
for (int i = 0; i < n; i++) {
cin >> va[i];
ans[i] = 0;
}
for (int i = n; i > 0; i--) {
int cnt;
for (int j = i * 2; j <= n; j += i) {
cnt += ans[j - 1];
}
if (cn... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> va(n), ans(n);
for (int i = 0; i < n; i++) {
cin >> va[i];
ans[i] = 0;
}
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
cnt += ans[j - 1];
}
if (cn... | [
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 778,448 | 778,449 | u023540496 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> va(n), ans(n);
for (int i = 0; i < n; i++) {
cin >> va[i];
ans[i] = 0;
}
for (int i = n; i > 0; i--) {
int cnt;
for (int j = i; j <= n; j += i) {
cnt += ans[j - 1];
}
if (cnt % ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> va(n), ans(n);
for (int i = 0; i < n; i++) {
cin >> va[i];
ans[i] = 0;
}
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
cnt += ans[j - 1];
}
if (cn... | [
"variable_declaration.value.change"
] | 778,450 | 778,449 | u023540496 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), ans(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = (n + 2) / 2; i <= n; i++) {
ans[i] = a[i];
}
for (int i = (n + 2) / 2 - 1; i >= 1; i-... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), ans(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = (n + 2) / 2; i <= n; i++) {
ans[i] = a[i];
}
for (int i = (n + 2) / 2 - 1; i >= 1; i-... | [] | 778,456 | 778,457 | u332519995 | cpp |
p02972 | /*
ID: Aman Raj
LANG: C++
TASK: subset
*/
#include <iostream>
#include <stdio.h>
//#include<iostream>
#include <algorithm>
#include <vector>
using namespace std;
#include <math.h>
typedef long long int ll;
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstd... | /*
ID: Aman Raj
LANG: C++
TASK: subset
*/
#include <iostream>
#include <stdio.h>
//#include<iostream>
#include <algorithm>
#include <vector>
using namespace std;
#include <math.h>
typedef long long int ll;
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstd... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,458 | 778,459 | u756289568 | cpp |
p02972 | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 +... | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 +... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 778,465 | 778,466 | u705296057 | cpp |
p02972 | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) \
for ( ... | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) \
for ( ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 778,467 | 778,468 | u669551866 | cpp |
p02972 | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) \
for ( ... | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) \
for ( ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 778,470 | 778,468 | u669551866 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int a[210000];
int b[210000];
vector<int> x;
int c = 0;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i > 0; i--) {
int z = 2;
int sum = 0;
while ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int a[210000];
int b[210000];
vector<int> x;
int c = 0;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i > 0; i--) {
int z = 2;
int sum = 0;
while ... | [
"call.arguments.change"
] | 778,480 | 778,479 | u126833093 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | [
"assignment.value.change",
"identifier.change"
] | 778,487 | 778,488 | u098844816 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,489 | 778,488 | u098844816 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int m = 0;
for (int j = 2; i * j <= n; j++) {
m += a[i * j];
}
if (m % 2 != a[i])
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int m = 0;
for (int j = 2; i * j <= n; j++)
m += ans[i * j];
if (m % 2 != a[i])
an... | [
"assignment.value.change",
"identifier.change"
] | 778,498 | 778,499 | u820225607 | cpp |
p02972 | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Author: z0marlin
Title: D.cpp
Time: 16-08-2019T22:36:50+0530
I suck at CP T_T
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#if DEBUG
#define dprintf(...) printf(__VA_ARGS__)
#else
#define dprintf(...)
#endif
#define FOR(i, a, n) for (int i = a; i < n; ... | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Author: z0marlin
Title: D.cpp
Time: 16-08-2019T22:36:50+0530
I suck at CP T_T
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#if DEBUG
#define dprintf(...) printf(__VA_ARGS__)
#else
#define dprintf(...)
#endif
#define FOR(i, a, n) for (int i = a; i < n; ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,500 | 778,501 | u472496155 | cpp |
p02972 | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Author: z0marlin
Title: D.cpp
Time: 16-08-2019T22:36:50+0530
I suck at CP T_T
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#if DEBUG
#define dprintf(...) printf(__VA_ARGS__)
#else
#define dprintf(...)
#endif
#define FOR(i, a, n) for (int i = a; i < n; ... | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Author: z0marlin
Title: D.cpp
Time: 16-08-2019T22:36:50+0530
I suck at CP T_T
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#if DEBUG
#define dprintf(...) printf(__VA_ARGS__)
#else
#define dprintf(...)
#endif
#define FOR(i, a, n) for (int i = a; i < n; ... | [
"assignment.add",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,502 | 778,501 | u472496155 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
cin.ignore();
vector<ll> a;
ll tmp = 0;
bool allzero = true;
for (ll i = 0; i < n; i++) {
cin >> tmp;
if (tmp != 0) {
allzero = false;
}
a.push_back(tmp);
}
ll b[n] = {0};
for (l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
cin.ignore();
vector<ll> a;
ll tmp = 0;
bool allzero = true;
for (ll i = 0; i < n; i++) {
cin >> tmp;
if (tmp != 0) {
allzero = false;
}
a.push_back(tmp);
}
ll b[n] = {... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 778,507 | 778,508 | u042605975 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> rest(n + 1, 0);
vector<int> ans(n + 1, 0);
vector<int> res;
for (int i = n; i > 0; i--) {
ans[i] = (abs(rest[i] - a[i])) % 2;
if (ans[i] ==... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> rest(n + 1, 0);
vector<int> ans(n + 1, 0);
vector<int> res;
for (int i = n; i > 0; i--) {
ans[i] = (abs(rest[i] - a[i])) % 2;
if (ans[i] ==... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,511 | 778,512 | u487641373 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, int> P;
int main() {
int N, a[210000], ans[210000];
cin >> N;
for (int i = 1; i <= N; i++)
cin ... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, int> P;
int main() {
int N, a[210000], ans[210000];
cin >> N;
for (int i = 1; i <= N; i++)
cin ... | [
"assignment.value.change",
"identifier.change"
] | 778,513 | 778,514 | u591914971 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll MAX_N = 2e5 + 10;
int arr[MAX_N];
void Eratosthenes(ll n) {
for (ll i = 0; i < n; i++) {
arr[i] = 1;
}
for (ll i = 2; i < sqrt(n); i++) {
if (arr[i]) {
for (ll j = 0;... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll MAX_N = 2e5 + 10;
int arr[MAX_N];
void Eratosthenes(ll n) {
for (ll i = 0; i < n; i++) {
arr[i] = 1;
}
for (ll i = 2; i < sqrt(n); i++) {
if (arr[i]) {
for (ll j = 0;... | [
"assignment.value.change",
"identifier.change"
] | 778,518 | 778,519 | u391752022 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("in.txt", "r",stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int A[n + 1], memo[n + 1];
memset(memo, 0, sizeof(memo));
for (int i = 1; i <= n; ++i)
cin >> A[i];
for (int i = n; i >= 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("in.txt", "r",stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int A[n + 1], memo[n + 1];
memset(memo, 0, sizeof(memo));
for (int i = 1; i <= n; ++i)
cin >> A[i];
for (int i = n; i >= 1... | [
"control_flow.branch.if.add"
] | 778,520 | 778,521 | u781659997 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 778,524 | 778,525 | u052332717 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"assignment.value.change",
"identifier.change"
] | 778,530 | 778,531 | u726501606 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define ALL(A) (A).begin(), (A).end()
#define ll long long
const ll mod = 1e9 + 7;
const ll INF = 2 * 1e18;
const int inf = 1e9 + 7;
int a[200005];
int b[200005];
int main(void) {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
ll ans = 0;
for... | #include <bits/stdc++.h>
using namespace std;
#define ALL(A) (A).begin(), (A).end()
#define ll long long
const ll mod = 1e9 + 7;
const ll INF = 2 * 1e18;
const int inf = 1e9 + 7;
int a[200005];
int b[200005];
int main(void) {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
ll ans = 0;
for... | [
"assignment.change"
] | 778,534 | 778,535 | u168774513 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef int64_t ll;
typedef long double ld;
const int INF = 1e9;
const ld EPS = 1e-8;
void solve(const vector<int> &a) {
int N = a.size();
vector<int> cnt(N + 1, 0);
vector<... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef int64_t ll;
typedef long double ld;
const int INF = 1e9;
const ld EPS = 1e-8;
void solve(const vector<int> &a) {
int N = a.size();
vector<int> cnt(N + 1, 0);
vector<... | [
"io.output.change"
] | 778,540 | 778,541 | u886956383 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
void dump(vector<int> &data, string name) {
cout << name << "= {";
for (int i = 0; i < data.size(); i++)
cout << data[i] << " ";
cout << "} " << endl;
}
int main() {
int n;
cin >> n;
vec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
void dump(vector<int> &data, string name) {
cout << name << "= {";
for (int i = 0; i < data.size(); i++)
cout << data[i] << " ";
cout << "} " << endl;
}
int main() {
int n;
cin >> n;
vec... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.value.change",
"identifier.change"
] | 778,544 | 778,545 | u341388158 | cpp |
p02972 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
int n, a[200001], box[200001];
int main(void) {
int i, mul = 1, sum = 0, balls = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = n; i >= 1; i--) {
mul = i * 2;
sum = 0;
while (mul <= n) {
sum += b... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
int n, a[200001], box[200001];
int main(void) {
int i, mul = 1, sum = 0, balls = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = n; i >= 1; i--) {
mul = i * 2;
sum = 0;
while (mul <= n) {
sum += b... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,546 | 778,547 | u940654002 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,550 | 778,551 | u288432959 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
vector<int> ans(n + 1);
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 !... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
vector<int> ans(n + 1);
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 !... | [] | 778,552 | 778,553 | u754651673 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
ret... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
ret... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 778,556 | 778,555 | u754651673 | cpp |
p02972 |
//#pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
... |
//#pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
... | [
"assignment.value.change"
] | 778,563 | 778,564 | u304121198 | cpp |
p02972 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
int m = 0;
for (int i = n; i > 0; i--) {
int tmp = 0;
for (int j = i; j ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
int m = 0;
for (int i = n; i > 0; i--) {
int tmp = 0;
for (int j = i; j ... | [
"assignment.value.change",
"identifier.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 778,576 | 778,577 | u992134985 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, t;
cin >> n;
vector<int> a(n + 1);
vector<int> k(n + 1);
vector<int> b;
for (i = 1; i < n + 1; i = i + 1) {
cin >> a.at(i);
}
for (i = n; 0 < i; i = i - 1) {
t = 0;
for (j = 2 * i; j < n + 1; j = j + i) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, t;
cin >> n;
vector<int> a(n + 1);
vector<int> k(n + 1);
vector<int> b;
for (i = 1; i < n + 1; i = i + 1) {
cin >> a.at(i);
}
for (i = n; 0 < i; i = i - 1) {
t = 0;
for (j = 2 * i; j < n + 1; j = j + i) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,580 | 778,581 | u854243627 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> ans(N + 1);
int cnt = 0;
for (int i = 1; i ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> ans(N + 1);
int cnt = 0;
for (int i = 1; i ... | [] | 778,584 | 778,585 | u870092796 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, end) rep2(i, 0, (end))
#define rep2(i, beg, end) for (int i = (beg); i < (end); i++)
#define all(cont)... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, end) rep2(i, 0, (end))
#define rep2(i, beg, end) for (int i = (beg); i < (end); i++)
#define all(cont)... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"io.output.change"
] | 778,591 | 778,592 | u857252938 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[n], b[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
b[i] = 0;
}
for (ll i = n - 1; i >= 0; i--) {
ll temp = 0;
for (ll j = i + 1; j <= n; j += (i + 1)) {
if (b[j] == 1)
temp++;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[n], b[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
b[i] = 0;
}
for (ll i = n - 1; i >= 0; i--) {
ll temp = 0;
for (ll j = i + 1; j <= n; j += (i + 1)) {
if (b[j - 1] == 1)
tem... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 778,593 | 778,594 | u513726585 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define LL long long
#define MOD 1000000007
ll N, M, K, H, W, mi1, mi2, sum;
string s;
int main() {
cin >> N;
vector<LL> A(N + 1), ans(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = N; i > 0; i--) {
M = 0;
if (... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define LL long long
#define MOD 1000000007
ll N, M, K, H, W, mi1, mi2, sum;
string s;
int main() {
cin >> N;
vector<LL> A(N + 1), ans(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = N; i > 0; i--) {
M = 0;
if (... | [
"assignment.value.change",
"identifier.change"
] | 778,622 | 778,623 | u568682546 | cpp |
p02972 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) long long((x).size())
#define OUT(x) c... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) long long((x).size())
#define OUT(x) c... | [
"expression.operation.binary.add"
] | 778,624 | 778,625 | u901615543 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int sum;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
vecto... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
v... | [
"variable_declaration.value.change"
] | 778,630 | 778,631 | u331991493 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | [
"assignment.value.change",
"identifier.change"
] | 778,632 | 778,633 | u666394517 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define int ll
const ll mod = 1000000007;
int n;
int a[200010];
int b[200010];
vector<int> ans;
signed main() {
cin >> n;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define int ll
const ll mod = 1000000007;
int n;
int a[200010];
int b[200010];
vector<int> ans;
signed main() {
cin >> n;
for (int i ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,634 | 778,635 | u263858205 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a;
vector<int> s;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
a.push_back(A);
s.push_back(0);
}
int hung = N / 2;
for (int i = N - 1; i >= hung; i--) {
if (a[i] == 0) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a;
vector<int> s;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
a.push_back(A);
s.push_back(0);
}
int hung = N / 2;
for (int i = N - 1; i >= hung; i--) {
if (a[i] == 0) {
... | [
"assignment.change"
] | 778,638 | 778,639 | u711816529 | cpp |
p02972 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
for (int i = 0; i < N; i++)
cin >> a[i];
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 1; j * ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
for (int i = 0; i < N; i++)
cin >> a[i];
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 2; j * ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change"
] | 778,644 | 778,645 | u119477929 | cpp |
p02972 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
for (int i = 0; i < N; i++)
cin >> a[i];
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 1; j * ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
for (int i = 0; i < N; i++)
cin >> a[i];
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 2; j * ... | [
"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",
"assignment.value.change",
"identifier.change"
] | 778,646 | 778,645 | u119477929 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + 1; j <= n; j += i) {
sum ^= b[j];
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 778,647 | 778,648 | u822037230 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
bitset<N> vet, tem;
int main() {
int n;
scanf("%d", &n);
int x;
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
vet[i] = x;
tem[i] = 0;
}
vector<int> ans;
for (int i = n; i > 0; i--) {
int qtd = 0;
for (int j = i + i... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
bitset<N> vet, tem;
int main() {
int n;
scanf("%d", &n);
int x;
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
vet[i] = x;
tem[i] = 0;
}
vector<int> ans;
for (int i = n; i > 0; i--) {
int qtd = 0;
for (int j = i + i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 778,659 | 778,660 | u100131109 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
bitset<N> vet, tem;
int main() {
int n;
scanf("%d", &n);
int x;
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
vet[i] = x;
tem[i] = 0;
}
vector<int> ans;
for (int i = n; i > 0; i--) {
int qtd = 0;
for (int j = i + i... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
bitset<N> vet, tem;
int main() {
int n;
scanf("%d", &n);
int x;
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
vet[i] = x;
tem[i] = 0;
}
vector<int> ans;
for (int i = n; i > 0; i--) {
int qtd = 0;
for (int j = i + i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 778,661 | 778,660 | u100131109 | cpp |
p02972 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
using namespace std;
int main() {
int M;
vector<int> B(200005, 0);
vector<bool> exist(200005, false);
vector<int> ans;
cin >> M;
rep1(i, M) {
int b;
cin >> b;
B[i] = b;
}
... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
using namespace std;
int main() {
int M;
vector<int> B(200005, 0);
vector<bool> exist(200005, false);
vector<int> ans;
cin >> M;
rep1(i, M) {
int b;
cin >> b;
B[i] = b;
}
... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 778,662 | 778,663 | u778614444 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define un... | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define un... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 778,664 | 778,665 | u267022560 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M = 0;
cin >> N;
vector<int> a(N + 1), b(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i >= 1; i--) {
for (int j = 2; j * i <= N; j++) {
b[i] += b[j];
}
if (b[i] % 2 == a[i]) {
b[i] = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M = 0;
cin >> N;
vector<int> a(N + 1), b(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i >= 1; i--) {
for (int j = 2; j * i <= N; j++) {
b[i] += b[i * j];
}
if (b[i] % 2 == a[i]) {
b[i] ... | [
"assignment.change"
] | 778,666 | 778,667 | u656368720 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M = 0;
cin >> N;
vector<int> a(N + 1), b(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i >= 1; i--) {
for (int j = 2; j * i <= N; j++) {
b[i] += a[j];
}
if (b[i] % 2 == a[i]) {
b[i] = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M = 0;
cin >> N;
vector<int> a(N + 1), b(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i >= 1; i--) {
for (int j = 2; j * i <= N; j++) {
b[i] += b[i * j];
}
if (b[i] % 2 == a[i]) {
b[i] ... | [
"assignment.value.change",
"identifier.change",
"assignment.change"
] | 778,668 | 778,667 | u656368720 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp, long long mod = MOD) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp, long long mod = MOD) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 778,672 | 778,673 | u276568758 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb pu... | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb pu... | [
"identifier.change"
] | 778,676 | 778,677 | u157886944 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb pu... | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb pu... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change"
] | 778,678 | 778,677 | u157886944 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 212345;
int a[MAXN], b[MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
for (int i = n; i > 0; --i) {
int sum = 0;
for (int j = i + i; j <= n; j += i)
sum += a[i];
if ... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 212345;
int a[MAXN], b[MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
for (int i = n; i > 0; --i) {
int sum = 0;
for (int j = i + i; j <= n; j += i)
sum += b[j];
if ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,679 | 778,680 | u578509549 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vect... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vect... | [
"expression.operation.binary.add"
] | 778,681 | 778,682 | u732502311 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vect... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vect... | [
"io.output.change"
] | 778,683 | 778,682 | u732502311 | cpp |
p02972 | #include <iostream>
#include <vector>
#define range(i, n) for (i = 0; i < n; ++i)
using namespace std;
int i, j;
int main(void) {
int N, bin, num = 0;
cin >> N;
vector<int> A(N), result(N);
range(i, N) { cin >> A[i]; }
for (i = N - 1; i >= 0; --i) {
bin = 0;
for (j = 2 * i + 1; j < N; j += i + 1) {
... | #include <iostream>
#include <vector>
#define range(i, n) for (i = 0; i < n; ++i)
using namespace std;
int i, j;
int main(void) {
int N, bin, num = 0;
cin >> N;
vector<int> A(N), result(N);
range(i, N) { cin >> A[i]; }
for (i = N - 1; i >= 0; --i) {
bin = 0;
for (j = 2 * i + 1; j < N; j += i + 1) {
... | [
"assignment.value.change",
"identifier.change"
] | 778,686 | 778,687 | u517447467 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,695 | 778,696 | u859541564 | cpp |
p02972 | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
... | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 778,697 | 778,698 | u230414490 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.