problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02972 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#... | [
"io.output.change"
] | 776,816 | 776,817 | u385244248 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[200005];
int b[200005];
int main() {
int n;
cin >> n;
int tmp;
int ans;
int count = 0;
for (int i = 1; i < n + 1; i++)
cin >> a[i];
for (int i = n; i >= 0; i++) {
tmp = i;
ans = 0;
while (tmp <= n) {
ans += b[tmp];
tmp += i;
... | #include <bits/stdc++.h>
using namespace std;
int a[200005];
int b[200005];
int main() {
int n;
cin >> n;
int tmp;
int ans;
int count = 0;
for (int i = 1; i < n + 1; i++)
cin >> a[i];
for (int i = n; i > 0; i--) {
tmp = i;
ans = 0;
while (tmp <= n) {
ans += b[tmp];
tmp += i;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,822 | 776,821 | u983681697 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N... | [
"expression.operator.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 776,823 | 776,824 | u557207741 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N... | [
"expression.operator.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 776,825 | 776,824 | u557207741 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 776,823 | 776,826 | u557207741 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 776,825 | 776,826 | u557207741 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#d... | [
"control_flow.loop.for.initializer.change"
] | 776,827 | 776,828 | u225581241 | cpp |
p02972 | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
int N;
int A[SIZE];
int table[SIZE];
int main() {
scanf("%d", &N);
for (i... | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
int N;
int A[SIZE];
int table[SIZE];
int main() {
scanf("%d", &N);
for (i... | [
"assignment.variable.change",
"identifier.change"
] | 776,829 | 776,830 | u000022466 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, len = 0;
int a[200005], b[200005], ans[200005];
signed main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sumv = 0;
for (int j = 2 * i; j <= n; j++)
sumv = (sumv + b[j]) % 2;... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, len = 0;
int a[200005], b[200005], ans[200005];
signed main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sumv = 0;
for (int j = 2 * i; j <= n; j += i)
sumv = (sumv + b[j]) %... | [] | 776,831 | 776,832 | u952557476 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define repr(i, N) for (ll i = N - 1; i >= 0; i--)
using ll = long long;
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;
int main() {
int N, M = 0;
cin >> N;
vi a(N), b(N... | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define repr(i, N) for (ll i = N - 1; i >= 0; i--)
using ll = long long;
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;
int main() {
int N, M = 0;
cin >> N;
vi a(N), b(N... | [
"expression.operation.binary.remove"
] | 776,833 | 776,834 | u099619676 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), x(n + 1, 0), ans(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a.at(i);
for (int i = n; i >= 1; i--) {
ans.at(i) = x.at(i) ^ a.at(i);
for (int j = 1; j * j <= i; j++) {
if (!(i % j)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), x(n + 1, 0), ans(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a.at(i);
for (int i = n; i >= 1; i--) {
ans.at(i) = x.at(i) ^ a.at(i);
for (int j = 1; j * j <= i; j++) {
if (!(i % j)) {
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.remove"
] | 776,837 | 776,838 | u082801599 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using name... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using name... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 776,846 | 776,847 | u758223800 | cpp |
p02972 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const long long INF = 1LL << 61;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<int> box(N, 0);
rep(i, N) {
int... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const long long INF = 1LL << 61;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<int> box(N, 0);
rep(i, N) {
int... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,848 | 776,849 | u289578952 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int a[200006];
int sum[200006];
int b[200006];
int main() {
int n;
int i, j;
int m = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum[i] = b[i] = 0;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int a[200006];
int sum[200006];
int b[200006];
int main() {
int n;
int i, j;
int m = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum[i] = b[i] = 0;
}
... | [
"assignment.value.change",
"identifier.change"
] | 776,853 | 776,854 | u253584031 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(... | [
"assignment.value.change",
"assignment.change"
] | 776,855 | 776,856 | u237054088 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> res(n + 1), a(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i >= n / 2) {
res.at(i + 1) = a.at(i);
if (res.at(i + 1) == 1)
cnt++;
}
}
for (int i = n / 2; i > 0; i--... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> res(n + 1), a(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i >= n / 2) {
res.at(i + 1) = a.at(i);
if (res.at(i + 1) == 1)
cnt++;
}
}
for (int i = n / 2; i > 0; i--... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,857 | 776,858 | u515131769 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> res(n + 1), a(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i >= n / 2) {
res.at(i + 1) = a.at(i);
if (res.at(i + 1) == 1)
cnt++;
}
}
for (int i = n / 2; i > 0; i--... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> res(n + 1), a(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i >= n / 2) {
res.at(i + 1) = a.at(i);
if (res.at(i + 1) == 1)
cnt++;
}
}
for (int i = n / 2; i > 0; i--... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.remove"
] | 776,859 | 776,858 | u515131769 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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,... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add"
] | 776,862 | 776,861 | u785492958 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 10000000000000
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define repN_1(i, n) for (ll i = 0; i < (ll)(n - 1); i++)
#define ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 10000000000000
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define repN_1(i, n) for (ll i = 0; i < (ll)(n - 1); i++)
#define ... | [
"assignment.value.change",
"identifier.change"
] | 776,867 | 776,868 | u466275789 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
using P = pair<int, int>;
#define MOD 1000000007
#define INF 1000000
/*
N=2*10^5
N個の箱に番号1-Nが書いてある
任意の整数i(1<=i<=N)に対して
iの倍数の番号の箱のボールの総和 %2 ==ai
*/
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
using P = pair<int, int>;
#define MOD 1000000007
#define INF 1000000
/*
N=2*10^5
N個の箱に番号1-Nが書いてある
任意の整数i(1<=i<=N)に対して
iの倍数の番号の箱のボールの総和 %2 ==ai
*/
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i... | [
"assignment.change"
] | 776,869 | 776,870 | u711676593 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#defi... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,875 | 776,876 | u053035261 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) \
fo... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) \
fo... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.loop.for.update.change"
] | 776,879 | 776,880 | u071036035 | cpp |
p02972 | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
long long N;
cin >> N;
long long a[N];
for (long long i = 0; i < N; ++i)
cin >> a[i];
long long rets[N];
long long c = 0;
for (int i = N; i > 0; --i) {
long long x = 0;
for (long long j = 2; j <= N / i; ++j) {
... | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
long long N;
cin >> N;
long long a[N];
for (long long i = 0; i < N; ++i)
cin >> a[i];
long long rets[N];
long long c = 0;
for (int i = N; i > 0; --i) {
long long x = 0;
for (long long j = 2; j <= N / i; ++j) {
... | [
"assignment.value.change",
"identifier.change"
] | 776,881 | 776,882 | u894471318 | cpp |
p02972 | #include <bits/stdc++.h>
//#define <- プログラムの文字列を置換する
// typedef <- 新しい型に名前を付けるためのキーワード
using namespace std;
#define MAX_N 1
typedef long long ll;
const double PI = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
int main() {
int N;
cin >> N;
vector<int> ... | #include <bits/stdc++.h>
//#define <- プログラムの文字列を置換する
// typedef <- 新しい型に名前を付けるためのキーワード
using namespace std;
#define MAX_N 1
typedef long long ll;
const double PI = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
int main() {
int N;
cin >> N;
vector<int> ... | [
"assignment.change"
] | 776,883 | 776,884 | u705561278 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define owo \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define mod (ll)(1e9 ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define owo \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define mod (ll)(1e9 ... | [
"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"
] | 776,887 | 776,888 | u300665398 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, box = 0, zero = 0;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
zero++;
}
vector<int> c;
for (int i = n - 1; i > n / 2 - 1; i--) {
if (a[i] == 1) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, box = 0, zero = 0;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
zero++;
}
vector<int> c;
for (int i = n - 1; i > n / 2 - 1; i--) {
if (a[i] == 1) {
... | [
"assignment.change"
] | 776,893 | 776,894 | u613326499 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, box = 0, zero = 0;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
zero++;
}
vector<int> c;
for (int i = n - 1; i > n / 2 + 1; i--) {
if (a[i] == 1) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, box = 0, zero = 0;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
zero++;
}
vector<int> c;
for (int i = n - 1; i > n / 2 - 1; i--) {
if (a[i] == 1) {
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 776,895 | 776,894 | u613326499 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), cur(n + 1), ans;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int have = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), cur(n + 1), ans;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int have = 0;
for (... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 776,896 | 776,897 | u627941097 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return tr... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return tr... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 776,898 | 776,899 | u178814165 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main() {
ll n;
cin >> n;
vll a(n + 1);
fo... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main() {
ll n;
cin >> n;
vll a(n + 1);
fo... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 776,903 | 776,904 | u552122040 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | [
"assignment.change"
] | 776,905 | 776,906 | u552122040 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 776,907 | 776,906 | u552122040 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 776,911 | 776,912 | u586598623 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 776,913 | 776,912 | u586598623 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | [
"assignment.change"
] | 776,923 | 776,924 | u378702452 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++)
cin >> A.at(i);
vector<int> B(N + 1);
for (int i = N; 0 < i; i--) {
int ans = 0;
for (int j = 2; j * i <= N; j++)
B.at(i * j);
int b = (ans + A.at(i)) % 2;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++)
cin >> A.at(i);
vector<int> B(N + 1);
for (int i = N; 0 < i; i--) {
int ans = 0;
for (int j = 2; j * i <= N; j++)
ans += B.at(i * j);
int b = (ans + A.at(i)... | [
"assignment.change"
] | 776,928 | 776,929 | u101018317 | cpp |
p02972 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const int INF = +100100100;
// typedef pair<int,int> P;
const int MAX = 1000000;
int n;
vector<int> a(MAX);
int main() {
int ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const int INF = +100100100;
// typedef pair<int,int> P;
const int MAX = 1000000;
int n;
vector<int> a(MAX);
int main() {
int ... | [
"variable_declaration.value.change"
] | 776,933 | 776,934 | u412659798 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 776,935 | 776,936 | u131946248 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
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);
int cnt = 0;
for (int i = N; i > 0; i--) {
for (int j = i + i; j < N; j += i)
A.at(i) ^= A.at(j);
if (A.at(i))
... | #include <bits/stdc++.h>
using namespace std;
int main() {
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);
int cnt = 0;
for (int i = N; i > 0; i--) {
for (int j = i + i; j <= N; j += i)
A.at(i) ^= A.at(j);
if (A.at(i))
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,941 | 776,942 | u045289115 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
vector<int> A(N, 0);
// reverse(a.begin(),a.end());
int tmp = 0;
for (int i = 0; i < N; i++) {
int j = N - i - 1;
tmp = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
vector<int> A(N, 0);
// reverse(a.begin(),a.end());
int tmp = 0;
for (int i = 0; i < N; i++) {
int j = N - i - 1;
tmp = 0;
... | [
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,943 | 776,944 | u508077444 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<set<ll>>;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
rep1(i, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<set<ll>>;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
rep1(i, ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"assignment.change"
] | 776,945 | 776,946 | u779216084 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<set<ll>>;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
rep1(i, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<set<ll>>;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
rep1(i, ... | [
"assignment.change"
] | 776,947 | 776,946 | u779216084 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | [
"assignment.value.change",
"assignment.change"
] | 776,950 | 776,951 | u427344224 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
... | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,956 | 776,957 | u787139585 | cpp |
p02972 | /*dismint|jjc*/
#include <bits/stdc++.h>
using namespace std;
#define forl(V, S, E) for (int V = S; V < E; V++)
#define ford(V, S, E) for (int V = S; V >= E; V--)
#define fore(E, X) for (auto &E : X)
#define println(X) cout << X << endl
#define printe(X) \
... | /*dismint|jjc*/
#include <bits/stdc++.h>
using namespace std;
#define forl(V, S, E) for (int V = S; V < E; V++)
#define ford(V, S, E) for (int V = S; V >= E; V--)
#define fore(E, X) for (auto &E : X)
#define println(X) cout << X << endl
#define printe(X) \
... | [
"assignment.value.change",
"identifier.change"
] | 776,960 | 776,961 | u602301110 | cpp |
p02972 | //#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/rope>
#define pb push_back
#define F first
#define S second
#define ins insert
#define... | //#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/rope>
#define pb push_back
#define F first
#define S second
#define ins insert
#define... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 776,964 | 776,965 | u202065611 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> b(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> a.at(i);
}
for (int i = N; i > 0; i--) {
int n = i;
int count = 0;
while (n < N) {
count += b.at(n);
n += i;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> b(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> a.at(i);
}
for (int i = N; i > 0; i--) {
int n = i;
int count = 0;
while (n <= N) {
count += b.at(n);
n += i;
}... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 776,966 | 776,967 | u422692699 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1 << (n))
using namespace std;
typedef long long ll;
typede... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1 << (n))
using namespace std;
typedef long long ll;
typede... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 776,968 | 776,969 | u115838990 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair... | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 776,970 | 776,971 | u395287054 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x <<... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x <<... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 776,978 | 776,979 | u929582923 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | [
"expression.operation.binary.add"
] | 776,980 | 776,981 | u530107518 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | [
"call.arguments.change"
] | 776,982 | 776,983 | u530107518 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
con... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
con... | [
"assignment.value.change",
"identifier.change"
] | 776,992 | 776,993 | u756784272 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inv(n, a) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LIN... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inv(n, a) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LIN... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 776,994 | 776,995 | u532086793 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main()... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main()... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,996 | 776,997 | u488493347 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main()... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main()... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 776,998 | 776,997 | u488493347 | cpp |
p02972 | #include <bits/stdc++.h>
#define ff first
#define ss second
#define len(x) (int)(x.size())
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#define MAXN 200010
int vs[MAXN];
int balls[MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define len(x) (int)(x.size())
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#define MAXN 200010
int vs[MAXN];
int balls[MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,999 | 777,000 | u808092084 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int... | [
"control_flow.loop.for.initializer.change"
] | 777,003 | 777,004 | u070779615 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<bool> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int... | [
"variable_declaration.type.primitive.change"
] | 777,005 | 777,004 | u070779615 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<bool> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,006 | 777,004 | u070779615 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<bool> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int... | [
"variable_declaration.type.primitive.change"
] | 777,007 | 777,008 | u070779615 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<bool> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int... | [
"variable_declaration.type.primitive.change"
] | 777,009 | 777,008 | u070779615 | cpp |
p02972 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i =... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i =... | [] | 777,021 | 777,022 | u075296067 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0), ans;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i >= 1; i--) {
int sum = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0), ans;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i >= 1; i--) {
int sum = 0;
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 777,025 | 777,026 | u831873811 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0), ans;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i >= 1; i--) {
int sum = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0), ans;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i >= 1; i--) {
int sum = 0;
... | [
"control_flow.loop.for.initializer.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 777,027 | 777,026 | u831873811 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i > 0; i--) {
int t = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i > 0; i--) {
int t = 0;
for (... | [
"expression.operation.binary.remove"
] | 777,028 | 777,029 | u831873811 | cpp |
p02972 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | [
"expression.operation.binary.add"
] | 777,039 | 777,040 | u516525290 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define MMOD(i) ((i % MOD) + MOD) % MOD;
#define all(v) v.begin(), v.end()
#define vec(i, j) vector<vector<ll>>(i, vector<ll>(j, 0))
#define in... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define MMOD(i) ((i % MOD) + MOD) % MOD;
#define all(v) v.begin(), v.end()
#define vec(i, j) vector<vector<ll>>(i, vector<ll>(j, 0))
#define in... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,041 | 777,042 | u268571052 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
templat... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
templat... | [
"assignment.change"
] | 777,045 | 777,046 | u414947284 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rrep(i, a, b) for (int i = int(a); i > int(b); --i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rb... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rrep(i, a, b) for (int i = int(a); i > int(b); --i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rb... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 777,047 | 777,048 | u203033720 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int n, a[202020], balls[202020];
int main() {
cin >> n;
rep(i, n) cin >> a[i + 1];
vector<int> res(0);
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i; j <= n; j += ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int n, a[202020], balls[202020];
int main() {
cin >> n;
rep(i, n) cin >> a[i + 1];
vector<int> res(0);
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i; j <= n; j += ... | [
"assignment.value.change",
"identifier.change"
] | 777,049 | 777,050 | u389007679 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j... | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,051 | 777,052 | u385617244 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j... | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,053 | 777,052 | u385617244 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j... | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,054 | 777,052 | u385617244 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j... | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 777,055 | 777,052 | u385617244 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j... | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,056 | 777,057 | u521652313 | cpp |
p02972 | #include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
std::vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
std::vector<int> ans(n + 1, 0);
for (int i = n; i > 0; i--) {
int cnt = 0, j = i + i;
while (j <= n) {
cnt += a[j];
j += i;
}
if (cnt % ... | #include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
std::vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
std::vector<int> ans(n + 1, 0);
for (int i = n; i > 0; i--) {
int cnt = 0, j = i + i;
while (j <= n) {
cnt += ans[j];
j += i;
}
if (cnt ... | [
"assignment.value.change",
"identifier.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 777,062 | 777,063 | u242031676 | cpp |
p02972 | #include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
std::vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
std::vector<int> ans(n + 1, 0);
for (int i = n; i > 0; i--) {
int cnt = 0, j = i + i;
while (j <= n) {
cnt += a[j];
j += i;
}
if (cnt % ... | #include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
std::vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
std::vector<int> ans(n + 1, 0);
for (int i = n; i > 0; i--) {
int cnt = 0, j = i + i;
while (j <= n) {
cnt += ans[j];
j += i;
}
if (cnt ... | [
"assignment.value.change",
"identifier.change"
] | 777,064 | 777,063 | u242031676 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, last, sum;
bool a[200001], b[200001] = {0};
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = N; i >= 1; i--) {
last = N / i;
sum = 0;
for (int j = last; j >= 2; j--)
sum +=... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, last, sum;
bool a[200001], b[200001] = {0};
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = N; i >= 1; i--) {
last = N / i;
sum = 0;
for (int j = last; j >= 2; j--)
sum +=... | [
"assignment.value.change",
"identifier.change"
] | 777,065 | 777,066 | u168293447 | cpp |
p02972 | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1e9 + 7;
int main(void) {
int N;
cin >> N;
vector<int> a(N + 1, 0);
for (int i = 1; i <= N; ++i) {
cin >> a[i];
}
vector<int> ans(N + 1, 0);
for (int i = N; i >= 1; --i) {
int cnt = 0;
... | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1e9 + 7;
int main(void) {
int N;
cin >> N;
vector<int> a(N + 1, 0);
for (int i = 1; i <= N; ++i) {
cin >> a[i];
}
vector<int> ans(N + 1, 0);
for (int i = N; i >= 1; --i) {
int cnt = 0;
... | [] | 777,067 | 777,068 | u635358463 | cpp |
p02972 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const long long LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int mod = 1000000007;
int main() {
cin.tie(0);
ios::syn... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const long long LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int mod = 1000000007;
int main() {
cin.tie(0);
ios::syn... | [
"io.output.change"
] | 777,075 | 777,076 | u813098295 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
int main() {
ll n;
cin >> n;
vector<int> a(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
for (ll i = n; i >= 1; i--) {
ll tmp = i;
int sum = 0;
while (tmp <= n) {
tmp += i;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
int main() {
ll n;
cin >> n;
vector<int> a(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
for (ll i = n; i >= 1; i--) {
ll tmp = i;
int sum = 0;
while (tmp + i <= n) {
tmp += ... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 777,077 | 777,078 | u770009793 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
int main() {
ll n;
cin >> n;
vector<int> a(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
// (n+0.5)/2 ~ n まで
// for(ll i=n; i>n/2; i--){
// if(a[i]){
// ans[i]=1;
// }
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
int main() {
ll n;
cin >> n;
vector<int> a(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
for (ll i = n; i >= 1; i--) {
ll tmp = i;
int sum = 0;
while (tmp + i <= n) {
tmp += ... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 777,079 | 777,078 | u770009793 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | [
"assignment.change"
] | 777,094 | 777,095 | u978109511 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, 0, N) cin >> A[i];
vector<int> B;
int multiples[N + 1] = {};
for (int i = N... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, 0, N) cin >> A[i];
vector<int> B;
int multiples[N + 1] = {};
for (int i = N... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 777,099 | 777,100 | u483992368 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;... | [
"variable_declaration.type.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 777,103 | 777,104 | u005906204 | cpp |
p02972 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 777,107 | 777,106 | u424602097 | cpp |
p02972 | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b, c) for (int i = (a); (i) <= (b); (i) += (c))
#define ll long long
#define mp map<int, int>
using namespace std;
int a[200005];
ll ans = 0;
bool pd[200005];
int main() {
int n;
cin >> n;
rep(i, 1, n, 1) cin >> a[i];
... | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b, c) for (int i = (a); (i) <= (b); (i) += (c))
#define ll long long
#define mp map<int, int>
using namespace std;
int a[200005];
ll ans = 0;
bool pd[200005];
int main() {
int n;
cin >> n;
rep(i, 1, n, 1) cin >> a[i];
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 777,110 | 777,111 | u796123030 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vec... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vec... | [
"expression.operation.binary.remove"
] | 777,112 | 777,113 | u561143568 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vec... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vec... | [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 777,114 | 777,113 | u561143568 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long l... | [] | 777,119 | 777,120 | u324825702 | cpp |
p02972 | //#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 100;
int n, m, tot;
int a[N], b[N];
int ans[N];
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; +... | //#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 100;
int n, m, tot;
int a[N], b[N];
int ans[N];
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; +... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,123 | 777,124 | u186902062 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans;
for (int i = n; i > 0; i--) {
int t = a[i];
for (int j = i; j < n; j += i) {
t ^= b[j];
}
b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans;
for (int i = n; i > 0; i--) {
int t = a[i];
for (int j = i; j <= n; j += i) {
t ^= b[j];
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,125 | 777,126 | u607728868 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
conste... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
conste... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 777,127 | 777,128 | u751537640 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define P pair<ll, ll>
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, pos, p, sum;
cin >> n;
lvector A(n, 0), B(n... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define P pair<ll, ll>
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, pos, p, sum;
cin >> n;
lvector A(n, 0), B(n... | [
"expression.operation.binary.remove"
] | 777,129 | 777,130 | u894339989 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<unsigned int> a(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
vector<unsigned int> b(n + 1);
for (int i = n; i >= 1; --i) {
unsigned int t = 0; // b[2i],b[3i],...に合計何個入れるか
for (int j = 2; i * j <= n; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<unsigned int> a(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
vector<unsigned int> b(n + 1);
for (int i = n; i >= 1; --i) {
unsigned int t = 0; // b[2i],b[3i],...に合計何個入れるか
for (int j = 2; i * j <= n; ... | [
"assignment.change"
] | 777,131 | 777,132 | u519194615 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
vector<int> ans;
const int N = 2e5;
int arr1[N + 100], arr2[N + 100];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &arr1[i]);
for (int i = n; i >= 1; i--) {... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
vector<int> ans;
const int N = 2e5;
int arr1[N + 100], arr2[N + 100];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &arr1[i]);
for (int i = n; i >= 1; i--) {... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 777,133 | 777,134 | u116018262 | cpp |
p02972 | #include <bits/stdc++.h>
int main() {
using namespace std;
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> m(N + 1, 0);
vector<int> ans;
for (int i = 1; i < N + 1; i++)
cin >> A[i];
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = i; j <= N; j += i) {
if (i % j == 0 && m[j... | #include <bits/stdc++.h>
int main() {
using namespace std;
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> m(N + 1, 0);
vector<int> ans;
for (int i = 1; i < N + 1; i++)
cin >> A[i];
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = i; j <= N; j += i) {
if (j % i == 0 && m[j... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 777,138 | 777,139 | u777258731 | cpp |
p02972 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 777,140 | 777,141 | u136342563 | cpp |
p02972 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"assignment.value.change",
"identifier.change"
] | 777,142 | 777,141 | u136342563 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.