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>
using namespace std;
const int N = 1e5 + 5;
int n, a[N], b[N];
bool flag = true;
vector<int> v;
int cal(int i) {
int ans = 0;
for (int j = i; j <= n; j++)
ans += b[j];
return ans;
}
int main() {
int res = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, a[N], b[N];
bool flag = true;
vector<int> v;
int cal(int i) {
int ans = 0;
for (int j = i; j <= n; j += i)
ans += b[j];
return ans;
}
int main() {
int res = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i])... | [
"literal.number.change",
"expression.operation.binary.change"
] | 779,749 | 779,750 | u061850718 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, n) for (int i = a; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, n) for (int i = a; ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 779,754 | 779,755 | u215692812 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
#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> ans;
vector<int> box(n + 1);
f... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
#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> ans;
vector<int> box(n + 1);
f... | [
"control_flow.loop.for.condition.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 779,758 | 779,759 | u480938608 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<in... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<in... | [
"assignment.value.change",
"identifier.change"
] | 779,766 | 779,767 | u480806810 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,768 | 779,769 | u155416173 | cpp |
p02972 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,778 | 779,779 | u450733728 | cpp |
p02972 | #include <bits/stdc++.h>
#define N 200005
#define debug(x) cout << #x << ":" << x << endl;
using namespace std;
int n, m;
bool res;
bool A[N], B[N];
int ans[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
for (int i = n; i; i--) {
bool res = 0;
for (int j = i +... | #include <bits/stdc++.h>
#define N 200005
#define debug(x) cout << #x << ":" << x << endl;
using namespace std;
int n, m;
bool res;
bool A[N], B[N];
int ans[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
for (int i = n; i; i--) {
bool res = 0;
for (int j = i +... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 779,782 | 779,783 | u392797842 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[200005];
int ans[200005];
int x;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = 2; j * i <= n; j++) {
if (ans[i * j] == 1)
cnt++;
... | #include <bits/stdc++.h>
using namespace std;
int a[200005];
int ans[200005];
int x;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = 2; j * i <= n; j++) {
if (ans[i * j] == 1)
cnt++;
... | [
"call.arguments.add"
] | 779,784 | 779,785 | u818518063 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> a(n);
for (long i = 0; i < n; ++i) {
cin >> a[i];
}
vector<long> ans;
for (long i = n - 1; i >= n / 2 + 1; --i) {
ans.push_back(a[i]);
}
for (long i = n / 2; i >= 0; --i) {
long sum = 0;
for (lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> a(n);
for (long i = 0; i < n; ++i) {
cin >> a[i];
}
vector<long> ans;
for (long i = n - 1; i >= n / 2 + 1; --i) {
ans.push_back(a[i]);
}
for (long i = n / 2; i >= 0; --i) {
long sum = 0;
for (lo... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 779,789 | 779,790 | u002386242 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> a(n);
for (long i = 0; i < n; ++i) {
cin >> a[i];
}
vector<long> ans;
for (long i = n - 1; i >= n / 2 + 1; --i) {
ans.push_back(a[i]);
}
for (long i = n / 2; i >= 0; --i) {
long sum = 0;
for (lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> a(n);
for (long i = 0; i < n; ++i) {
cin >> a[i];
}
vector<long> ans;
for (long i = n - 1; i >= n / 2 + 1; --i) {
ans.push_back(a[i]);
}
for (long i = n / 2; i >= 0; --i) {
long sum = 0;
for (lo... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 779,791 | 779,790 | u002386242 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for (int i = from; i < ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for (int i = from; i < ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,795 | 779,796 | u352350187 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for (int i = from; i < ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for (int i = from; i < ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 779,797 | 779,796 | u352350187 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[2 * 100000 + 10], M = 0, num[2 * 100000 + 10];
vector<int> ans;
signed main() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
int i;
for (i = N; i >= N / 2 + 1; i--) {
if (a[i] == 0)
;
else {
M++;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[2 * 100000 + 10], M = 0, num[2 * 100000 + 10];
vector<int> ans;
signed main() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
int i;
for (i = N; i >= N / 2 + 1; i--) {
if (a[i] == 0)
;
else {
M++;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 779,800 | 779,801 | u577926181 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[2 * 100000 + 10], M = 0, num[2 * 100000 + 10];
vector<int> ans;
signed main() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
int i;
for (i = N; i >= N / 2 + 1; i--) {
if (a[i] == 0)
;
else {
M++;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[2 * 100000 + 10], M = 0, num[2 * 100000 + 10];
vector<int> ans;
signed main() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
int i;
for (i = N; i >= N / 2 + 1; i--) {
if (a[i] == 0)
;
else {
M++;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 779,802 | 779,801 | u577926181 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[2 * 100000 + 10], M = 0, num[2 * 100000 + 10];
vector<int> ans;
signed main() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
int i;
for (i = N; i >= N / 2 + 1; i--) {
if (a[i] == 0)
;
else {
M++;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[2 * 100000 + 10], M = 0, num[2 * 100000 + 10];
vector<int> ans;
signed main() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
int i;
for (i = N; i >= N / 2 + 1; i--) {
if (a[i] == 0)
;
else {
M++;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 779,803 | 779,801 | u577926181 | cpp |
p02972 | #include <iostream>
using namespace std;
int a[200000];
int b[200000];
int main() {
int N, n;
cin >> N;
for (int i = 0; i < N; i++)
cin >> a[i];
for (int i = N - 1; i >= 0; i--) {
n = i + 1;
b[i] = a[i];
for (int j = 2; j * n <= N; j++) {
b[i] ^= a[j * n - 1];
}
}
n = 0;
for (... | #include <iostream>
using namespace std;
int a[200000];
int b[200000];
int main() {
int N, n;
cin >> N;
for (int i = 0; i < N; i++)
cin >> a[i];
for (int i = N - 1; i >= 0; i--) {
n = i + 1;
b[i] = a[i];
for (int j = 2; j * n <= N; j++) {
b[i] ^= b[j * n - 1];
}
}
n = 0;
for (... | [
"assignment.value.change",
"identifier.change"
] | 779,804 | 779,805 | u705230587 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
using ll = long long;
using ull = unsigned long long;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
usi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
using ll = long long;
using ull = unsigned long long;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
usi... | [
"assignment.change"
] | 779,808 | 779,809 | u172929647 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,810 | 779,811 | u862316882 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int Ai;
vector<int> A;
vector<int> dp(N, 0);
for (int i = 0; i < N; i++) {
cin >> Ai;
A.push_back(Ai);
}
for (int i = N - 1; i >= 0; i--) {
int tmp = 0;
for (int j = 2; (i + 1) * j < N; j++) {
if (dp[(i + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int Ai;
vector<int> A;
vector<int> dp(N, 0);
for (int i = 0; i < N; i++) {
cin >> Ai;
A.push_back(Ai);
}
for (int i = N - 1; i >= 0; i--) {
int tmp = 0;
for (int j = 2; (i + 1) * j <= N; j++) {
if (dp[(i +... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,819 | 779,820 | u235057691 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m = 0;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = n - 1; i >= 0; i--) {
b.at(i) = (a.at(i) + b.at(i)) % 2;
m += b.at(i);
if (b.at(i) == 0)
continue;
for (int j = 1; j * ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m = 0;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = n - 1; i >= 0; i--) {
b.at(i) = (a.at(i) + b.at(i)) % 2;
m += b.at(i);
if (b.at(i) == 0)
continue;
for (int j = 1; j * ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 779,821 | 779,822 | u697658632 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<int> il(n + 1);
int odp = 0;
for (int i = n; i >= 1; --i) {
int ile = 0;
for (int j = 2 * i; j <= n; j +=... | #include <iostream>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<int> il(n + 1);
int odp = 0;
for (int i = n; i >= 1; --i) {
int ile = 0;
for (int j = 2 * i; j <= n; j +=... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,823 | 779,824 | u535773602 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<int> il(n + 1);
int odp = 0;
for (int i = n; i >= 1; --i) {
int ile = 0;
for (int j = 2 * i; j <= n; j +=... | #include <iostream>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<int> il(n + 1);
int odp = 0;
for (int i = n; i >= 1; --i) {
int ile = 0;
for (int j = 2 * i; j <= n; 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"
] | 779,825 | 779,824 | u535773602 | cpp |
p02972 | #include <algorithm>
#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> b(n + 1);
int count = 0;
for (int i = n; i >= 1; i--) {
int total = 0;
for (int j = i + i; j <= n; ... | #include <algorithm>
#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> b(n + 1);
int count = 0;
for (int i = n; i >= 1; i--) {
int total = 0;
for (int j = i + i; j <= n; ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.remove",
"assignment.change"
] | 779,826 | 779,827 | u389009751 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
long long n;
vector<long long> x;
cin >> n;
for (long long i = 0; i < n; i++) {
long long temp;
cin >> temp;
x.push_back(temp);
}
long long output_count = 0;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
long long n;
vector<long long> x;
cin >> n;
for (long long i = 0; i < n; i++) {
long long temp;
cin >> temp;
x.push_back(temp);
}
long long output_count = 0;
... | [
"assignment.value.change",
"identifier.change"
] | 779,830 | 779,831 | u528005130 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
long long n;
vector<long long> x;
cin >> n;
for (long long i = 0; i < n; i++) {
long long temp;
cin >> temp;
x.push_back(temp);
}
long long output_count = 0;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
long long n;
vector<long long> x;
cin >> n;
for (long long i = 0; i < n; i++) {
long long temp;
cin >> temp;
x.push_back(temp);
}
long long output_count = 0;
... | [
"assignment.value.change",
"identifier.change",
"io.output.change"
] | 779,832 | 779,831 | u528005130 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
//#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
//#inc... | [
"assignment.change"
] | 779,840 | 779,841 | u301409936 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using lli = int_fast64_t;
using ulli = uint_fast64_t;
#define debug(x) cerr << #x << " : " << x << endl
#define debugv(x) \
cerr << #x << " : {"; \
for (... | #include <bits/stdc++.h>
using namespace std;
using lli = int_fast64_t;
using ulli = uint_fast64_t;
#define debug(x) cerr << #x << " : " << x << endl
#define debugv(x) \
cerr << #x << " : {"; \
for (... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 779,842 | 779,843 | u031593168 | cpp |
p02972 | #include <iostream>
using namespace std;
long long head[200001];
long long save[200001][1000];
int main() {
long long N;
long long a[200001];
long long b[200001];
long long size = 0;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = 1; i <= N; i++) {
for (int j = 2; i * j <= N; j+... | #include <iostream>
using namespace std;
int head[200001];
int save[200001][200];
int main() {
long long N;
long long a[200001];
long long b[200001];
long long size = 0;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = 1; i <= N; i++) {
for (int j = 2; i * j <= N; j++) {
sa... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 779,844 | 779,845 | u721980697 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
const int MOD = ... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
const int MOD = ... | [] | 779,848 | 779,849 | u194208056 | cpp |
p02972 | #include <algorithm>
#include <chrono>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>... | #include <algorithm>
#include <chrono>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>... | [
"control_flow.branch.if.condition.change"
] | 779,850 | 779,851 | u394853232 | cpp |
p02972 | #include <algorithm>
#include <chrono>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>... | #include <algorithm>
#include <chrono>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>... | [
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.update.change",
"assignment.change"
] | 779,853 | 779,851 | u394853232 | cpp |
p02972 | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdi... | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdi... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,866 | 779,867 | u708618797 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> b(n + 1, 0);
int ones = 0;
for (int i = n; i >= 1; i--) {
int parity = 0;
// int num = i+1;
for (int j = i + i; j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> b(n + 1, 0);
int ones = 0;
for (int i = n; i >= 1; i--) {
int parity = 0;
// int num = i+1;
for (int j = i + i; j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.condition.change"
] | 779,868 | 779,869 | u147913071 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define reg register
#define ll long long
inline ll read() {
ll x = 0, w = 0;
char ch = getchar();
while (!isdigit(ch))
w |= ch == '-', ch = getchar();
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return w ? -x : x;
}
int a[1000... | #include <bits/stdc++.h>
using namespace std;
#define reg register
#define ll long long
inline ll read() {
ll x = 0, w = 0;
char ch = getchar();
while (!isdigit(ch))
w |= ch == '-', ch = getchar();
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return w ? -x : x;
}
int a[1000... | [
"assignment.change"
] | 779,870 | 779,871 | u962361946 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define reg register
#define ll long long
inline ll read() {
ll x = 0, w = 0;
char ch = getchar();
while (!isdigit(ch))
w |= ch == '-', ch = getchar();
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return w ? -x : x;
}
int a[1000... | #include <bits/stdc++.h>
using namespace std;
#define reg register
#define ll long long
inline ll read() {
ll x = 0, w = 0;
char ch = getchar();
while (!isdigit(ch))
w |= ch == '-', ch = getchar();
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return w ? -x : x;
}
int a[1000... | [
"assignment.add",
"assignment.change"
] | 779,872 | 779,871 | u962361946 | cpp |
p02972 | /* Dsingh_24 */
#include <bits/stdc++.h>
#define ll int
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll int i = a; i ... | /* Dsingh_24 */
#include <bits/stdc++.h>
#define ll int
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll int i = a; i ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"literal.string.change",
"io.output.change"
] | 779,873 | 779,874 | u535413433 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y)... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 779,875 | 779,876 | u987594251 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
for (int i = 1; i <= N; i++)... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
for (int i = 1; i <= N; i++)... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 779,877 | 779,878 | u492131209 | cpp |
p02972 | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
temp... | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
temp... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,881 | 779,882 | u581122825 | cpp |
p02972 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 779,888 | 779,889 | u838742270 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
//関数
const long INF = 1000000000000000;
int main(void) {
long N;
cin >> N;
vector<long> a(N + 1);
for (int i = 1; i <= N; i++)
cin >> a.at(i);
vector<long> b(N + 1, 0);
long M = 0;
for (int n = N; n >= 1; n--) {
long bit = a.at(n);
for (int i =... | #include <bits/stdc++.h>
using namespace std;
//関数
const long INF = 1000000000000000;
int main(void) {
long N;
cin >> N;
vector<long> a(N + 1);
for (int i = 1; i <= N; i++)
cin >> a.at(i);
// cout<<a.at(3)<<endl;
vector<long> b(N + 1, 0);
long M = 0;
for (int n = N; n >= 1; n--) {
long bit = ... | [
"assignment.value.change",
"expression.operation.binary.change",
"call.remove"
] | 779,890 | 779,891 | u968365254 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 7;
const int inf = INT_MAX;
const ll inff = 1e18;
const ll mod = 1e9 + 7;
#define pii pair<int, int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 7;
const int inf = INT_MAX;
const ll inff = 1e18;
const ll mod = 1e9 + 7;
#define pii pair<int, int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,892 | 779,893 | u175665488 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define pp pair<int, int>
#define ll long long
#define ld long double
int inf = 100000000;
ll INF = 4000000000000000000;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(0), c(n + 1, 0);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define pp pair<int, int>
#define ll long long
#define ld long double
int inf = 100000000;
ll INF = 4000000000000000000;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(0), c(n + 1, 0);
... | [
"expression.operation.binary.remove",
"assignment.change"
] | 779,896 | 779,897 | u112775098 | cpp |
p02972 | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <cstring>
#include <iostream>
#include <map> // pair
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
... | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <cstring>
#include <iostream>
#include <map> // pair
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
... | [
"assignment.value.change",
"identifier.change"
] | 779,900 | 779,901 | u276796245 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, cont = 0;
cin >> n;
vector<int> a(n + 1), ans(n + 1);
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
if (i + 1 > n / 2) {
ans[i + 1] = a[i + 1];
if (a... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, cont = 0;
cin >> n;
vector<int> a(n + 1), ans(n + 1);
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
if (i + 1 > n / 2) {
ans[i + 1] = a[i + 1];
if (a... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,902 | 779,903 | u905270643 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int n, sum, tot, a[200005], 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--) {
if (i * 2 > n) {
b[i] = a[i];
} else {
for (int j = 2 * i; j <= n; j += i) {
sum ... | #include <bits/stdc++.h>
using namespace std;
int n, sum, tot, a[200005], 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--) {
if (i * 2 > n) {
b[i] = a[i];
} else {
sum = 0;
for (int j = 2 * i; j <= n; j += i)... | [
"assignment.add"
] | 779,906 | 779,907 | u803118370 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pll pair<ll, ll>
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pll pair<ll, ll>
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [] | 779,910 | 779,911 | u005899600 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ll long long int
const int INF = 2147483647;
using namespace std;
int main() {
int n;
int a[200000];
cin >> n;
REP(i, n) { cin >> a[i]; }
int ans[200000] = {};
int box = 0;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ll long long int
const int INF = 2147483647;
using namespace std;
int main() {
int n;
int a[200000];
cin >> n;
REP(i, n) { cin >> a[i]; }
int ans[200000] = {};
int box = 0;
... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,916 | 779,917 | u620059302 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
vector<int> b(n + 1), ans;
for (int i = n; i >= 1; --i) {
int s = 0;
for (int j = i + i; j <= n; j += i) {
s ^= b[j];
}
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
vector<int> b(n + 1), ans;
for (int i = n; i >= 1; --i) {
int s = 0;
for (int j = i + i; j <= n; j += i) {
s ^= b[j];
}
if... | [
"assignment.variable.change",
"identifier.change"
] | 779,918 | 779,919 | u129325320 | cpp |
p02972 | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __builtin_popcount
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbeg... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __builtin_popcount
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbeg... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,924 | 779,925 | u091650402 | cpp |
p02972 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int... | [
"expression.operation.binary.change",
"call.remove"
] | 779,928 | 779,929 | u608965386 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> arr, sol;
int i, j;
int input;
int res;
arr.push_back(0);
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &input);
arr.push_back(input);
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> arr, sol;
int i, j;
int input;
int res;
arr.push_back(0);
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &input);
arr.push_back(input);
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.unary.logical.remove"
] | 779,930 | 779,931 | u619248223 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
const ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
const ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,932 | 779,933 | u693027786 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
const ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
const ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,934 | 779,933 | u693027786 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
const ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
const ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,935 | 779,933 | u693027786 | cpp |
p02972 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<int> vin... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<int> vin... | [
"io.output.change"
] | 779,938 | 779,939 | u376082984 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
#define N 200005
queue<int> q;
int a[N], b[N] = {0};
int main() {
int n;
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; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
#define N 200005
queue<int> q;
int a[N], b[N] = {0};
int main() {
int n;
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; ... | [
"assignment.value.change",
"identifier.change"
] | 779,946 | 779,947 | u689939934 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,948 | 779,949 | u069450081 | cpp |
p02972 | // Utkarsh.25dec
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, a, b) for (ll i = a; i <= b; i++)
#define vi vector<int>
#define vs vector<string>
#define v... | // Utkarsh.25dec
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, a, b) for (ll i = a; i <= b; i++)
#define vi vector<int>
#define vs vector<string>
#define v... | [] | 779,950 | 779,951 | u596750443 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store") // to restrict undesirable precision
#pragma GCC optimize( \
"-fno-defer-pop") // to pop argument of functio... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store") // to restrict undesirable precision
#pragma GCC optimize( \
"-fno-defer-pop") // to pop argument of functio... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,952 | 779,953 | u838261804 | cpp |
p02972 | #include <cstdio>
#define M 200005
int A[M], B[M];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
int cnt = 0;
for (int i = n; i >= 1; i--) {
for (int j = i + i; j <= n; j += i) {
A[i] ^= A[j];
}
if (A[i])
cnt++;
}
printf("%d\n", cnt);
f... | #include <cstdio>
#define M 200005
int A[M], B[M];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
int cnt = 0;
for (int i = n; i >= 1; i--) {
for (int j = i + i; j <= n; j += i) {
A[i] ^= A[j];
}
if (A[i])
cnt++;
}
printf("%d\n", cnt);
f... | [
"call.arguments.change"
] | 779,956 | 779,957 | u934118424 | cpp |
p02972 | #include <bits/stdc++.h> //Written by ThiDaiLoc
using namespace std; // Team Three Wolves
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> triple;
#define fu(i, a, b) for (ll i = a; i <= b; i++)
#define f1(i, n) for... | #include <bits/stdc++.h> //Written by ThiDaiLoc
using namespace std; // Team Three Wolves
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> triple;
#define fu(i, a, b) for (ll i = a; i <= b; i++)
#define f1(i, n) for... | [] | 779,960 | 779,961 | u104888333 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inc... | [
"expression.operation.binary.add"
] | 779,962 | 779,963 | u443010331 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define _for(i, j, N) for (int i = (j); i < (N); i++)
#define _rep(i, j, N) for (int i = (j); i <= (N); i++)
#define _dec(i, N, j) for (int i = (N - 1); i >= (j); i--)
#define _rec(i, N, j) for (int i = (N); i >= (j); i--)
#define ALL(x) x.begin(), x.end()
#define MEM(a, n... | #include <bits/stdc++.h>
using namespace std;
#define _for(i, j, N) for (int i = (j); i < (N); i++)
#define _rep(i, j, N) for (int i = (j); i <= (N); i++)
#define _dec(i, N, j) for (int i = (N - 1); i >= (j); i--)
#define _rec(i, N, j) for (int i = (N); i >= (j); i--)
#define ALL(x) x.begin(), x.end()
#define MEM(a, n... | [
"assignment.value.change",
"identifier.change"
] | 779,964 | 779,965 | u066651036 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define _for(i, j, N) for (int i = (j); i < (N); i++)
#define _rep(i, j, N) for (int i = (j); i <= (N); i++)
#define _dec(i, N, j) for (int i = (N - 1); i >= (j); i--)
#define _rec(i, N, j) for (int i = (N); i >= (j); i--)
#define ALL(x) x.begin(), x.end()
#define MEM(a, n... | #include <bits/stdc++.h>
using namespace std;
#define _for(i, j, N) for (int i = (j); i < (N); i++)
#define _rep(i, j, N) for (int i = (j); i <= (N); i++)
#define _dec(i, N, j) for (int i = (N - 1); i >= (j); i--)
#define _rec(i, N, j) for (int i = (N); i >= (j); i--)
#define ALL(x) x.begin(), x.end()
#define MEM(a, n... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 779,966 | 779,965 | u066651036 | cpp |
p02972 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,967 | 779,968 | u896838289 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
#define REP(i, n, m) for (ll i = n; i < (ll)m; ++i)
#define IREP(i, n, m) for (ll i = n - 1; i >= m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v) v.begin(), v.en... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
#define REP(i, n, m) for (ll i = n; i < (ll)m; ++i)
#define IREP(i, n, m) for (ll i = n - 1; i >= m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v) v.begin(), v.en... | [
"io.output.change"
] | 779,969 | 779,970 | u059082716 | cpp |
p02972 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vecto... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vecto... | [
"control_flow.branch.if.condition.change"
] | 779,973 | 779,972 | u810616694 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | [
"call.arguments.change"
] | 779,976 | 779,977 | u759266806 | cpp |
p02972 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG ce... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG ce... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,980 | 779,981 | u905715926 | cpp |
p02972 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a)... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a)... | [
"identifier.change",
"call.arguments.change",
"variable_access.subscript.index.change"
] | 779,986 | 779,987 | u876335718 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9 + 7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define ANS(n) cout << (n) << "\n"
#define ... | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9 + 7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define ANS(n) cout << (n) << "\n"
#define ... | [
"expression.operation.binary.add"
] | 779,990 | 779,991 | u694731294 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9 + 7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define ANS(n) cout << (n) << "\n"
#define ... | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9 + 7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define ANS(n) cout << (n) << "\n"
#define ... | [
"expression.operator.change"
] | 779,992 | 779,991 | u694731294 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define Int long long
//#define int long long
// TEMPLATE
// START---------------8<---------------8<---------------8<---------------8<---------------//
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi... | #include <bits/stdc++.h>
using namespace std;
#define Int long long
//#define int long long
// TEMPLATE
// START---------------8<---------------8<---------------8<---------------8<---------------//
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi... | [
"control_flow.loop.for.initializer.change"
] | 779,993 | 779,994 | u832039789 | cpp |
p02972 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, A[202020], M, B[202020];
ll i, j, ans;
int main() {
scanf("%lld", &... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, A[202020], M, B[202020];
ll i, j, ans;
int main() {
scanf("%lld", &... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,995 | 779,996 | u259396003 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define M 200005
int a[M], b[M];
int main() {
int n, ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = n; i >= 1; --i) {
int v = 0;
for (int j = i + i; j <= n; ++j)
v ^= b[j];
b[i] = v ^ a[i];
if (b[i])... | #include <bits/stdc++.h>
using namespace std;
#define M 200005
int a[M], b[M];
int main() {
int n, ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = n; i >= 1; --i) {
int v = 0;
for (int j = i + i; j <= n; j += i)
v ^= b[j];
b[i] = v ^ a[i];
if (b[... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 779,999 | 780,000 | u455656648 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define int long long
#define mod 1000000007
using namespace std;
int n, a[234567], b[234567], ans = 0;
signed main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define int long long
#define mod 1000000007
using namespace std;
int n, a[234567], b[234567], ans = 0;
signed main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 780,001 | 780,002 | u141968173 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X)... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X)... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 780,005 | 780,006 | u205561862 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X)... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X)... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 780,007 | 780,006 | u205561862 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef int ll;
typedef long double ld;
const ll N = 100005;
char en = '\n';
ll inf = 1e16;
ll mod = 1000000007;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef int ll;
typedef long double ld;
const ll N = 100005;
char en = '\n';
ll inf = 1e16;
ll mod = 1000000007;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
... | [] | 780,008 | 780,009 | u401416019 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef int ll;
typedef long double ld;
const ll N = 100005;
char en = '\n';
ll inf = 1e16;
ll mod = 1000000007;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef int ll;
typedef long double ld;
const ll N = 100005;
char en = '\n';
ll inf = 1e16;
ll mod = 1000000007;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
... | [
"assignment.value.change",
"identifier.change"
] | 780,010 | 780,009 | u401416019 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 780,011 | 780,012 | u196497077 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define N 200005
int n, A[N], AN[N], an;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (int i = n; i; i--) {
if (A[i]) {
AN[++an] = i;
for (int z = 1; z * z <= i; z++) {
if (i % z == 0) {
A[z] ... | #include <bits/stdc++.h>
using namespace std;
#define N 200005
int n, A[N], AN[N], an;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (int i = n; i; i--) {
if (A[i]) {
AN[++an] = i;
for (int z = 1; z * z <= i; z++) {
if (i % z == 0) {
A[z] ... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 780,013 | 780,014 | u867285555 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 212345;
int a[MAXN], v[MAXN];
vector<int> ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = n; i > 0; --i) {
int put = a[i];
for (int j = i + i; j < n; j += i) {
put ^= v[j];
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 212345;
int a[MAXN], v[MAXN];
vector<int> ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = n; i > 0; --i) {
int put = a[i];
for (int j = i + i; j <= n; j += i) {
put ^= v[j];
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 780,015 | 780,016 | u932299059 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 2001;
const int MOD = 1000000007;
signed main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int m = 0, k[n] = {};
for (int i = n - 1; i >= 0; i--) {
k[i] = a[i];
for (int j = 2 * (i + ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 2001;
const int MOD = 1000000007;
signed main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int m = 0, k[n] = {};
for (int i = n - 1; i >= 0; i--) {
k[i] = a[i];
for (int j = 2 * (i + ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 780,019 | 780,020 | u651317892 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priori... | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priori... | [] | 780,021 | 780,022 | u259210975 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef ARTHUR_LOCAL
ifstream cin("input.txt");
#endif
int n;
cin >> n;
vector<int> A = {-1};
for (int i = 0; i < n; i++) {
int a;
cin >> a;
A.push_back(a);
}
vector<int> ans(n + 1);
int ones = 0;
for (int i = n; i >= 1; i--) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef ARTHUR_LOCAL
ifstream cin("input.txt");
#endif
int n;
cin >> n;
vector<int> A = {-1};
for (int i = 0; i < n; i++) {
int a;
cin >> a;
A.push_back(a);
}
vector<int> ans(n + 1);
int ones = 0;
for (int i = n; i >= 1; i--) ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 780,025 | 780,026 | u263542246 | cpp |
p02972 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#includ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#includ... | [] | 780,027 | 780,028 | u495699318 | cpp |
p02972 | #include <iostream>
using namespace std;
int b[200001];
int main() {
int N;
int cnt = 0;
cin >> N;
int a[200001];
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 2; j * i <= N; j++) {
sum += b[j * i];
}
sum %= 2;
if (sum != ... | #include <iostream>
using namespace std;
int b[200001];
int main() {
int N;
int cnt = 0;
cin >> N;
int a[200001];
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 2; j * i <= N; j++) {
sum += b[j * i];
}
sum %= 2;
if (sum != ... | [] | 780,037 | 780,038 | u693133807 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define p_b push_back
#define pll pair<ll, ll>
#define pii pair<int, int>
#define m_p... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define p_b push_back
#define pll pair<ll, ll>
#define pii pair<int, int>
#define m_p... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 780,039 | 780,040 | u884914117 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(... | #include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(... | [
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 780,041 | 780,042 | u774906517 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
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;
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
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;
re... | [
"identifier.replace.add",
"literal.replace.remove",
"assignment.value.change",
"identifier.change"
] | 780,043 | 780,044 | u980655160 | cpp |
p02972 | #include <bits/stdc++.h>
//#pragma GCC target("avx,avx2,sse4.2")
#define rep(q, a, b) for (int q = a, q##_end_ = b; q <= q##_end_; ++q)
#define dep(q, a, b) for (int q = a, q##_end_ = b; q >= q##_end_; --q)
#define mem(a, b) memset(a, b, sizeof a)
#define debug(a) cerr << #a << ' ' << a << "___" << endl
using namespace... | #include <bits/stdc++.h>
//#pragma GCC target("avx,avx2,sse4.2")
#define rep(q, a, b) for (int q = a, q##_end_ = b; q <= q##_end_; ++q)
#define dep(q, a, b) for (int q = a, q##_end_ = b; q >= q##_end_; --q)
#define mem(a, b) memset(a, b, sizeof a)
#define debug(a) cerr << #a << ' ' << a << "___" << endl
using namespace... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 780,045 | 780,046 | u063024444 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define N 200010
int n, a[N], b[N];
bool ok() {
for (int i = 1; i <= n; ++i) {
int tot = 0;
for (int j = i; j <= n; j += i) {
tot = tot + b[j];
tot %= 2;
}
if (tot ^ b[i])
return 0;
}
return 1;
}
int main() {
while (scanf("%d", &... | #include <bits/stdc++.h>
using namespace std;
#define N 200010
int n, a[N], b[N];
bool ok() {
for (int i = 1; i <= n; ++i) {
int tot = 0;
for (int j = i; j <= n; j += i) {
tot = tot + b[j];
tot %= 2;
}
if (tot ^ a[i])
return 0;
}
return 1;
}
int main() {
while (scanf("%d", &... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 780,049 | 780,050 | u717168969 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define N 200010
int n, a[N], b[N];
bool ok() {
for (int i = 1; i <= n; ++i) {
int tot = 0;
for (int j = i; j <= n; j += i) {
tot = tot + b[j];
tot %= 2;
}
if (tot ^ b[i])
return 0;
}
return 1;
}
int main() {
while (scanf("%d", &... | #include <bits/stdc++.h>
using namespace std;
#define N 200010
int n, a[N], b[N];
bool ok() {
for (int i = 1; i <= n; ++i) {
int tot = 0;
for (int j = i; j <= n; j += i) {
tot = tot + b[j];
tot %= 2;
}
if (tot ^ a[i])
return 0;
}
return 1;
}
int main() {
while (scanf("%d", &... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.add"
] | 780,051 | 780,050 | u717168969 | cpp |
p02972 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int n, tmp, sz = 0;
vector<int> v, ans;
cin >> n;
v.resize(n + 1);
ans.resize(n + 1);
for (int i = 1; i < n + 1; i++)
cin >> v[i];
for (int i = 1; i < n + 1; i++)
ans[i] = 0;
f... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int n, tmp, sz = 0;
vector<int> v, ans;
cin >> n;
v.resize(n + 1);
ans.resize(n + 1);
for (int i = 1; i < n + 1; i++)
cin >> v[i];
for (int i = 1; i < n + 1; i++)
ans[i] = 0;
f... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 780,052 | 780,053 | u672995180 | cpp |
p02972 | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(a, b) for (int i = a; i < b + 1; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v;
vector<bool> vv(n);
int ans = 0;... | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(a, b) for (int i = a; i < b + 1; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v;
vector<bool> vv(n);
int ans = 0;... | [
"io.output.change"
] | 780,054 | 780,055 | u118875091 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int n, ans;
int a[MAXN], f[MAXN];
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 = (sum + f[i]) % 2;
f[i... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int n, ans;
int a[MAXN], f[MAXN];
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 = (sum + f[j]) % 2;
f[i... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 780,058 | 780,059 | u462461621 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define endl "\n"
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define rrep(i, a, b) for (auto i = (a); i > (b); --i)
#define ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define endl "\n"
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define rrep(i, a, b) for (auto i = (a); i > (b); --i)
#define ... | [
"expression.operation.binary.add"
] | 780,062 | 780,063 | u817774241 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) ... | [] | 780,067 | 780,068 | u888717396 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.