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 <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
constexpr int kMod = 1000000007;
typedef long long LL;
int main() {
int N;
std::cin >> N;
std::vector<int> a(N + 1), b... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
constexpr int kMod = 1000000007;
typedef long long LL;
int main() {
int N;
std::cin >> N;
std::vector<int> a(N + 1), b... | [
"assignment.change"
] | 777,530 | 777,531 | u116523315 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
vector<int> ball(200005, 0);
void putball(int n) {
for (int i = 1; i < sqrt(n) + 1; i++) {
if (n % i == 0) {
ball.at(i)++;
if (i != n / i)
ball.at(n / ... | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
vector<int> ball(200005, 0);
void putball(int n) {
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
ball.at(i)++;
if (i != n / i)
ball.at(n / i)+... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 777,534 | 777,535 | u748819456 | cpp |
p02972 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> arr(n + 1);
for (ll i = 1; i <= n; i++)
cin >> arr[i];
vector<ll> ans(n + 1);
for (ll i = n; i; i--) {
ll sum = 0;
for (ll j = 2 * i; j <= n... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> arr(n + 1);
for (ll i = 1; i <= n; i++)
cin >> arr[i];
vector<ll> ans(n + 1);
for (ll i = n; i; i--) {
ll sum = 0;
for (ll j = 2 * i; j <= n... | [] | 777,538 | 777,539 | u897552198 | cpp |
p02972 | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
int main() {
int N, i, j;
scanf("%d", &N);
int a[N + 1], ans[N + 1], sum;
for (i = 1; i <= N; i++)
scanf("%d", &a[i]);
for (i = N; i >= 1; i--) {
... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
int main() {
int N, i, j;
scanf("%d", &N);
int a[N + 1], ans[N + 1], sum;
for (i = 1; i <= N; i++)
scanf("%d", &a[i]);
for (i = N; i >= 1; i--) {
... | [
"expression.operator.change"
] | 777,544 | 777,543 | u881116515 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(... | [
"assignment.variable.change",
"identifier.change"
] | 777,545 | 777,546 | u502772848 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int total = 0;
vector<int> ans(n + 1);
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
if (ans[i] == 1)
total++;
}
for (int i = n / 2; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int total = 0;
vector<int> ans(n + 1);
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
if (ans[i] == 1)
total++;
}
for (int i = n / 2; i... | [
"assignment.variable.change",
"identifier.change"
] | 777,549 | 777,550 | u948698924 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int total = 0;
vector<int> ans(n + 1);
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
if (ans[i] == 1)
total++;
}
for (int i = n / 2; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int total = 0;
vector<int> ans(n + 1);
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
if (ans[i] == 1)
total++;
}
for (int i = n / 2; i... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,551 | 777,550 | u948698924 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int total = 0;
vector<int> ans(n + 1);
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
if (ans[i] == 1)
total++;
}
for (int i = n / 2; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int total = 0;
vector<int> ans(n + 1);
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
if (ans[i] == 1)
total++;
}
for (int i = n / 2; i... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,552 | 777,550 | u948698924 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll ch[200010], ans[200010];
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
ll now;
cin >> now;
ch[i] = now;
}
ll ANS = 0;
for (ll i = n; i >= 1; i--) {
ll cnt = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll ch[200010], ans[200010];
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
ll now;
cin >> now;
ch[i] = now;
}
ll ANS = 0;
for (ll i = n; i >= 1; i--) {
ll cnt = 0;
... | [] | 777,557 | 777,558 | u166378830 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll ch[200010], ans[200010];
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
ll now;
cin >> now;
ch[i] = now;
}
ll ANS = 0;
for (ll i = n; i >= 1; i--) {
ll cnt = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll ch[200010], ans[200010];
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
ll now;
cin >> now;
ch[i] = now;
}
ll ANS = 0;
for (ll i = n; i >= 1; i--) {
ll cnt = 0;
... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 777,559 | 777,558 | u166378830 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[200010], b[200010];
int main() {
ll n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = n; i >= 1; i--) {
ll sum = 0;
for (int j = 2; j * i < n; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[200010], b[200010];
int main() {
ll n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = n; i >= 1; i--) {
ll sum = 0;
for (int j = 2; j * i <= n;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,560 | 777,561 | u166378830 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
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.at(i + 1);
vector<int> b(n + 1, 0);
for (int i = n; i >= 1; i--) {
int sum = 0;
for... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
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.at(i + 1);
vector<int> b(n + 1, 0);
for (int i = n; i >= 1; i--) {
int sum = 0;
for... | [
"call.remove",
"call.arguments.change"
] | 777,566 | 777,567 | u011438316 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int NMAX = 2e5 + 5;
int n, a[NMAX], b[NMAX], nr;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
b[n] = a[n] % 2;
nr = b[n];
for (int i = n - 1; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b... | #include <bits/stdc++.h>
using namespace std;
const int NMAX = 2e5 + 5;
int n, a[NMAX], b[NMAX], nr;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
b[n] = a[n] % 2;
nr = b[n];
for (int i = n - 1; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,572 | 777,573 | u644497121 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int n = 0; n < N; ++n) {
cin >> A[n + 1];
}
vector<int> B(N + 1);
for (int n = N; n >= 1; --n) {
int sum = 0;
for (int m = n + n; m <= N; m += n) {
sum += B[n];
}
if (A[n] == s... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int n = 0; n < N; ++n) {
cin >> A[n + 1];
}
vector<int> B(N + 1);
for (int n = N; n >= 1; --n) {
int sum = 0;
for (int m = n + n; m <= N; m += n) {
sum += B[m];
}
if (A[n] == s... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,574 | 777,575 | u835523614 | cpp |
p02972 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int p[1000001];
int mod = 100000007;
int main() {
int n;
cin >> n;
int a[n + 1] = {};
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
int b[n + 1] = {};
int tmp = 0;
int res = 0;
for (int i = n; i > 0; i--) ... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int p[1000001];
int mod = 100000007;
int main() {
int n;
cin >> n;
int a[n + 1] = {};
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
int b[n + 1] = {};
int tmp = 0;
int res = 0;
for (int i = n; i > 0; i--) ... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 777,576 | 777,577 | u891945807 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); (i) < (n); i++)
#define repe(i, f, n) for (ll i = (f); (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 b... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); (i) < (n); i++)
#define repe(i, f, n) for (ll i = (f); (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 b... | [
"assignment.change",
"io.output.change"
] | 777,578 | 777,579 | u873269440 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 100;
int a[N], b[N];
vector<int> ve;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
if ((b[i] & 1) ^ a[i]) {
ve.p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 100;
int a[N], b[N];
vector<int> ve;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
if ((b[i] & 1) ^ a[i]) {
ve.p... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 777,580 | 777,581 | u722928342 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 100;
int a[N], b[N];
vector<int> ve;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
if ((b[i] & 1) ^ a[i]) {
ve.p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 100;
int a[N], b[N];
vector<int> ve;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
if ((b[i] & 1) ^ a[i]) {
ve.p... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"expression.operator.arithmetic.change"
] | 777,582 | 777,581 | u722928342 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define printVec(v) \
printf("{"); \
for (const auto &i : v) { \
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define printVec(v) \
printf("{"); \
for (const auto &i : v) { \
... | [
"control_flow.loop.for.condition.change",
"assignment.change"
] | 777,583 | 777,584 | u945554850 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n, 0);
for (auto i = 0; i < n; i++)
cin >> a[i];
for (auto i = n - 1; i >= n / 2; i--)
if (a[i] == 1)
b[i]++;
for (auto i = n / 2 - 1; i >= 0; i--) {
int cnt = 0, mul = 2;
while (true) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n, 0);
for (auto i = 0; i < n; i++)
cin >> a[i];
for (auto i = n - 1; i >= n / 2; i--)
if (a[i] == 1)
b[i]++;
for (auto i = n / 2 - 1; i >= 0; i--) {
int cnt = 0, mul = 2;
while (true) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"assignment.change"
] | 777,595 | 777,596 | u666049605 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i, idx, cnt;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
for (i = 0; i < n; ++i) {
cin >> a.at(i);
if (i >= n / 2)
ans.at(i) = a.at(i);
}
for (i = n / 2 - 1; i >= 0; --i) {
cnt = 0;
idx = 2 * i + 1;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i, idx, cnt;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
for (i = 0; i < n; ++i) {
cin >> a.at(i);
if (i >= n / 2)
ans.at(i) = a.at(i);
}
for (i = n / 2 - 1; i >= 0; --i) {
cnt = 0;
idx = 2 * i + 1;
... | [
"call.remove",
"io.output.change"
] | 777,606 | 777,607 | u714732628 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;... | [
"identifier.change"
] | 777,608 | 777,609 | u527058497 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
const int mxN = 1e9 + 7;
char s[100005];
long long dp[100005][13];
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
const int mxN = 1e9 + 7;
char s[100005];
long long dp[100005][13];
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 777,611 | 777,612 | u221780420 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).siz... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).siz... | [] | 777,613 | 777,614 | u073139376 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).siz... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).siz... | [] | 777,615 | 777,614 | u073139376 | cpp |
p02972 | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
// c... | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
// c... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,616 | 777,617 | u394961950 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define reps(i, n) for (ll i = 1; i <= (n); ++i)
using ll = long long;
constexpr ll INF = (1LL << 60);
constexpr ll MOD = (1e9 + 7);
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define reps(i, n) for (ll i = 1; i <= (n); ++i)
using ll = long long;
constexpr ll INF = (1LL << 60);
constexpr ll MOD = (1e9 + 7);
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 777,618 | 777,619 | u423624748 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<ll> b(n + 1, 0);
for (ll i = n; i > 0; --i) {
ll t = 0, idx = i;
if (idx + i <= n) {
idx += i;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<ll> b(n + 1, 0);
for (ll i = n; i > 0; --i) {
ll t = 0, idx = i;
while (idx + i <= n) {
idx += i... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 777,620 | 777,621 | u423624748 | cpp |
p02972 | // 解説を見た
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<bool>> vvb;
typedef vector<vector<int>> vvi;
typedef map<int, bool> mib;
typedef long l... | // 解説を見た
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<bool>> vvb;
typedef vector<vector<int>> vvi;
typedef map<int, bool> mib;
typedef long l... | [
"identifier.change"
] | 777,622 | 777,623 | u558528117 | cpp |
p02972 | #include <algorithm>
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD = 1000000007;
int modpow(int a, int x) {
if (a < 0)
a += MOD;
int ans = 1;
while (x > 0) {
if (x & 1)
... | #include <algorithm>
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD = 1000000007;
int modpow(int a, int x) {
if (a < 0)
a += MOD;
int ans = 1;
while (x > 0) {
if (x & 1)
... | [
"assignment.value.change",
"assignment.change"
] | 777,627 | 777,628 | u532514769 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int> A(N), B(N, 0), C(0);
for (int &i : A)
cin >> i;
for (int i = N; i > 0; i--) {
int cnt = 0;
for (int j = 2; i * j <= N; j++)
cnt += A[i * j - 1];
B[i - 1] = (A[i - 1] + cnt) % ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int> A(N), B(N, 0), C(0);
for (int &i : A)
cin >> i;
for (int i = N; i > 0; i--) {
int cnt = 0;
for (int j = 2; i * j <= N; j++)
cnt += B[i * j - 1];
B[i - 1] = (A[i - 1] + cnt) % ... | [
"assignment.value.change",
"identifier.change"
] | 777,633 | 777,634 | u306482197 | cpp |
p02972 | /* Simplicity and Goodness */
#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;
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
void my... | /* Simplicity and Goodness */
#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;
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
void my... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,637 | 777,638 | u777549027 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push... | [] | 777,639 | 777,640 | u722640678 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
vector<ll> v(n);
vector<ll> w(n, 0);
rep(i, n) cin >> v[i];
for (ll i = n - 1; i >= 0; i--) {
ll tmp = 0;
rep(j, 10 / (i + 1)) {
if (j == 0)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
vector<ll> v(n);
vector<ll> w(n, 0);
rep(i, n) cin >> v[i];
for (ll i = n - 1; i >= 0; i--) {
ll tmp = 0;
rep(j, n / (i + 1)) {
if (j == 0)
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 777,643 | 777,644 | u264265458 | 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 all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 0x7ffffff;
const int mod = 1000000... | #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 all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 0x7ffffff;
const int mod = 1000000... | [
"control_flow.loop.for.initializer.change"
] | 777,648 | 777,649 | u274883254 | cpp |
p02972 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | [] | 777,650 | 777,651 | u714724786 | cpp |
p02972 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | [
"identifier.change",
"call.function.change"
] | 777,652 | 777,651 | u714724786 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
int a[n + 1];
rep(i, n) cin >> a[i + 1];
vector<int> ans(n + 1);
int cnt = 0;
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = i * 2; j... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
int a[n + 1];
rep(i, n) cin >> a[i + 1];
vector<int> ans(n + 1);
int cnt = 0;
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = i * 2; j... | [
"call.arguments.change"
] | 777,657 | 777,658 | u075775814 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N, 0);
vector<int> solution(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
int counter = 0;
int j = 0;
for (int i = N - 1; i >= 0; i--) {
counter = 0;
j = 1;
while (j * (i + 1) <= N) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N, 0);
vector<int> solution(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
int counter = 0;
int j = 0;
for (int i = N - 1; i >= 0; i--) {
counter = 0;
j = 2;
while (j * (i + 1) <= N) {
... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 777,663 | 777,664 | u636279017 | cpp |
p02972 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 777,671 | 777,672 | u590825760 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> a;
int main() {
cin >> N;
a.resize(N + 1);
rep(i, N) cin >> a[i + 1];
// 後ろから決めてく
vector<ll> a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> a;
int main() {
cin >> N;
a.resize(N + 1);
rep(i, N) cin >> a[i + 1];
// 後ろから決めてく
vector<ll> a... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,679 | 777,680 | u455366471 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 777,686 | 777,687 | u644224332 | 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 = 1; i <= (int)(n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
type... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i <= (int)(n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
type... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 777,696 | 777,697 | u263000123 | 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 = 1; i <= (int)(n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
type... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i <= (int)(n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
type... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 777,698 | 777,697 | u263000123 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | [
"call.arguments.change"
] | 777,703 | 777,704 | u852449189 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | [
"call.arguments.change"
] | 777,705 | 777,704 | u852449189 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<bool> ball(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int m = 0;
vector<int> b;
for (int i = n; i >= 1; i--) {
int j = 2;
int now = 0;
while (i * j <= n) {
if (ball[i * ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<bool> ball(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int m = 0;
vector<int> b;
for (int i = n; i >= 1; i--) {
int j = 2;
int now = 0;
while (i * j <= n) {
if (ball[i * ... | [
"call.arguments.change",
"call.add"
] | 777,706 | 777,707 | u105533331 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef pair<int, int> P;
typedef long long ll;
ll num[200010] = {0};
int main(void) {
ll ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef pair<int, int> P;
typedef long long ll;
ll num[200010] = {0};
int main(void) {
ll ... | [
"call.arguments.change"
] | 777,719 | 777,720 | u744305661 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#def... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,721 | 777,722 | u318785595 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m = 0;
cin >> n;
vector<ll> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<ll> b(n + 1);
for (int i = n; i >= 1; i--) {
ll count = 0;
for (int j = i; j <= n; j += i) {
count += b[j];
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m = 0;
cin >> n;
vector<ll> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<ll> b(n + 1);
for (int i = n; i >= 1; i--) {
ll count = 0;
for (int j = i; j <= n; j += i) {
count += b[j];
}
... | [
"assignment.value.change",
"identifier.change"
] | 777,725 | 777,726 | u028906014 | cpp |
p02972 | // #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <cstring>
// #include <algorithm>
// #include <string>
// #include <sstream>
// #include <complex>
// #include <vector>
// #include <list>
// #include <queue>
// #include <deque>
// #include <stack>
// #include <map>
// #include <set>
// #inc... | // #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <cstring>
// #include <algorithm>
// #include <string>
// #include <sstream>
// #include <complex>
// #include <vector>
// #include <list>
// #include <queue>
// #include <deque>
// #include <stack>
// #include <map>
// #include <set>
// #inc... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"identifier.change",
"assignment.change"
] | 777,727 | 777,728 | u337845373 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll coun... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll coun... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 777,731 | 777,732 | u196953553 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll coun... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll coun... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change"
] | 777,733 | 777,732 | u196953553 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll coun... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll coun... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 777,734 | 777,732 | u196953553 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll coun... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll coun... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 777,735 | 777,732 | u196953553 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
using ll = long lon... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
using ll = long lon... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,736 | 777,737 | u363936720 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
using ll = long lon... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
using ll = long lon... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 777,738 | 777,737 | u363936720 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
using ll = long lon... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
using ll = long lon... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 777,739 | 777,737 | u363936720 | cpp |
p02972 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
typedef long long ll;
template <typename T> void print(const T &v);
int main() {
int N... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
typedef long long ll;
template <typename T> void print(const T &v);
int main() {
int N... | [
"assignment.variable.change",
"identifier.change"
] | 777,742 | 777,743 | u286623856 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
f... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
f... | [
"assignment.value.change"
] | 777,744 | 777,745 | u517411077 | 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;
typedef pair<int, int> P;
const ll mod = 1000000007; //出力は (ans % mod + mod) % mod (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60; // INF = 1152921504606846976
int main() {
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007; //出力は (ans % mod + mod) % mod (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60; // INF = 1152921504606846976
int main() {
int... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,752 | 777,753 | u883323885 | cpp |
p02972 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int inf = 1 << 20;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef pair<in... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int inf = 1 << 20;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef pair<in... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.add"
] | 777,756 | 777,755 | u883323885 | cpp |
p02972 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9 + 1;
const ll INFll = 2e18 + 1;
ll MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i(1); i <= N; i++)
cin >> A[i];
vector<int> ans(N + 1);
int cnt(0);
for (int i(N); i >= 1; i--) {
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9 + 1;
const ll INFll = 2e18 + 1;
ll MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i(1); i <= N; i++)
cin >> A[i];
vector<int> ans(N + 1);
int cnt(0);
for (int i(N); i >= 1; i--) {
... | [
"assignment.change"
] | 777,757 | 777,758 | u991846372 | cpp |
p02972 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
int main() {
int N;
ll a[200001];
ll b[200001];
int cnt(0);
cin >> N;
for (int i(1); i <= N; i++)
cin >> b[i];
for (int i(N / 2 + 1); i <= N; i++) {
a[i] = b[i];
if (a[i] == 1)
cnt += 1;
}
for (int... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
int main() {
int N;
ll a[300001];
ll b[300001];
int cnt(0);
cin >> N;
for (int i(1); i <= N; i++)
cin >> b[i];
for (int i(N / 2 + 1); i <= N; i++) {
a[i] = b[i];
if (a[i] == 1)
cnt += 1;
}
for (int... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 777,759 | 777,760 | u991846372 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#d... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#d... | [
"expression.operation.binary.add"
] | 777,763 | 777,764 | u950174376 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n - 1); i >= 0; --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n - 1); i >= 0; --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 777,767 | 777,768 | u992875223 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, 1, n + 1) cin >> a[i];
vector<ll> ans(n + 1);
ll m = 0;
for (ll i = n; i > 0; i--) {
ll j = 2 * i;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, 1, n + 1) cin >> a[i];
vector<ll> ans(n + 1);
ll m = 0;
for (ll i = n; i > 0; i--) {
ll j = 2 * i;... | [] | 777,771 | 777,772 | u893584578 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 777,777 | 777,778 | u134678977 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n, 0... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n, 0... | [] | 777,785 | 777,786 | u199184624 | cpp |
p02972 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,789 | 777,790 | u700484101 | cpp |
p02972 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 777,791 | 777,792 | u700484101 | cpp |
p02972 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | [
"identifier.change",
"call.arguments.change",
"io.output.change",
"call.arguments.add"
] | 777,793 | 777,792 | u700484101 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | [
"expression.operation.binary.add"
] | 777,798 | 777,799 | u965730380 | cpp |
p02972 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#de... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#de... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 777,800 | 777,801 | u491256431 | cpp |
p02972 | #include <iomanip>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
repi(i, n, 0) cin >> a[i + 1];
vector<int> b(n + 1);
f... | #include <iomanip>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
repi(i, n, 0) cin >> a[i + 1];
vector<int> b(n + 1);
f... | [
"io.output.change"
] | 777,804 | 777,805 | u187013893 | cpp |
p02972 | #include <algorithm>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#includ... | #include <algorithm>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#includ... | [
"variable_declaration.type.primitive.change",
"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,810 | 777,811 | u000212387 | cpp |
p02972 | /*
Created by vasu090 on 19 Apr, 2020
*/
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a, b) for (auto(i) = a; i < b; i++)
#define list(i, N) for (auto(i) = 0; i < N; i++)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
#defi... | /*
Created by vasu090 on 19 Apr, 2020
*/
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a, b) for (auto(i) = a; i < b; i++)
#define list(i, N) for (auto(i) = 0; i < N; i++)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
#defi... | [
"expression.operation.binary.add"
] | 777,812 | 777,813 | u299043628 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#de... | [
"io.output.change"
] | 777,820 | 777,821 | u613960672 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> box(n), seq(n);
int cnt;
int zerone;
int m = 0;
vector<int> ans;
for (int i = 0; i < n; ++i)
cin >> box[i];
for (int i = n - 1; i >= 0; --i) {
cnt = 0;
for (int j = 1; j * (i + 1) <= n; ++j) {
cnt... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> box(n), seq(n);
int cnt;
int zerone;
int m = 0;
vector<int> ans;
for (int i = 0; i < n; ++i)
cin >> box[i];
for (int i = n - 1; i >= 0; --i) {
cnt = 0;
for (int j = 1; j * (i + 1) <= n; ++j) {
cnt... | [
"assignment.change"
] | 777,822 | 777,823 | u706341784 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long longをllだけにした
using vll = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long longをllだけにした
using vll = ve... | [
"expression.operation.binary.add"
] | 777,824 | 777,825 | u513211419 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, n, a) for (int i = n; i >= a; i--)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define all(s) s.begin(), s.end()
#define lla(s) s.rbegin(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, n, a) for (int i = n; i >= a; i--)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define all(s) s.begin(), s.end()
#define lla(s) s.rbegin(... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,826 | 777,827 | u885523920 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tupl... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tupl... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,832 | 777,833 | u577774192 | cpp |
p02972 | //{{{
#include <bits/stdc++.h>
using namespace std;
const string truename = "Yes";
const string falsename = "No";
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecision(12);
};
} ioSetup;
//{{{ rep rrep loop
... | //{{{
#include <bits/stdc++.h>
using namespace std;
const string truename = "Yes";
const string falsename = "No";
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecision(12);
};
} ioSetup;
//{{{ rep rrep loop
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,842 | 777,843 | u899220667 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) >= (ll)(m); (i)--)
#define ALL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) >= (ll)(m); (i)--)
#define ALL... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 777,846 | 777,847 | u014442925 | 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;
int a[n + 5];
int b[n + 5];
int check = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i > n / 2; i--) {
if (a[i] == 1) {
b[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;
int a[n + 5];
int b[n + 5];
int check = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i > (n / 2); i--) {
if (a[i] == 1) {
b[... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,848 | 777,849 | u861722435 | cpp |
p02972 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N], i;
for (i = 0; i < N; i++) {
cin >> a[i];
}
int b[N], c, s, sum = 0;
for (i = N - 1; i > -1; i--) {
if ((i + 1) > (N / 2)) {
b[i] = a[i];
if (b[i] == 1)
sum += 1;
} else {
c = 2;
... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N], i;
for (i = 0; i < N; i++) {
cin >> a[i];
}
int b[N], c, s, sum = 0;
for (i = N - 1; i > -1; i--) {
if ((i + 1) > (N / 2)) {
b[i] = a[i];
if (b[i] == 1)
sum += 1;
} else {
c = 2;
... | [
"assignment.value.change",
"identifier.change"
] | 777,850 | 777,851 | u806657856 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), ball(n);
rep(i, n) cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
ll sum = 0;
for (int j = 1; (i + 1) * j <= n... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), ball(n);
rep(i, n) cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
ll sum = 0;
for (int j = 1; (i + 1) * j - 1 ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 777,853 | 777,854 | u915689660 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <vector>
using namespace std;
using ll = long long int;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
const int MOD = 1000000007;
// const int MOD=... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <vector>
using namespace std;
using ll = long long int;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
const int MOD = 1000000007;
// const int MOD=... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,855 | 777,856 | u376578635 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 777,857 | 777,858 | u247679666 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"variable_declaration.type.change"
] | 777,859 | 777,858 | u247679666 | cpp |
p02972 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll gcd(ll a... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll gcd(ll a... | [
"control_flow.loop.for.initializer.change"
] | 777,863 | 777,864 | u822169805 | cpp |
p02972 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll gcd(ll a... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll gcd(ll a... | [
"assignment.change"
] | 777,865 | 777,864 | u822169805 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e+9;
typedef pair<ll, ll> P;
#define fi first
#define se second
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), balls(n + 1, 0), ans;
for (int i = 1; i < n + 1; i++)
cin >> a.... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e+9;
typedef pair<ll, ll> P;
#define fi first
#define se second
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), balls(n + 1, 0), ans;
for (int i = 1; i < n + 1; i++)
cin >> a.... | [
"assignment.change"
] | 777,866 | 777,867 | u822169805 | cpp |
p02972 | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using... | [
"call.arguments.change"
] | 777,868 | 777,869 | u955627293 | cpp |
p02972 | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using... | [
"call.arguments.change"
] | 777,870 | 777,869 | u955627293 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
int m = 0;
for (int i = n - 1; i >= 0; i--) {
... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.value.change",
"io.output.change"
] | 777,871 | 777,872 | u346629192 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
int m = 0;
for (int i = n - 1; i >= 0; i--) {
... | [
"variable_declaration.name.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"io.output.change"
] | 777,873 | 777,872 | u346629192 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll i, j, k;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n, 0);
int num = n;
int flag;
while (num > 0) {
flag = 0;
for (i = num; i <= n; i += num) {
if (b[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll i, j, k;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n, 0);
int num = n;
int flag;
while (num > 0) {
flag = 0;
for (i = num; i <= n; i += num) {
if (b[i... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 777,880 | 777,881 | u582588783 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define repf(i, ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define repf(i, ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,882 | 777,883 | u374929478 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> a(n + 10, 0);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> b(n + 10, 0);
for (int i... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> a(n + 10, 0);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> b(n + 10, 0);
for (int i... | [
"assignment.value.change",
"identifier.change"
] | 777,884 | 777,885 | u374929478 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.