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 <bits/stdc++.h>
#define N 200010
using namespace std;
int n, m = 0;
int a[N];
int f[N];
int main() {
memset(f, 0, sizeof(f));
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
int tot = 0;
for (int j = 1; j <= n; j += i)
tot += f[j];
... | #include <bits/stdc++.h>
#define N 200010
using namespace std;
int n, m = 0;
int a[N];
int f[N];
int main() {
memset(f, 0, sizeof(f));
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
int tot = 0;
for (int j = i; j <= n; j += i)
tot += f[j];
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 778,699 | 778,700 | u091286840 | cpp |
p02972 | #include <bits/stdc++.h>
#define N 200010
using namespace std;
int n, m = 0;
int a[N];
int f[N];
int main() {
memset(f, 0, sizeof(f));
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
int tot = 0;
for (int j = i; j <= n; j += i)
tot += f[i];
... | #include <bits/stdc++.h>
#define N 200010
using namespace std;
int n, m = 0;
int a[N];
int f[N];
int main() {
memset(f, 0, sizeof(f));
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
int tot = 0;
for (int j = i; j <= n; j += i)
tot += f[j];
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,701 | 778,700 | u091286840 | cpp |
p02972 | #include <bits/stdc++.h>
#define N 200010
using namespace std;
int n, m = 0;
int a[N];
int f[N];
int main() {
memset(f, 0, sizeof(f));
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
int tot = 0;
for (int j = i; j <= n; j += i)
tot += (int)f[i];... | #include <bits/stdc++.h>
#define N 200010
using namespace std;
int n, m = 0;
int a[N];
int f[N];
int main() {
memset(f, 0, sizeof(f));
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
int tot = 0;
for (int j = i; j <= n; j += i)
tot += f[j];
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,702 | 778,700 | u091286840 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int n, m = 0, a[200010], b[200010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
for (int i = n; i >= 1; i--) {
int s = 0;
for (int j = i; j <= n; j += i)
s += b[i];
s %= 2;
if (s != a[i])
b[i] = 1, m++;
}
... | #include <bits/stdc++.h>
using namespace std;
int n, m = 0, a[200010], b[200010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
for (int i = n; i >= 1; i--) {
int s = 0;
for (int j = i; j <= n; j += i)
s += b[j];
s &= 1;
if (s != a[i])
b[i] = 1, m++;
}
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.change"
] | 778,708 | 778,709 | u709966987 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int n, m = 0, a[200010], b[200010] = {0};
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
for (int i = n; i >= 1; i--) {
int s = 0;
for (int j = i; j <= n; j += i)
s += b[i];
s &= 1;
if (s != a[i])
b[i] = 1, m++;... | #include <bits/stdc++.h>
using namespace std;
int n, m = 0, a[200010], b[200010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
for (int i = n; i >= 1; i--) {
int s = 0;
for (int j = i; j <= n; j += i)
s += b[j];
s &= 1;
if (s != a[i])
b[i] = 1, m++;
}
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,710 | 778,709 | u709966987 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int n, m = 0, a[200010], b[200010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
for (int i = n; i >= 1; i--) {
int s = 0;
for (int j = i; j <= n; j += i)
s += b[i];
s &= 1;
if (s != a[i])
b[i] = 1, m++;
}
... | #include <bits/stdc++.h>
using namespace std;
int n, m = 0, a[200010], b[200010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
for (int i = n; i >= 1; i--) {
int s = 0;
for (int j = i; j <= n; j += i)
s += b[j];
s &= 1;
if (s != a[i])
b[i] = 1, m++;
}
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,711 | 778,709 | u709966987 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
vector<int> cnt(N + 1);
for (int i = N; i >= 1; i--) {
int c = 0;
for (int j = i * 2; j <= N; j += i) {
c += cnt[i];
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
vector<int> cnt(N + 1);
for (int i = N; i >= 1; i--) {
int c = 0;
for (int j = i * 2; j <= N; j += i) {
c += cnt[j];
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,712 | 778,713 | u738450435 | cpp |
p02972 | /*
1. I'm the Future Red Coder :)
2. Hopefully, I'll be Yellow Soon.
*/
#include <bits/stdc++.h>
#define mod 998244353 // 1000000007
#define lim 1000000000000000007
#define lim1 18446744073709551615 // Unsigned
#define sq(a) ((a) * (a))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mms(... | /*
1. I'm the Future Red Coder :)
2. Hopefully, I'll be Yellow Soon.
*/
#include <bits/stdc++.h>
#define mod 998244353 // 1000000007
#define lim 1000000000000000007
#define lim1 18446744073709551615 // Unsigned
#define sq(a) ((a) * (a))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mms(... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 778,714 | 778,715 | u921940646 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t;
cin >> n;
int a[200005], b[200005] = {0};
vector<int> ans;
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
t = 0;
for (int j = 2 * i; j <= n; j += i) {
if (b[j]) ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t;
cin >> n;
int a[200005], b[200005] = {0};
vector<int> ans;
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
t = 0;
for (int j = 2 * i; j <= n; j += i) {
if (b[j]) ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 778,716 | 778,717 | u754325138 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 9;
const int MOD = 2;
int n;
int a[N], b[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
b[i] = a[i];
for (int j = 2 * i; j < n; j += i) {
b[i] -= b[j];
b[i] = (b[i] + M... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 9;
const int MOD = 2;
int n;
int a[N], b[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
b[i] = a[i];
for (int j = 2 * i; j <= n; j += i) {
b[i] -= b[j];
b[i] = (b[i] + ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,718 | 778,719 | u194268736 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n, 0);
vector<int> ret(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
int k = n;
while (k > 1) {
int l = k;
k = k / 2 + 1;
for (int i = k; i <= l; i++) {
int bit = 0;
... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n, 0);
vector<int> ret(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
int k = n;
while (k > 1) {
int l = k;
k = k / 2 + 1;
for (int i = k; i <= l; i++) {
int bit = 0;
... | [
"io.output.change"
] | 778,724 | 778,725 | u755121033 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n, 0);
vector<int> ret(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
int k = n;
while (k > 0) {
int l = k;
k = k / 2 + 1;
for (int i = k; i <= l; i++) {
int bit = 0;
... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n, 0);
vector<int> ret(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
int k = n;
while (k > 1) {
int l = k;
k = k / 2 + 1;
for (int i = k; i <= l; i++) {
int bit = 0;
... | [
"literal.number.change",
"control_flow.loop.condition.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"io.output.change"
] | 778,726 | 778,725 | u755121033 | cpp |
p02972 | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd... | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"identifier.change",
"io.output.change"
] | 778,742 | 778,741 | u434747175 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[200000];
for (int i = 0; i < n; i++)
cin >> a[i];
int ball[200000] = {0};
vector<int> b;
for (int i = n; i >= 1; i--) {
int r = 0;
for (int j = i * 2; j < n; j += i)
r = (r + ball[j - 1]) % 2;
if (a[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[200000];
for (int i = 0; i < n; i++)
cin >> a[i];
int ball[200000] = {0};
vector<int> b;
for (int i = n; i >= 1; i--) {
int r = 0;
for (int j = i * 2; j <= n; j += i)
r = (r + ball[j - 1]) % 2;
if (a[... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,746 | 778,747 | u347579043 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define rep(i, j, k) for (int i = j; i < k; i++)
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
bool hako[200100];
bool hakoa[200100];
vector<int> res;
int resnum;
int main() {
int n;
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define rep(i, j, k) for (int i = j; i < k; i++)
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
bool hako[200100];
bool hakoa[200100];
vector<int> res;
int resnum;
int main() {
int n;
cin >... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,757 | 778,758 | u400497478 | cpp |
p02972 | #include <bits/stdc++.h>
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define forn1(i, n) for (int i = 1; i <= int(n); i++)
#define popcnt __builtin_popcount
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long lo... | #include <bits/stdc++.h>
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define forn1(i, n) for (int i = 1; i <= int(n); i++)
#define popcnt __builtin_popcount
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long lo... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,765 | 778,766 | u806601169 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using i32 = int;
using i64 = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using pii = pair<i32, i32>;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using i32 = int;
using i64 = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using pii = pair<i32, i32>;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,767 | 778,768 | u782480355 | cpp |
p02972 | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, a[200005], b[200005];
vector<int> ans;
inline void dd() {
for (int i = 1; i <= n; ++i)
printf("%d ", b[i]);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = n; i >= 1; --i) {
... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, a[200005], b[200005];
vector<int> ans;
inline void dd() {
for (int i = 1; i <= n; ++i)
printf("%d ", b[i]);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = n; i >= 1; --i) {
... | [
"control_flow.loop.for.condition.change"
] | 778,769 | 778,770 | u315350841 | cpp |
p02972 | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, a[200005], b[200005];
vector<int> ans;
inline void dd() {
for (int i = 1; i <= n; ++i)
printf("%d ", b[i]);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = n; i >= 1; --i) {
... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, a[200005], b[200005];
vector<int> ans;
inline void dd() {
for (int i = 1; i <= n; ++i)
printf("%d ", b[i]);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = n; i >= 1; --i) {
... | [
"control_flow.loop.for.condition.change",
"expression.operator.change"
] | 778,771 | 778,770 | u315350841 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int... | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 778,776 | 778,777 | u973991908 | cpp |
p02972 | #include <bits/stdc++.h>
#include <iostream>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long l... | #include <bits/stdc++.h>
#include <iostream>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long l... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,783 | 778,784 | u752814744 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,785 | 778,786 | u118951811 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,787 | 778,786 | u118951811 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> rs(n + 1);
for (int i = 1; i <= n; i++)
cin >> rs[i];
vector<int> xs(n + 1);
for (int k = n; k >= 1; k--) {
int current = 0;
for (int... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> rs(n + 1);
for (int i = 1; i <= n; i++)
cin >> rs[i];
vector<int> xs(n + 1);
for (int k = n; k >= 1; k--) {
int current = 0;
for (int... | [
"assignment.value.change",
"identifier.change"
] | 778,788 | 778,789 | u771276542 | cpp |
p02972 | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int64_t rll() {
long long n;
scanf("%lld", &n);
return n;
}
int main() {
int n = ri();
int a[n];
for (int i = 0; i < n; i++)
a[i] = ri();
int res[n];
for (int i = n - 1; i >= 0; i--) {
int step = i + 1;
int cnt =... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int64_t rll() {
long long n;
scanf("%lld", &n);
return n;
}
int main() {
int n = ri();
int a[n];
for (int i = 0; i < n; i++)
a[i] = ri();
int res[n];
for (int i = n - 1; i >= 0; i--) {
int step = i + 1;
int cnt =... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 778,790 | 778,791 | u040490988 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
using vpl = vector<PL>;
template <typename T> constexpr auto inf = numeric_limits<T>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
using vpl = vector<PL>;
template <typename T> constexpr auto inf = numeric_limits<T>... | [
"expression.operation.binary.remove"
] | 778,792 | 778,793 | u502709453 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int n, a[200010], cnt, ans[200010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
cnt = 0;
for (int j = 2; j < n / i; j++)
cnt += ans[j * i];
if (cnt % 2 != a[i])
ans[i] = 1;
}
cn... | #include <bits/stdc++.h>
using namespace std;
int n, a[200010], cnt, ans[200010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
cnt = 0;
for (int j = 1; j <= n / i; j++)
cnt += ans[j * i];
if (cnt % 2 != a[i])
ans[i] = 1;
}
c... | [
"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",
"control_flow.return.add",
"control_flow.return.0.a... | 778,811 | 778,812 | u727652622 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef long double ld;
typedef vector<ld> vd;
typedef bool bl;
typedef vector<bl> vb;
typedef vector<vl> mt;
typedef unordered_map<ll, unordered_map<ll, ll>> graph;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef long double ld;
typedef vector<ld> vd;
typedef bool bl;
typedef vector<bl> vb;
typedef vector<vl> mt;
typedef unordered_map<ll, unordered_map<ll, ll>> graph;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vec... | [
"assignment.change"
] | 778,815 | 778,816 | u842401785 | cpp |
p02972 | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
// typedef complex<double>P;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1); // 3.14159265... | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
// typedef complex<double>P;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1); // 3.14159265... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 778,822 | 778,823 | u539402331 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i < (n); i++)
#define REP2(i, d, n) for (int i = (d); i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= ... | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i < (n); i++)
#define REP2(i, d, n) for (int i = (d); i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 778,824 | 778,825 | u250996767 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
v.push_back(a);
}
vector<int> ans(N + 1);
int count = 0;
stringstream ss;
for (int i = v.size() - 1; i >= 0; i--) {
int sum = 0;
for (int j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
v.push_back(a);
}
vector<int> ans(N);
int count = 0;
stringstream ss;
for (int i = v.size() - 1; i >= 0; i--) {
int sum = 0;
for (int j = i;... | [
"expression.operation.binary.remove"
] | 778,831 | 778,832 | u598710706 | cpp |
p02972 | /*
Rohit645
Rohit Kumar
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using pll = pair<ll, ll>;
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ... | /*
Rohit645
Rohit Kumar
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using pll = pair<ll, ll>;
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ... | [
"assignment.value.change",
"identifier.change"
] | 778,840 | 778,841 | u206390872 | cpp |
p02972 | /*
Rohit645
Rohit Kumar
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using pll = pair<ll, ll>;
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ... | /*
Rohit645
Rohit Kumar
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using pll = pair<ll, ll>;
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ... | [
"assignment.value.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,842 | 778,841 | u206390872 | cpp |
p02972 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define INF 1000000000000000001
#define MOD 1... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define INF 1000000000000000001
#define MOD 1... | [
"control_flow.branch.else.add"
] | 778,852 | 778,853 | u251433890 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M = 0, temp = 0;
cin >> N;
vector<int> a(N + 1);
for (int i = 0; i < N; i++) {
cin >> a[i + 1];
}
vector<int> res(N + 1, 0);
for (int i = N; i > 0; i--) {
temp = 0;
for (int j = 1; i * j <= N; j++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M = 0, temp = 0;
cin >> N;
vector<int> a(N + 1);
for (int i = 0; i < N; i++) {
cin >> a[i + 1];
}
vector<int> res(N + 1, 0);
for (int i = N; i > 0; i--) {
temp = 0;
for (int j = 1; i * j <= N; j++) {
... | [
"expression.operation.binary.remove"
] | 778,856 | 778,857 | u703503553 | cpp |
p02972 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,858 | 778,859 | u468700753 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> box(n, 0);
vector<int> res;
for (int i = n; i > 0; --i) {
int s = 0;
for (int j = i; j <= n; j += i) {
s += box[j - 1];... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> box(n, 0);
vector<int> res;
for (int i = n; i > 0; --i) {
int s = 0;
for (int j = i; j <= n; j += i) {
s += box[j - 1];... | [
"assignment.variable.change",
"identifier.change"
] | 778,860 | 778,861 | u305396672 | cpp |
p02972 | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
int main() {
int n;
cin >> n;
vector<int> A(n + 1, 0);
for (int i = 1; i <= n; i++) {
... | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
int main() {
int n;
cin >> n;
vector<int> A(n + 1, 0);
for (int i = 1; i <= n; i++) {
... | [
"control_flow.branch.if.condition.change"
] | 778,864 | 778,865 | u067694854 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define ll long long
typedef pair<int, int> P;
#define mod 998244353
#define INF (1LL << 60)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define YES puts("YES\n")
#define Yes puts("Yes\n")
#define NO puts("NO\n")
#define No pu... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define ll long long
typedef pair<int, int> P;
#define mod 998244353
#define INF (1LL << 60)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define YES puts("YES\n")
#define Yes puts("Yes\n")
#define NO puts("NO\n")
#define No pu... | [] | 778,868 | 778,869 | u592610268 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int cnt = 0;
vector<bool> in(n + 1, false);
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i + i; j < n; j += i) {
if (in[j])
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int cnt = 0;
vector<bool> in(n + 1, false);
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
if (in[j])
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,879 | 778,880 | u770509135 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define SORT(x) sort(x.begin(), x.end())
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0,... | #include <bits/stdc++.h>
using namespace std;
#define SORT(x) sort(x.begin(), x.end())
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0,... | [
"assignment.value.change",
"identifier.change"
] | 778,881 | 778,882 | u022832318 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M = 0, tmp = 0;
cin >> N;
vector<int> a(2 * N), b(2 * N);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i > 0; i--) {
tmp = a[i];
for (int j = 2 * i; j <= N; j += i) {
tmp ^= a[j];
}
b[i] = tmp;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M = 0, tmp = 0;
cin >> N;
vector<int> a(2 * N), b(2 * N);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i > 0; i--) {
tmp = a[i];
for (int j = 2 * i; j <= N; j += i) {
tmp ^= b[j];
}
b[i] = tmp;
... | [
"assignment.value.change",
"identifier.change"
] | 778,885 | 778,886 | u074306398 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define INF 1000000000
#define MOD ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define INF 1000000000
#define MOD ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 778,891 | 778,892 | u677400065 | cpp |
p02972 |
#include <algorithm>
#include <bitset>
#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... |
#include <algorithm>
#include <bitset>
#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... | [
"literal.number.change",
"call.arguments.change"
] | 778,893 | 778,894 | u724732842 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
using ll = long long;
int N;
vector<ll> a(200001);
vector<ll> b(200001);
int sumball;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i + 1];
}
for (int i = N; i >= 1; i--) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
using ll = long long;
int N;
vector<ll> a(200001);
vector<ll> b(200001);
int sumball;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i + 1];
}
for (int i = N; i >= 1; i--) {
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 778,895 | 778,896 | u378155378 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define mkp make_pair
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define mkp make_pair
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"assignment.value.change"
] | 778,897 | 778,898 | u754112329 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define mkp make_pair
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define mkp make_pair
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 778,899 | 778,898 | u754112329 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
namespace {
#define DUMPOUT cerr
#ifndef DEBUG_
#define dump(...)
#else
#define dump(...) \
DUMPOUT << " "; \
DUMPOUT << #__VA_ARGS__ << " :[" << _... | #include <bits/stdc++.h>
using namespace std;
namespace {
#define DUMPOUT cerr
#ifndef DEBUG_
#define dump(...)
#else
#define dump(...) \
DUMPOUT << " "; \
DUMPOUT << #__VA_ARGS__ << " :[" << _... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,902 | 778,903 | u300752229 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mo = 1000000007;
const ll INF = 1LL << 59; // MAX 9223372036854775807
int main() {
ll n;
cin >> n;
ll ans[n + 1] = {};
ll t[n + 1] = {};
rep(i, n) { cin >> t[i + 1]; }
for (ll i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mo = 1000000007;
const ll INF = 1LL << 59; // MAX 9223372036854775807
int main() {
ll n;
cin >> n;
ll ans[n + 1] = {};
ll t[n + 1] = {};
rep(i, n) { cin >> t[i + 1]; }
for (ll i =... | [
"assignment.change",
"expression.operation.binary.add"
] | 778,912 | 778,913 | u419307948 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define MAX 200000
int main() {
int N, a[MAX], b[MAX];
int count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N; i > 0; i--) {
int A = a[i - 1];
if (i > N / 2)
b[i - 1] = A;
else {
int sum = 0;
for... | #include <bits/stdc++.h>
using namespace std;
#define MAX 200000
int main() {
int N, a[MAX], b[MAX];
int count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N; i > 0; i--) {
int A = a[i - 1];
if (i > N / 2)
b[i - 1] = A;
else {
int sum = 0;
for... | [
"call.arguments.change",
"io.output.change"
] | 778,914 | 778,915 | u776086908 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 778,920 | 778,921 | u525137785 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 778,922 | 778,921 | u525137785 | cpp |
p02972 | #include <cstdio>
int n;
int a[200005];
int box[200005];
int ans[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += box[j];
}
if (sum % 2 != a[i]) {
int ... | #include <cstdio>
int n;
int a[200005];
int box[200005];
int ans[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += box[j];
}
if (sum % 2 != a[i]) {
int ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 778,923 | 778,924 | u358689692 | cpp |
p02972 | #include <cstdio>
int n;
int a[200005];
int box[200005];
int ans[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += box[j];
}
box[i] = (a[i] - sum % 2) % 2... | #include <cstdio>
int n;
int a[200005];
int box[200005];
int ans[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += box[j];
}
box[i] = (a[i] - sum % 2) % 2... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 778,925 | 778,926 | u358689692 | cpp |
p02972 | #include <cstdio>
int n;
int a[200005];
int box[200005];
int ans[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += box[j];
}
box[i] = (a[i] - sum) % 2;
... | #include <cstdio>
int n;
int a[200005];
int box[200005];
int ans[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += box[j];
}
box[i] = (a[i] - sum % 2) % 2... | [
"assignment.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 778,927 | 778,926 | u358689692 | cpp |
p02972 | #include <cstdio>
int n;
int a[200005];
int box[200005];
int ans[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += box[j];
}
box[i] = a[i] - sum % 2;
}
... | #include <cstdio>
int n;
int a[200005];
int box[200005];
int ans[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += box[j];
}
box[i] = (a[i] - sum % 2) % 2... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 778,928 | 778,926 | u358689692 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
lll ii, jj, kk;
lll n, sum;
vector<lll... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
lll ii, jj, kk;
lll n, sum;
vector<lll... | [
"assignment.change"
] | 778,929 | 778,930 | u146847434 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n);
for (int i = n; i >= 1; i--) {... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
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-... | [
"call.arguments.change",
"identifier.change",
"io.output.change"
] | 778,935 | 778,936 | u539199630 | 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 + i; 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];
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 778,941 | 778,942 | u562935282 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long in... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long in... | [
"call.arguments.change"
] | 778,943 | 778,944 | u463697306 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef double db;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define pb push_back
#define mp make_pair
#define MAX 1000000
#define mod 100... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef double db;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define pb push_back
#define mp make_pair
#define MAX 1000000
#define mod 100... | [] | 778,945 | 778,946 | u868281230 | cpp |
p02972 | #include <bits/stdc++.h>
//#include<tr1/unordered_map>
#pragma GCC optimize("Ofast")
#define ll long long
#define pll pair<long long, long long>
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define Forn(i, n) fo... | #include <bits/stdc++.h>
//#include<tr1/unordered_map>
#pragma GCC optimize("Ofast")
#define ll long long
#define pll pair<long long, long long>
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define Forn(i, n) fo... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"call.function.change"
] | 778,951 | 778,952 | u475019197 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> as(n + 1, 0);
for (int64_t i = 1; i <= n; i++) {
cin >> as[i];
}
vector<int64_t> puni(n + 1, 0);
for (int64_t i = n; 1 <= i; i--) {
int64_t cnt = 0;
for (int64_t j = 2 * i; j <= n; j += i) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> as(n + 1, 0);
for (int64_t i = 1; i <= n; i++) {
cin >> as[i];
}
vector<int64_t> puni(n + 1, 0);
for (int64_t i = n; 1 <= i; i--) {
int64_t cnt = 0;
for (int64_t j = 2 * i; j <= n; j += i) {
... | [
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 778,953 | 778,954 | u017167684 | cpp |
p02972 | #include <bits/stdc++.h>
#define All(v) v.begin(), v.end()
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
const int MAX_N = (int)2e5 + 5;
int A[MAX_N], ans[MAX_N];
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int N;
cin >> N;
for (int i = ... | #include <bits/stdc++.h>
#define All(v) v.begin(), v.end()
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
const int MAX_N = (int)2e5 + 5;
int A[MAX_N], ans[MAX_N];
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int N;
cin >> N;
for (int i = ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,957 | 778,958 | u354638986 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#i... | [
"identifier.change",
"call.function.change"
] | 778,961 | 778,962 | u904131314 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> b;
long long b_num[n + 1];
for (int i = 0; i <= n; i++)
b_num[i] = 0;
for (int i = n; i > n / 2; i--) {
if (a[i] == 1) {
b.push_back(i);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> b;
long long b_num[n + 1];
for (int i = 0; i <= n; i++)
b_num[i] = 0;
for (int i = n; i > n / 2; i--) {
if (a[i] == 1) {
b.push_back(i);
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 778,963 | 778,964 | u313766957 | cpp |
p02972 | // JSD
#include <iostream>
#include <map>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
ll sum = 0;
int a[n + 1], b[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i], b[i] = a[i];
for (int i = n; i >= 1; i--) {
ll ans = 0;
for (int j = 2; j * i <= n; j+... | // JSD
#include <iostream>
#include <map>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
ll sum = 0;
int a[n + 1], b[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i], b[i] = a[i];
for (int i = n / 2; i >= 1; i--) {
ll ans = 0;
for (int j = 2; j * i <= n... | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 778,965 | 778,966 | u436019023 | cpp |
p02972 | // JSD
#include <iostream>
#include <map>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
ll sum = 0;
int a[n + 1], b[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i], b[i] = a[i];
for (int i = n / 2; i >= 1; i--) {
ll ans = 0;
for (int j = 2; j * i <= n... | // JSD
#include <iostream>
#include <map>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
ll sum = 0;
int a[n + 1], b[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i], b[i] = a[i];
for (int i = n / 2; i >= 1; i--) {
ll ans = 0;
for (int j = 2; j * i <= n... | [
"assignment.change"
] | 778,967 | 778,966 | u436019023 | cpp |
p02972 | // JSD
#include <iostream>
#include <map>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
ll sum = 0;
int a[n + 1], b[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i], b[i] = a[i];
for (int i = n / 2 - 1; i >= 1; i--) {
ll ans = 0;
for (int j = 2; j * i ... | // JSD
#include <iostream>
#include <map>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
ll sum = 0;
int a[n + 1], b[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i], b[i] = a[i];
for (int i = n / 2; i >= 1; i--) {
ll ans = 0;
for (int j = 2; j * i <= n... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"assignment.change"
] | 778,968 | 778,966 | u436019023 | cpp |
p02972 | #include "bits/stdc++.h"
#define REP(i, n, N) for (ll i = (n); i < (N); i++)
#define RREP(i, n, N) for (ll i = (N - 1); i >= (n); i--)
#define LREP(lst, itr) for (auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a) <= (n) && (n) < (b))
#define ALL(v) (v).begin(), (v).end()
#define MCP(a, b) memcp... | #include "bits/stdc++.h"
#define REP(i, n, N) for (ll i = (n); i < (N); i++)
#define RREP(i, n, N) for (ll i = (N - 1); i >= (n); i--)
#define LREP(lst, itr) for (auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a) <= (n) && (n) < (b))
#define ALL(v) (v).begin(), (v).end()
#define MCP(a, b) memcp... | [
"assignment.value.change",
"identifier.change"
] | 778,969 | 778,970 | u379951749 | cpp |
p02972 | #include <iostream>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
int main() {
int N;
cin >> N;
int a[N + 1], box[N + 1] = {0};
for (int i ... | #include <iostream>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
int main() {
int N;
cin >> N;
int a[N + 1], box[N + 1] = {0};
for (int i ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 778,973 | 778,974 | u016189984 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[200001];
int b[200001];
int flag[200001];
int main() {
scanf("%d", &n);
int ans = 0;
memset(b, 0, sizeof b);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
int s = 0;
for (int j = i; j <= n; j = j + i)
... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[200001];
int b[200001];
int flag[200001];
int main() {
scanf("%d", &n);
int ans = 0;
memset(b, 0, sizeof b);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
int s = 0;
for (int j = i; j <= n; j = j + i)
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 778,978 | 778,979 | u433665020 | cpp |
p02972 | #pragma region include
#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = (int)(n); i < int(m); i++)
using namesp... | #pragma region include
#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = (int)(n); i < int(m); i++)
using namesp... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,980 | 778,981 | u165374901 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
vector<ll> a(N);
for (ll i = 0; i < N; i++) {
cin >> a[i];
}
vector<ll> num(N + 1, 0);
vector<ll> ans;
for (ll i = N - 1; i >= 0; i--) {
ll sum = 0;
for (ll j = i + 1; j <= N; j += i + 1) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
vector<ll> a(N);
for (ll i = 0; i < N; i++) {
cin >> a[i];
}
vector<ll> num(N + 1, 0);
vector<ll> ans;
for (ll i = N - 1; i >= 0; i--) {
ll sum = 0;
for (ll j = i + 1; j <= N; j += i + 1) {
... | [
"expression.operation.binary.remove"
] | 778,988 | 778,989 | u456065785 | cpp |
p02972 | #include <iostream>
#include <sstream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int b[n];
for (int i = n - 1; i > -1; --i) {
b[i] = a[i];
if ((i + 1) * 2 - 1 >= n)
continue;
for (int j = (i + 1) * 2; j < n; j += (i + 1))
... | #include <iostream>
#include <sstream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int b[n];
for (int i = n - 1; i > -1; --i) {
b[i] = a[i];
if ((i + 1) * 2 - 1 >= n)
continue;
for (int j = (i + 1) * 2 - 1; j < n; j += (i + 1))
... | [
"control_flow.loop.for.initializer.change"
] | 778,992 | 778,993 | u146240825 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//---------... | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//---------... | [
"call.arguments.change"
] | 778,994 | 778,995 | u187052933 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n, 0);
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2 * i + 1; j < n; j++) {
sum += b[j];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n, 0);
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2 * i + 1; j < n; j += i + 1) {
sum += b[j];... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 779,008 | 779,009 | u629314247 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 1; i < n; i++)
cin >> a[i];
int m = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = 2 * i; j < n + 1; j += i) {
sum += b[j];
}
if (sum ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 1; i < n + 1; i++)
cin >> a[i];
int m = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = 2 * i; j < n + 1; j += i) {
sum += b[j];
}
if (... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 779,012 | 779,013 | u117348081 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (i = n - 1; i >= 0; i--) {
int s = 0;
for (j = 2 * (i + 1); j < n; j += i + 1) {
s += b[j - 1];
}
... | #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (i = n - 1; i >= 0; i--) {
int s = 0;
for (j = 2 * (i + 1); j <= n; j += i + 1) {
s += b[j - 1];
}... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,017 | 779,018 | u309112964 | cpp |
p02972 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"expression.operation.binary.remove"
] | 779,021 | 779,022 | u627347690 | cpp |
p02972 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [] | 779,023 | 779,022 | u627347690 | cpp |
p02972 | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(int, char **) {
long N, M;
cin >> N;
vector<long> a(N), box(N), sums(N, 0);
for (long i = 0; i < N; ++i) {
cin >> a[i];
}
M = 0;
for (long i = N - 1; i >= 0; --... | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(int, char **) {
long N, M;
cin >> N;
vector<long> a(N), box(N), sums(N, 0);
for (long i = 0; i < N; ++i) {
cin >> a[i];
}
M = 0;
for (long i = N - 1; i >= 0; --... | [
"control_flow.loop.for.initializer.change"
] | 779,032 | 779,033 | u298497862 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
main() {
int n;
cin >> n;
int a[n + 5];
for (int i = 1; i <= n; i++)
cin >> a[i];
int flag = 1;
int dp[n + 10] = {0};
int count = 0;
vector<int> ans;
for (int i = n; i >= 2; i--) {
if (dp[i] != a[i])
count++, dp[i]++, dp... | #include <bits/stdc++.h>
#define int long long
using namespace std;
main() {
int n;
cin >> n;
int a[n + 5];
for (int i = 1; i <= n; i++)
cin >> a[i];
int flag = 1;
int dp[n + 10] = {0};
int count = 0;
vector<int> ans;
for (int i = n; i >= 2; i--) {
if (dp[i] != a[i]) {
count++, dp[i]++, ... | [] | 779,036 | 779,037 | u124375339 | cpp |
p02972 | // C++ includes
#include <bits/stdc++.h>
// 俳句
using namespace std;
// alias templates
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
// alias declaration
using ll = long long;
using str = string;
using vll = V<ll>;
using vvll = V<vll>;
using vs = V<str>;
// loops
#define FOR(i, a, b... | // C++ includes
#include <bits/stdc++.h>
// 俳句
using namespace std;
// alias templates
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
// alias declaration
using ll = long long;
using str = string;
using vll = V<ll>;
using vvll = V<vll>;
using vs = V<str>;
// loops
#define FOR(i, a, b... | [
"call.arguments.add",
"call.arguments.change"
] | 779,038 | 779,039 | u510283765 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> inputVec;
for (int i = 1; i <= n; i++) {
int num;
cin >> num;
inputVec.push_back(num);
}
vector<int> ansVec(n, 0);
vector<int> ansNum;
for (int i = n; i >= 1; i--) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> inputVec;
for (int i = 1; i <= n; i++) {
int num;
cin >> num;
inputVec.push_back(num);
}
vector<int> ansVec(n, 0);
vector<int> ansNum;
for (int i = n; i >= 1; i--) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,042 | 779,043 | u509420256 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int boader = n / 2;
if (n % 2 == 0) {
boader -= 1;
}
vector<int> a(n), ans(n);
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int boader = n / 2;
if (n % 2 == 1) {
boader += 1;
}
vector<int> a(n), ans(n);
for (int i = 0; i < n; i++) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operator.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 779,051 | 779,050 | u807028974 | cpp |
p02972 | #include <iostream>
using namespace std;
int main() {
int n, i, j, mul, num, m = 0;
cin >> n;
int a[n];
int ans[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
ans[i] = 0;
}
for (i = n; i >= 1; i--) {
mul = n / i;
num = 0;
for (j = 2; j <= mul; j++) {
... | #include <iostream>
using namespace std;
int main() {
int n, i, j, mul, num, m = 0;
cin >> n;
int a[n];
int ans[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
ans[i] = 0;
}
for (i = n; i >= 1; i--) {
mul = n / i;
num = 0;
for (j = 2; j <= mul; j++) {
... | [
"io.output.change"
] | 779,053 | 779,054 | u709752172 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int n;
cin >> n;
vector<ll> v(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i];
int cnt = 0;
vector<ll> ans(n + 1);
for (int i = n; i > 0; i--) {
int c = 0;
for (int j = 2 * i; j <= n; j += i) {
if (ans[j... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i];
int cnt = 0;
vector<int> ans(n + 1);
for (int i = n; i > 0; i--) {
int c = 0;
for (int j = 2 * i; j <= n; j += i) {
if (ans... | [] | 779,055 | 779,056 | u366445643 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
vector<bool> A;
vector<int> NUM;
vector<bool> TAMA;
int temp;
int num = 0;
A.push_back(0);
TAMA.push_back(0);
cin >> N;
for (int i = 0; ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
vector<bool> A;
vector<int> NUM;
vector<bool> TAMA;
int temp;
int num = 0;
A.push_back(0);
TAMA.push_back(0);
cin >> N;
for (int i = 0; ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 779,059 | 779,060 | u787146631 | cpp |
p02972 | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<int> a;
a.resize(n + 1, 0);
for (long long i = 1; i <= n; ++i) {
cin >> a[i];
}
long long countb = 0;
vector<int> b;
b.resize(n + 1, 0);
for (long long i =... | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<int> a;
a.resize(n + 1, 0);
for (long long i = 1; i <= n; ++i) {
cin >> a[i];
}
long long countb = 0;
vector<int> b;
b.resize(n + 1, 0);
for (long long i =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.condition.change"
] | 779,065 | 779,066 | u611571299 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0, sum = 0;
int n;
cin >> n;
int a[n];
int box[n];
int anslist[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int k = 2;
int bit = a[i - 1];
while (k * i <= n) {
bit ^= a[k... | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0, sum = 0;
int n;
cin >> n;
int a[n];
int box[n];
int anslist[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int k = 2;
int bit = a[i - 1];
while (k * i <= n) {
bit ^= box... | [
"assignment.value.change",
"identifier.change"
] | 779,067 | 779,068 | u355424600 | cpp |
p02972 | #include "bits/stdc++.h"
/************* Using *************/
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using graph_t = vector<vector<ll>>;
/*********** Constants ***********/
const auto INF = static_cast<int>(1e10);
const auto INFL = static_cast<ll>(1e18);
const auto MOD = static_cast<ll>(1... | #include "bits/stdc++.h"
/************* Using *************/
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using graph_t = vector<vector<ll>>;
/*********** Constants ***********/
const auto INF = static_cast<int>(1e10);
const auto INFL = static_cast<ll>(1e18);
const auto MOD = static_cast<ll>(1... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,069 | 779,070 | u634208461 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
for (ll i = 1; i < n + 1; i++) {
cin >> a[i];
}
vector<ll> b(n + 1);
for (ll i = n / 2 + 1; i < n + 1; i++) {
if (a[i] == 1)
b[i] = 1;
else
b[i] = 0;
}
for (ll ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
for (ll i = 1; i < n + 1; i++) {
cin >> a[i];
}
vector<ll> b(n + 1);
for (ll i = n / 2 + 1; i < n + 1; i++) {
if (a[i] == 1)
b[i] = 1;
else
b[i] = 0;
}
for (ll ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 779,071 | 779,072 | u330689597 | cpp |
p02972 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A = vector<int>(N + 1);
vector<int> B = vector<int>(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = N; i >= 1; i--) {
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A = vector<int>(N + 1);
vector<int> B = vector<int>(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = N; i >= 1; i--) {
... | [
"assignment.value.change",
"identifier.change"
] | 779,089 | 779,090 | u783428243 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> b(N, 0);
for (int i = N - 1; i >= 0; --i) {
int sum = 0;
for (int j = 2; j < 2e6; ++j) {
if ((i + 1) * j - 1 < N... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> b(N, 0);
for (int i = N - 1; i >= 0; --i) {
int sum = 0;
for (int j = 2; j < 2e6; ++j) {
if ((i + 1) * j - 1 < N... | [
"io.output.change"
] | 779,091 | 779,092 | u679366464 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> b(N, 0);
for (int i = N - 1; i >= 0; --i) {
int sum = 0;
for (int j = 2; j < 2e6; ++j) {
if ((i + 1) * j - 1 < N... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> b(N, 0);
for (int i = N - 1; i >= 0; --i) {
int sum = 0;
for (int j = 2; j < 2e6; ++j) {
if ((i + 1) * j - 1 < N... | [
"assignment.value.change",
"identifier.change",
"io.output.change"
] | 779,093 | 779,092 | u679366464 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int arr[200005];
int box[200005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> ans;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
for (int i = n; i >= 1; i--) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int arr[200005];
int box[200005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> ans;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
for (int i = n; i >= 1; i--) {
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 779,094 | 779,095 | u599785147 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int a[n + 1];
int b[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
int t = 0;
for (i = n; i > 0; i--) {
int c = 0;
for (j = i * 2; j <= n; j++) {
c += a[j];
}
b[i] = (c + a[i]) % 2;
if (b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int a[n + 1];
int b[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
int t = 0;
for (i = n; i > 0; i--) {
int c = 0;
for (j = i * 2; j <= n; j += i) {
c += b[j];
}
b[i] = (c + a[i]) % 2;
if... | [
"assignment.value.change",
"identifier.change"
] | 779,096 | 779,097 | u898143674 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int a[n + 1];
int b[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
int t = 0;
for (i = n; i > 0; i--) {
int c = 0;
for (j = i * 2; j < n; j++) {
c += a[j];
}
b[i] = (c + a[i]) % 2;
if (b[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int a[n + 1];
int b[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
int t = 0;
for (i = n; i > 0; i--) {
int c = 0;
for (j = i * 2; j <= n; j += i) {
c += b[j];
}
b[i] = (c + a[i]) % 2;
if... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 779,098 | 779,097 | u898143674 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a.at(i);
}
int cnt1 = 0;
vector<int> b(N);
for (int i = N - 1; i >= 0; --i) {
if (N / (i + 1) == 1) {
b.at(i) = a.at(i);
if (a.at(i) == 1)
cnt... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a.at(i);
}
int cnt1 = 0;
vector<int> b(N);
for (int i = N - 1; i >= 0; --i) {
if (N / (i + 1) == 1) {
b.at(i) = a.at(i);
if (a.at(i) == 1)
cnt... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 779,101 | 779,102 | u495461806 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.