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 |
|---|---|---|---|---|---|---|---|
p02971 | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> data(n, 0);
for (int i = 0; i < n; ++i) {
cin >> data[i];
}
vector<int> lmax(n, 0);
vector<int> rmax(n, 0);
for (int i = 1; i < n; ++i) {
lmax[i] = max(lmax[i - 1], data[i]);
}
for (int i = n - 2; i >= 0; --i) {
rmax[i] = max(rmax[i + 1], data[i]);
}
for (int i = 0; i < n; ++i) {
cout << max(lmax[i], rmax[i]) << endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> data(n, 0);
for (int i = 0; i < n; ++i) {
cin >> data[i];
}
vector<int> lmax(n, 0);
vector<int> rmax(n, 0);
for (int i = 1; i < n; ++i) {
lmax[i] = max(lmax[i - 1], data[i - 1]);
}
for (int i = n - 2; i >= 0; --i) {
rmax[i] = max(rmax[i + 1], data[i + 1]);
}
for (int i = 0; i < n; ++i) {
cout << max(lmax[i], rmax[i]) << endl;
}
return 0;
}
| [
"assignment.change"
] | 776,328 | 776,329 | u725232444 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vi a(n);
for (auto &x : a) {
cin >> x;
}
vi p(n), s(n);
p[0] = a[0];
s[n - 1] = a[n - 1];
for (int i = 1; i < n; ++i) {
p[i] = max(a[i], p[i - 1]);
}
for (int i = n - 2; i >= 0; --i) {
s[i] = max(a[i], s[i + 1]);
}
vi ans(n);
ans[0] = p[1];
ans[n - 1] = s[n - 2];
for (int i = 1; i + 1 < n; ++i) {
ans[i] = max(p[i - 1], s[i + 1]);
}
for (auto &x : ans) {
cout << x << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vi a(n);
for (auto &x : a) {
cin >> x;
}
vi p(n), s(n);
p[0] = a[0];
s[n - 1] = a[n - 1];
for (int i = 1; i < n; ++i) {
p[i] = max(a[i], p[i - 1]);
}
for (int i = n - 2; i >= 0; --i) {
s[i] = max(a[i], s[i + 1]);
}
vi ans(n);
ans[0] = s[1];
ans[n - 1] = p[n - 2];
for (int i = 1; i + 1 < n; ++i) {
ans[i] = max(p[i - 1], s[i + 1]);
}
for (auto &x : ans) {
cout << x << '\n';
}
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 776,339 | 776,340 | u906129425 | cpp |
p02971 |
/*Hey, What's up?*/
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
vector<long long> v, vc;
int main() {
fastio;
long long a = 0, b = 0, c, d, e, f = 0, l, g, m, n, k, i, j, t, p, q;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
vc.push_back(a);
}
sort(v.begin(), v.end());
for (i = 0; i < n - 1; i++) {
if (vc[i] < v[n - 1])
cout << v[n - 1] << '\n';
else
cout << v[n - 2] << '\n';
}
return 0;
}
|
/*Hey, What's up?*/
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
vector<long long> v, vc;
int main() {
fastio;
long long a = 0, b = 0, c, d, e, f = 0, l, g, m, n, k, i, j, t, p, q;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
vc.push_back(a);
}
sort(v.begin(), v.end());
for (i = 0; i < n; i++) {
if (vc[i] < v[n - 1])
cout << v[n - 1] << '\n';
else
cout << v[n - 2] << '\n';
}
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 776,351 | 776,352 | u959479368 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); i++)
#define FORR(i, m, n) for (int(i) = (n)-1; (i) >= (m); i--)
#define debug(x) cerr << #x << " = " << x << endl
//#define int long long
typedef long long ll;
// ll const MOD = 998244353;
ll const MOD = 1e9 + 7;
int const inf = 1e9;
ll const INF = 1e18;
inline void ios_() {
cin.tie(0);
ios::sync_with_stdio(false);
}
template <typename T> int size(const T &a) { return (int)a.size(); }
template <typename T> T Div(T a, T b) { return (a + b - 1) / b; }
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
signed main() {
int n;
cin >> n;
vector<int> v(n);
int ma = -inf, p = -1;
REP(i, n) {
cin >> v[i];
if (chmax(ma, v[i]))
p = i;
}
vector<int> u(v);
sort(all(u));
REP(i, n) { cout << (i == p ? u[1] : ma) << endl; }
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); i++)
#define FORR(i, m, n) for (int(i) = (n)-1; (i) >= (m); i--)
#define debug(x) cerr << #x << " = " << x << endl
//#define int long long
typedef long long ll;
// ll const MOD = 998244353;
ll const MOD = 1e9 + 7;
int const inf = 1e9;
ll const INF = 1e18;
inline void ios_() {
cin.tie(0);
ios::sync_with_stdio(false);
}
template <typename T> int size(const T &a) { return (int)a.size(); }
template <typename T> T Div(T a, T b) { return (a + b - 1) / b; }
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
signed main() {
int n;
cin >> n;
vector<int> v(n);
int ma = -inf, p = -1;
REP(i, n) {
cin >> v[i];
if (chmax(ma, v[i]))
p = i;
}
vector<int> u(v);
sort(rall(u));
REP(i, n) { cout << (i == p ? u[1] : ma) << endl; }
return 0;
}
| [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 776,355 | 776,356 | u994831328 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define MP make_pair
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define PLI pair<ll, int>
#define PIL pair<int, ll>
#define F first
#define S second
#define SHN 1e9
#define LSHN 1e18
using namespace std;
int n;
int a[200010];
int b[200010], c[200010];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
b[0] = a[0];
for (int i = 1; i < n; i++)
b[i] = max(b[i - 1], a[i]);
c[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--)
c[i] = max(c[i + 1], a[i]);
for (int i = 0; i < n; i++) {
int t = -1e9;
if (i)
t = max(t, a[i - 1]);
if (i != n - 1)
t = max(t, a[i + 1]);
cout << t << "\n";
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define MP make_pair
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define PLI pair<ll, int>
#define PIL pair<int, ll>
#define F first
#define S second
#define SHN 1e9
#define LSHN 1e18
using namespace std;
int n;
int a[200010];
int b[200010], c[200010];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
b[0] = a[0];
for (int i = 1; i < n; i++)
b[i] = max(b[i - 1], a[i]);
c[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--)
c[i] = max(c[i + 1], a[i]);
for (int i = 0; i < n; i++) {
int t = -1e9;
if (i)
t = max(t, b[i - 1]);
if (i != n - 1)
t = max(t, c[i + 1]);
cout << t << "\n";
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 776,357 | 776,358 | u152424169 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7; // 10^9+7
int main() {
int n, a[200001];
cin >> n;
int maxl[200001], maxr[200001];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0)
maxl[i] = a[i];
else
maxl[i] = max(a[i], maxl[i - 1]);
}
for (int i = n - 1; i >= 0; i--) {
if (i == n - 1) {
maxr[i] = a[i];
} else {
maxr[i] = max(a[i], maxr[i + 1]);
}
}
for (int i = 0; i < n; i++) {
if (i == 0) {
cout << maxr[i];
} else if (i == n - 1) {
cout << maxl[i];
} else {
cout << max(maxl[i - 1], maxr[i + 1]);
}
cout << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7; // 10^9+7
int main() {
int n, a[200001];
cin >> n;
int maxl[200001], maxr[200001];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0)
maxl[i] = a[i];
else
maxl[i] = max(a[i], maxl[i - 1]);
}
for (int i = n - 1; i >= 0; i--) {
if (i == n - 1) {
maxr[i] = a[i];
} else {
maxr[i] = max(a[i], maxr[i + 1]);
}
}
for (int i = 0; i < n; i++) {
if (i == 0) {
cout << maxr[1];
} else if (i == n - 1) {
cout << maxl[n - 2];
} else {
cout << max(maxl[i - 1], maxr[i + 1]);
}
cout << endl;
}
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,359 | 776,360 | u792423109 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> as(n);
for (auto &a : as) {
cin >> a;
}
as.emplace_back(-1);
int64_t fst = 0, snd = n;
for (int64_t i = 0; i < n; i++) {
if (as[fst] <= as[i]) {
snd = fst;
fst = i;
} else if (as[snd] <= as[i]) {
snd = i;
}
}
for (int64_t i = 0; i < n; i++) {
if (i == fst) {
cout << as[snd] << endl;
} else {
cout << as[fst] << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> as(n);
for (auto &a : as) {
cin >> a;
}
as.emplace_back(-1);
int64_t fst = 0, snd = n;
for (int64_t i = 1; i < n; i++) {
if (as[fst] <= as[i]) {
snd = fst;
fst = i;
} else if (as[snd] <= as[i]) {
snd = i;
}
}
for (int64_t i = 0; i < n; i++) {
if (i == fst) {
cout << as[snd] << endl;
} else {
cout << as[fst] << endl;
}
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 776,369 | 776,370 | u017167684 | cpp |
p02971 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long ll;
// typedef pair<int,int> Pint;
// typedef pair<ll, ll> P;
// typedef pair<ll, pair<ll, ll>> P;
// typedef tuple<int,int,int> T;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define revrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
const ll INFL = 1LL << 60; // 10^18 = 2^60
const int INF = 1 << 30; // 10^9
const ll MOD = 1e9 + 7;
// ll MOD = 998244353;
vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};
ll max(ll a, ll b) { return (a > b) ? a : b; }
ll min(ll a, ll b) { return (a < b) ? a : b; }
ll pow_long(ll x, ll k) {
ll res = 1;
while (k > 0) {
if (k % 2)
res *= x;
x *= x;
k /= 2;
}
return res;
}
ll pow_mod(ll x, ll k) {
x %= MOD;
x += MOD;
x %= MOD;
ll res = 1;
while (k > 0) {
if (k % 2) {
res *= x;
res %= MOD;
}
x *= x;
x %= MOD;
k /= 2;
}
return res;
}
ll inverse(ll x) { return pow_mod(x, MOD - 2); };
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; };
int main(void) {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
vector<ll> B = A;
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
ll a = B[0];
ll b = B[1];
if (a == b) {
rep(i, N) cout << a << endl;
return 0;
}
rep(i, N) {
if (A[i] == a)
cout << b << endl;
else
cout << a << endl;
return 0;
}
}
| #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long ll;
// typedef pair<int,int> Pint;
// typedef pair<ll, ll> P;
// typedef pair<ll, pair<ll, ll>> P;
// typedef tuple<int,int,int> T;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define revrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
const ll INFL = 1LL << 60; // 10^18 = 2^60
const int INF = 1 << 30; // 10^9
const ll MOD = 1e9 + 7;
// ll MOD = 998244353;
vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};
ll max(ll a, ll b) { return (a > b) ? a : b; }
ll min(ll a, ll b) { return (a < b) ? a : b; }
ll pow_long(ll x, ll k) {
ll res = 1;
while (k > 0) {
if (k % 2)
res *= x;
x *= x;
k /= 2;
}
return res;
}
ll pow_mod(ll x, ll k) {
x %= MOD;
x += MOD;
x %= MOD;
ll res = 1;
while (k > 0) {
if (k % 2) {
res *= x;
res %= MOD;
}
x *= x;
x %= MOD;
k /= 2;
}
return res;
}
ll inverse(ll x) { return pow_mod(x, MOD - 2); };
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; };
int main(void) {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
vector<ll> B = A;
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
ll a = B[0];
ll b = B[1];
if (a == b) {
rep(i, N) cout << a << endl;
return 0;
} else {
rep(i, N) {
if (A[i] == a)
cout << b << endl;
else
cout << a << endl;
}
}
}
| [
"control_flow.branch.else.add",
"function.return_value.change"
] | 776,371 | 776,372 | u633284019 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int N;
int A[200000];
int main() {
scanf("%d", &N);
rep(i, N) scanf("%d", &A[i]);
int max0 = 0, max1 = 0;
int max0cnt = 0;
rep(i, N) {
if (A[i] > max0) {
max1 = max0;
max0 = A[i];
max0cnt = 1;
} else if (A[i] = max0) {
max0cnt++;
} else if (A[i] > max1) {
max1 = A[i];
}
}
rep(i, N) {
if (A[i] == max0) {
cout << (max0cnt > 1 ? max0 : max1) << endl;
} else {
cout << max0 << endl;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int N;
int A[200000];
int main() {
scanf("%d", &N);
rep(i, N) scanf("%d", &A[i]);
int max0 = 0, max1 = 0;
int max0cnt = 0;
rep(i, N) {
if (A[i] > max0) {
max1 = max0;
max0 = A[i];
max0cnt = 1;
} else if (A[i] == max0) {
max0cnt++;
} else if (A[i] > max1) {
max1 = A[i];
}
}
rep(i, N) {
if (A[i] == max0) {
cout << (max0cnt > 1 ? max0 : max1) << endl;
} else {
cout << max0 << endl;
}
}
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 776,373 | 776,374 | u379710681 | cpp |
p02971 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (i = a; i < b; i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define vi vector<int>
#define vii vector<long long int>
#define CLR(a) memset((a), 0, sizeof(a))
#define mp make_pair
#define hell 1000000007
using namespace std;
void solve() {
ll i, j = 0, r = 200, p, q, k = 0, ans = 0, d, y = 0, h, flag = 0, n, m = 0,
a = hell, b = hell, id, c, h1, h2, a1, b1;
cin >> n;
vector<ll> v(n), as(n);
rep(i, 0, n) cin >> v[i], as[i] = v[i];
sort(all(v));
if (as[0] == as[n - 1]) {
rep(i, 0, n) { cout << v[0] << endl; }
return;
}
rep(i, 0, n) {
if (as[i] != v[n - 1])
cout << v[n - 1] << endl;
else if (as[i] == v[n - 1])
cout << v[n - 2] << endl;
else
cout << v[n - 1] << endl;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
solve();
}
/*
void bfs( int i , int j)
{
vis[i][j]= true;
queue < int > que;
que.push(k);
while(!que.empty())
{
int x= que.front();
que.pop();
for ( int i=1;i<=n;i++)
{
if((!g[1][n] and g[x][i] ) or (g[1][n] and ! g[x][i]))
{
if(!vis[i])
{
que.push(i);
level[i]=level[x]+1;
vis[i]= true;
}
}
}
}
}
ll int por(ll int a,ll int b)
{
ll int k=1;
while(b>0)
{
if(b%2) k=k*a,k%=hell;
b/=2;
a*=a; a%=hell;
}
return k;
} */
| #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (i = a; i < b; i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define vi vector<int>
#define vii vector<long long int>
#define CLR(a) memset((a), 0, sizeof(a))
#define mp make_pair
#define hell 1000000007
using namespace std;
void solve() {
ll i, j = 0, r = 200, p, q, k = 0, ans = 0, d, y = 0, h, flag = 0, n, m = 0,
a = hell, b = hell, id, c, h1, h2, a1, b1;
cin >> n;
vector<ll> v(n), as(n);
rep(i, 0, n) cin >> v[i], as[i] = v[i];
sort(all(v));
if (v[0] == v[n - 1]) {
rep(i, 0, n) { cout << v[0] << endl; }
return;
}
rep(i, 0, n) {
if (as[i] != v[n - 1])
cout << v[n - 1] << endl;
else if (as[i] == v[n - 1])
cout << v[n - 2] << endl;
else
cout << v[n - 1] << endl;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
solve();
}
/*
void bfs( int i , int j)
{
vis[i][j]= true;
queue < int > que;
que.push(k);
while(!que.empty())
{
int x= que.front();
que.pop();
for ( int i=1;i<=n;i++)
{
if((!g[1][n] and g[x][i] ) or (g[1][n] and ! g[x][i]))
{
if(!vis[i])
{
que.push(i);
level[i]=level[x]+1;
vis[i]= true;
}
}
}
}
}
ll int por(ll int a,ll int b)
{
ll int k=1;
while(b>0)
{
if(b%2) k=k*a,k%=hell;
b/=2;
a*=a; a%=hell;
}
return k;
} */
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,377 | 776,378 | u216069198 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> p;
struct SegTree {
int seg_tree_size = 1;
int nums_size;
vector<ll> data;
SegTree(int origin_size, vector<ll> a) {
// 簡単のため数列の要素数が2のべき乗と考える
while (seg_tree_size < origin_size)
seg_tree_size *= 2;
nums_size = seg_tree_size;
seg_tree_size = seg_tree_size * 2 - 1;
// 2分木の要素数は2*要素数-1
// n + n/2 + n/4 + n/8 + ... 1 = 2*n-1
data = vector<ll>(seg_tree_size, -1);
for (int i = 0; i < origin_size; i++) {
update(i, a[i]);
}
}
// k番目の値をxに変更
void update(int k, int a) {
// 葉のノードの番号
k += (seg_tree_size - nums_size);
data[k] = a;
// 登りながら更新
while (k > 0) {
k = (k - 1) / 2;
data[k] = max(data[k * 2 + 1], data[k * 2 + 2]);
}
}
// [a, b)の最小値を求める
// kは節点の番号。l, rはその節点が[1, r)に対応づいている
// (a, b, 0, 0, n)として呼び出す。
int query(int a, int b, int k, int l, int r) {
// cout << l << " : " << r << endl;
// cout << a << " : " << b << endl;
// 交差しなければ
if (r <= a || b <= l)
return -1;
// [a, b)が[1, r)を完全に含んでいれば、この節点の値
if (a <= l && r <= b)
return data[k];
// そうでなければ、2つの子の最小値
else {
int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
// cout << min(vl, vr) << endl;
return max(vl, vr);
}
}
int query(int a, int b) { return query(a, b, 0, 0, nums_size); }
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
SegTree st(n, v);
cout << st.query(1, n) << endl;
for (int i = 1; i < n - 1; i++) {
cout << max(st.query(0, i - 1), st.query(i + 1, n)) << endl;
}
cout << st.query(0, n - 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> p;
struct SegTree {
int seg_tree_size = 1;
int nums_size;
vector<ll> data;
SegTree(int origin_size, vector<ll> a) {
// 簡単のため数列の要素数が2のべき乗と考える
while (seg_tree_size < origin_size)
seg_tree_size *= 2;
nums_size = seg_tree_size;
seg_tree_size = seg_tree_size * 2 - 1;
// 2分木の要素数は2*要素数-1
// n + n/2 + n/4 + n/8 + ... 1 = 2*n-1
data = vector<ll>(seg_tree_size, -1);
for (int i = 0; i < origin_size; i++) {
update(i, a[i]);
}
}
// k番目の値をxに変更
void update(int k, int a) {
// 葉のノードの番号
k += (seg_tree_size - nums_size);
data[k] = a;
// 登りながら更新
while (k > 0) {
k = (k - 1) / 2;
data[k] = max(data[k * 2 + 1], data[k * 2 + 2]);
}
}
// [a, b)の最小値を求める
// kは節点の番号。l, rはその節点が[1, r)に対応づいている
// (a, b, 0, 0, n)として呼び出す。
int query(int a, int b, int k, int l, int r) {
// cout << l << " : " << r << endl;
// cout << a << " : " << b << endl;
// 交差しなければ
if (r <= a || b <= l)
return -1;
// [a, b)が[1, r)を完全に含んでいれば、この節点の値
if (a <= l && r <= b)
return data[k];
// そうでなければ、2つの子の最小値
else {
int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
// cout << min(vl, vr) << endl;
return max(vl, vr);
}
}
int query(int a, int b) { return query(a, b, 0, 0, nums_size); }
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
SegTree st(n, v);
// print(st.data);
cout << st.query(1, n) << endl;
for (int i = 1; i < n - 1; i++) {
cout << max(st.query(0, i), st.query(i + 1, n)) << endl;
}
cout << st.query(0, n - 1) << endl;
}
| [
"expression.operation.binary.remove"
] | 776,379 | 776,380 | u916743460 | cpp |
p02971 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <string>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, nuint_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> new_data_set;
#define int long long
#define MOD 1000000007
#define what_is(x) cerr << #x << " is " << x << endl;
#define loop(i, a, n) for (int i = a; i < n; i++)
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, szof(x))
#define sortall(x) sort(aint(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef pair<int, int> pt;
#define mod 998244353
int modval[25];
int arr[10];
signed main() {
fastio();
//#define LOCAL_DEFINE
#ifdef LOCAL_DEFINE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// https://www.coursera.org/learn/algorithms-on-strings/home/welcome
// https://www.coursera.org/lecture/algorithms-on-strings/suffix-array-and-suffix-tree-TV4I6
int n;
cin >> n;
int arr[n], arr1[n], arr2[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
arr1[i] = arr[i];
arr2[i] = arr[i];
}
for (int i = 1; i < n; i++) {
arr1[i] = max(arr1[i - 1], arr1[i]);
}
for (int i = n - 2; i >= 0; i--) {
arr2[i] = max(arr2[i + 1], arr2[i]);
}
for (int i = 0; i < n; i++) {
if (i == 0) {
cout << arr2[i] << endl;
} else if (i == (n - 1)) {
cout << arr1[n - 2] << endl;
} else {
cout << max(arr1[i - 1], arr2[i + 1]) << endl;
}
}
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <string>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, nuint_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> new_data_set;
#define int long long
#define MOD 1000000007
#define what_is(x) cerr << #x << " is " << x << endl;
#define loop(i, a, n) for (int i = a; i < n; i++)
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, szof(x))
#define sortall(x) sort(aint(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef pair<int, int> pt;
#define mod 998244353
int modval[25];
int arr[10];
signed main() {
fastio();
// #define LOCAL_DEFINE
#ifdef LOCAL_DEFINE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// https://www.coursera.org/learn/algorithms-on-strings/home/welcome
// https://www.coursera.org/lecture/algorithms-on-strings/suffix-array-and-suffix-tree-TV4I6
int n;
cin >> n;
int arr[n], arr1[n], arr2[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
arr1[i] = arr[i];
arr2[i] = arr[i];
}
for (int i = 1; i < n; i++) {
arr1[i] = max(arr1[i - 1], arr1[i]);
}
for (int i = n - 2; i >= 0; i--) {
arr2[i] = max(arr2[i + 1], arr2[i]);
}
for (int i = 0; i < n; i++) {
if (i == 0) {
cout << arr2[i + 1] << endl;
} else if (i == (n - 1)) {
cout << arr1[n - 2] << endl;
} else {
cout << max(arr1[i - 1], arr2[i + 1]) << endl;
}
}
return 0;
} | [
"expression.operation.binary.add"
] | 776,381 | 776,382 | u600880717 | cpp |
p02971 | // Utkarsh.25dec
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, a, b) for (ll i = a; i <= b; i++)
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define all(c) (c).begin(), (c).end()
#define max3(a, b, c) max(max(a, b), c)
#define min3(a, b, c) min(min(a, b), c)
using namespace std;
const int N = 500023;
bool vis[N];
vector<int> adj[N];
void solve() {
ll n;
cin >> n;
vl v;
ll highest = 0;
ll pos = 0;
rep(i, n) {
ll c;
cin >> c;
v.pb(c);
if (highest < c) {
highest = c;
pos = i;
}
}
ll shighest = 0;
;
v.erase(v.begin() + pos);
rep(i, n) {
ll c = v[i];
if (shighest < c) {
shighest = c;
}
}
for (int i = 0; i < n; i++) {
if (pos == i) {
cout << shighest << '\n';
} else
cout << highest << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T = 1;
// cin>>T;
int t = 0;
while (t++ < T) {
// cout<<"Case #"<<t<<":"<<' ';
solve();
// cout<<'\n';
}
} | // Utkarsh.25dec
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, a, b) for (ll i = a; i <= b; i++)
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define all(c) (c).begin(), (c).end()
#define max3(a, b, c) max(max(a, b), c)
#define min3(a, b, c) min(min(a, b), c)
using namespace std;
const int N = 500023;
bool vis[N];
vector<int> adj[N];
void solve() {
ll n;
cin >> n;
vl v;
ll highest = 0;
ll pos = 0;
rep(i, n) {
ll c;
cin >> c;
v.pb(c);
if (highest < c) {
highest = c;
pos = i;
}
}
ll shighest = 0;
;
v.erase(v.begin() + pos);
rep(i, n - 1) {
ll c = v[i];
if (shighest < c) {
shighest = c;
}
}
for (int i = 0; i < n; i++) {
if (pos == i) {
cout << shighest << '\n';
} else
cout << highest << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T = 1;
// cin>>T;
int t = 0;
while (t++ < T) {
// cout<<"Case #"<<t<<":"<<' ';
solve();
// cout<<'\n';
}
} | [
"expression.operation.binary.add"
] | 776,383 | 776,384 | u596750443 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int arr[200003] = {};
int mx[200003] = {};
int mx_rev[200003] = {};
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
mx[0] = arr[0];
for (int i = 1; i <= n; i++) {
mx[i] = max(mx[i - 1], arr[i]);
}
mx_rev[n - 1] = arr[n - 1];
for (int i = n - 2; i >= 0; i--) {
mx_rev[i] = max(mx_rev[i + 1], arr[i]);
}
cout << mx_rev[1] << endl;
for (int i = 1; i < n - 1; i++) {
cout << max(mx[i - 1], mx_rev[i + 1]) << endl;
}
cout << mx[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int arr[200003] = {};
int mx[200003] = {};
int mx_rev[200003] = {};
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
mx[0] = arr[0];
for (int i = 1; i <= n; i++) {
mx[i] = max(mx[i - 1], arr[i]);
}
mx_rev[n - 1] = arr[n - 1];
for (int i = n - 2; i >= 0; i--) {
mx_rev[i] = max(mx_rev[i + 1], arr[i]);
}
cout << mx_rev[1] << endl;
for (int i = 1; i < n - 1; i++) {
cout << max(mx[i - 1], mx_rev[i + 1]) << endl;
}
cout << mx[n - 2] << endl;
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,387 | 776,388 | u508729896 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define eb emplace_back
#define fst first
#define scd second
constexpr int mod = 1000000007;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// value
int N;
int A[200020];
void solve() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vi maxL(N), maxR(N);
maxL[0] = A[0];
maxR[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
maxL[i] = max(maxL[i - 1], A[i]);
maxR[N - 1 - i] = max(maxR[N - 1 - i + 1], A[N - 1 - i]);
}
cout << maxR[0] << endl;
for (int i = 1; i < N - 1; i++) {
cout << max(maxL[i - 1], maxR[i + 1]) << endl;
}
cout << maxL[N - 1] << endl;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define eb emplace_back
#define fst first
#define scd second
constexpr int mod = 1000000007;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// value
int N;
int A[200020];
void solve() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vi maxL(N), maxR(N);
maxL[0] = A[0];
maxR[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
maxL[i] = max(maxL[i - 1], A[i]);
maxR[N - 1 - i] = max(maxR[N - 1 - i + 1], A[N - 1 - i]);
}
cout << maxR[1] << endl;
for (int i = 1; i < N - 1; i++) {
cout << max(maxL[i - 1], maxR[i + 1]) << endl;
}
cout << maxL[N - 2] << endl;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,389 | 776,390 | u381714561 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define eb emplace_back
#define fst first
#define scd second
constexpr int mod = 1000000007;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// value
int N;
int A[200020];
void solve() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vi maxL(N), maxR(N);
maxL[0] = A[0];
maxR[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
maxL[i] = max(maxL[i - 1], A[i]);
maxR[N - 1 - i] = max(maxR[N - 1 - i + 1], A[N - 1 - i]);
}
cout << maxR[1] << endl;
for (int i = 1; i < N - 1; i++) {
cout << max(maxL[i - 1], maxR[i + 1]) << endl;
}
cout << maxL[N - 1] << endl;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define eb emplace_back
#define fst first
#define scd second
constexpr int mod = 1000000007;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// value
int N;
int A[200020];
void solve() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vi maxL(N), maxR(N);
maxL[0] = A[0];
maxR[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
maxL[i] = max(maxL[i - 1], A[i]);
maxR[N - 1 - i] = max(maxR[N - 1 - i + 1], A[N - 1 - i]);
}
cout << maxR[1] << endl;
for (int i = 1; i < N - 1; i++) {
cout << max(maxL[i - 1], maxR[i + 1]) << endl;
}
cout << maxL[N - 2] << endl;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,391 | 776,390 | u381714561 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define eb emplace_back
#define fst first
#define scd second
constexpr int mod = 1000000007;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// value
int N;
int A[200020];
void solve() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vi maxL(N), maxR(N);
maxL[0] = A[0];
maxR[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
maxL[i] = max(maxL[i - 1], A[i]);
maxR[N - 1 - i] = max(maxR[N - 1 - i + 1], A[i]);
}
cout << maxR[1] << endl;
for (int i = 1; i < N - 1; i++) {
cout << max(maxL[i - 1], maxR[i + 1]) << endl;
}
cout << maxL[N - 1] << endl;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define eb emplace_back
#define fst first
#define scd second
constexpr int mod = 1000000007;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// value
int N;
int A[200020];
void solve() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vi maxL(N), maxR(N);
maxL[0] = A[0];
maxR[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
maxL[i] = max(maxL[i - 1], A[i]);
maxR[N - 1 - i] = max(maxR[N - 1 - i + 1], A[N - 1 - i]);
}
cout << maxR[1] << endl;
for (int i = 1; i < N - 1; i++) {
cout << max(maxL[i - 1], maxR[i + 1]) << endl;
}
cout << maxL[N - 2] << endl;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| [
"assignment.change",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,392 | 776,390 | u381714561 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ar[n], copy[n];
for (int i = 0; i < n; ++i) {
cin >> ar[i];
copy[i] = ar[i];
}
sort(copy, copy + n, greater<int>());
for (int i = 0; i < n; ++i) {
if (ar[i] == copy[0]) {
cout << copy[1] << "\n";
} else {
cout << copy[1] << "\n";
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ar[n], copy[n];
for (int i = 0; i < n; ++i) {
cin >> ar[i];
copy[i] = ar[i];
}
sort(copy, copy + n, greater<int>());
for (int i = 0; i < n; ++i) {
if (ar[i] == copy[0]) {
cout << copy[1] << "\n";
} else {
cout << copy[0] << "\n";
}
}
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,393 | 776,394 | u328627271 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll A[200005];
ll B[200005];
ll m = -1;
bool f = false;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] > m) {
m = A[i];
f = false;
} else if (A[i] == m) {
f = true;
}
B[i] = A[i];
}
sort(B, B + N);
for (int i = 0; i < N; i++) {
if (f)
cout << A[i] << endl;
else {
if (A[i] == m)
cout << B[N - 2] << endl;
else
cout << m << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll A[200005];
ll B[200005];
ll m = -1;
bool f = false;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] > m) {
m = A[i];
f = false;
} else if (A[i] == m) {
f = true;
}
B[i] = A[i];
}
sort(B, B + N);
for (int i = 0; i < N; i++) {
if (f)
cout << m << endl;
else {
if (A[i] == m)
cout << B[N - 2] << endl;
else
cout << m << endl;
}
}
return 0;
} | [
"io.output.change"
] | 776,397 | 776,398 | u140450365 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> A(N);
int a;
for (int i = 0; i < N; i++) {
cin >> a;
A[i] = make_pair(a, i);
}
sort(A.begin(), A.end(), greater<pair<int, int>>());
int maxIndex = A[0].second;
int maxA = A[0].first;
int secondA = A[1].first;
for (int i = 0; i < N; i++) {
if (i == maxIndex) {
cout << maxA << endl;
} else {
cout << secondA << endl;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> A(N);
int a;
for (int i = 0; i < N; i++) {
cin >> a;
A[i] = make_pair(a, i);
}
sort(A.begin(), A.end(), greater<pair<int, int>>());
int maxIndex = A[0].second;
int maxA = A[0].first;
int secondA = A[1].first;
for (int i = 0; i < N; i++) {
if (i == maxIndex) {
cout << secondA << endl;
} else {
cout << maxA << endl;
}
}
return 0;
} | [
"identifier.change",
"io.output.change"
] | 776,405 | 776,406 | u048945791 | cpp |
p02971 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.141592653589793
using namespace std;
int main() {
// cout << setprecision(100);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a[n], pre[n], post[n];
for (int i = 0; i < n; i++)
cin >> a[i];
pre[0] = a[0];
post[n - 1] = a[n - 1];
for (int i = 1; i < n; i++)
pre[i] = max(pre[i - 1], a[i]);
for (int i = n - 2; i >= 0; i--)
post[i] = max(a[i], post[i + 1]);
cout << pre[1] << '\n';
for (int i = 1; i < n - 1; i++) {
cout << max(pre[i - 1], post[i + 1]) << '\n';
}
cout << post[n - 2];
}
| #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.141592653589793
using namespace std;
int main() {
// cout << setprecision(100);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a[n], pre[n], post[n];
for (int i = 0; i < n; i++)
cin >> a[i];
pre[0] = a[0];
post[n - 1] = a[n - 1];
for (int i = 1; i < n; i++)
pre[i] = max(pre[i - 1], a[i]);
for (int i = n - 2; i >= 0; i--)
post[i] = max(a[i], post[i + 1]);
cout << post[1] << '\n';
for (int i = 1; i < n - 1; i++) {
cout << max(pre[i - 1], post[i + 1]) << '\n';
}
cout << pre[n - 2];
}
| [
"identifier.change",
"io.output.change"
] | 776,407 | 776,408 | u188208110 | cpp |
p02971 | #include <iostream>
using namespace std;
const int MAX_N = 2 * 1e5 + 2;
int A[MAX_N];
int left_max[MAX_N], right_max[MAX_N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = 1; i <= N; i++) {
left_max[i] = max(left_max[i - 1], A[i]);
}
for (int i = N; i >= 1; i--) {
right_max[i] = max(right_max[i - 1], A[i]);
}
for (int i = 1; i <= N; i++) {
cout << max(left_max[i - 1], right_max[i + 1]) << endl;
}
return 0;
} | #include <iostream>
using namespace std;
const int MAX_N = 2 * 1e5 + 10;
int A[MAX_N];
int left_max[MAX_N], right_max[MAX_N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = 1; i <= N; i++) {
left_max[i] = max(left_max[i - 1], A[i]);
}
for (int i = N; i >= 1; i--) {
right_max[i] = max(right_max[i + 1], A[i]);
}
for (int i = 1; i <= N; i++) {
cout << max(left_max[i - 1], right_max[i + 1]) << endl;
}
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 776,411 | 776,412 | u134519179 | cpp |
p02971 | #include <bits/stdc++.h>
#define M 200005
using namespace std;
int n, A[M], la[M];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
la[n] = A[n];
for (int i = n - 1; i >= 1; i--)
la[i] = max(la[i - 1], A[i]);
int mx = 0;
for (int i = 1; i <= n; i++) {
printf("%d\n", max(la[i + 1], mx));
mx = max(mx, A[i]);
}
return 0;
} | #include <bits/stdc++.h>
#define M 200005
using namespace std;
int n, A[M], la[M];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
la[n] = A[n];
for (int i = n - 1; i >= 1; i--)
la[i] = max(la[i + 1], A[i]);
int mx = 0;
for (int i = 1; i <= n; i++) {
printf("%d\n", max(la[i + 1], mx));
mx = max(mx, A[i]);
}
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 776,415 | 776,416 | u625437412 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec) \
std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec) \
std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d) \
vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec) \
do { \
sort(ALL((vec))); \
(vec).erase(std::unique(ALL((vec))), (vec).end()); \
} while (0)
ll POW(ll n, ll m) {
if (m == 0) {
return 1;
} else if (m % 2 == 0) {
ll tmp = POW(n, m / 2);
return (tmp * tmp);
} else {
return (n * POW(n, m - 1));
}
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin >> N;
vl A(N);
REP(i, N) cin >> A[i];
ll max1 = 0;
ll maxid = 0;
ll max2 = 0;
REP(i, N) {
if (max1 < A[i])
maxid = i;
max1 = max(max1, A[i]);
}
REP(i, N) {
if (i != maxid)
max2 = max(max2, A[i]);
}
REP(i, N) {
if (A[i] != max1)
cout << max2 << endl;
else
cout << max1 << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec) \
std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec) \
std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d) \
vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec) \
do { \
sort(ALL((vec))); \
(vec).erase(std::unique(ALL((vec))), (vec).end()); \
} while (0)
ll POW(ll n, ll m) {
if (m == 0) {
return 1;
} else if (m % 2 == 0) {
ll tmp = POW(n, m / 2);
return (tmp * tmp);
} else {
return (n * POW(n, m - 1));
}
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin >> N;
vl A(N);
REP(i, N) cin >> A[i];
ll max1 = 0;
ll maxid = 0;
ll max2 = 0;
REP(i, N) {
if (max1 < A[i])
maxid = i;
max1 = max(max1, A[i]);
}
REP(i, N) {
if (i != maxid)
max2 = max(max2, A[i]);
}
REP(i, N) {
if (A[i] == max1)
cout << max2 << endl;
else
cout << max1 << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 776,419 | 776,420 | u050865477 | cpp |
p02971 | #include <bits/stdc++.h>
#define me(a, x) memset(a, x, sizeof(a))
#define sc scanf
#define itn int
using namespace std;
const int N = 1e6;
const long long mod = 1e9 + 7;
const int oo = 0x7fffffff;
const int sup = 0x80000000;
typedef long long ll;
typedef unsigned long long ull;
template <typename it> void db(it *begin, it *end) {
while (begin != end)
cout << (*begin++) << " ";
puts("");
}
template <typename it> string to_str(it n) {
string s = "";
while (n)
s += n % 10 + '0', n /= 10;
reverse(s.begin(), s.end());
return s;
}
template <typename it> int o(it a) {
cout << a << endl;
return 0;
}
ll mul(ll a, ll b, ll c) {
ll ans = 0;
for (; b; b >>= 1, a = (a + a) % c)
if (b & 1)
ans = (ans + a) % c;
return ans;
}
ll ksm(ll a, ll b, ll c) {
ll ans = 1;
for (; b; b >>= 1, a = mul(a, a, c))
if (b & 1)
ans = mul(ans, a, c);
return ans;
}
int n;
int a[N];
int pre[N] = {0}, suf[N] = {0};
int main() {
// freopen("in.txt","r",stdin);
cin >> n;
for (itn i = 1; i <= n; i++)
cin >> a[i];
for (itn i = 1; i <= n; i++) {
pre[i] = max(pre[i], a[i]);
}
for (int i = n; i >= 1; i--)
suf[i] = max(suf[i + 1], a[i]);
for (int i = 1; i <= n; i++) {
o(max(pre[i - 1], suf[i + 1]));
}
}
| #include <bits/stdc++.h>
#define me(a, x) memset(a, x, sizeof(a))
#define sc scanf
#define itn int
using namespace std;
const int N = 1e6;
const long long mod = 1e9 + 7;
const int oo = 0x7fffffff;
const int sup = 0x80000000;
typedef long long ll;
typedef unsigned long long ull;
template <typename it> void db(it *begin, it *end) {
while (begin != end)
cout << (*begin++) << " ";
puts("");
}
template <typename it> string to_str(it n) {
string s = "";
while (n)
s += n % 10 + '0', n /= 10;
reverse(s.begin(), s.end());
return s;
}
template <typename it> int o(it a) {
cout << a << endl;
return 0;
}
ll mul(ll a, ll b, ll c) {
ll ans = 0;
for (; b; b >>= 1, a = (a + a) % c)
if (b & 1)
ans = (ans + a) % c;
return ans;
}
ll ksm(ll a, ll b, ll c) {
ll ans = 1;
for (; b; b >>= 1, a = mul(a, a, c))
if (b & 1)
ans = mul(ans, a, c);
return ans;
}
int n;
int a[N];
int pre[N] = {0}, suf[N] = {0};
int main() {
// freopen("in.txt","r",stdin);
cin >> n;
for (itn i = 1; i <= n; i++)
cin >> a[i];
for (itn i = 1; i <= n; i++) {
pre[i] = max(pre[i - 1], a[i]);
}
for (int i = n; i >= 1; i--)
suf[i] = max(suf[i + 1], a[i]);
for (int i = 1; i <= n; i++) {
o(max(pre[i - 1], suf[i + 1]));
}
}
| [
"assignment.change"
] | 776,423 | 776,424 | u433172603 | cpp |
p02971 | #include <iostream>
using namespace std;
int main() {
int N;
int A[200000];
int l[200000];
int r[200000];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
l[0] = A[0];
for (int i = 1; i < N; i++)
l[i] = max(l[i - 1], A[i]);
r[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--)
r[i] = max(r[i + 1], A[i]);
cout << r[1] << endl;
for (int i = 0; i < N - 1; i++) {
cout << max(l[i - 1], r[i + 1]) << endl;
}
cout << l[N - 2] << endl;
} | #include <iostream>
using namespace std;
int main() {
int N;
int A[200000];
int l[200000];
int r[200000];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
l[0] = A[0];
for (int i = 1; i < N; i++)
l[i] = max(l[i - 1], A[i]);
r[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--)
r[i] = max(r[i + 1], A[i]);
cout << r[1] << endl;
for (int i = 1; i < N - 1; i++) {
cout << max(l[i - 1], r[i + 1]) << endl;
}
cout << l[N - 2] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 776,425 | 776,426 | u693133807 | cpp |
p02971 | #include <iostream>
using namespace std;
int main(void) {
int n;
int a[200000];
int leftmax[200001] = {-1};
int rightmax[200001] = {-1};
int ans[200000] = {-1};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = (n - 1); i >= 0; i--) {
if (i == (n - 1)) {
rightmax[i] = a[n - 1];
} else {
(rightmax[i + 1] > a[i]) ? rightmax[i] = rightmax[i + 1]
: rightmax[i] = a[i];
}
// cout << rightmax[i] << " " ;
}
// cout<<endl;
for (int i = 1; i < n; i++) {
if (i == 1) {
leftmax[i] = a[1];
} else {
(leftmax[i - 1] > a[i]) ? leftmax[i] = leftmax[i - 1] : leftmax[i] = a[i];
}
// cout << leftmax[i] << " " ;
}
// cout<<endl;
for (int i = 0; i < n; i++) {
if (i == 0) {
ans[i] = rightmax[1];
} else if (i == (n - 1)) {
ans[i] = leftmax[n - 1];
} else {
if (rightmax[i + 1] > leftmax[i - 1]) {
ans[i] = rightmax[i + 1];
} else {
ans[i] = leftmax[i - 1];
}
}
}
for (int j = 0; j < n; j++) {
cout << ans[j] << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int n;
int a[200000];
int leftmax[200001] = {-1};
int rightmax[200001] = {-1};
int ans[200000] = {-1};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = (n - 1); i >= 0; i--) {
if (i == (n - 1)) {
rightmax[i] = a[n - 1];
} else {
(rightmax[i + 1] > a[i]) ? rightmax[i] = rightmax[i + 1]
: rightmax[i] = a[i];
}
// cout << rightmax[i] << " " ;
}
// cout<<endl;
for (int i = 0; i < n; i++) {
if (i == 0) {
leftmax[i] = a[0];
} else {
(leftmax[i - 1] > a[i]) ? leftmax[i] = leftmax[i - 1] : leftmax[i] = a[i];
}
// cout << leftmax[i] << " " ;
}
// cout<<endl;
for (int i = 0; i < n; i++) {
if (i == 0) {
ans[i] = rightmax[1];
} else if (i == (n - 1)) {
ans[i] = leftmax[n - 2];
} else {
if (rightmax[i + 1] > leftmax[i - 1]) {
ans[i] = rightmax[i + 1];
} else {
ans[i] = leftmax[i - 1];
}
}
}
for (int j = 0; j < n; j++) {
cout << ans[j] << endl;
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 776,433 | 776,434 | u274657603 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int n, a[200020];
int maxx1[200020];
int maxx2[200020];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
maxx1[i] = max(maxx1[i - 1], a[i]);
}
for (int i = n; i >= 1; i--) {
maxx2[i] = max(maxx2[i - 1], a[i]);
}
for (int i = 1; i <= n; i++) {
int ans = max(maxx1[i - 1], maxx2[i + 1]);
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int n, a[200020];
int maxx1[200020];
int maxx2[200020];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
maxx1[i] = max(maxx1[i - 1], a[i]);
}
for (int i = n; i >= 1; i--) {
maxx2[i] = max(maxx2[i + 1], a[i]);
}
for (int i = 1; i <= n; i++) {
int ans = max(maxx1[i - 1], maxx2[i + 1]);
cout << ans << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 776,440 | 776,441 | u234165819 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int k = -1;
int g = -2;
int p;
int q;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (k < a[i]) {
g = k;
k = a[i];
p = i;
}
if (a[i] <= k && a[i] > g) {
g = a[i];
}
}
for (int j = 1; j <= n; j++) {
if (j != p + 1) {
cout << k << endl;
} else {
cout << g << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int k = -1;
int g = -2;
int p;
int q;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (k < a[i]) {
g = k;
k = a[i];
p = i;
} else if (a[i] <= k && a[i] > g) {
g = a[i];
}
}
for (int j = 1; j <= n; j++) {
if (j != p + 1) {
cout << k << endl;
} else {
cout << g << endl;
}
}
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 776,446 | 776,447 | u758406624 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int max = 0;
int semi = 0;
for (int i = 1; i < n; i++) {
if (max < a.at(i)) {
semi = max;
max = a.at(i);
} else {
if (semi < a.at(i)) {
semi = a.at(i);
}
}
}
for (int i = 0; i < n; i++) {
if (a.at(i) < max) {
cout << max << endl;
} else {
cout << semi << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int max = 0;
int semi = 0;
for (int i = 0; i < n; i++) {
if (max < a.at(i)) {
// cout<<1<<endl;
semi = max;
max = a.at(i);
} else {
// cout<<0<<endl;
if (semi < a.at(i)) {
semi = a.at(i);
}
}
}
// cout<<max<<" "<<semi<<endl;
for (int i = 0; i < n; i++) {
if (a.at(i) < max) {
cout << max << endl;
} else {
cout << semi << endl;
}
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 776,448 | 776,449 | u461896927 | cpp |
p02971 | #include <iostream>
using namespace std;
int main(void) {
int n;
std::cin >> n;
int max = 0;
int next = 0;
int maxi = 0;
int nexti = 0;
for (int i = 0; i < n; i++) {
int now = 0;
std::cin >> now;
if (now >= max) {
next = max;
nexti = maxi;
max = now;
maxi = i;
} else if (now >= next) {
next = now;
nexti = maxi;
}
}
for (int i = 0; i < n; i++) {
int result = i == nexti ? next : max;
std::cout << result << std::endl;
}
}
| #include <iostream>
using namespace std;
int main(void) {
int n;
std::cin >> n;
int max = 0;
int next = 0;
int maxi = 0;
int nexti = 0;
for (int i = 0; i < n; i++) {
int now = 0;
std::cin >> now;
if (now >= max) {
next = max;
nexti = maxi;
max = now;
maxi = i;
} else if (now >= next) {
next = now;
nexti = maxi;
}
}
for (int i = 0; i < n; i++) {
int result = i == maxi ? next : max;
std::cout << result << std::endl;
}
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,450 | 776,451 | u074135432 | cpp |
p02971 | #include <iostream>
using namespace std;
int main(void) {
int n;
std::cin >> n;
int max = 0;
int next = 0;
int maxi = 0;
int nexti = 0;
for (int i = 0; i < n; i++) {
int now = 0;
std::cin >> now;
if (now > max) {
next = max;
nexti = maxi;
max = now;
maxi = i;
} else if (now > next) {
next = now;
nexti = maxi;
}
}
for (int i = 0; i < n; i++) {
int result = i == nexti ? next : max;
std::cout << result << std::endl;
}
}
| #include <iostream>
using namespace std;
int main(void) {
int n;
std::cin >> n;
int max = 0;
int next = 0;
int maxi = 0;
int nexti = 0;
for (int i = 0; i < n; i++) {
int now = 0;
std::cin >> now;
if (now >= max) {
next = max;
nexti = maxi;
max = now;
maxi = i;
} else if (now >= next) {
next = now;
nexti = maxi;
}
}
for (int i = 0; i < n; i++) {
int result = i == maxi ? next : max;
std::cout << result << std::endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,452 | 776,451 | u074135432 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> a(N);
cin >> a[0];
long long amax_1 = a[0];
long long amax_2 = a[0];
for (long long i = 1; i < N; i++) {
cin >> a[i];
if (a[i] > amax_1) {
amax_2 = amax_1;
amax_1 = a[i];
}
if (a[i] > amax_2 && a[i] < amax_1) {
amax_2 = a[i];
}
}
long long cnt = 0;
for (long long i = 0; i < N; i++) {
if (a[i] == amax_1) {
cnt++;
}
}
for (long long i = 0; i < N; i++) {
if (cnt > 1)
cout << amax_1 << endl;
else {
if (amax_1 == a[i])
cout << amax_2 << endl;
else
cout << amax_1 << endl;
}
}
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> a(N);
cin >> a[0];
long long amax_1 = a[0];
long long amax_2 = 0;
for (long long i = 1; i < N; i++) {
cin >> a[i];
if (a[i] > amax_1) {
amax_2 = amax_1;
amax_1 = a[i];
}
if (a[i] > amax_2 && a[i] < amax_1)
amax_2 = a[i];
}
long long cnt = 0;
for (long long i = 0; i < N; i++) {
if (a[i] == amax_1) {
cnt++;
}
}
for (long long i = 0; i < N; i++) {
if (cnt > 1)
cout << amax_1 << endl;
else {
if (amax_1 == a[i])
cout << amax_2 << endl;
else
cout << amax_1 << endl;
}
}
}
| [] | 776,453 | 776,454 | u846226907 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
v.push_back(a[i]);
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (v[n - 1] == a[i]) {
cout << v[n - 2] << endl;
} else {
cout << v[n - 1] << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a[i];
v.push_back(a[i]);
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (v[n - 1] == a[i]) {
cout << v[n - 2] << endl;
} else {
cout << v[n - 1] << endl;
}
}
} | [
"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,461 | 776,462 | u745852541 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
std::vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
v.push_back(a[i]);
}
sort(v.begin(), v.end());
for (int i = 0; i <= n; i++) {
if (v[n - 1] == a[i]) {
cout << v[n - 2] << endl;
} else {
cout << v[n - 1] << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a[i];
v.push_back(a[i]);
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (v[n - 1] == a[i]) {
cout << v[n - 2] << endl;
} else {
cout << v[n - 1] << endl;
}
}
} | [
"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,463 | 776,462 | u745852541 | cpp |
p02971 | #include <algorithm>
#include <chrono>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define inf 1e6
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int max_1 = -inf, max_2 = -inf, max_1_idx, max_2_idx;
for (int i = 0; i < N; i++) {
if (A[i] > max_1) {
max_1 = A[i];
max_1_idx = i;
}
}
for (int i = 0; i < N; i++) {
if (i != max_1_idx) {
if (A[i] > max_2) {
max_2 = A[i];
max_2_idx = i;
}
}
}
for (int i = 0; i < N; i++) {
if (i == max_1_idx) {
cout << max_1 << endl;
} else {
cout << max_2 << endl;
}
}
return 0;
}
| #include <algorithm>
#include <chrono>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define inf 1e6
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int max_1 = -inf, max_2 = -inf, max_1_idx, max_2_idx;
for (int i = 0; i < N; i++) {
if (A[i] >= max_1) {
max_1 = A[i];
max_1_idx = i;
}
}
for (int i = 0; i < N; i++) {
if (i != max_1_idx) {
if (A[i] >= max_2) {
max_2 = A[i];
max_2_idx = i;
}
}
}
for (int i = 0; i < N; i++) {
if (i == max_1_idx) {
cout << max_2 << endl;
} else {
cout << max_1 << endl;
}
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 776,466 | 776,467 | u766009355 | cpp |
p02971 | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 2e5 + 9;
int s[N], f[N];
int main(void) {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> s[i], f[i] = s[i];
sort(f, f + n, greater<int>());
int a = f[0], b = f[1];
for (int i = 0; i < n; ++i) {
cout << (s[i] == a ? a : b) << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 2e5 + 9;
int s[N], f[N];
int main(void) {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> s[i], f[i] = s[i];
sort(f, f + n, greater<int>());
int a = f[0], b = f[1];
for (int i = 0; i < n; ++i) {
cout << (s[i] != a ? a : b) << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 776,468 | 776,469 | u777148280 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ma = 0;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = max(a[i], ma);
ma = max(a[i], ma);
}
ma = 0;
for (int i = n - 1; i >= 0; i--) {
c[i] = max(a[i], ma);
ma = max(a[i], ma);
}
for (int i = 0; i < n; i++) {
if (i == 0) {
cout << c[i] << "\n";
} else if (i == n - 1) {
cout << b[i - 1] << "\n";
} else {
m = max(b[i - 1], c[i + 1]);
cout << m << "\n";
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ma = 0;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = max(a[i], ma);
ma = max(a[i], ma);
}
ma = 0;
for (int i = n - 1; i >= 0; i--) {
c[i] = max(a[i], ma);
ma = max(a[i], ma);
}
for (int i = 0; i < n; i++) {
if (i == 0) {
cout << c[i + 1] << "\n";
} else if (i == n - 1) {
cout << b[i - 1] << "\n";
} else {
m = max(b[i - 1], c[i + 1]);
cout << m << "\n";
}
}
return 0;
} | [
"expression.operation.binary.add"
] | 776,476 | 776,477 | u125051909 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ma = 0;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = max(a[i], ma);
ma = max(a[i], ma);
}
ma = 0;
for (int i = n - 1; i >= 0; i--) {
c[i] = max(a[i], ma);
ma = max(a[i], ma);
}
for (int i = 0; i < n; i++) {
if (i == 0) {
cout << c[i] << "\n";
} else if (i == n - 1) {
cout << b[0] << "\n";
} else {
m = max(b[i - 1], c[i + 1]);
cout << m << "\n";
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ma = 0;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = max(a[i], ma);
ma = max(a[i], ma);
}
ma = 0;
for (int i = n - 1; i >= 0; i--) {
c[i] = max(a[i], ma);
ma = max(a[i], ma);
}
for (int i = 0; i < n; i++) {
if (i == 0) {
cout << c[i + 1] << "\n";
} else if (i == n - 1) {
cout << b[i - 1] << "\n";
} else {
m = max(b[i - 1], c[i + 1]);
cout << m << "\n";
}
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,478 | 776,477 | u125051909 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ma = 0;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = max(a[i], ma);
ma = max(a[i], ma);
}
ma = 0;
for (int i = n - 1; i >= 0; i--) {
c[i] = max(a[i], ma);
ma = max(a[i], ma);
}
for (int i = 0; i < n; i++) {
if (i == 0) {
cout << c[i] << "\n";
} else if (i == n - 1) {
cout << b[i] << "\n";
} else {
m = max(b[i - 1], c[i + 1]);
cout << m << "\n";
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ma = 0;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = max(a[i], ma);
ma = max(a[i], ma);
}
ma = 0;
for (int i = n - 1; i >= 0; i--) {
c[i] = max(a[i], ma);
ma = max(a[i], ma);
}
for (int i = 0; i < n; i++) {
if (i == 0) {
cout << c[i + 1] << "\n";
} else if (i == n - 1) {
cout << b[i - 1] << "\n";
} else {
m = max(b[i - 1], c[i + 1]);
cout << m << "\n";
}
}
return 0;
} | [
"expression.operation.binary.add"
] | 776,479 | 776,477 | u125051909 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++)
b[i] = a[i];
sort(a.begin(), a.end());
ll max = a[n - 1], sec;
sec = max;
for (ll i = n - 1; 0 <= i; i--) {
if (a[i] != max) {
sec = a[i];
break;
}
}
if (max = a[n - 2]) {
for (ll i = 0; i < n; i++) {
cout << max << endl;
}
return 0;
}
if (max == sec) {
for (ll i = 0; i < n; i++) {
cout << max << endl;
}
return 0;
}
for (ll i = 0; i < n; i++) {
if (b[i] == max)
cout << sec << endl;
else
cout << max << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++)
b[i] = a[i];
sort(a.begin(), a.end());
ll max = a[n - 1], sec;
sec = max;
for (ll i = n - 1; 0 <= i; i--) {
if (a[i] != max) {
sec = a[i];
break;
}
}
if (max == a[n - 2]) {
for (ll i = 0; i < n; i++) {
cout << max << endl;
}
return 0;
}
if (max == sec) {
for (ll i = 0; i < n; i++) {
cout << max << endl;
}
return 0;
}
for (ll i = 0; i < n; i++) {
if (b[i] == max)
cout << sec << endl;
else
cout << max << endl;
}
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 776,497 | 776,498 | u067128860 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long a[n + 1], b[n + 1];
for (long long i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(a, a + n);
long long m1 = a[n - 1];
long long m2 = a[n - 2];
for (long long i = 0; i < n; i++) {
if (b[i] == m1)
cout << m2 << endl;
else
cout << m1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n + 1], b[n + 1];
for (long long i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(a, a + n);
long long m1 = a[n - 1];
long long m2 = a[n - 2];
for (long long i = 0; i < n; i++) {
if (b[i] == m1)
cout << m2 << endl;
else
cout << m1 << endl;
}
return 0;
}
| [] | 776,501 | 776,502 | u968285884 | cpp |
p02971 | #include <bits/stdc++.h>
int n;
int x;
std::vector<int> vec;
std::vector<int> vec2;
int main() {
std::cin >> n;
vec.assign(n, 0);
vec2.assign(n, 0);
for (int i = 0; i < n; i++) {
std::cin >> x;
vec[i] = x;
vec2[i] = x;
}
std::sort(vec2.begin(), vec2.end());
for (int j = 0; j < n; j++) {
if (vec[j] == vec2[n - 1]) {
std::cout << vec[n - 2];
} else {
std::cout << vec[n - 1];
}
std::cout << std::endl;
}
}
| #include <bits/stdc++.h>
int n;
int x;
std::vector<int> vec;
std::vector<int> vec2;
int main() {
std::cin >> n;
vec.assign(n, 0);
vec2.assign(n, 0);
for (int i = 0; i < n; i++) {
std::cin >> x;
vec[i] = x;
vec2[i] = x;
}
std::sort(vec2.begin(), vec2.end());
for (int j = 0; j < n; j++) {
if (vec[j] == vec2[n - 1]) {
std::cout << vec2[n - 2];
} else {
std::cout << vec2[n - 1];
}
std::cout << std::endl;
}
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 776,503 | 776,504 | u537538698 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> v(a), b(a);
int tmp;
for (int i = 0; i < a; i++) {
cin >> v[i];
b[i] = v[i];
}
sort(v.begin(), v.end());
if (v[a - 1] == v[a - 2]) {
for (int i = 0; i < a; i++)
cout << v[a - 1] << endl;
} else
for (int i = 0; i < a; i++) {
if (v[a - 1] == b[i])
tmp = i;
}
for (int i = 0; i < a; i++) {
if (tmp == i)
cout << v[a - 2] << endl;
else
cout << v[a - 1] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> v(a), b(a);
int tmp;
for (int i = 0; i < a; i++) {
cin >> v[i];
b[i] = v[i];
}
sort(v.begin(), v.end());
if (v[a - 1] == v[a - 2]) {
for (int i = 0; i < a; i++)
cout << v[a - 1] << endl;
} else {
for (int i = 0; i < a; i++) {
if (v[a - 1] == b[i])
tmp = i;
}
for (int i = 0; i < a; i++) {
if (tmp == i)
cout << v[a - 2] << endl;
else
cout << v[a - 1] << endl;
}
}
}
| [] | 776,509 | 776,510 | u936271647 | cpp |
p02971 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int max = 0;
int s_max = 0;
bool max_f = false;
vector<int> num;
cin >> n;
for (int i = 0; i < n; i++) {
int inp;
cin >> inp;
num.push_back(inp);
if (inp > s_max) {
if (inp > max) {
max = inp;
max_f = false;
} else if (inp == max) {
max_f = true;
} else {
s_max = inp;
}
}
}
if (max_f) {
for (int i = 0; i < n; i++) {
cout << max << endl;
}
} else {
for (int i = 0; i < n; i++) {
if (num.at(i) == max) {
cout << s_max << endl;
} else {
cout << max << endl;
}
}
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int max = 0;
int s_max = 0;
bool max_f = false;
vector<int> num;
cin >> n;
for (int i = 0; i < n; i++) {
int inp;
cin >> inp;
num.push_back(inp);
if (inp > s_max) {
if (inp > max) {
s_max = max;
max = inp;
max_f = false;
} else if (inp == max) {
max_f = true;
} else {
s_max = inp;
}
}
}
if (max_f) {
for (int i = 0; i < n; i++) {
cout << max << endl;
}
} else {
for (int i = 0; i < n; i++) {
if (num.at(i) == max) {
cout << s_max << endl;
} else {
cout << max << endl;
}
}
}
return 0;
} | [
"assignment.add"
] | 776,515 | 776,516 | u818286983 | cpp |
p02971 | #include <bits/stdc++.h>
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fo(v, a, b) for (int v = (a); v <= (b); v++)
#define fr(v, a, b) for (int v = (a); v >= (b); v--)
#define rng(v, a, b) for (int v = (a); v < (b); v++)
using namespace std;
typedef long long ll;
template <typename T> T &chmax(T &a, T b) {
a = a > b ? a : b;
return a;
}
template <typename T> T &chmin(T &a, T b) {
a = a < b ? a : b;
return a;
}
const int maxn = 2e5 + 5;
int a[maxn], l[maxn], r[maxn];
int main() {
boost;
int n;
cin >> n;
fo(i, 1, n) cin >> a[i];
fo(i, 1, n) { chmax(l[i], max(l[i - 1], a[i])); }
fr(i, n, 1) { chmax(r[i], max(r[i - 1], a[i])); }
fo(i, 1, n) { cout << max(l[i - 1], r[i + 1]) << '\n'; }
return 0;
}
| #include <bits/stdc++.h>
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fo(v, a, b) for (int v = (a); v <= (b); v++)
#define fr(v, a, b) for (int v = (a); v >= (b); v--)
#define rng(v, a, b) for (int v = (a); v < (b); v++)
using namespace std;
typedef long long ll;
template <typename T> T &chmax(T &a, T b) {
a = a > b ? a : b;
return a;
}
template <typename T> T &chmin(T &a, T b) {
a = a < b ? a : b;
return a;
}
const int maxn = 2e5 + 5;
int a[maxn], l[maxn], r[maxn];
int main() {
boost;
int n;
cin >> n;
fo(i, 1, n) cin >> a[i];
fo(i, 1, n) { chmax(l[i], max(l[i - 1], a[i])); }
fr(i, n, 1) { chmax(r[i], max(r[i + 1], a[i])); }
fo(i, 1, n) { cout << max(l[i - 1], r[i + 1]) << '\n'; }
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 776,523 | 776,524 | u280425786 | cpp |
p02971 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
vector<int> v(n);
int max1 = 0, max2 = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
if (max1 < v[i]) {
max2 = max1;
max1 = v[i];
} else if (max2 < v[i])
max2 = v[i];
}
for (int i = 0; i < n; i++) {
if (max1 == v[i])
cout << max2 << "\n";
else
cout << max1 << "\n";
}
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> v(n);
int max1 = 0, max2 = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
if (max1 < v[i]) {
max2 = max1;
max1 = v[i];
} else if (max2 < v[i])
max2 = v[i];
}
for (int i = 0; i < n; i++) {
if (max1 == v[i])
cout << max2 << "\n";
else
cout << max1 << "\n";
}
return 0;
}
| [] | 776,525 | 776,526 | u827841970 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<long long> A(N), B;
for (int i = 0; i < N; i++)
cin >> A[i];
B = A;
sort(B.begin(), B.end());
long long M = *max_element(A.begin(), A.end());
if (M == B[1]) {
for (int i = 0; i < N; i++)
cout << M << endl;
} else {
for (int i = 0; i < N; i++) {
if (A[i] == M)
cout << B[1] << endl;
else
cout << M << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<long long> A(N), B;
for (int i = 0; i < N; i++)
cin >> A[i];
B = A;
sort(B.rbegin(), B.rend());
long long M = *max_element(A.begin(), A.end());
if (M == B[1]) {
for (int i = 0; i < N; i++)
cout << M << endl;
} else {
for (int i = 0; i < N; i++) {
if (A[i] == M)
cout << B[1] << endl;
else
cout << M << endl;
}
}
return 0;
} | [
"call.function.change",
"call.arguments.change"
] | 776,527 | 776,528 | u898331860 | 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 ull = unsigned long long;
using P = pair<int, int>;
int main() {
ll N;
cin >> N;
vector<ll> a(N + 1), b(N + 1);
rep(i, N) cin >> a[i + 1];
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = N / i; j >= 1; j--) {
if (b[j]) {
cnt++;
}
}
if (a[i] != cnt % 2) {
b[i] = 1;
}
}
int sum = accumulate(b.begin(), b.end(), 0);
cout << sum << endl;
if (sum) {
for (int i = 1; i <= N; i++) {
if (b[i]) {
cout << i << " ";
}
}
cout << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
ll N;
cin >> N;
vector<ll> a(N + 1), b(N + 1);
rep(i, N) cin >> a[i + 1];
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = N / i; j >= 1; j--) {
if (b[i * j]) {
cnt++;
}
}
if (a[i] != cnt % 2) {
b[i] = 1;
}
}
int sum = accumulate(b.begin(), b.end(), 0);
cout << sum << endl;
if (sum) {
for (int i = 1; i <= N; i++) {
if (b[i]) {
cout << i << " ";
}
}
cout << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 776,537 | 776,538 | u201651098 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
// sengen
int n;
// nyuryoku
cin >> n;
int a[n + 1] = {};
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int b[n + 1] = {};
int m = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
int j = 2;
while (i * j <= n) {
sum += b[i * j];
j++;
}
if (sum % 2 != a[i]) {
b[i]++;
if (b[i] == 1) {
m++;
}
}
}
// keisan
cout << m << endl;
if (m) {
for (int i = 1; i <= n; i++) {
if (b[i]) {
cout << b[i] << ' ';
}
}
}
// syutsuryoku
} | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
// sengen
int n;
// nyuryoku
cin >> n;
int a[n + 1] = {};
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int b[n + 1] = {};
int m = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
int j = 2;
while (i * j <= n) {
sum += b[i * j];
j++;
}
if (sum % 2 != a[i]) {
b[i]++;
if (b[i] == 1) {
m++;
}
}
}
// keisan
cout << m << endl;
if (m) {
for (int i = 1; i <= n; i++) {
if (b[i]) {
cout << i << ' ';
}
}
}
// syutsuryoku
} | [] | 776,539 | 776,540 | u002847662 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define NIL = -1;
#define all(x) x.begin(), x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0)
return 1;
return digit(x / 10) + 1;
}
ll gcd(long long a, long long b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
bool is_prime(long long N) {
if (N == 1)
return false;
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0)
return false;
}
return true;
}
ll lcm(ll a, ll b) { return ((a * b == 0)) ? 0 : (a / gcd(a, b) * b); }
double DegreeToRadian(double degree) { return degree * M_PI / 180.0; }
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
///////////////////////////////////////////////////////////////////////////////////
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> box(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int count = 0;
for (int j = i * 2; j <= n; j++) {
count += box[j];
}
if (a[i] != count % 2) {
box[i] = 1;
}
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (box[i] == 1) {
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define NIL = -1;
#define all(x) x.begin(), x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0)
return 1;
return digit(x / 10) + 1;
}
ll gcd(long long a, long long b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
bool is_prime(long long N) {
if (N == 1)
return false;
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0)
return false;
}
return true;
}
ll lcm(ll a, ll b) { return ((a * b == 0)) ? 0 : (a / gcd(a, b) * b); }
double DegreeToRadian(double degree) { return degree * M_PI / 180.0; }
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
///////////////////////////////////////////////////////////////////////////////////
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> box(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int count = 0;
for (int j = i * 2; j <= n; j += i) {
count += box[j];
}
if (a[i] != count % 2) {
box[i] = 1;
}
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (box[i] == 1) {
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << endl;
} | [] | 776,541 | 776,542 | u111600809 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9 + 7;
int a[200010], b[200010];
int main() {
int n;
cin >> n;
rep(i, n) cin >> a[i + 1];
int m = 0;
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += b[j];
if (sum % 2 != a[i]) {
b[i]++;
m++;
}
}
cout << m << endl;
rep(i, n) {
if (b[i + 1])
cout << b[i + 1] << ' ';
}
if (m > 0)
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9 + 7;
int a[200010], b[200010];
int main() {
int n;
cin >> n;
rep(i, n) cin >> a[i + 1];
int m = 0;
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += b[j];
if (sum % 2 != a[i]) {
b[i]++;
m++;
}
}
cout << m << endl;
rep(i, n) {
if (b[i + 1])
cout << i + 1 << ' ';
}
if (m > 0)
cout << endl;
return 0;
} | [] | 776,543 | 776,544 | u309168663 | 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 rep1(i, n) for (ll i = 1; i <= n; ++i)
#define revrep(i, n) for (ll i = n - 1; i >= 0; --i)
inline constexpr ll Inf = (1ULL << 62) - 1;
#define fastio \
cin.tie(nullptr); \
ios_base::sync_with_stdio(false);
#define endl '\n'
template <class T> bool updmax(T &a, T b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template <class T> bool updmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
int main() {
fastio;
ll N;
cin >> N;
vector<int> a(N);
vector<int> b(N);
rep(i, N) cin >> a[i];
for (int i = N; i > 0; --i) {
int oe = 0;
for (int j = i * 2; j <= N; j += i) {
oe += b[j - 1];
}
oe += a[i - 1];
oe %= 2;
b[i - 1] = oe;
}
int m = accumulate(begin(b), end(b), 0);
cout << m << endl;
rep(i, m) {
if (b[i])
cout << i + 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define revrep(i, n) for (ll i = n - 1; i >= 0; --i)
inline constexpr ll Inf = (1ULL << 62) - 1;
#define fastio \
cin.tie(nullptr); \
ios_base::sync_with_stdio(false);
#define endl '\n'
template <class T> bool updmax(T &a, T b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template <class T> bool updmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
int main() {
fastio;
ll N;
cin >> N;
vector<int> a(N);
vector<int> b(N);
rep(i, N) cin >> a[i];
for (int i = N; i > 0; --i) {
int oe = 0;
for (int j = i * 2; j <= N; j += i) {
oe += b[j - 1];
}
oe += a[i - 1];
oe %= 2;
b[i - 1] = oe;
}
int m = accumulate(begin(b), end(b), 0);
cout << m << endl;
rep(i, N) {
if (b[i])
cout << i + 1 << endl;
}
}
| [] | 776,547 | 776,548 | u185413585 | cpp |
p02972 | #include <iostream>
#include <vector>
int main(void) {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n + 1);
a[0] = 0;
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
if (b[i] == 1)
cnt++;
}
cnt = cnt % 2;
if (cnt != a[i])
b[i] = 1;
}
int zcnt = 0;
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
zcnt++;
}
}
std::cout << zcnt << std::endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
std::cout << i << " ";
}
}
return 0;
} | #include <iostream>
#include <vector>
int main(void) {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n + 1);
a[0] = 0;
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
if (b[j] == 1)
cnt++;
}
cnt = cnt % 2;
if (cnt != a[i])
b[i] = 1;
}
int zcnt = 0;
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
zcnt++;
}
}
std::cout << zcnt << std::endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
std::cout << i << " ";
}
}
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 776,549 | 776,550 | u275256557 | cpp |
p02972 | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for (long long int i = K; i < N; i++)
#define ll long long int
#define PP 1000000007
using namespace std;
int main() {
ll N, Ans = 0;
cin >> N;
vector<ll> A(N + 1);
vector<bool> B(N + 1);
rep(i, 1, N + 1) {
cin >> A[i];
if (i >= N / 2 + 1) {
B[i] = A[i];
if (A[i] == 1)
Ans++;
}
}
for (ll i = N / 2; i > 0; i--) {
ll j = 2, cnt = 0;
while (i * j <= N) {
cnt += A[i * j];
j++;
}
if (cnt % 2 != A[i]) {
B[i] = 1;
Ans++;
}
}
cout << Ans << endl;
rep(i, 1, N + 1) {
if (B[i])
cout << i << " ";
}
} | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for (long long int i = K; i < N; i++)
#define ll long long int
#define PP 1000000007
using namespace std;
int main() {
ll N, Ans = 0;
cin >> N;
vector<ll> A(N + 1);
vector<bool> B(N + 1);
rep(i, 1, N + 1) {
cin >> A[i];
if (i >= N / 2 + 1) {
B[i] = A[i];
if (A[i] == 1)
Ans++;
}
}
for (ll i = N / 2; i > 0; i--) {
ll j = 2, cnt = 0;
while (i * j <= N) {
cnt += B[i * j];
j++;
}
if (cnt % 2 != A[i]) {
B[i] = 1;
Ans++;
}
}
cout << Ans << endl;
rep(i, 1, N + 1) {
if (B[i])
cout << i << " ";
}
} | [
"assignment.value.change",
"identifier.change"
] | 776,551 | 776,552 | u551500493 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, x, n) for (int i = x; i < (n); i++)
#define vint(a, n) \
vint a(n); \
rep(i, n) cin >> a[i];
#define vll(a, n) \
vll a(n); \
rep(i, n) cin >> a[i];
#define ALL(n) begin(n), end(n)
#define RALL(n) rbegin(n), rend(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint = vector<int>;
using vll = vector<ll>;
using vbool = vector<bool>;
template <class T> using arr = vector<vector<T>>;
template <class T> int popcount(T &a) {
int c = 0;
rep(i, 8 * (int)sizeof(a)) {
if ((a >> i) & 1)
c++;
}
return c;
}
template <class T> void pr(T x) { cout << x << endl; }
template <class T> void prvec(vector<T> &a) {
rep(i, a.size() - 1) { cout << a[i] << " "; }
pr(a[a.size() - 1]);
}
template <class T> void prarr(arr<T> &a) {
rep(i, a.size()) if (a[i].empty()) pr("");
else prvec(a[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) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
vint(a, n);
vint ans(n, 0);
for (int i = n - 1; i >= 0; i--) {
int t = i + 1;
int sum = 0;
for (int j = i + t; j < n; j += t)
sum += ans[i];
sum %= 2;
if (sum != a[i])
ans[i]++;
}
int s = 0;
rep(i, n) s += ans[i];
pr(s);
rep(i, n) {
if (ans[i])
cout << i + 1 << " ";
}
cout << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, x, n) for (int i = x; i < (n); i++)
#define vint(a, n) \
vint a(n); \
rep(i, n) cin >> a[i];
#define vll(a, n) \
vll a(n); \
rep(i, n) cin >> a[i];
#define ALL(n) begin(n), end(n)
#define RALL(n) rbegin(n), rend(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint = vector<int>;
using vll = vector<ll>;
using vbool = vector<bool>;
template <class T> using arr = vector<vector<T>>;
template <class T> int popcount(T &a) {
int c = 0;
rep(i, 8 * (int)sizeof(a)) {
if ((a >> i) & 1)
c++;
}
return c;
}
template <class T> void pr(T x) { cout << x << endl; }
template <class T> void prvec(vector<T> &a) {
rep(i, a.size() - 1) { cout << a[i] << " "; }
pr(a[a.size() - 1]);
}
template <class T> void prarr(arr<T> &a) {
rep(i, a.size()) if (a[i].empty()) pr("");
else prvec(a[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) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
vint(a, n);
vint ans(n, 0);
for (int i = n - 1; i >= 0; i--) {
int t = i + 1;
int sum = 0;
for (int j = i + t; j < n; j += t)
sum += ans[j];
sum %= 2;
if (sum != a[i])
ans[i]++;
}
int s = 0;
rep(i, n) s += ans[i];
pr(s);
rep(i, n) {
if (ans[i])
cout << i + 1 << " ";
}
cout << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 776,557 | 776,558 | u370785250 | cpp |
p02972 | #pragma region header
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// ===============================================================
// using系
#pragma region header
using namespace std;
using lint = long long;
using ld = long double;
using ulint = unsigned long long;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
constexpr lint mod = 1000000007;
constexpr long double pi = 3.141592653589793238462643383279;
#pragma endregion
// ========================================================================
// define
#define INF (lint)10000000000000000;
#define mod (int)1000000007
#pragma region header
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
#pragma endregion
#pragma endregion
lint dp[1000][2020];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> d(n);
vector<bool> ans(n, false);
for (int i = 0; i < n; i++)
cin >> d[i];
for (int i = n - 1; i >= 0; i--) {
int cnt = 0;
for (int j = i; j < n; j += i + 1) {
if (ans[j])
cnt++;
}
if (cnt % 2 != d[i])
ans[i] = true;
}
int cnt = 0;
lint a = 0;
for (int i = 0; i < n; i++) {
if (ans[i])
a++;
}
cout << a << endl;
for (int i = 0; i < a; i++) {
if (ans[i]) {
cout << i + 1;
cnt++;
if (cnt == a)
cout << endl;
else
cout << ' ';
}
}
return 0;
} | #pragma region header
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// ===============================================================
// using系
#pragma region header
using namespace std;
using lint = long long;
using ld = long double;
using ulint = unsigned long long;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
constexpr lint mod = 1000000007;
constexpr long double pi = 3.141592653589793238462643383279;
#pragma endregion
// ========================================================================
// define
#define INF (lint)10000000000000000;
#define mod (int)1000000007
#pragma region header
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
#pragma endregion
#pragma endregion
lint dp[1000][2020];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> d(n);
vector<bool> ans(n, false);
for (int i = 0; i < n; i++)
cin >> d[i];
for (int i = n - 1; i >= 0; i--) {
int cnt = 0;
for (int j = i; j < n; j += i + 1) {
if (ans[j])
cnt++;
}
if (cnt % 2 != d[i])
ans[i] = true;
}
int cnt = 0;
lint a = 0;
for (int i = 0; i < n; i++) {
if (ans[i])
a++;
}
cout << a << endl;
for (int i = 0; i < n; i++) {
if (ans[i]) {
cout << i + 1;
cnt++;
if (cnt == a)
cout << endl;
else
cout << ' ';
}
}
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,565 | 776,566 | u926006934 | cpp |
p02972 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= a[j];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 776,567 | 776,568 | u782144261 | cpp |
p02972 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) { cin >> a[i]; }
bool box[n];
int m = 0;
for (int i = n; i > 0; i--) {
int num = 0;
for (int j = 2 * i; j <= n; j += i) {
if (box[i - 1])
num++;
}
if (num % 2 != a[i - 1]) {
box[i - 1] = true;
m++;
} else
box[i - 1] = false;
}
cout << m << endl;
rep(i, n) {
if (box[i])
cout << i + 1 << " ";
}
cout << endl;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) { cin >> a[i]; }
bool box[n];
int m = 0;
for (int i = n; i > 0; i--) {
int num = 0;
for (int j = 2 * i; j <= n; j += i) {
if (box[j - 1])
num++;
}
// cout << i << " " << num << endl;
if (num % 2 != a[i - 1]) {
box[i - 1] = true;
m++;
} else
box[i - 1] = false;
}
// rep(i, n){
// if(box[i]) cout << 1 << endl;
// else cout << 0 << endl;
// }
cout << m << endl;
rep(i, n) {
if (box[i])
cout << i + 1 << " ";
}
cout << endl;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 776,569 | 776,570 | u416773418 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ball(n + 1, 0);
ll cnt = 0;
for (int i = n; i >= 1; i--) {
ll tmp = 0;
for (int j = i + i; j <= n; j += i) {
tmp += ball[j];
}
if (tmp % 2 != a[i]) {
ball[i] = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= cnt; i++) {
if (ball[i] == 0)
continue;
cout << i << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ball(n + 1, 0);
ll cnt = 0;
for (int i = n; i >= 1; i--) {
ll tmp = 0;
for (int j = i + i; j <= n; j += i) {
tmp += ball[j];
}
if (tmp % 2 != a[i]) {
ball[i] = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (ball[i] == 1)
cout << i << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 776,575 | 776,576 | u221391729 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
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 tmpSum = 0;
for (int j = i + i; j <= n; j += i) {
tmpSum += a[j];
}
if (tmpSum % 2 != a[i]) {
ans[i] = 1;
}
}
vector<int> b;
for (int i = 1; i <= n; i++) {
if (ans[i])
b.push_back(i);
}
cout << b.size() << endl;
for (int i = 0; i < b.size(); i++) {
cout << b[i] << " ";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
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 tmpSum = 0;
for (int j = i + i; j <= n; j += i) {
tmpSum += ans[j];
}
if (tmpSum % 2 != a[i]) {
ans[i] = 1;
}
}
vector<int> b;
for (int i = 1; i <= n; i++) {
if (ans[i])
b.push_back(i);
}
cout << b.size() << endl;
for (int i = 0; i < b.size(); i++) {
cout << b[i] << " ";
}
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 776,577 | 776,578 | u221391729 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int n;
int a[MAXN], FMax[MAXN], SMax[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
FMax[1] = a[1];
SMax[1] = a[1];
for (int i = 2; i <= n; i++) {
if (a[i] >= FMax[i - 1])
FMax[i] = a[i], SMax[i] = FMax[i - 1];
else if (a[i] > SMax[i - 1])
FMax[i] = FMax[i - 1], SMax[i] = a[i];
else
FMax[i] = FMax[i - 1], SMax[i] = SMax[i - 1];
}
for (int i = 1; i <= n; i++)
printf("%d\n", (FMax[n] == a[i]) ? SMax[n] : FMax[n]);
// system("pause");
} | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int n;
int a[MAXN], FMax[MAXN], SMax[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
FMax[1] = a[1];
SMax[1] = 0;
for (int i = 2; i <= n; i++) {
if (a[i] >= FMax[i - 1])
FMax[i] = a[i], SMax[i] = FMax[i - 1];
else if (a[i] > SMax[i - 1])
FMax[i] = FMax[i - 1], SMax[i] = a[i];
else
FMax[i] = FMax[i - 1], SMax[i] = SMax[i - 1];
}
for (int i = 1; i <= n; i++)
printf("%d\n", (FMax[n] == a[i]) ? SMax[n] : FMax[n]);
// system("pause");
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 776,589 | 776,590 | u462461621 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define re(i, x, y) for (int i = x; i < y; i++)
long long INF = 1e9;
const long long mod = 2019;
#define ll long long
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> sum1(N), sum2(N);
rep(i, N) { cin >> a[i]; }
sum1[0] = a[0];
sum2[N - 1] = a[N - 1];
for (int i = 1; i < N; i++) {
if (sum1[i - 1] < a[i]) {
sum1[i] = a[i];
} else {
sum1[i] = sum1[i - 1];
}
}
for (int i = N - 1; i >= 1; i--) {
if (sum2[i] < a[i - 1]) {
sum2[i - 1] = a[i - 1];
} else {
sum2[i - 1] = sum2[i];
}
}
cout << sum2[0] << endl;
for (int i = 1; i < N - 1; i++) {
cout << max(sum1[i - 1], sum2[i + 1]) << endl;
}
cout << sum1[N - 1] << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define re(i, x, y) for (int i = x; i < y; i++)
long long INF = 1e9;
const long long mod = 2019;
#define ll long long
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> sum1(N), sum2(N);
rep(i, N) { cin >> a[i]; }
sum1[0] = a[0];
sum2[N - 1] = a[N - 1];
for (int i = 1; i < N; i++) {
if (sum1[i - 1] < a[i]) {
sum1[i] = a[i];
} else {
sum1[i] = sum1[i - 1];
}
}
for (int i = N - 1; i >= 1; i--) {
if (sum2[i] < a[i - 1]) {
sum2[i - 1] = a[i - 1];
} else {
sum2[i - 1] = sum2[i];
}
}
cout << sum2[1] << endl;
for (int i = 1; i < N - 1; i++) {
cout << max(sum1[i - 1], sum2[i + 1]) << endl;
}
cout << sum1[N - 2] << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,607 | 776,608 | u110653681 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> A(N);
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
}
std::vector<int> max_from(N);
int max_val = A.back();
max_from[N - 1] = max_val;
for (int i = N - 2; i >= 0; --i) {
max_val = std::max(max_val, A[i]);
max_from[i] = max_val;
}
std::vector<int> max_to(N);
max_val = A.front();
max_to[0] = max_val;
for (int i = 1; i < N; ++i) {
max_val = std::max(max_val, A[i]);
max_to[i] = max_val;
}
for (int i = 0; i < N; ++i) {
if (i == 0) {
max_val = max_to[1];
} else if (i == N - 1) {
max_val = max_to[N - 2];
} else {
max_val = std::max(max_to[i - 1], max_from[i + 1]);
}
std::cout << max_val << std::endl;
}
}
| #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> A(N);
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
}
std::vector<int> max_from(N);
int max_val = A.back();
max_from[N - 1] = max_val;
for (int i = N - 2; i >= 0; --i) {
max_val = std::max(max_val, A[i]);
max_from[i] = max_val;
}
std::vector<int> max_to(N);
max_val = A.front();
max_to[0] = max_val;
for (int i = 1; i < N; ++i) {
max_val = std::max(max_val, A[i]);
max_to[i] = max_val;
}
for (int i = 0; i < N; ++i) {
if (i == 0) {
max_val = max_from[1];
} else if (i == N - 1) {
max_val = max_to[N - 2];
} else {
max_val = std::max(max_to[i - 1], max_from[i + 1]);
}
std::cout << max_val << std::endl;
}
}
| [
"assignment.value.change",
"identifier.change"
] | 776,618 | 776,619 | u549516870 | cpp |
p02971 | #include <limits.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n;
scanf("%d", &n);
// get array
int *array = (int *)malloc(sizeof(int) * n);
for (int i = 0; i < n; i++) {
scanf("%d", &array[i]);
}
int max, nextMax;
int maxIndex;
// init
if (array[0] > array[1]) {
max = array[0];
maxIndex = 0;
nextMax = array[1];
} else {
max = array[1];
maxIndex = 1;
nextMax = array[0];
}
for (int i = 2; i < n; i++) {
if (max < array[i]) {
nextMax = max;
max = array[i];
maxIndex = i;
} else if (nextMax < array[i]) {
nextMax = array[i];
}
}
// print
for (int i = 0; i < n; i++) {
if (i == maxIndex)
printf("%d\n", max);
else
printf("%d\n", nextMax);
}
return 0;
}
| #include <limits.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n;
scanf("%d", &n);
// get array
int *array = (int *)malloc(sizeof(int) * n);
for (int i = 0; i < n; i++) {
scanf("%d", &array[i]);
}
int max, nextMax;
int maxIndex;
// init
if (array[0] > array[1]) {
max = array[0];
maxIndex = 0;
nextMax = array[1];
} else {
max = array[1];
maxIndex = 1;
nextMax = array[0];
}
for (int i = 2; i < n; i++) {
if (max < array[i]) {
nextMax = max;
max = array[i];
maxIndex = i;
} else if (nextMax < array[i]) {
nextMax = array[i];
}
}
// print
for (int i = 0; i < n; i++) {
if (i == maxIndex)
printf("%d\n", nextMax);
else
printf("%d\n", max);
}
return 0;
} | [
"call.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"call.add"
] | 776,637 | 776,638 | u069586564 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
cin >> a[0] >> a[1];
int m1 = max(a[0], a[1]), m2 = min(a[0], a[1]);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= m1) {
m2 = m1;
m1 = a[i];
} else if (a[i] >= m2) {
m2 = a[i];
}
}
for (int i = 0; i < n; i++) {
if (a[i] == m1) {
cout << m2 << endl;
;
} else {
cout << m1 << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
cin >> a[0] >> a[1];
int m1 = max(a[0], a[1]), m2 = min(a[0], a[1]);
for (int i = 2; i < n; i++) {
cin >> a[i];
if (a[i] >= m1) {
m2 = m1;
m1 = a[i];
} else if (a[i] >= m2) {
m2 = a[i];
}
}
for (int i = 0; i < n; i++) {
if (a[i] == m1) {
cout << m2 << endl;
;
} else {
cout << m1 << endl;
}
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 776,643 | 776,644 | u320241053 | cpp |
p02971 | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int a, b[210000], c[210000], d;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
c[i] = b[i];
}
sort(c, c + a, greater<int>());
for (int i = 0; i < a; i++) {
if (b[i] == c[0]) {
cout << c[1];
} else
cout << c[0];
}
}
| #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int a, b[210000], c[210000], d;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
c[i] = b[i];
}
sort(c, c + a, greater<int>());
for (int i = 0; i < a; i++) {
if (b[i] == c[0]) {
cout << c[1];
} else
cout << c[0];
cout << endl;
}
}
| [] | 776,675 | 776,676 | u661845689 | cpp |
p02972 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const static int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
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 true;
}
return false;
}
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define rept(i, m, n) for (ll i = m; i < n; i++)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define PF push_front
#define PB push_back
#define SORT(V) sort((V).begin(), (V).end())
#define RVERSE(V) reverse((V).begin(), (V).end())
#define paired make_pair
#define PRINT(V) \
for (auto v : (V)) \
cout << v << " "
// charを整数に
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
// 累積和 for (int i = 0; i < N; ++i) s[i+1] = s[i] + a[i];
void cum_sum(int N, vector<double> a, vector<double> &s) {
for (int i = 0; i < N; i++) {
s[i + 1] = s[i] + a[i];
}
}
//ユークリッドの控除法
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
//最小公倍数
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b; // Be careful not to overflow
}
//素数判定
bool is_prime(long long n) {
if (n <= 1)
return false;
for (long long p = 2; p * p <= n; ++p) {
if (n % p == 0)
return false;
}
return true;
}
int getdigit(ll num) {
unsigned digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
return digit;
}
//空白文字も入力 getline(cin, S);
//桁数指定 setprecision
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll N;
cin >> N;
VLL a(N);
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
VLL ball(N);
ll count = 0;
for (int i = N - 1; i >= 0; i--) {
ll sum = 0;
for (int j = i + 1; j <= N; j += (i + 1)) {
sum += ball[j - 1];
}
if (sum % 2 != a[i]) {
if ((sum + 1) % 2 == a[i]) {
ball[i] = 1;
count++;
} else {
cout << -1 << endl;
return 0;
}
}
}
cout << count << endl;
rep(i, N) {
if (ball[i] == 1) {
cout << i + 1 << endl;
}
}
} | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const static int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
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 true;
}
return false;
}
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define rept(i, m, n) for (ll i = m; i < n; i++)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define PF push_front
#define PB push_back
#define SORT(V) sort((V).begin(), (V).end())
#define RVERSE(V) reverse((V).begin(), (V).end())
#define paired make_pair
#define PRINT(V) \
for (auto v : (V)) \
cout << v << " "
// charを整数に
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
// 累積和 for (int i = 0; i < N; ++i) s[i+1] = s[i] + a[i];
void cum_sum(int N, vector<double> a, vector<double> &s) {
for (int i = 0; i < N; i++) {
s[i + 1] = s[i] + a[i];
}
}
//ユークリッドの控除法
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
//最小公倍数
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b; // Be careful not to overflow
}
//素数判定
bool is_prime(long long n) {
if (n <= 1)
return false;
for (long long p = 2; p * p <= n; ++p) {
if (n % p == 0)
return false;
}
return true;
}
int getdigit(ll num) {
unsigned digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
return digit;
}
//空白文字も入力 getline(cin, S);
//桁数指定 setprecision
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll N;
cin >> N;
VLL a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
VLL ball(N);
ll count = 0;
for (int i = N - 1; i >= 0; i--) {
ll sum = 0;
for (int j = i + 1; j <= N; j += (i + 1)) {
sum += ball[j - 1];
}
if (sum % 2 != a[i]) {
if ((sum + 1) % 2 == a[i]) {
ball[i] = 1;
count++;
} else {
cout << -1 << endl;
return 0;
}
}
}
cout << count << endl;
rep(i, N) {
if (ball[i] == 1) {
cout << i + 1 << endl;
}
}
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,685 | 776,686 | u690326065 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N;
cin >> N;
ll a[N];
rep(i, N) cin >> a[i];
ll M = 0;
ll b[N];
rep(i, N) b[i] = 0;
;
rep(i, N) {
ll I = N - 1 - i;
ll n = N / (I + 1);
ll cnt = 0;
rep(j, n) {
if (a[(I + 1) * (j + 1) - 1] == 1)
cnt++;
}
if (cnt % 2 == 1) {
b[I]++;
M++;
}
}
cout << M << endl;
rep(i, N) {
if (b[i] == 1)
cout << i + 1 << endl;
}
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N;
cin >> N;
ll a[N];
rep(i, N) cin >> a[i];
ll M = 0;
ll b[N];
rep(i, N) b[i] = 0;
;
rep(i, N) {
ll I = N - 1 - i;
ll n = N / (I + 1);
ll cnt = 0;
rep(j, n) {
if (b[(I + 1) * (j + 1) - 1] == 1)
cnt++;
}
if (cnt % 2 != a[I]) {
b[I]++;
M++;
}
}
cout << M << endl;
rep(i, N) {
if (b[i] == 1)
cout << i + 1 << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,687 | 776,688 | u742595961 | cpp |
p02972 | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG // FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <limits> //setprecision
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <utility> // pair, make_pair
#include <vector> // vector
//#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
//#include <unordered_set> //unordered_set
#include <bitset> // bitset
#include <cmath> //abs,,,
#include <deque> // deque
#include <math.h> //pow,,,
#include <stack> // stack
#define endl "\n";
// It is so troublesome that I include bits/stdc++.h !
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 10010010010010;
const long long MOD = 1000000007;
typedef pair<int, int> P;
// Solve N^M. This, mod_pow use Iterative Square Method.
long long mod_pow(long long N, long long M) {
if (M == 0)
return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
//最下位ビット(*N)が1の時は単独でNをかける
if (M & 1)
res = (res * N) % MOD;
return res %= MOD;
}
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
cin >> N;
// 1-indexed
vector<int> retu(N + 1);
for (int i = 1; i <= N; i++)
cin >> retu.at(i);
vector<int> now(N + 10, 0);
vector<int> ans;
for (int i = N; i >= 1; i--) {
// i >= (N+2)/2の時はiの倍数箱目を考える必要はない
//(N+2)/2をすることでNが奇数の場合もカバー
if (retu.at(i) && i >= (N + 2) / 2) {
ans.push_back(i);
now.at(i) = 1;
} else {
// i <= N/2の時はiの倍数箱目を考える必要がある
int sum = 0;
for (int j = 2 * i; j <= N; j += i) {
sum += now.at(i);
}
if (sum % 2 != retu.at(i)) {
ans.push_back(i);
now.at(i) = 1;
}
}
}
cout << ans.size() << endl;
for (int V : ans)
cout << V << endl;
}
| /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG // FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <limits> //setprecision
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <utility> // pair, make_pair
#include <vector> // vector
//#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
//#include <unordered_set> //unordered_set
#include <bitset> // bitset
#include <cmath> //abs,,,
#include <deque> // deque
#include <math.h> //pow,,,
#include <stack> // stack
#define endl "\n";
// It is so troublesome that I include bits/stdc++.h !
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 10010010010010;
const long long MOD = 1000000007;
typedef pair<int, int> P;
// Solve N^M. This, mod_pow use Iterative Square Method.
long long mod_pow(long long N, long long M) {
if (M == 0)
return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
//最下位ビット(*N)が1の時は単独でNをかける
if (M & 1)
res = (res * N) % MOD;
return res %= MOD;
}
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
cin >> N;
// 1-indexed
vector<int> retu(N + 1);
for (int i = 1; i <= N; i++)
cin >> retu.at(i);
vector<int> now(N + 10, 0);
vector<int> ans;
for (int i = N; i >= 1; i--) {
// i >= (N+2)/2の時はiの倍数箱目を考える必要はない
//(N+2)/2をすることでNが奇数の場合もカバー
if (retu.at(i) && i >= (N + 2) / 2) {
ans.push_back(i);
now.at(i) = 1;
} else {
// i <= N/2の時はiの倍数箱目を考える必要がある
int sum = 0;
for (int j = i; j <= N; j += i) {
sum += now.at(j);
}
if (sum % 2 != retu.at(i)) {
ans.push_back(i);
now.at(i) = 1;
}
}
}
cout << ans.size() << endl;
for (int V : ans)
cout << V << endl;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 776,698 | 776,699 | u590927341 | cpp |
p02972 | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using pll = pair<ll, ll>;
using mll = map<ll, ll>;
#define EACH(x, v) for (auto &x : v)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define REFOR(i, a, b) for (ll i = (ll)b - 1; i >= (ll)a; i--)
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REREP(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mp make_pair
const ll INF = 1LL << 60;
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x <= b)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
long double __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << endl; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
template <typename T> void in1(T &s) {
REP(i, s.size()) { in(s[i]); }
}
template <typename T> void in2(T &s, T &t) {
REP(i, s.size()) { in(s[i], t[i]); }
}
template <typename T> void in3(T &s, T &t, T &u) {
REP(i, s.size()) { in(s[i], t[i], u[i]); }
}
template <typename T> void in4(T &s, T &t, T &u, T &v) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i]); }
}
template <typename T> void in5(T &s, T &t, T &u, T &v, T &w) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i], w[i]); }
}
template <typename T> void outv(T s) {
REP(i, s.size()) { cout << s[i] << " "; }
cout << endl;
}
template <typename T> void out1(T s) {
REP(i, s.size()) { out(s[i]); }
}
template <typename T> void out2(T s, T t) {
REP(i, s.size()) { out(s[i], t[i]); }
}
template <typename T> void out3(T s, T t, T u) {
REP(i, s.size()) { out(s[i], t[i], u[i]); }
}
template <typename T> void out4(T s, T t, T u, T v) {
REP(i, s.size()) { out(s[i], t[i], u[i], v[i]); }
}
template <typename T> void out5(T s, T t, T u, T v, T w) {
REP(i, s.size()) { out(s[i], t[i], u[i], v[i], w[i]); }
}
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
template <typename T> T allSum(vector<T> a) {
T ans = T();
EACH(it, a) ans += it;
return ans;
}
ll ceilDiv(ll a, ll b) { return (a + b - 1) / b; }
ld dist(pair<ld, ld> a, pair<ld, ld> b) {
return sqrt(abs(a.fi - b.fi) * abs(a.fi - b.fi) +
abs(a.se - b.se) * abs(a.se - b.se));
} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
#define YES(n) ((n) ? "YES" : "NO")
#define Yes(n) ((n) ? "Yes" : "No")
#define yes(n) ((n) ? "yes" : "no")
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
class UnionFind {
public:
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> siz; // siz[i]:iのサイズ (例) siz[3] = 2 : 3のサイズが2
UnionFind(ll N) : par(N), siz(N, 1LL) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
bool unite(ll x, ll y) { // xとyの木を併合
x = root(x); // xの根をrx
y = root(y); // yの根をry
if (x == y)
return false; // xとyの根が同じ(=同じ木にある)時はそのまま
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] =
x; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
return true;
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
class Dag {
public:
vvl g;
vl inCnt;
vl sorted;
bool sortedF = false;
Dag(ll N) : g(N), inCnt(N) {}
void input(ll x, ll y) {
g[x].pb(y);
inCnt[y]++;
}
bool tpSort() {
vl tmp = inCnt;
deque<ll> dq;
vl ans;
REP(i, g.size()) if (tmp[i] == 0) dq.pb(i);
while (dq.size() != 0) {
ll v = dq.front();
dq.pop_front();
ans.pb(v);
EACH(it, g[v]) {
tmp[it]--;
if (tmp[it] == 0)
dq.pb(it);
}
}
sorted.swap(ans);
sortedF = true;
return sorted.size() == g.size();
}
ll longest() {
if (sortedF == false)
tpSort();
vl dp(g.size(), 0);
ll res = 0;
EACH(it1, sorted) {
EACH(it2, g[it1]) { chmax(dp[it2], dp[it1] + 1); }
chmax(res, dp[it1]);
}
return res;
}
};
int main() {
init();
inl(n);
vl a(n);
in1(a);
vl ans;
REREP(i, n) {
ll cur = i;
ll now = 0;
while (cur < n) {
now ^= a[i];
cur += i + 1;
}
a[i] = now;
if (now == 1)
ans.pb(i);
}
out(ans.size());
REP(i, ans.size()) {
if (i != 0)
cout << " ";
cout << ans[i] + 1;
}
cout << endl;
return 0;
} | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using pll = pair<ll, ll>;
using mll = map<ll, ll>;
#define EACH(x, v) for (auto &x : v)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define REFOR(i, a, b) for (ll i = (ll)b - 1; i >= (ll)a; i--)
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REREP(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mp make_pair
const ll INF = 1LL << 60;
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x <= b)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
long double __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << endl; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
template <typename T> void in1(T &s) {
REP(i, s.size()) { in(s[i]); }
}
template <typename T> void in2(T &s, T &t) {
REP(i, s.size()) { in(s[i], t[i]); }
}
template <typename T> void in3(T &s, T &t, T &u) {
REP(i, s.size()) { in(s[i], t[i], u[i]); }
}
template <typename T> void in4(T &s, T &t, T &u, T &v) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i]); }
}
template <typename T> void in5(T &s, T &t, T &u, T &v, T &w) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i], w[i]); }
}
template <typename T> void outv(T s) {
REP(i, s.size()) { cout << s[i] << " "; }
cout << endl;
}
template <typename T> void out1(T s) {
REP(i, s.size()) { out(s[i]); }
}
template <typename T> void out2(T s, T t) {
REP(i, s.size()) { out(s[i], t[i]); }
}
template <typename T> void out3(T s, T t, T u) {
REP(i, s.size()) { out(s[i], t[i], u[i]); }
}
template <typename T> void out4(T s, T t, T u, T v) {
REP(i, s.size()) { out(s[i], t[i], u[i], v[i]); }
}
template <typename T> void out5(T s, T t, T u, T v, T w) {
REP(i, s.size()) { out(s[i], t[i], u[i], v[i], w[i]); }
}
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
template <typename T> T allSum(vector<T> a) {
T ans = T();
EACH(it, a) ans += it;
return ans;
}
ll ceilDiv(ll a, ll b) { return (a + b - 1) / b; }
ld dist(pair<ld, ld> a, pair<ld, ld> b) {
return sqrt(abs(a.fi - b.fi) * abs(a.fi - b.fi) +
abs(a.se - b.se) * abs(a.se - b.se));
} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
#define YES(n) ((n) ? "YES" : "NO")
#define Yes(n) ((n) ? "Yes" : "No")
#define yes(n) ((n) ? "yes" : "no")
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
class UnionFind {
public:
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> siz; // siz[i]:iのサイズ (例) siz[3] = 2 : 3のサイズが2
UnionFind(ll N) : par(N), siz(N, 1LL) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
bool unite(ll x, ll y) { // xとyの木を併合
x = root(x); // xの根をrx
y = root(y); // yの根をry
if (x == y)
return false; // xとyの根が同じ(=同じ木にある)時はそのまま
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] =
x; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
return true;
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
class Dag {
public:
vvl g;
vl inCnt;
vl sorted;
bool sortedF = false;
Dag(ll N) : g(N), inCnt(N) {}
void input(ll x, ll y) {
g[x].pb(y);
inCnt[y]++;
}
bool tpSort() {
vl tmp = inCnt;
deque<ll> dq;
vl ans;
REP(i, g.size()) if (tmp[i] == 0) dq.pb(i);
while (dq.size() != 0) {
ll v = dq.front();
dq.pop_front();
ans.pb(v);
EACH(it, g[v]) {
tmp[it]--;
if (tmp[it] == 0)
dq.pb(it);
}
}
sorted.swap(ans);
sortedF = true;
return sorted.size() == g.size();
}
ll longest() {
if (sortedF == false)
tpSort();
vl dp(g.size(), 0);
ll res = 0;
EACH(it1, sorted) {
EACH(it2, g[it1]) { chmax(dp[it2], dp[it1] + 1); }
chmax(res, dp[it1]);
}
return res;
}
};
int main() {
init();
inl(n);
vl a(n);
in1(a);
vl ans;
REREP(i, n) {
ll cur = i;
ll now = 0;
while (cur < n) {
now ^= a[cur];
cur += i + 1;
}
a[i] = now;
if (now == 1)
ans.pb(i);
}
out(ans.size());
REP(i, ans.size()) {
if (i != 0)
cout << " ";
cout << ans[i] + 1;
}
cout << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 776,703 | 776,704 | u145483532 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long modpow(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return (t * t) % mod;
} else {
return (modpow(m, n - 1) * m) % mod;
}
}
void yes() {
cout << "Yes" << endl;
exit(0);
}
void no() {
cout << "No" << endl;
exit(0);
}
#define REP(i, n) for (long long i = 0; i < (n); i++)
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
struct LCA {
vector<vector<int>> par;
vector<int> d;
int n;
LCA(vector<vector<int>> graph, int root) {
n = graph.size();
par.resize(n, vector<int>(30));
d.resize(n, 0);
function<void(int, int, int)> dfs = [&](int c, int p, int depth) {
d[c] = depth;
par[c][0] = p;
for (auto ch : graph[c]) {
if (ch != p)
dfs(ch, c, depth + 1);
}
};
dfs(0, 0, 0);
for (int j = 1; j < 30; j++) {
REP(i, n) { par[i][j] = par[par[i][j - 1]][j - 1]; }
}
}
int getdistance(int u, int v) { return (d[u] + d[v]) - 2 * (d[query(u, v)]); }
int query(int u, int v) {
if (d[u] > d[v]) {
swap(u, v);
}
for (int i = 29; 0 <= i; i--) {
if (d[u] <= d[par[v][i]]) {
v = par[v][i];
}
}
/* LCA */
for (int i = 29; 0 <= i; i--) {
if (par[v][i] != par[u][i]) {
v = par[v][i];
u = par[u][i];
}
}
if (u == v) {
return u;
} else {
return par[v][0];
}
}
};
struct UnionFind {
vector<int> parent, size;
UnionFind(int n) {
parent.resize(n, -1);
size.resize(n, 1);
}
void unite(int x, int y) {
if (same(x, y)) {
return;
}
x = root(x);
y = root(y);
if (size[x] <= size[y]) {
swap(x, y);
}
parent[y] = x;
size[x] += size[y];
}
bool same(int x, int y) { return (root(x) == root(y)); }
int root(int x) {
while (parent[x] != -1) {
x = parent[x];
}
return x;
}
int getsize(int x) { return size[root(x)]; }
};
void aoj(vector<int> bs) {
REP(i, bs.size() - 1) { cout << bs[i] << " "; }
cout << bs[bs.size() - 1] << endl;
}
signed main() {
int n;
cin >> n;
vector<int> as(n + 1);
vector<int> ans(n, 0);
REP(i, n) { cin >> as[i + 1]; }
int m = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
if (ans[i - 1] == 1) {
sum++;
}
}
if ((sum % 2) != as[i]) {
ans[i - 1] = 1;
m++;
}
}
cout << m << endl;
for (int i = 0; i < n; i++) {
if (ans[i] != 0) {
cout << i + 1 << " ";
}
}
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long modpow(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return (t * t) % mod;
} else {
return (modpow(m, n - 1) * m) % mod;
}
}
void yes() {
cout << "Yes" << endl;
exit(0);
}
void no() {
cout << "No" << endl;
exit(0);
}
#define REP(i, n) for (long long i = 0; i < (n); i++)
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
struct LCA {
vector<vector<int>> par;
vector<int> d;
int n;
LCA(vector<vector<int>> graph, int root) {
n = graph.size();
par.resize(n, vector<int>(30));
d.resize(n, 0);
function<void(int, int, int)> dfs = [&](int c, int p, int depth) {
d[c] = depth;
par[c][0] = p;
for (auto ch : graph[c]) {
if (ch != p)
dfs(ch, c, depth + 1);
}
};
dfs(0, 0, 0);
for (int j = 1; j < 30; j++) {
REP(i, n) { par[i][j] = par[par[i][j - 1]][j - 1]; }
}
}
int getdistance(int u, int v) { return (d[u] + d[v]) - 2 * (d[query(u, v)]); }
int query(int u, int v) {
if (d[u] > d[v]) {
swap(u, v);
}
for (int i = 29; 0 <= i; i--) {
if (d[u] <= d[par[v][i]]) {
v = par[v][i];
}
}
/* LCA */
for (int i = 29; 0 <= i; i--) {
if (par[v][i] != par[u][i]) {
v = par[v][i];
u = par[u][i];
}
}
if (u == v) {
return u;
} else {
return par[v][0];
}
}
};
struct UnionFind {
vector<int> parent, size;
UnionFind(int n) {
parent.resize(n, -1);
size.resize(n, 1);
}
void unite(int x, int y) {
if (same(x, y)) {
return;
}
x = root(x);
y = root(y);
if (size[x] <= size[y]) {
swap(x, y);
}
parent[y] = x;
size[x] += size[y];
}
bool same(int x, int y) { return (root(x) == root(y)); }
int root(int x) {
while (parent[x] != -1) {
x = parent[x];
}
return x;
}
int getsize(int x) { return size[root(x)]; }
};
void aoj(vector<int> bs) {
REP(i, bs.size() - 1) { cout << bs[i] << " "; }
cout << bs[bs.size() - 1] << endl;
}
signed main() {
int n;
cin >> n;
vector<int> as(n + 1);
vector<int> ans(n, 0);
REP(i, n) { cin >> as[i + 1]; }
int m = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
if (ans[j - 1] == 1) {
sum++;
}
}
if ((sum % 2) != as[i]) {
ans[i - 1] = 1;
m++;
}
}
cout << m << endl;
for (int i = 0; i < n; i++) {
if (ans[i] != 0) {
cout << i + 1 << " ";
}
}
} | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 776,705 | 776,706 | u687204015 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// #define cerr if(false)cerr
#define watch(x) cerr << "> " << #x << ": " << x << "\n";
using namespace std;
template <typename T>
std::ostream &operator<<(std::ostream &out, vector<T> &v) {
for (typename vector<T>::size_type i = 0; i < v.size(); ++i)
out << v[i] << " ";
out << "\n";
return out;
}
template <typename T, typename N>
std::ostream &operator<<(std::ostream &out, vector<pair<T, N>> &v) {
for (size_t i = 0; i < v.size(); ++i)
out << "(" << v[i].first << ", " << v[i].second << ") ";
out << "\n";
return out;
}
template <typename T>
std::ostream &operator<<(std::ostream &out, vector<vector<T>> &v) {
for (size_t i = 0; i < v.size(); ++i) {
for (size_t j = 0; j < v[i].size(); ++j) {
out << v[i][j] << " ";
}
out << "\n";
}
return out;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
vector<int> total_balls(n + 1), has_ball(n + 1);
int m = 0;
for (int i = n; i > 1; --i) {
if (a[i]) {
if (total_balls[i] % 2 == 0) {
++total_balls[i];
has_ball[i] = 1;
++m;
}
} else {
if (total_balls[i] & 1) {
++total_balls[i];
has_ball[i] = 1;
++m;
}
}
if (total_balls[i]) {
++total_balls[1];
for (int j = 2; j * j <= i; ++j) {
if (i % j == 0) {
++total_balls[j];
int k = i / j;
if (k != j) {
++total_balls[k];
}
}
}
}
}
if (total_balls[1] % 2 != a[1] % 2) {
++total_balls[1];
has_ball[1] = 1;
}
cout << m + (has_ball[1] != 0) << "\n";
for (int i = 1; i <= n; ++i) {
if (has_ball[i]) {
cout << i << " ";
}
}
cout << "\n";
return 0;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// #define cerr if(false)cerr
#define watch(x) cerr << "> " << #x << ": " << x << "\n";
using namespace std;
template <typename T>
std::ostream &operator<<(std::ostream &out, vector<T> &v) {
for (typename vector<T>::size_type i = 0; i < v.size(); ++i)
out << v[i] << " ";
out << "\n";
return out;
}
template <typename T, typename N>
std::ostream &operator<<(std::ostream &out, vector<pair<T, N>> &v) {
for (size_t i = 0; i < v.size(); ++i)
out << "(" << v[i].first << ", " << v[i].second << ") ";
out << "\n";
return out;
}
template <typename T>
std::ostream &operator<<(std::ostream &out, vector<vector<T>> &v) {
for (size_t i = 0; i < v.size(); ++i) {
for (size_t j = 0; j < v[i].size(); ++j) {
out << v[i][j] << " ";
}
out << "\n";
}
return out;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
vector<int> total_balls(n + 1), has_ball(n + 1);
int m = 0;
for (int i = n; i > 1; --i) {
if (a[i]) {
if (total_balls[i] % 2 == 0) {
++total_balls[i];
has_ball[i] = 1;
++m;
}
} else {
if (total_balls[i] & 1) {
++total_balls[i];
has_ball[i] = 1;
++m;
}
}
if (has_ball[i]) {
++total_balls[1];
for (int j = 2; j * j <= i; ++j) {
if (i % j == 0) {
++total_balls[j];
int k = i / j;
if (k != j) {
++total_balls[k];
}
}
}
}
}
if (total_balls[1] % 2 != a[1] % 2) {
++total_balls[1];
has_ball[1] = 1;
}
cout << m + (has_ball[1] != 0) << "\n";
for (int i = 1; i <= n; ++i) {
if (has_ball[i]) {
cout << i << " ";
}
}
cout << "\n";
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,710 | 776,711 | u314543767 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ii = pair<ll, ll>;
using vi = vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(), (x).end()
#define print(a) \
; \
for (auto x : a) \
cout << x << " "; \
cout << "\n";
#define mset(a) \
; \
memset(a, 0, sizeof(a));
int main() {
// ios_base::sync_with_stdio(0);cin.tie(0);
ll n;
cin >> n;
ll a[n + 1];
ll dp[n + 1];
mset(dp);
vi ans;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
ll cnt = 0;
for (int j = i; j <= n; j += i) {
cnt += dp[j];
}
if (cnt % 2 != a[i]) {
a[i] = 1;
ans.pb(i);
}
}
cout << ans.size() << "\n";
print(ans);
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ii = pair<ll, ll>;
using vi = vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(), (x).end()
#define print(a) \
; \
for (auto x : a) \
cout << x << " "; \
cout << "\n";
#define mset(a) \
; \
memset(a, 0, sizeof(a));
int main() {
// ios_base::sync_with_stdio(0);cin.tie(0);
ll n;
cin >> n;
ll a[n + 1];
ll dp[n + 1];
mset(dp);
vi ans;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
ll cnt = 0;
for (int j = i; j <= n; j += i) {
cnt += dp[j];
}
if (cnt % 2 != a[i]) {
dp[i] = 1;
ans.pb(i);
}
}
cout << ans.size() << "\n";
print(ans);
}
| [
"assignment.variable.change",
"identifier.change"
] | 776,712 | 776,713 | u596724731 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
while (true) {
if (q > n)
break;
q = (i + 1) * j;
sum += a[q - 1];
j++;
}
if (sum % 2 != a[i])
b[i] = 1, m++;
}
cout << m << "\n";
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
cout << i + 1;
if (i != n - 1)
cout << " ";
}
}
cout << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
// cout<<i<<" ";
while (true) {
if (q > n)
break;
// cout<<q<<" ";
q = (i + 1) * j;
sum += b[q - 1];
j++;
}
// cout<<sum<<"\n";
if (sum % 2 != a[i])
b[i] = 1, m++;
}
cout << m << "\n";
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
cout << i + 1;
if (i != n - 1)
cout << " ";
}
}
cout << "\n";
}
| [
"assignment.value.change",
"identifier.change"
] | 776,718 | 776,719 | u831161882 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
while (true) {
if (q > n)
break;
q = (i + 1) * j;
sum += a[q - 1];
j++;
}
if (sum != a[i])
b[i] = 1, m++;
}
cout << m << "\n";
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
cout << i + 1;
if (i != n - 1)
cout << " ";
}
}
cout << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
// cout<<i<<" ";
while (true) {
if (q > n)
break;
// cout<<q<<" ";
q = (i + 1) * j;
sum += b[q - 1];
j++;
}
// cout<<sum<<"\n";
if (sum % 2 != a[i])
b[i] = 1, m++;
}
cout << m << "\n";
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
cout << i + 1;
if (i != n - 1)
cout << " ";
}
}
cout << "\n";
}
| [
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 776,720 | 776,719 | u831161882 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
while (true) {
if (q > n)
break;
q = (i + 1) * j;
sum = a[q - 1];
j++;
}
if (sum != a[i])
b[i] = 1, m++;
}
cout << m << "\n";
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
cout << i + 1;
if (i != n - 1)
cout << " ";
}
}
cout << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
// cout<<i<<" ";
while (true) {
if (q > n)
break;
// cout<<q<<" ";
q = (i + 1) * j;
sum += b[q - 1];
j++;
}
// cout<<sum<<"\n";
if (sum % 2 != a[i])
b[i] = 1, m++;
}
cout << m << "\n";
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
cout << i + 1;
if (i != n - 1)
cout << " ";
}
}
cout << "\n";
}
| [
"assignment.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 776,721 | 776,719 | u831161882 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[100000], b[100000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
while (true) {
if (q > n)
break;
q = (i + 1) * j;
sum = a[q - 1];
j++;
}
if (sum != a[i])
b[i] = 1, m++;
}
cout << m << "\n";
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
cout << i + 1;
if (i != n - 1)
cout << " ";
}
}
cout << "\n";
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
// cout<<i<<" ";
while (true) {
if (q > n)
break;
// cout<<q<<" ";
q = (i + 1) * j;
sum += b[q - 1];
j++;
}
// cout<<sum<<"\n";
if (sum % 2 != a[i])
b[i] = 1, m++;
}
cout << m << "\n";
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
cout << i + 1;
if (i != n - 1)
cout << " ";
}
}
cout << "\n";
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 776,722 | 776,719 | u831161882 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
auto a = vector<ll>(n + 1, 0);
auto h = vector<ll>(n + 1, 0);
auto b = vector<ll>();
for (ll i = 1; i < n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
bool sum = false;
for (ll j = i; j <= n; j += i)
sum ^= h[j];
h[i] = sum ^ a[i];
if (h[i])
b.push_back(i);
}
cout << b.size() << endl;
for (auto i : b)
cout << i << " ";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
auto a = vector<ll>(n + 1, 0);
auto h = vector<ll>(n + 1, 0);
auto b = vector<ll>();
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
bool sum = false;
for (ll j = i; j <= n; j += i)
sum ^= h[j];
h[i] = sum ^ a[i];
if (h[i])
b.push_back(i);
}
cout << b.size() << endl;
for (auto i : b)
cout << i << " ";
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,725 | 776,726 | u533749093 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
auto a = vector<ll>(n + 1, 0);
auto h = vector<ll>(n + 1, 0);
auto b = vector<ll>();
for (ll i = 1; i < n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
bool sum = false;
for (ll j = i; j < n; j += i)
sum ^= h[j];
h[i] = sum ^ a[i];
if (h[i])
b.push_back(i);
}
cout << b.size() << endl;
for (auto i : b)
cout << i << " ";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
auto a = vector<ll>(n + 1, 0);
auto h = vector<ll>(n + 1, 0);
auto b = vector<ll>();
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
bool sum = false;
for (ll j = i; j <= n; j += i)
sum ^= h[j];
h[i] = sum ^ a[i];
if (h[i])
b.push_back(i);
}
cout << b.size() << endl;
for (auto i : b)
cout << i << " ";
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,727 | 776,726 | u533749093 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
auto a = vector<ll>(n + 1, 0);
auto h = vector<ll>(n + 1, 0);
auto b = vector<ll>();
for (ll i = 1; i < n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
bool sum = false;
for (ll j = 2 * i; j < n; j += i)
sum ^= h[j];
h[i] = sum ^ a[i];
if (h[i])
b.push_back(i);
}
cout << b.size() << endl;
for (auto i : b)
cout << i << " ";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
auto a = vector<ll>(n + 1, 0);
auto h = vector<ll>(n + 1, 0);
auto b = vector<ll>();
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
bool sum = false;
for (ll j = i; j <= n; j += i)
sum ^= h[j];
h[i] = sum ^ a[i];
if (h[i])
b.push_back(i);
}
cout << b.size() << endl;
for (auto i : b)
cout << i << " ";
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 776,728 | 776,726 | u533749093 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N + 1);
for (int i = 1; i < N; i++) {
cin >> p.at(i);
}
vector<int> q(N + 1);
vector<int> r = {};
for (int i = N; i > 0; i--) {
int Z = 0;
for (int j = 1; j <= N / i; j++) {
Z += q.at(j * i);
}
if (Z % 2 != p.at(i)) {
q.at(i) = 1;
r.push_back(i);
}
}
cout << r.size() << endl;
for (int i = 0; i < r.size(); i++) {
cout << r.at(i);
if (i < r.size() - 1) {
cout << " ";
}
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N + 1);
for (int i = 1; i <= N; i++) {
cin >> p.at(i);
}
vector<int> q(N + 1);
vector<int> r = {};
for (int i = N; i > 0; i--) {
int Z = 0;
for (int j = 1; j <= N / i; j++) {
Z += q.at(j * i);
}
if (Z % 2 != p.at(i)) {
q.at(i) = 1;
r.push_back(i);
}
}
cout << r.size() << endl;
for (int i = 0; i < r.size(); i++) {
cout << r.at(i);
if (i < r.size() - 1) {
cout << " ";
}
}
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,731 | 776,732 | u158290747 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> c(N, 0);
for (int i = N - 1; i >= 0; i--) {
c[i] = a[i];
for (int j = 2 * i + 1; j < N; j += i + 1) {
c[i] ^= a[j];
}
}
vector<int> b;
for (int i = 0; i < N; i++) {
if (c[i] == 1) {
b.push_back(i + 1);
}
}
int M = b.size();
cout << M << endl;
for (int i = 0; i < M; i++) {
cout << b[i];
if (i < M - 1) {
cout << ' ';
}
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> c(N, 0);
for (int i = N - 1; i >= 0; i--) {
c[i] = a[i];
for (int j = 2 * i + 1; j < N; j += i + 1) {
c[i] ^= c[j];
}
}
vector<int> b;
for (int i = 0; i < N; i++) {
if (c[i] == 1) {
b.push_back(i + 1);
}
}
int M = b.size();
cout << M << endl;
for (int i = 0; i < M; i++) {
cout << b[i];
if (i < M - 1) {
cout << ' ';
}
}
cout << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 776,733 | 776,734 | u424374375 | cpp |
p02972 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++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) {
a = b;
return 1;
}
return 0;
}
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9 + 7;
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
// 割り算の切り上げ処理
template <typename T> T rp(T a, T b) { return (a + b - 1) / b; }
// 桁和
template <typename T> T digsum(T n) {
T res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
// 回文判定
bool kai(string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int main(void) {
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> ans(n);
ll count = 0;
for (int i = n - 1; i >= 0; --i) {
ll num = i + 1;
ll sum = 0;
ll tmp = 2;
while (num * tmp < n) {
ll ind = num * tmp;
sum += ans[ind - 1];
tmp++;
}
if (sum % 2 != a[i]) {
ans[i]++;
count++;
}
}
print(count);
rep(i, n) {
if (ans[i])
print(i + 1);
}
}
| #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++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) {
a = b;
return 1;
}
return 0;
}
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9 + 7;
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
// 割り算の切り上げ処理
template <typename T> T rp(T a, T b) { return (a + b - 1) / b; }
// 桁和
template <typename T> T digsum(T n) {
T res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
// 回文判定
bool kai(string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int main(void) {
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> ans(n);
ll count = 0;
for (int i = n - 1; i >= 0; --i) {
ll num = i + 1;
ll sum = 0;
ll tmp = 2;
while (num * tmp <= n) {
ll ind = num * tmp;
sum += ans[ind - 1];
tmp++;
}
if (sum % 2 != a[i]) {
ans[i]++;
count++;
}
}
print(count);
rep(i, n) {
if (ans[i])
print(i + 1);
}
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 776,737 | 776,738 | u135572611 | cpp |
p02972 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++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) {
a = b;
return 1;
}
return 0;
}
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9 + 7;
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
// 割り算の切り上げ処理
template <typename T> T rp(T a, T b) { return (a + b - 1) / b; }
// 桁和
template <typename T> T digsum(T n) {
T res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
// 回文判定
bool kai(string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int main(void) {
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> box(n);
vector<ll> ans;
for (int i = n - 1; i >= 0; --i) {
ll num = i + 1;
ll sum = 0;
for (int j = num + num; j < n; j += num) {
sum += box[j - 1];
}
if (sum % 2 != a[i]) {
box[i]++;
ans.push_back(i + 1);
}
}
print(ans.size());
rep(i, sz(ans)) { print(ans[i]); }
}
| #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++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) {
a = b;
return 1;
}
return 0;
}
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9 + 7;
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
// 割り算の切り上げ処理
template <typename T> T rp(T a, T b) { return (a + b - 1) / b; }
// 桁和
template <typename T> T digsum(T n) {
T res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
// 回文判定
bool kai(string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int main(void) {
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> box(n);
vector<ll> ans;
for (int i = n - 1; i >= 0; --i) {
ll num = i + 1;
ll sum = 0;
for (int j = num + num; j <= n; j += num) {
sum += box[j - 1];
}
if (sum % 2 != a[i]) {
box[i]++;
ans.push_back(i + 1);
}
}
print(ans.size());
rep(i, sz(ans)) { print(ans[i]); }
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,739 | 776,740 | u135572611 | cpp |
p02972 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++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) {
a = b;
return 1;
}
return 0;
}
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9 + 7;
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
// 割り算の切り上げ処理
template <typename T> T rp(T a, T b) { return (a + b - 1) / b; }
// 桁和
template <typename T> T digsum(T n) {
T res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
// 回文判定
bool kai(string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int main(void) {
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> box(n);
set<ll> ans;
for (int i = n - 1; i >= 0; --i) {
ll num = i + 1;
ll sum = 0;
for (int j = num + num; j < n; j += num) {
sum += box[j - 1];
}
if (sum % 2 != a[i]) {
box[i] = 1;
ans.insert(i + 1);
}
}
print(ans.size());
if (ans.size()) {
for (auto a : ans) {
print(a);
}
}
}
| #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++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) {
a = b;
return 1;
}
return 0;
}
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9 + 7;
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
// 割り算の切り上げ処理
template <typename T> T rp(T a, T b) { return (a + b - 1) / b; }
// 桁和
template <typename T> T digsum(T n) {
T res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
// 回文判定
bool kai(string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int main(void) {
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> box(n);
set<ll> ans;
for (int i = n - 1; i >= 0; --i) {
ll num = i + 1;
ll sum = 0;
for (int j = num + num; j <= n; j += num) {
sum += box[j - 1];
}
if (sum % 2 != a[i]) {
box[i] = 1;
ans.insert(i + 1);
}
}
print(ans.size());
if (ans.size()) {
for (auto a : ans) {
print(a);
}
}
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,741 | 776,742 | u135572611 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<long long, long long>;
using veci = vector<int>;
using vecl = vector<long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
int main() {
int N;
cin >> N;
veci A(N);
REP(i, N) cin >> A[i];
veci ans(N);
for (int i = N - 1; i >= 0; --i) {
int total = 0;
for (int j = 2; j <= N / (i + 1); j++)
total += A[(i + 1) * j - 1];
if (total % 2 == A[i])
ans[i] = 0;
else
ans[i] = 1;
}
veci b;
for (int i = 0; i < N; i++) {
if (ans[i])
b.push_back(i + 1);
}
cout << b.size() << endl;
if (b.size() > 0) {
for (int i : b)
cout << i << " ";
cout << endl;
}
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<long long, long long>;
using veci = vector<int>;
using vecl = vector<long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
int main() {
int N;
cin >> N;
veci A(N);
REP(i, N) cin >> A[i];
veci ans(N);
for (int i = N - 1; i >= 0; --i) {
int total = 0;
for (int j = 2; j <= N / (i + 1); j++)
total += ans[(i + 1) * j - 1];
if (total % 2 == A[i])
ans[i] = 0;
else
ans[i] = 1;
}
veci b;
for (int i = 0; i < N; i++) {
if (ans[i])
b.push_back(i + 1);
}
cout << b.size() << endl;
if (b.size() > 0) {
for (int i : b)
cout << i << " ";
cout << endl;
}
}
| [
"assignment.value.change",
"identifier.change"
] | 776,743 | 776,744 | u446371873 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[200005], b[200005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--)
for (int j = i * 2; j <= n; j++)
a[i] ^= a[j];
int ttl = 0;
for (int i = 1; i <= n; i++)
if (a[i])
ttl++;
cout << ttl << endl;
for (int i = 1; i <= n; i++)
if (a[i])
cout << i << " ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int a[200005], b[200005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--)
for (int j = i * 2; j <= n; j += i)
a[i] ^= a[j];
int ttl = 0;
for (int i = 1; i <= n; i++)
if (a[i])
ttl++;
cout << ttl << endl;
for (int i = 1; i <= n; i++)
if (a[i])
cout << i << " ";
cout << endl;
}
| [] | 776,748 | 776,749 | u729337236 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[100005], b[100005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--)
for (int j = i * 2; j <= n; j++)
a[i] ^= a[j];
int ttl = 0;
for (int i = 1; i <= n; i++)
if (a[i])
ttl++;
cout << ttl << endl;
for (int i = 1; i <= n; i++)
if (a[i])
cout << i << " ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int a[200005], b[200005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--)
for (int j = i * 2; j <= n; j += i)
a[i] ^= a[j];
int ttl = 0;
for (int i = 1; i <= n; i++)
if (a[i])
ttl++;
cout << ttl << endl;
for (int i = 1; i <= n; i++)
if (a[i])
cout << i << " ";
cout << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 776,750 | 776,749 | u729337236 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), \
cout << fixed << setprecision(20);
#define int long long
#define double long double
const int INF = 1e18, MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
int a[222222];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ans[222222] = {};
for (int i = n; i > 0; i--) {
for (int j = i * 2; j <= n; j += j) {
a[i] += ans[j];
}
if (a[i] % 2) {
ans[i] = 1;
}
}
int length = 0;
for (int i = 1; i <= n; i++) {
if (ans[i])
length++;
}
cout << length << endl;
for (int i = 1; i <= n; i++) {
if (ans[i])
cout << i << ' ';
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), \
cout << fixed << setprecision(20);
#define int long long
#define double long double
const int INF = 1e18, MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
int a[222222];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ans[222222] = {};
for (int i = n; i > 0; i--) {
for (int j = i * 2; j <= n; j += i) {
a[i] += ans[j];
}
if (a[i] % 2) {
ans[i] = 1;
}
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (ans[i])
cnt++;
}
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (ans[i])
cout << i << ' ';
}
cout << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_declaration.name.change",
"io.output.change"
] | 776,764 | 776,765 | u303059352 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const long long MOD = 2;
void solve(long long N, std::vector<long long> a) {
vector<ll> ans;
vector<int> hasBall(N, 0);
for (int i = N - 1; i >= 0; --i) {
ll num = i + 1;
ll t = 2;
ll sum = a[i];
while (num * t < N) {
sum += hasBall[num * t - 1];
++t;
}
if (sum % 2 == 1) {
hasBall[i] = 1;
ans.push_back(num);
}
}
cout << ans.size() << endl;
sort(ans.begin(), ans.end());
for (ll num : ans) {
cout << num << endl;
}
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips:
// You use the default template now. You can remove this line by using your
// custom template)
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> a(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &a[i]);
}
solve(N, std::move(a));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const long long MOD = 2;
void solve(long long N, std::vector<long long> a) {
vector<ll> ans;
vector<int> hasBall(N, 0);
for (int i = N - 1; i >= 0; --i) {
ll num = i + 1;
ll t = 2;
ll sum = a[i];
while (num * t <= N) {
sum += hasBall[num * t - 1];
++t;
}
if (sum % 2 == 1) {
hasBall[i] = 1;
ans.push_back(num);
}
}
cout << ans.size() << endl;
sort(ans.begin(), ans.end());
for (ll num : ans) {
cout << num << endl;
}
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips:
// You use the default template now. You can remove this line by using your
// custom template)
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> a(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &a[i]);
}
solve(N, std::move(a));
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 776,768 | 776,769 | u943966256 | 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[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j * i < n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
for (int i : ans)
cout << i << endl;
return 0;
} | #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[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
for (int i : ans)
cout << i << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 776,770 | 776,771 | u894496005 | cpp |
p02972 | //----AUTHOR:kkdrummer----/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
// typedef unordered_set<ll> usll;
// typedef unordered_multiset<ll> umsll;
typedef multiset<ll> msll;
typedef set<ll> sll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll> pqll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
// typedef unordered_multiset<int> umsi;
// typedef unordered_set<int> usi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef set<pi> spi;
typedef priority_queue<int> pqi;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ind_set;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ind_setll;
#define in insert
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define be begin
#define en end
#define itr iterator
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mo 998244353
#define inf 9223372026854775807
#define ninf -inf
#define ima 2047483647
#define imi -ima
#define oncnt __builtin_popcount
#define zerobegin __builtin_clz
#define zeroend __builtin_ctz
#define parity __builtin_parity
#define all(x) x.be(), x.en()
#define eps 1e-9
#define coutd cout << setprecision(12) << fixed
#define mems(dp, x) memset(dp, x, sizeof(dp))
#define fbo find_by_order
#define ook order_of_key
#define upb upper_bound
#define lowb lower_bound
#define lte(v, x) upb(all(v), x) - v.be()
#define gte(v, x) v.end() - lowb(all(v), x)
const ld PI = 3.1415926535897932384626433832792884197169399375105820974944;
inline ll modpow(ll x, ll n) {
if (x == 0)
return 0;
if (n == 0)
return 1;
if (n == 1)
return (x % mo);
ll u = (modpow(x, n / 2));
u = (u * u) % mo;
if (n % 2 != 0)
u = (u * x % mo) % mo;
return u;
}
inline ll modinv(ll x) { return modpow(x, mo - 2); }
inline ll mmul(ll a, ll b) {
if (a >= mo)
a = a % mo;
if (b >= mo)
b = b % mo;
if (a * b >= mo)
return (a * b) % mo;
return (a * b);
}
inline ll madd(ll a, ll b) {
if (a >= mo)
a = a % mo;
if (b >= mo)
b = b % mo;
if (a + b >= mo)
return (a + b) % mo;
return (a + b);
}
inline ll msub(ll a, ll b) {
if (a >= mo)
a = a % mo;
if (b >= mo)
b = b % mo;
return (((a - b) % mo + mo) % mo);
}
inline ll mdiv(ll a, ll bb) {
if (a >= mo)
a = a % mo;
ll b = modinv(bb);
if (b >= mo)
b = b % mo;
if (a * b >= mo)
return (a * b) % mo;
return (a * b);
}
inline ll gcd(ll a, ll b) { return __gcd(a, b); }
inline ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int main() {
io int testcases = 1; // cin>>testcases;
while (testcases--) {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int b[n + 1] = {0};
int c = 0;
for (int i = n; i >= 1; i--) {
int va = 0;
for (int j = i * 2; j <= n; j++) {
va += b[j];
}
if (a[i] == 1) {
if (va % 2 == 0)
b[i] = 1;
else
b[i] = 0;
} else {
if (va % 2 == 0)
b[i] = 0;
else
b[i] = 1;
}
if (b[i] == 1)
c++;
}
cout << c << "\n";
for (int i = 1; i <= n; i++) {
if (b[i])
cout << i << " ";
}
}
return 0;
} | //----AUTHOR:kkdrummer----/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
// typedef unordered_set<ll> usll;
// typedef unordered_multiset<ll> umsll;
typedef multiset<ll> msll;
typedef set<ll> sll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll> pqll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
// typedef unordered_multiset<int> umsi;
// typedef unordered_set<int> usi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef set<pi> spi;
typedef priority_queue<int> pqi;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ind_set;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ind_setll;
#define in insert
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define be begin
#define en end
#define itr iterator
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mo 998244353
#define inf 9223372026854775807
#define ninf -inf
#define ima 2047483647
#define imi -ima
#define oncnt __builtin_popcount
#define zerobegin __builtin_clz
#define zeroend __builtin_ctz
#define parity __builtin_parity
#define all(x) x.be(), x.en()
#define eps 1e-9
#define coutd cout << setprecision(12) << fixed
#define mems(dp, x) memset(dp, x, sizeof(dp))
#define fbo find_by_order
#define ook order_of_key
#define upb upper_bound
#define lowb lower_bound
#define lte(v, x) upb(all(v), x) - v.be()
#define gte(v, x) v.end() - lowb(all(v), x)
const ld PI = 3.1415926535897932384626433832792884197169399375105820974944;
inline ll modpow(ll x, ll n) {
if (x == 0)
return 0;
if (n == 0)
return 1;
if (n == 1)
return (x % mo);
ll u = (modpow(x, n / 2));
u = (u * u) % mo;
if (n % 2 != 0)
u = (u * x % mo) % mo;
return u;
}
inline ll modinv(ll x) { return modpow(x, mo - 2); }
inline ll mmul(ll a, ll b) {
if (a >= mo)
a = a % mo;
if (b >= mo)
b = b % mo;
if (a * b >= mo)
return (a * b) % mo;
return (a * b);
}
inline ll madd(ll a, ll b) {
if (a >= mo)
a = a % mo;
if (b >= mo)
b = b % mo;
if (a + b >= mo)
return (a + b) % mo;
return (a + b);
}
inline ll msub(ll a, ll b) {
if (a >= mo)
a = a % mo;
if (b >= mo)
b = b % mo;
return (((a - b) % mo + mo) % mo);
}
inline ll mdiv(ll a, ll bb) {
if (a >= mo)
a = a % mo;
ll b = modinv(bb);
if (b >= mo)
b = b % mo;
if (a * b >= mo)
return (a * b) % mo;
return (a * b);
}
inline ll gcd(ll a, ll b) { return __gcd(a, b); }
inline ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int main() {
io int testcases = 1; // cin>>testcases;
while (testcases--) {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int b[n + 1] = {0};
int c = 0;
for (int i = n; i >= 1; i--) {
int va = 0;
for (int j = i * 2; j <= n; j += i) {
va += b[j];
}
if (a[i] == 1) {
if (va % 2 == 0)
b[i] = 1;
else
b[i] = 0;
} else {
if (va % 2 == 0)
b[i] = 0;
else
b[i] = 1;
}
if (b[i] == 1)
c++;
}
cout << c << "\n";
for (int i = 1; i <= n; i++) {
if (b[i])
cout << i << " ";
}
}
return 0;
} | [] | 776,781 | 776,782 | u452240501 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const ll INF = 1e18;
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;
}
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0); // b[i]:=i番目の箱のボールの有無
vector<int> ans;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = a[i];
for (int j = i + i; j <= n; j += i) { // i以外の倍数を見る
sum += b[j];
}
b[i] = sum % 2;
if (b[i])
ans.pb(i);
}
cout << sz(ans) << endl;
rep(i, sz(ans)) {
if (i)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const ll INF = 1e18;
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;
}
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0); // b[i]:=i番目の箱のボールの有無
vector<int> ans;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = a[i];
for (int j = i + i; j <= n; j += i) { // i以外の倍数を見る
sum += b[j];
}
b[i] = sum % 2;
if (b[i])
ans.pb(i);
}
cout << sz(ans) << endl;
rep(i, sz(ans)) {
if (i)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 776,793 | 776,794 | u863279562 | 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;
int aa;
vector<int> a(n + 1);
rep(i, n) {
cin >> aa;
if (aa == 0) {
a[i + 1] = -1;
} else {
a[i + 1] = 1;
}
}
vector<vector<int>> memo(n + 1);
int k, k2;
rep(i, n) {
k = 2;
while ((i + 1) * k <= n) {
memo[(i + 1) * k].push_back(i + 1);
++k;
}
}
int ka;
ka = 0;
int l;
vector<int> ans(n + 1, 0);
for (int i = n; i > 0; --i) {
if (a[i] == 1) {
++ka;
ans[i] = 1;
if (memo[i].size() != 0) {
l = memo[i].size();
rep(j, l) { ans[memo[i][j]] *= -1; }
}
}
}
cout << ka << endl;
rep(i, n) {
if (a[i + 1] == 1) {
cout << i + 1 << endl;
}
}
return 0;
} | #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;
int aa;
vector<int> a(n + 1);
rep(i, n) {
cin >> aa;
if (aa == 0) {
a[i + 1] = -1;
} else {
a[i + 1] = 1;
}
}
vector<vector<int>> memo(n + 1);
int k, k2;
rep(i, n) {
k = 2;
while ((i + 1) * k <= n) {
memo[(i + 1) * k].push_back(i + 1);
++k;
}
}
int ka;
ka = 0;
int l;
vector<int> ans(n + 1, 0);
for (int i = n; i > 0; --i) {
if (a[i] == 1) {
++ka;
ans[i] = 1;
if (memo[i].size() != 0) {
l = memo[i].size();
rep(j, l) { a[memo[i][j]] *= -1; }
}
}
}
cout << ka << endl;
rep(i, n) {
if (a[i + 1] == 1) {
cout << i + 1 << endl;
}
}
return 0;
} | [
"assignment.variable.change",
"identifier.change"
] | 776,795 | 776,796 | u992471673 | 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;
int aa;
vector<int> a(n + 1);
rep(i, n) {
cin >> aa;
if (aa == 0) {
a[i + 1] = -1;
} else {
a[i + 1] = 1;
}
}
vector<vector<int>> memo(n + 1);
int k, k2;
rep(i, n) {
k = 2;
while ((i + 1) * k <= n) {
memo[(i + 1) * k].push_back(i + 1);
++k;
}
}
int ka;
ka = 0;
int l;
vector<int> ans(n + 1, 0);
for (int i = n; i > 0; --i) {
if (a[i] == 1) {
++ka;
ans[i] = 1;
if (memo[i].size() != 0) {
l = memo[i].size();
rep(i, l) { ans[memo[i][l]] *= -1; }
}
}
}
cout << ka << endl;
rep(i, n) {
if (a[i + 1] == 1) {
cout << i + 1 << endl;
}
}
return 0;
} | #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;
int aa;
vector<int> a(n + 1);
rep(i, n) {
cin >> aa;
if (aa == 0) {
a[i + 1] = -1;
} else {
a[i + 1] = 1;
}
}
vector<vector<int>> memo(n + 1);
int k, k2;
rep(i, n) {
k = 2;
while ((i + 1) * k <= n) {
memo[(i + 1) * k].push_back(i + 1);
++k;
}
}
int ka;
ka = 0;
int l;
vector<int> ans(n + 1, 0);
for (int i = n; i > 0; --i) {
if (a[i] == 1) {
++ka;
ans[i] = 1;
if (memo[i].size() != 0) {
l = memo[i].size();
rep(j, l) { a[memo[i][j]] *= -1; }
}
}
}
cout << ka << endl;
rep(i, n) {
if (a[i + 1] == 1) {
cout << i + 1 << endl;
}
}
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 776,797 | 776,796 | u992471673 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> H(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
int j = i;
while (j <= n) {
sum += H[j];
j += j;
}
if (sum % 2 == a[i])
H[i] = 0;
else
H[i] = 1;
}
//指定の形に変換
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (H[i] == 1)
ans.push_back(i);
}
cout << ans.size() << endl;
rep(i, ans.size()) cout << ans[i] << " ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> H(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
int j = i;
while (j <= n) {
sum += H[j];
j += i;
}
if (sum % 2 == a[i])
H[i] = 0;
else
H[i] = 1;
}
//指定の形に変換
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (H[i] == 1)
ans.push_back(i);
}
cout << ans.size() << endl;
rep(i, ans.size()) cout << ans[i] << " ";
cout << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 776,804 | 776,805 | u650236619 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + 1; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 776,806 | 776,807 | u936558609 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> ans(N + 1);
rep(i, N) { cin >> A[i + 1]; }
for (int i = N; i >= 1; i--) {
int x = 0;
for (int j = i; j <= N; j += j) {
x += ans[j];
}
if (x % 2 == A[i]) {
ans[i] = 0;
} else {
ans[i] = 1;
}
}
queue<int> Q;
int M = 0;
rep(i, N) {
if (ans[i + 1] == 1) {
Q.push(i + 1);
M++;
}
}
cout << M << endl;
while (!Q.empty()) {
cout << Q.front();
Q.pop();
if (Q.empty()) {
cout << endl;
} else {
cout << " ";
}
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> ans(N + 1);
rep(i, N) { cin >> A[i + 1]; }
for (int i = N; i >= 1; i--) {
int x = 0;
for (int j = i; j <= N; j += i) {
x += ans[j];
}
if (x % 2 == A[i]) {
ans[i] = 0;
} else {
ans[i] = 1;
}
}
queue<int> Q;
int M = 0;
rep(i, N) {
if (ans[i + 1] == 1) {
Q.push(i + 1);
M++;
}
}
cout << M << endl;
while (!Q.empty()) {
cout << Q.front();
Q.pop();
if (Q.empty()) {
cout << endl;
} else {
cout << " ";
}
}
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 776,808 | 776,809 | u859566721 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> q(N);
vector<int> ans(N, 0);
int M = 0;
for (int &e : q)
cin >> e;
for (int i = N; i > 0; i--) {
int p = N / i;
int sum = 0;
for (int j = 2; j <= p; j++)
sum += ans[p * j - 1];
if (sum % 2 != q[i - 1]) {
ans[i - 1] = 1;
M += 1;
}
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (q[i] == 1) {
M -= 1;
cout << i + 1 << (M == 0 ? "\n" : " ");
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> q(N);
vector<int> ans(N, 0);
int M = 0;
for (int &e : q)
cin >> e;
for (int i = N; i > 0; i--) {
int p = N / i;
int sum = 0;
for (int j = 2; j <= p; j++)
sum += ans[i * j - 1];
if (sum % 2 != q[i - 1]) {
ans[i - 1] = 1;
M += 1;
}
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (ans[i] == 1) {
M -= 1;
cout << i + 1 << (M == 0 ? "\n" : " ");
}
}
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 776,812 | 776,813 | u619653948 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.