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;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
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... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 777,159 | 777,160 | u601384736 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
... | [
"call.arguments.change"
] | 777,163 | 777,164 | u147556624 | 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];
... | [] | 777,165 | 777,166 | u147556624 | cpp |
p02972 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#de... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#de... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 777,170 | 777,171 | u774652316 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
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 >= n / 2; --i) {
b[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
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 >= n / 2; --i) {
b[i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,172 | 777,173 | u701556979 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
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 >= n / 2; --i) {
b[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
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 >= n / 2; --i) {
b[i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"control_flow.loop.for.update.change",
"assignment.change"
] | 777,174 | 777,173 | u701556979 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
typedef long long ll;
int a[maxn * 2];
int b[maxn * 2];
int ans[maxn];
int cnt = 0;
int n;
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... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
typedef long long ll;
int a[maxn * 2];
int b[maxn * 2];
int ans[maxn];
int cnt = 0;
int n;
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... | [] | 777,177 | 777,178 | u131573212 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repo(i, n) for (int i = 1; i <= n; i++)
#define MAX 200005
#define INF 1001001001
using namespace std;
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main() {
int n;
cin ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repo(i, n) for (int i = 1; i <= n; i++)
#define MAX 200005
#define INF 1001001001
using namespace std;
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main() {
int n;
cin ... | [
"assignment.value.change",
"identifier.change"
] | 777,179 | 777,180 | u930997891 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#defi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#defi... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 777,190 | 777,191 | u489108157 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 777,192 | 777,193 | u291873788 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,198 | 777,199 | u624678037 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
set<ll> ans;
vector<ll> b(n);
for (ll i = n; i > 0; i--) {
ll c = 0;
for (ll j = i * 2; i <= n; j += i) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
set<ll> ans;
vector<ll> b(n);
for (ll i = n; i > 0; i--) {
ll c = 0;
for (ll j = i * 2; j <= n; j += i) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change"
] | 777,202 | 777,203 | u718758485 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,205 | 777,206 | u106297876 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int n;
cin >> n;
vector<int> vec(n + 1);
for (int i = 1; i <= n; i++) {
cin >> vec[i];
}
vector<int> ans;
vector<int> build(n + 1);
for (int i = n; i >= 1; i--) {
int sum = build[i];
for (int j = i + i; j <... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int n;
cin >> n;
vector<int> vec(n + 1);
for (int i = 1; i <= n; i++) {
cin >> vec[i];
}
vector<int> ans;
vector<int> build(n + 1);
for (int i = n; i >= 1; i--) {
int sum = build[i];
for (int j = i + i; j <... | [
"assignment.value.change",
"identifier.change"
] | 777,207 | 777,208 | u251058942 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[1000000];
int ret[1000000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> vec;
for (int i = 1; i <= n; i++)
cin >> 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;
int a[1000000];
int ret[1000000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> vec;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,209 | 777,210 | u109635851 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[1000000];
int ret[1000000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> vec;
for (int i = 1; i <= n; i++)
cin >> 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;
int a[1000000];
int ret[1000000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> vec;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,211 | 777,210 | u109635851 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#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 FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#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 FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | [
"call.arguments.add",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 777,222 | 777,223 | u917282863 | cpp |
p02972 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin()... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin()... | [
"preprocessor.define.value.change",
"control_flow.branch.if.condition.change"
] | 777,224 | 777,225 | u524019694 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
... | [
"call.function.change",
"call.arguments.change"
] | 777,226 | 777,227 | u782785740 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
... | [
"call.arguments.change"
] | 777,228 | 777,227 | u782785740 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
... | [
"call.function.change",
"call.arguments.change"
] | 777,226 | 777,229 | u782785740 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
... | [
"call.arguments.change"
] | 777,228 | 777,229 | u782785740 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP2(i, s, e)... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP2(i, s, e)... | [
"assignment.value.change",
"identifier.change",
"call.add",
"call.arguments.change"
] | 777,230 | 777,231 | u868099754 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | [
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,232 | 777,233 | u908318580 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 777,243 | 777,244 | u303039933 | cpp |
p02972 | // shan61916
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define IOS \
ios::sync_with_stdio(false... | // shan61916
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define IOS \
ios::sync_with_stdio(false... | [
"call.arguments.change"
] | 777,247 | 777,248 | u032226420 | cpp |
p02972 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
void solve() {
ll N;
cin >> N;
vector<ll> a(N);
for (ll i = 0; i < N; i++) {
cin >> a.at(i);
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
void solve() {
ll N;
cin >> N;
vector<ll> a(N);
for (ll i = 0; i < N; i++) {
cin >> a.at(i);
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 777,249 | 777,250 | u941251324 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
// cout << a.at(i) << " ";
}
vector<int> b(N);
int j, sum;
for (int i = N; i > 0; i--) {
sum = 0;
j = 2 * i;
while ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
vector<int> b(N);
int j, sum;
for (int i = N; i > 0; i--) {
sum = 0;
j = 2 * i;
while (j <= N) {
sum += b.at(j ... | [
"assignment.value.change",
"identifier.change"
] | 777,253 | 777,254 | u616090453 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <... | [
"call.arguments.change"
] | 777,266 | 777,267 | u781381862 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <... | [
"call.arguments.change"
] | 777,266 | 777,269 | u781381862 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
int m = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool goodIn = true;
for (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
int m = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool goodIn = true;
for (... | [
"io.output.change"
] | 777,270 | 777,271 | u156778176 | cpp |
p02972 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 777,277 | 777,278 | u820341516 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,281 | 777,282 | u987913144 | cpp |
p02972 | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1];
memset(b, 0, sizeof(b));
a[0] = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int num = 0;
for (int x = 2 * i; x <= n; x +... | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1];
memset(b, 0, sizeof(b));
a[0] = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int num = 0;
for (int x = 2 * i; x <= n; x +... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,283 | 777,284 | u542474460 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<int> ans(N);
for (int i = 0; i < N; i++)
ans[i] = 0;
for (int i = N; i > 0; i--) {
int sum = 0;
for (int j = i; j < N; j += j) {
... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<int> ans(N);
for (int i = 0; i < N; i++)
ans[i] = 0;
for (int i = N; i > 0; i--) {
int sum = 0;
for (int j = i; j <= N; j += i) {... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 777,289 | 777,290 | u407539638 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int i, j;
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> boxes(n);
int tmp;
for (i = n; i > 0; i--) {
tmp = 0;
for (j = 2 * i; j < n; j += i) {
if (boxes[j - 1] == 1)
tmp++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int i, j;
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> boxes(n);
int tmp;
for (i = n; i > 0; i--) {
tmp = 0;
for (j = 2 * i; j <= n; j += i) {
if (boxes[j - 1] == 1)
tmp++;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,293 | 777,294 | u523698212 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int ball = 0;
for (int i = n; 0 < i; i--) {
if (0 == a.at(i - 1)) {
int total = 0;
for (int j = i * 2; j <= n; j += i) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int ball = 0;
for (int i = n; 0 < i; i--) {
if (0 == a.at(i - 1)) {
int total = 0;
for (int j = i * 2; j <= n; j += i) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,305 | 777,306 | u091552241 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], s[n + 1], sum[n + 1];
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = 0;
}
for (int i = n; i >= 1; i--) {
if (a[i] != sum[i] % 2) {
v.push_back(i);
for (int j = 1; j <= ce... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], s[n + 1], sum[n + 1];
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = 0;
}
for (int i = n; i >= 1; i--) {
if (a[i] != sum[i] % 2) {
v.push_back(i);
for (int j = 1; j <= fl... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 777,325 | 777,326 | u142234618 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], s[n + 1], sum[n + 1];
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = 0;
}
for (int i = n; i >= 1; i--) {
if (a[i] != sum[i] % 2) {
v.push_back(i);
for (int j = 1; j <= ce... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], s[n + 1], sum[n + 1];
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = 0;
}
for (int i = n; i >= 1; i--) {
if (a[i] != sum[i] % 2) {
v.push_back(i);
for (int j = 1; j <= fl... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 777,327 | 777,326 | u142234618 | cpp |
p02972 | //
// main.cpp
// test130
//
// Created by on 2019/06/16.
// Copyright © 2 All rights reserved.
//
//
// main.cpp
// new
//
// Created on 2019/06/09.
// Copyright All rights reserved.
//
// C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This fi... | //
// main.cpp
// test130
//
// Created by on 2019/06/16.
// Copyright © 2 All rights reserved.
//
//
// main.cpp
// new
//
// Created on 2019/06/09.
// Copyright All rights reserved.
//
// C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This fi... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,328 | 777,329 | u943070796 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int ans[n + 1];
int M = 0;
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i > 0; i--) {
int k = 2 * i;
int s = 0;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int ans[n + 1];
int M = 0;
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i > 0; i--) {
int k = 2 * i;
int s = 0;
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 777,330 | 777,331 | u992779443 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int a[200001];
for (int i ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int a[200001];
for (int i ... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,336 | 777,337 | u790614328 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j;
ll cnt = 0;
int n;
cin >> n;
int a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
int c[n];
for (i = n; i >= 1; i--) {
if (a[i] != 0) {
c[cnt++] = i;
int p = (int)round(sqrt(i));
if (p * ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j;
ll cnt = 0;
int n;
cin >> n;
int a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
int c[n];
for (i = n; i >= 1; i--) {
if (a[i] != 0) {
c[cnt++] = i;
int p = (int)round(sqrt(i));
if (p * ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 777,346 | 777,347 | u952130512 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
void Main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
int ans[n];
memset(ans, 0, sizeof(ans));
for (int i = n; i > 0; i--) {
int tmp = 0;
for (int j = i + i; j < n; j += i) {
tmp += ans[... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
int ans[n];
memset(ans, 0, sizeof(ans));
for (int i = n; i > 0; i--) {
int tmp = 0;
for (int j = i + i; j <= n; j += i) {
tmp += ans... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,350 | 777,351 | u931698099 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), ball(n, 0), ans(0);
int cnt = 0;
for (int i = 0; i < n; i++)
cin >> a.at(i);
if (n % 2 == 0)
for (int i = 0; i < n / 2; i++) {
ball.at(n - 1 - i) = a.at(n - 1 - i);
if (ball.at(n - 1 - i) == 1)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), ball(n, 0), ans(0);
int cnt = 0;
for (int i = 0; i < n; i++)
cin >> a.at(i);
if (n % 2 == 0)
for (int i = 0; i < n / 2; i++) {
ball.at(n - 1 - i) = a.at(n - 1 - i);
if (ball.at(n - 1 - i) == 1)... | [
"expression.operation.binary.remove"
] | 777,355 | 777,356 | u071019032 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[200010], c[200010];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
c[i] = 0;
}
vector<int> v;
for (int i = n; i >= 1; i++) {
for (int j = i * 2; j <= n; j += i) {
a[i] ^= c[j];
}
c[i] = a[i];
if (c[i])
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[200010], c[200010];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
c[i] = 0;
}
vector<int> v;
for (int i = n; i >= 1; i--) {
for (int j = i * 2; j <= n; j += i) {
a[i] ^= c[j];
}
c[i] = a[i];
if (c[i])
... | [] | 777,357 | 777,358 | u924885571 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
using namespace std;
/*******-c++14 don't include-*******/
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
using namespace std;
/*******-c++14 don't include-*******/
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b,... | [] | 777,365 | 777,366 | u895382169 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD ... | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 777,367 | 777,368 | u473116917 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, m = 0;
cin >> n;
vector<ll> a(n), b(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = n - 1; i >= 0; i--) {
ll t;
for (ll j = i; j < n; j += i + 1) {
t += b[j];
}
if (t % 2 == 0 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, m = 0;
cin >> n;
vector<ll> a(n), b(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = n - 1; i >= 0; i--) {
ll t = 0;
for (ll j = i; j < n; j += i + 1) {
t += b[j];
}
if (t % 2 =... | [
"variable_declaration.value.change"
] | 777,369 | 777,370 | u125051909 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | [] | 777,371 | 777,372 | u421426760 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | [] | 777,373 | 777,372 | u421426760 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 777,374 | 777,372 | u421426760 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
// vector <int> xor_sum(n + 1);
rep(i, n + 1) {
if (i == 0)
continue;
cin >> a.at(i);
// xor_sum.at(i) = a.at(i);
// if (i == 1) conti... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
// vector <int> xor_sum(n + 1);
rep(i, n + 1) {
if (i == 0)
continue;
cin >> a.at(i);
// xor_sum.at(i) = a.at(i);
// if (i == 1) conti... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 777,378 | 777,379 | u619557935 | cpp |
p02972 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1e18;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n, 0);
rep(i, n) cin >> a[i];
ll cnt = 0;
for (ll i = n - 1; i >= 0; i--) {
ll n... |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1e18;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n, 0);
rep(i, n) cin >> a[i];
ll cnt = 0;
for (ll i = n - 1; i >= 0; i--) {
ll n... | [] | 777,380 | 777,381 | u289381123 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, 0);
int m = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, 0);
int m = 0;... | [
"control_flow.loop.for.initializer.change"
] | 777,382 | 777,383 | u633967774 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, 0);
int m = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, 0);
int m = 0;... | [
"control_flow.loop.for.initializer.change",
"io.output.change"
] | 777,384 | 777,383 | u633967774 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int ans[n];
for (int i = n - 1; i >= 0; i--) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int ans[n];
for (int i = n - 1; i >= 0; i--) ... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 777,385 | 777,386 | u633967774 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N), ans(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = N; i >= 1; i--) {
for (int j = i; j <= N; j += i) {
sum += ans[j - 1];
}
if (sum % 2 == ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N), ans(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = N; i >= 1; i--) {
sum = 0;
for (int j = i; j <= N; j += i) {
sum += ans[j - 1];
}
if... | [
"assignment.add"
] | 777,395 | 777,396 | u109191542 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 10, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> putted(n + 10, 0);
for (int i = n; i >= 1; i--) {
int sum_temp = 0;
for (int j = i + i; j <= n; j += i)
sum_temp += putted[j];
pu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 10, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> putted(n + 10, 0);
for (int i = n; i >= 1; i--) {
int sum_temp = 0;
for (int j = i + i; j <= n; j += i)
sum_temp += putted[j];
pu... | [
"identifier.change",
"call.arguments.change"
] | 777,397 | 777,398 | u833963136 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <set>
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + ... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <set>
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,399 | 777,400 | u872982453 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <set>
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + ... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <set>
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 777,401 | 777,400 | u872982453 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,402 | 777,403 | u084949493 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | [
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,404 | 777,405 | u084949493 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
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> memo(n);
int m = 0;
for (in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
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> memo(n);
int m = 0;
for (in... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change"
] | 777,406 | 777,407 | u476027087 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
// iの書かれた箱に入れるボールの個数（0 or 1）
vector<int> b(N + 1, 0);
for (int i = 1; i < N + 1; i++)
cin >> a[i];
for (int i = N; i >= 1; i--) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
// iの書かれた箱に入れるボールの個数（0 or 1）
vector<int> b(N + 1, 0);
for (int i = 1; i < N + 1; i++)
cin >> a[i];
for (int i = N; i >= 1; i--) {
... | [] | 777,408 | 777,409 | u224794697 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
co... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 777,410 | 777,411 | u280096880 | cpp |
p02972 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | [
"expression.operation.binary.add"
] | 777,416 | 777,417 | u179778090 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i)
cin >> a.at(i);
vector<int> v(n + 1, 0);
vector<int> ans;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i; j <= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i)
cin >> a.at(i);
vector<int> v(n + 1, 0);
vector<int> ans;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i + i; j... | [
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"call.function.change",
"io.output.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 777,418 | 777,419 | u104613587 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i)
cin >> a.at(i);
vector<int> v(n + 1, 0);
vector<int> ans;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i; j <= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i)
cin >> a.at(i);
vector<int> v(n + 1, 0);
vector<int> ans;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i + i; j... | [
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 777,420 | 777,419 | u104613587 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1, 0);
REP(i, n) cin >> a[i + 1];
vector<int> b(n + 1, 0), res(n + 1, 0);
int m = 0;
for (int i = n; i > 0; i--) {
int ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1, 0);
REP(i, n) cin >> a[i + 1];
vector<int> b(n + 1, 0), res(n + 1, 0);
int m = 0;
for (int i = n; i > 0; i--) {
int ... | [
"expression.operation.binary.remove"
] | 777,421 | 777,422 | u596385287 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
constexpr int Nmax = 200'000;
constexpr int Nbit = Nmax + 1;
int N;
cin >> N;
vector<int> mod2(N + 1);
for (int d = 1; d <= N; d++) {
cin >> mod2.at(d);
}
bitset<Nbit> bs;
for (int d = N; d >= 1; d--) {
int cnt_mul = 0;
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
constexpr int Nmax = 200'000;
constexpr int Nbit = Nmax + 1;
int N;
cin >> N;
vector<int> mod2(N + 1);
for (int d = 1; d <= N; d++) {
cin >> mod2.at(d);
}
bitset<Nbit> bs;
for (int d = N; d >= 1; d--) {
int cnt_mul = 0;
for (int... | [] | 777,423 | 777,424 | u068765697 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main() {
int n;
const int max_n = 2 * 1e5;
int a[max_n + 1];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
bool ball[max_n + 1] = {};
int cnt = 0;
for (int i = n; i >= 1; i--) {
int sum = 0... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main() {
int n;
const int max_n = 2 * 1e5;
int a[max_n + 1];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
bool ball[max_n + 1] = {};
int cnt = 0;
for (int i = n; i >= 1; i--) {
int sum = 0... | [
"expression.operation.binary.add"
] | 777,427 | 777,428 | u906832993 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> cnt(n, 0);
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = i * 2 + 1; j > n; j += (i + 1)) {
if (j > n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> cnt(n, 0);
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = i * 2 + 1; j < n; j += (i + 1)) {
// cout <... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,429 | 777,430 | u502312544 | cpp |
p02972 | #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
std::vector<int> a(N);
for (int i = 0; i < N; i++) {
std::cin >> a[i];
}
std::vector<int> boxes(N, 0);
int M = 0;
for (int i = N - 1; i >= 0; i--) {
int count = 0;
for (int j = N / (i + 1); j > 1; j--) {
count += boxes[j * i... | #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
std::vector<int> a(N);
for (int i = 0; i < N; i++) {
std::cin >> a[i];
}
std::vector<int> boxes(N, 0);
int M = 0;
for (int i = N - 1; i >= 0; i--) {
int count = 0;
for (int j = N / (i + 1); j > 1; j--) {
count += boxes[j * (... | [] | 777,431 | 777,432 | u136968995 | cpp |
p02972 | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
... | [
"assignment.change"
] | 777,437 | 777,438 | u616794313 | cpp |
p02972 | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#... | [] | 777,443 | 777,444 | u858929490 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i < N + 1; i++)
cin >> a[i];
vector<int> ko(N + 1, 0);
int cnt = 0;
for (int i = N; i > 0; i--) {
int t = 0;
for (int j = i; j <= N; j += i) {
t += ko[i];
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i < N + 1; i++)
cin >> a[i];
vector<int> ko(N + 1, 0);
int cnt = 0;
for (int i = N; i > 0; i--) {
int t = 0;
for (int j = i; j <= N; j += i) {
t += ko[j];
}
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,450 | 777,451 | u503221936 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
vector<long long> divisor(long long n) { // nの約数列挙
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
int main() {
int... | #include <iostream>
#include <vector>
using namespace std;
vector<long long> divisor(long long n) { // nの約数列挙
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
int main() {
int... | [
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 777,452 | 777,453 | u503221936 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 777,454 | 777,455 | u401139594 | cpp |
p02972 | #include <bits/stdc++.h>
#include <float.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
... | #include <bits/stdc++.h>
#include <float.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
... | [
"assignment.value.change",
"assignment.change"
] | 777,458 | 777,459 | u622045059 | cpp |
p02972 | #include <bits/stdc++.h>
#include <float.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
... | #include <bits/stdc++.h>
#include <float.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"assignment.change"
] | 777,460 | 777,459 | u622045059 | cpp |
p02972 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
re... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
re... | [
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,461 | 777,462 | u622045059 | cpp |
p02972 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
re... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
re... | [
"assignment.value.change",
"identifier.change",
"assignment.change",
"control_flow.branch.if.condition.change"
] | 777,463 | 777,462 | u622045059 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = ... | [
"expression.operation.binary.remove"
] | 777,471 | 777,472 | u740054550 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 777,473 | 777,472 | u740054550 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int a[n], b[200010] = {}, ans = 0;
rep(i, n) cin >> a[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int a[n], b[200010] = {}, ans = 0;
rep(i, n) cin >> a[... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 777,486 | 777,487 | u501163846 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int a[n], b[200010] = {}, ans = 0;
rep(i, n) cin >> a[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int a[n], b[200010] = {}, ans = 0;
rep(i, n) cin >> a[... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 777,488 | 777,487 | u501163846 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto it... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto it... | [
"assignment.value.change",
"identifier.change"
] | 777,491 | 777,492 | u340010271 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto it... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto it... | [
"assignment.value.change",
"identifier.change"
] | 777,493 | 777,492 | u340010271 | cpp |
p02972 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,494 | 777,495 | u415325136 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Khela \
ios_base::sync_with_stdio(false); \
cin.... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Khela \
ios_base::sync_with_stdio(false); \
cin.... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 777,500 | 777,501 | u863370423 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Khela \
ios_base::sync_with_stdio(false); \
cin.... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Khela \
ios_base::sync_with_stdio(false); \
cin.... | [
"control_flow.branch.if.condition.change"
] | 777,502 | 777,501 | u863370423 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | [
"assignment.value.change",
"identifier.change"
] | 777,508 | 777,509 | u371051907 | cpp |
p02972 |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
while (b != 0) {
ll tmp = b;
b = ... |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
while (b != 0) {
ll tmp = b;
b = ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"function.return_value.change"
] | 777,514 | 777,515 | u111653921 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += ans[j];
}
sum... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += ans[j];
}
... | [
"control_flow.loop.for.initializer.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 777,517 | 777,518 | u308012928 | cpp |
p02972 | // https://atcoder.jp/contests/abc134/tasks/abc134_d
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ... | // https://atcoder.jp/contests/abc134/tasks/abc134_d
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ... | [
"io.output.change",
"literal.string.change"
] | 777,519 | 777,520 | u858107870 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 777,524 | 777,525 | u153390822 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin... | [
"expression.operation.binary.remove",
"control_flow.loop.condition.change"
] | 777,526 | 777,525 | u153390822 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin... | [
"expression.operation.binary.remove",
"control_flow.loop.condition.change"
] | 777,527 | 777,525 | u153390822 | cpp |
p02972 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#in... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,528 | 777,529 | u006717664 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.