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 <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i).first;
a.at(i).second = i;
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (a.at(0).second != i) {
cout << a.at(0).first << endl;
} else {
cout << a.at(1).first << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i).first;
a.at(i).second = i;
}
sort(a.rbegin(), a.rend());
for (int i = 0; i < n; i++) {
if (a.at(0).second != i) {
cout << a.at(0).first << endl;
} else {
cout << a.at(1).first << endl;
}
}
} | [
"call.function.change",
"call.arguments.change"
] | 775,643 | 775,644 | u442754977 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
vec.at(i) = a.at(i);
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (vec.at(i) != a.at(n - 1)) {
cout << a.at(n - 1) << endl;
} else {
cout << a.at(n - 2) << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
a.at(i) = vec.at(i);
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (vec.at(i) != a.at(n - 1)) {
cout << a.at(n - 1) << endl;
} else {
cout << a.at(n - 2) << endl;
}
}
}
| [
"assignment.variable.change",
"identifier.change",
"assignment.value.change"
] | 775,645 | 775,646 | u955282280 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
long long N;
long long A[2000005];
long long L[2000005];
long long R[2000005];
int main() {
cin >> N;
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
L[0] = A[0];
for (long long i = 1; i <= N; i++) {
L[i] = max(L[i - 1], A[i]);
}
L[N - 1] = A[N - 1];
for (long long i = N - 2; i >= 0; i--) {
R[i] = max(R[i + 1], A[i]);
}
for (long long i = 0; i < N; i++) {
if (i == 0) {
cout << R[i + 1] << endl;
} else if (i == N - 1) {
cout << L[i - 1] << endl;
} else {
cout << max(L[i - 1], R[i + 1]) << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
long long N;
long long A[2000005];
long long L[2000005];
long long R[2000005];
int main() {
cin >> N;
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
L[0] = A[0];
for (long long i = 1; i < N; i++) {
L[i] = max(L[i - 1], A[i]);
}
R[N - 1] = A[N - 1];
for (long long i = N - 2; i >= 0; i--) {
R[i] = max(R[i + 1], A[i]);
}
for (long long i = 0; i < N; i++) {
if (i == 0) {
cout << R[i + 1] << endl;
} else if (i == N - 1) {
cout << L[i - 1] << endl;
} else {
cout << max(L[i - 1], R[i + 1]) << endl;
}
}
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.variable.change",
"identifier.change"
] | 775,651 | 775,652 | u920254817 | cpp |
p02971 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
int main() {
long long int a, b[200010], c[200010];
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
c[i] = b[i];
}
sort(b, b + a, greater<int>());
for (int i = 0; i < a; i++) {
if (c[i] = b[0]) {
cout << b[1] << endl;
}
else {
cout << b[0] << endl;
}
}
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
int main() {
long long int a, b[200010], c[200010];
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
c[i] = b[i];
}
sort(b, b + a, greater<int>());
for (int i = 0; i < a; i++) {
if (c[i] == b[0]) {
cout << b[1] << endl;
}
else {
cout << b[0] << endl;
}
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 775,655 | 775,656 | u530329977 | cpp |
p02971 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a) \
{ cout << a << "\n"; }
#define tell(a, b) \
{ cout << a << " | " << b << "\n"; }
#define telll(a, b, c) \
{ cout << a << " | " << b << " | " << c << "\n"; }
#define teln(v, n) \
{ \
cout << "v- "; \
rep(i, 0, n) cout << v[i] << " "; \
cout << "\n"; \
}
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
#define M 1000010
int main() {
IOS;
ll n;
cin >> n;
ll mx = -1, mx1 = -1, cnt = 0, a[n], idx = 0;
rep(i, 0, n) {
cin >> a[i];
mx = max(mx, a[i]);
}
rep(i, 0, n) if (a[i] == mx) cnt++, idx = i;
if (cnt == 2)
rep(i, 0, n) cout << mx << "\n";
else {
rep(i, 0, n) if (i != idx) mx1 = max(mx1, a[i]);
rep(i, 0, n) {
if (i != idx)
cout << mx1 << "\n";
else
cout << mx << "\n";
}
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a) \
{ cout << a << "\n"; }
#define tell(a, b) \
{ cout << a << " | " << b << "\n"; }
#define telll(a, b, c) \
{ cout << a << " | " << b << " | " << c << "\n"; }
#define teln(v, n) \
{ \
cout << "v- "; \
rep(i, 0, n) cout << v[i] << " "; \
cout << "\n"; \
}
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
#define M 1000010
int main() {
IOS;
ll n;
cin >> n;
ll mx = -1, mx1 = -1, cnt = 0, a[n], idx = 0;
rep(i, 0, n) {
cin >> a[i];
mx = max(mx, a[i]);
}
rep(i, 0, n) if (a[i] == mx) cnt++, idx = i;
if (cnt == 2)
rep(i, 0, n) cout << mx << "\n";
else {
rep(i, 0, n) if (i != idx) mx1 = max(mx1, a[i]);
rep(i, 0, n) {
if (i != idx)
cout << mx << "\n";
else
cout << mx1 << "\n";
}
}
return 0;
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 775,659 | 775,660 | u742553775 | cpp |
p02971 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a) \
{ cout << a << "\n"; }
#define tell(a, b) \
{ cout << a << " | " << b << "\n"; }
#define telll(a, b, c) \
{ cout << a << " | " << b << " | " << c << "\n"; }
#define teln(v, n) \
{ \
cout << "v- "; \
rep(i, 0, n) cout << v[i] << " "; \
cout << "\n"; \
}
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
#define M 1000010
int main() {
IOS;
ll n;
cin >> n;
ll mx = -1, mx1 = -1, cnt = 0, a[n], idx = 0;
rep(i, 0, n) {
cin >> a[i];
mx = max(mx, a[i]);
}
rep(i, 0, n) if (a[i] == mx) cnt++, idx = i;
if (cnt == 2)
rep(i, 0, n) cout << mx << "\n";
else {
rep(i, 0, n) if (i != idx) mx1 = max(mx1, a[i]);
rep(i, 0, n) {
if (i != idx)
cout << mx1 << "\n";
else
cout << "\n";
}
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a) \
{ cout << a << "\n"; }
#define tell(a, b) \
{ cout << a << " | " << b << "\n"; }
#define telll(a, b, c) \
{ cout << a << " | " << b << " | " << c << "\n"; }
#define teln(v, n) \
{ \
cout << "v- "; \
rep(i, 0, n) cout << v[i] << " "; \
cout << "\n"; \
}
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
#define M 1000010
int main() {
IOS;
ll n;
cin >> n;
ll mx = -1, mx1 = -1, cnt = 0, a[n], idx = 0;
rep(i, 0, n) {
cin >> a[i];
mx = max(mx, a[i]);
}
rep(i, 0, n) if (a[i] == mx) cnt++, idx = i;
if (cnt == 2)
rep(i, 0, n) cout << mx << "\n";
else {
rep(i, 0, n) if (i != idx) mx1 = max(mx1, a[i]);
rep(i, 0, n) {
if (i != idx)
cout << mx << "\n";
else
cout << mx1 << "\n";
}
}
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 775,661 | 775,660 | u742553775 | cpp |
p02971 | #include <iostream>
using namespace std;
int main() {
int n, a[200000];
int m1 = -1, m2 = -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;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a[200000];
cin >> n;
int m1 = -1, m2 = -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;
}
return 0;
} | [] | 775,664 | 775,665 | u522506260 | cpp |
p02971 | #include <iostream>
using namespace std;
int main() {
int n, a[200000];
int m1 = -1, m2 = -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;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a[200000];
cin >> n;
int m1 = -1, m2 = -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;
}
return 0;
} | [] | 775,666 | 775,667 | u522506260 | 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[i];
int B[N];
for (int i = 0; i < N; i++)
A[i] = B[i];
sort(A.begin(), A.end());
int ans = A[N - 1];
int sub = A[N - 2];
for (int i = 0; i < N; i++) {
if (B[i] == ans)
cout << sub << endl;
else
cout << ans << 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];
int B[N];
for (int i = 0; i < N; i++)
B[i] = A[i];
sort(A.begin(), A.end());
int ans = A[N - 1];
int sub = A[N - 2];
for (int i = 0; i < N; i++) {
if (B[i] == ans)
cout << sub << endl;
else
cout << ans << endl;
}
} | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change"
] | 775,668 | 775,669 | u105533331 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
vector<int> getList(int i) {
int a;
vector<int> vec(i);
for (int j = 0; j < i; ++j) {
cin >> a;
vec.at(j) = a;
}
return vec;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> vec = getList(n);
vector<int> backUp = vec;
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
int ma = vec.at(0);
int second = vec.at(1);
for (int i = 0; i < n; ++i) {
if (vec.at(i) == ma) {
cout << second << endl;
} else {
cout << ma << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
vector<int> getList(int i) {
int a;
vector<int> vec(i);
for (int j = 0; j < i; ++j) {
cin >> a;
vec.at(j) = a;
}
return vec;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> vec = getList(n);
vector<int> backUp = vec;
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
int ma = vec.at(0);
int second = vec.at(1);
vec = backUp;
for (int i = 0; i < n; ++i) {
if (vec.at(i) == ma) {
cout << second << endl;
} else {
cout << ma << endl;
}
}
}
| [
"assignment.add"
] | 775,670 | 775,671 | u433852402 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
#define ss second
#define ff first
int main() {
int n, cnt = 0;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++)
cin >> A[i];
int maxval = *max_element(all(A));
int maxval2 = A[0];
for (int i = 1; i < n; i++) {
if (A[i] == maxval)
cnt++;
if (A[i] != maxval) {
maxval2 = max(maxval2, A[i]);
}
}
vector<int> ans(n, maxval);
if (cnt == 1) {
int indx = max_element(all(A)) - A.begin();
ans[indx] = maxval2;
}
for (int i = 0; i < n; i++)
cout << ans[i] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
#define ss second
#define ff first
int main() {
int n, cnt = 0;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++)
cin >> A[i];
int maxval = *max_element(all(A));
int maxval2 = INT_MIN;
for (int i = 0; i < n; i++) {
if (A[i] == maxval)
cnt++;
if (A[i] != maxval) {
maxval2 = max(maxval2, A[i]);
}
}
vector<int> ans(n, maxval);
if (cnt == 1) {
int indx = max_element(all(A)) - A.begin();
ans[indx] = maxval2;
}
for (int i = 0; i < n; i++)
cout << ans[i] << endl;
} | [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 775,675 | 775,676 | u559021558 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int a[200200];
int b[200200];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(a, a + n);
int max = 0;
int smax = 0;
max = a[n - 1];
smax = a[n - 2];
for (int i = 0; i < n; i++) {
if (a[i] == max)
cout << smax << endl;
else
cout << max << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <chrono>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int a[200200];
int b[200200];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(a, a + n);
int max = 0;
int smax = 0;
max = a[n - 1];
smax = a[n - 2];
for (int i = 0; i < n; i++) {
if (b[i] == max)
cout << smax << endl;
else
cout << max << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 775,683 | 775,684 | u769802367 | cpp |
p02971 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> s = a;
sort(s.rbegin(), s.rend());
rep(i, n) {
int ans = s[0];
if (s[0] == a[i])
;
ans = s[1];
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> s = a;
sort(s.rbegin(), s.rend());
rep(i, n) {
int ans = s[0];
if (s[0] == a[i])
ans = s[1];
cout << ans << endl;
}
return 0;
}
| [] | 775,687 | 775,688 | u506858457 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef map<int, int> M;
typedef vector<int> V;
typedef queue<int> Q;
typedef pair<long, long> PLL;
typedef map<long, long> MLL;
typedef vector<long long> VLL;
typedef vector<pair<int, int>> VP;
typedef vector<vector<int>> VV;
#define INF (int)(1e9 + 1)
#define MAXX (int)1.1529215e+18
#define inf 999999
#define EPS (1e-7)
#define MOD (ll)(1e9 + 7)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.begin(), a.end(), greater<int>()
#define PRALL(a) a.begin(), a.end(), greater<pair<int, int>>()
#define ROT(a) a.begin(), a.begin() + 1, a.end()
#define RROT(a) a.begin(), a.end() - 1, a.end()
#define PB push_back
#define MP make_pair
#define PI acos(-1.0)
// ceil(a/(double)b)=(a+b-1)/b
// printf("myco\n");//for debug
/*--------------------------------------------*/
int main() {
int n;
cin >> n;
V a(n);
rep(i, n) cin >> a[i];
V l(n), r(n);
l[0] = a[0];
r[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
int w1 = l[i - 1];
int w2 = a[i];
l[i] = max(w1, w2);
int w3 = l[n - i];
int w4 = a[n - i - 1];
r[n - i - 1] = max(w3, w4);
}
cout << r[1] << endl;
rep(i, n - 1) {
if (i == 0)
continue;
else
cout << max(l[i - 1], r[i + 1]) << endl;
}
cout << l[n - 2] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef map<int, int> M;
typedef vector<int> V;
typedef queue<int> Q;
typedef pair<long, long> PLL;
typedef map<long, long> MLL;
typedef vector<long long> VLL;
typedef vector<pair<int, int>> VP;
typedef vector<vector<int>> VV;
#define INF (int)(1e9 + 1)
#define MAXX (int)1.1529215e+18
#define inf 999999
#define EPS (1e-7)
#define MOD (ll)(1e9 + 7)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.begin(), a.end(), greater<int>()
#define PRALL(a) a.begin(), a.end(), greater<pair<int, int>>()
#define ROT(a) a.begin(), a.begin() + 1, a.end()
#define RROT(a) a.begin(), a.end() - 1, a.end()
#define PB push_back
#define MP make_pair
#define PI acos(-1.0)
// ceil(a/(double)b)=(a+b-1)/b
// printf("myco\n");//for debug
/*--------------------------------------------*/
int main() {
int n;
cin >> n;
V a(n);
rep(i, n) cin >> a[i];
V l(n), r(n);
l[0] = a[0];
r[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
int w1 = l[i - 1];
int w2 = a[i];
l[i] = max(w1, w2);
int w3 = r[n - i];
int w4 = a[n - i - 1];
r[n - i - 1] = max(w3, w4);
}
cout << r[1] << endl;
rep(i, n - 1) {
if (i == 0)
continue;
else
cout << max(l[i - 1], r[i + 1]) << endl;
}
cout << l[n - 2] << endl;
}
| [
"identifier.change"
] | 775,699 | 775,700 | u745562814 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
B.at(i) = A.at(i);
}
sort(B.begin(), B.end());
int maxA = B.at(N - 1);
int maxA2 = B.at(N - 2);
for (int i = 0; i < N; i++) {
if (B.at(i) == maxA)
cout << maxA2 << endl;
else
cout << maxA << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
B.at(i) = A.at(i);
}
sort(B.begin(), B.end());
int maxA = B.at(N - 1);
int maxA2 = B.at(N - 2);
for (int i = 0; i < N; i++) {
if (A.at(i) == maxA)
cout << maxA2 << endl;
else
cout << maxA << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 775,701 | 775,702 | u615258936 | cpp |
p02971 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end(), greater<>());
rep(i, n) {
if (b[i] == a[0]) {
cout << a[1] << endl;
} else {
cout << a[0] << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
b = a;
sort(a.begin(), a.end(), greater<>());
rep(i, n) {
if (b[i] == a[0]) {
cout << a[1] << endl;
} else {
cout << a[0] << endl;
}
}
return 0;
} | [
"assignment.add"
] | 775,705 | 775,706 | u355545160 | cpp |
p02971 | #include <cstdio>
int main() {
int n;
int a;
scanf("%d %d", &n, &a);
int max = a;
int max2 = 0;
int max_at = 1;
for (int i = 1; i < n; ++i) {
scanf("%d", &a);
if (max < a) {
max2 = max;
max = a;
max_at = i;
} else if (max2 < a) {
max2 = a;
}
}
for (int i = 0; i < n; ++i) {
printf("%d\n", i == max_at ? max2 : max);
}
return 0;
} | #include <cstdio>
int main() {
int n;
int a;
scanf("%d %d", &n, &a);
int max = a;
int max2 = 0;
int max_at = 0;
for (int i = 1; i < n; ++i) {
scanf("%d", &a);
if (max < a) {
max2 = max;
max = a;
max_at = i;
} else if (max2 < a) {
max2 = a;
}
}
for (int i = 0; i < n; ++i) {
printf("%d\n", i == max_at ? max2 : max);
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 775,715 | 775,716 | u931819817 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i, start, end) for (ll i = (ll)start; i < (ll)end; i++)
#define print(a) cout << a << endl;
#define printarray(a, len) rep(i, 0, len) cout << a[i] << " ";
int main() {
ll n, amax = 0, asec = 0;
bool same = false;
cin >> n;
ll a[200010];
rep(i, 0, n) {
cin >> a[i];
if (amax == a[i]) {
same = true;
} else if (a[i] > amax) {
asec = amax;
amax = a[i];
} else if (a[i] < amax) {
asec = max(asec, a[i]);
}
}
rep(i, 0, n) {
if (same) {
print(amax);
} else {
if (a[i] == amax) {
print(asec);
} else {
print(amax);
}
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i, start, end) for (ll i = (ll)start; i < (ll)end; i++)
#define print(a) cout << a << endl;
#define printarray(a, len) rep(i, 0, len) cout << a[i] << " ";
int main() {
ll n, amax = 0, asec = 0;
bool same = false;
cin >> n;
ll a[200010];
rep(i, 0, n) {
cin >> a[i];
if (amax == a[i]) {
same = true;
} else if (a[i] > amax) {
asec = amax;
amax = a[i];
same = false;
} else if (a[i] < amax) {
asec = max(asec, a[i]);
}
}
rep(i, 0, n) {
if (same) {
print(amax);
} else {
if (a[i] == amax) {
print(asec);
} else {
print(amax);
}
}
}
return 0;
} | [
"assignment.add"
] | 775,721 | 775,722 | u656995812 | cpp |
p02971 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> A(n), B(n);
int max1 = 0, max2 = 0;
rep(i, n) {
scanf("%d", &A[i]);
if (A[i] > max2) {
max2 = max1;
max1 = A[i];
} else if (A[i] > max1) {
max1 = A[i];
}
}
rep(i, n) {
if (A[i] == max1)
printf("%d\n", max2);
else
printf("%d\n", max1);
}
}
int main(void) {
solve();
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> A(n), B(n);
int max1 = 0, max2 = 0;
rep(i, n) {
scanf("%d", &A[i]);
if (A[i] > max1) {
max2 = max1;
max1 = A[i];
} else if (A[i] > max2) {
max2 = A[i];
}
}
rep(i, n) {
if (A[i] == max1)
printf("%d\n", max2);
else
printf("%d\n", max1);
}
}
int main(void) {
solve();
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 775,723 | 775,724 | u863957421 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int ma1 = 0, ma2 = 0, p1 = -1, a;
for (int i = 0; i < n; ++i) {
cin >> a;
if (a > ma1) {
ma2 = ma1;
ma1 = a;
p1 = i;
} else if (a > ma2) {
ma2 = a;
}
}
for (int i = 0; i < n; ++i) {
if (i == 1) {
cout << ma2 << endl;
} else {
cout << ma1 << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int ma1 = 0, ma2 = 0, p1 = -1, a;
for (int i = 0; i < n; ++i) {
cin >> a;
if (a > ma1) {
ma2 = ma1;
ma1 = a;
p1 = i;
} else if (a > ma2) {
ma2 = a;
}
}
for (int i = 0; i < n; ++i) {
if (i == p1) {
cout << ma2 << endl;
} else {
cout << ma1 << endl;
}
}
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 775,727 | 775,728 | u399987025 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N);
vector<int> ADash(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
ADash[i] = -1 * A[i];
}
sort(ADash.begin(), ADash.end());
for (int i : A) {
if (i == A[0])
cout << ADash[1] * -1 << endl;
else
cout << ADash[0] * -1 << endl;
// cout<<i<<" ";
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N);
vector<int> ADash(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
ADash[i] = -1 * A[i];
}
sort(ADash.begin(), ADash.end());
for (int i : A) {
if (i * -1 == ADash[0])
cout << ADash[1] * -1 << endl;
else
cout << ADash[0] * -1 << endl;
// cout<<i<<" ";
}
} | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 775,735 | 775,736 | u117345342 | 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[i];
}
vector<int> dummy = A;
vector<int>::iterator maxIt = max_element(A.begin(), A.end());
size_t maxIndex = distance(A.begin(), maxIt);
int max = *max_element(A.begin(), A.end());
sort(dummy.begin(), dummy.end());
for (int i = 0; i < N; i++) {
if (i == maxIndex) {
cout << dummy[1] << endl;
} else {
cout << max << 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> dummy = A;
vector<int>::iterator maxIt = max_element(A.begin(), A.end());
size_t maxIndex = distance(A.begin(), maxIt);
int max = *max_element(A.begin(), A.end());
sort(dummy.begin(), dummy.end());
for (int i = 0; i < N; i++) {
if (i == maxIndex) {
cout << dummy[N - 2] << endl;
} else {
cout << max << endl;
}
}
}
| [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 775,737 | 775,738 | u654055742 | cpp |
p02971 | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) \
for ( \
int i = (a); i >= (b); \
--i) // 終端を0じゃなくて、1まですることによってn回。感覚的に1以上にしておいた。
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR_EQ(i, 0, n)
#define rep_re(i, n) FOR_RE(i, n, 0)
#define DEBUG_VARIABLE(variable) cout << #variable << ":" << variable << endl
#define INFTY (1 << 21) // 10^21
#define INF (1 << 9)
#define WHITE 1 //（未訪問）
#define GRAY \
2 //（訪問）未だに訪問していない頂点への辺を持っている。スタックに退避。
#define BLACK 3 //（訪問完了）未訪問への頂点への辺を持たない
#define N 100
int M[N][N]; // 隣接行列(頂点と頂点が繋がってる、もしくは重みの値)
int color[N]; // その頂点の探索具合
const int TABLEMAX = 510000;
const int MOD = 1000000007;
//二項係数用の各階乗の値とその逆元を記録するための配列．
long long fac[TABLEMAX], finv[TABLEMAX], inv[TABLEMAX];
// 1個上から時計周り
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//上右下左
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
static const int NIL = -1;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> Vector;
typedef vector<Vector> DVector;
typedef vector<pair<ll, ll>> Vec_map;
//因数分解で使う。firstは数。secondは指数。
vector<pair<ll, ll>> prime_factor;
//因数の一覧を取得で使う
Vector factor_list;
ll n;
template <class X> void printArray(X *array, ll);
template <class X> void printVector(vector<X> &v);
template <class X> void printDimention(vector<vector<X>> &dv);
template <class X> void printMap(X);
template <class X> void printVecPair(vector<X> &v);
// 何個2がかかっているか
ll factor2(ll);
// nCr方式で組み合わせの数を求める
ll combination(int, int);
// nPrで階乗を求める
int factorial(int, int);
//桁数を返す
int find_digits(int);
// 各桁の和を計算する関数
int findSumOfDigits(int);
//次数を得る
int degree(int);
//四捨五入
int shishagonyu(double);
//切り上げ
int roundUp(double);
//切り捨て
int roundDown(double);
//四捨五入
int roundOff(double);
//最大公約数(Greatest Common Divisor)
int gcd(int, int);
//最小公倍数(Least Common Multiple)
ll lcm(ll, ll);
//素因数分解
void prime_factorization(ll);
//エラトステネスの篩
int Eratosthenes(int);
//偶奇判定。奇数ならtrue。
bool odd_even(int);
// aのmod mにおける逆元を計算する
long long modinv(long long, long long);
// a^n mod を計算する（二分累乗）
long long modpow(long long, long long, long long);
//テーブルを作る前処理
void COMinit();
//二項係数計算 nCk, 1 <= k <= n <= 10^7
long long COM(int, int);
// longlong型で絶対値を帰す。
long long abs_ll(ll);
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll, ll);
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string, vector<X> &v);
// 因数の一覧を取得する
void get_factor_list(ll);
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
ll a[n];
pair<ll, ll> one(0, 0), two(0, 0); // two.secondはいらない
rep(i, n) {
cin >> a[i];
if (one.first < a[i]) {
two.first = one.first;
two.second = one.second;
one.first = a[i];
one.second = 1;
} else if (one.first == a[i]) {
one.second++;
} else {
if (two.second < a[i]) {
two.first = a[i];
}
}
}
rep(i, n) {
if (one.first == a[i]) {
if (one.second == 1) {
cout << two.first << endl;
} else {
cout << one.first << endl;
}
} else {
cout << one.first << endl;
}
}
return 0;
}
template <class X> void printArray(X array[], ll n) {
rep(i, n) {
if (i)
cout << " ";
cout << array[i];
}
cout << endl;
}
template <class X> void printVector(vector<X> &v) {
rep(i, (int)v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
//二次元配列の表示
template <class X> void printDimention(vector<vector<X>> &dv) {
rep(i, (ll)dv.size()) {
rep(j, (ll)dv[i].size()) {
if (j)
cout << " ";
cout << dv[i][j];
}
cout << endl;
}
}
// mapの表示
template <class X> void printMap(X mp) {
for (auto it : mp) {
cout << it.first << " " << it.second << endl;
}
}
// 内部にpairを内包したvectorの表示
template <class X> void printVecPair(vector<X> &v) {
rep(i, (int)v.size()) { cout << v[i].first << " " << v[i].second << endl; }
cout << endl;
}
// numの中に何個2がかかってるか
ll factor2(ll num) {
int cnt = 0;
while (num % 2 == 0) {
num /= 2;
cnt++;
}
return cnt;
}
// nCr方式で組み合わせの数を求める
ll combination(int n, int r) {
ll up = 1, down = 1;
// 以下2行はお試し
ll half = n / 2;
if (r >= half)
r = n - r;
ll up_tmp = n, down_tmp = r;
if (r == 0)
return 1;
rep(i, r) {
up *= up_tmp;
up_tmp--;
down *= down_tmp;
down_tmp--;
}
return up / down;
}
// nPr方式で階乗を求める
int factorial(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
} else {
int res = 1;
while (r) {
r--;
res *= n;
n--;
}
return res;
}
}
//桁数を返す
int find_digits(int n) {
int digit = 0;
while (n) {
n /= 10;
digit++;
}
return digit;
}
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
//次数を得る
int degree(int n) {
int count = 0;
while (1) {
if (count <= 0)
break;
count /= 2;
count++;
}
return count;
}
//四捨五入
int shishagonyu(double x) { return (int)(x < 0.0 ? x - 0.5 : x + 0.5); }
//切り上げ
int roundUp(double n) {
if (n >= 0) {
return (int)n + 1;
} else {
return (int)n - 1;
}
}
//切り捨て
int roundDown(double n) { return (int)n; }
//四捨五入
int roundOff(double n) {
double decimal = 0;
decimal = n - (int)n;
if (decimal >= 0.5 || decimal <= -0.5) {
return roundUp(n);
} else {
return roundDown(n);
}
}
//最大公約数(Greatest Common Divisor)
int gcd(int m, int n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
//ユークリッドの互除法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
//最小公倍数(Least Common Multiple)
ll lcm(ll m, ll n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
// lcm = m * n / gcd(m, n)
return ((m / gcd(m, n)) * n);
}
//素因数分解 firstは数。secondは指数。
void prime_factorization(ll n) {
int a = 2, res;
bool flg = false;
if (n < 2) {
cout << "Error" << endl;
return;
}
while (n >= a * a) {
if (n % a == 0) {
res = a;
// resをグローバルな配列に代入すれば記録できる。
if (flg) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(0, 1));
prime_factor[prime_factor.size() - 1].first = res;
}
n /= a;
flg = true;
} else {
a++;
flg = false;
}
}
//ラス1の素因数
res = n;
if (prime_factor[prime_factor.size() - 1].first == res) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(res, 1));
}
}
//エラトステネスの篩
int Eratosthenes(int n) {
bool prime[n];
// prime[0]が1、prime[n - 1]がn。
rep(i, n) prime[i] = true;
for (int i = 2; i < sqrt(n); i++) {
if (prime[i]) {
for (int j = 0; i * (j + 2) < n; j++) {
prime[i * (j + 2)] = false;
}
}
}
int cnt = 0;
for (int i = 2; i < n; i++) {
if (prime[i]) {
cnt++;
}
}
return cnt;
}
//偶奇判定。奇数ならtrue。
bool odd_even(int num) {
bool judge;
if (num % 2) {
judge = true;
} else {
judge = false;
}
return judge;
}
// aのmod mにおける逆元を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// main関数内でCOMinitを呼んだ後，COMを呼ぶ．
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < TABLEMAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算 nCk, nCrのcombinationでも使える
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long abs_ll(ll a) {
if (a >= 0) {
return a;
} else {
return -a;
}
}
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll res, ll div) {
// res 割られる数、div 割る数
return (res + div - 1) / div;
}
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string str, vector<X> &v) {
ll num = stoll(str);
ll it = str.size() - 1;
// 桁を逆にしたい時、下をon
// ll it = 0;
v.resize(str.size());
while (num) {
v[it] = num % 10;
num /= 10;
it--;
// it++;
if (it < 0) {
cout << "reference error" << endl;
break;
}
}
}
// nに数を入れるとその約数の一覧をfactor_listに格納する
void get_factor_list(ll n) {
int a = 1, res;
while (n >= a * a) {
if (n % a == 0) {
res = a;
ll tmp = n / res;
factor_list.push_back(res);
factor_list.push_back(tmp);
a++;
} else {
a++;
}
}
sort(factor_list.begin(), factor_list.end());
} | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) \
for ( \
int i = (a); i >= (b); \
--i) // 終端を0じゃなくて、1まですることによってn回。感覚的に1以上にしておいた。
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR_EQ(i, 0, n)
#define rep_re(i, n) FOR_RE(i, n, 0)
#define DEBUG_VARIABLE(variable) cout << #variable << ":" << variable << endl
#define INFTY (1 << 21) // 10^21
#define INF (1 << 9)
#define WHITE 1 //（未訪問）
#define GRAY \
2 //（訪問）未だに訪問していない頂点への辺を持っている。スタックに退避。
#define BLACK 3 //（訪問完了）未訪問への頂点への辺を持たない
#define N 100
int M[N][N]; // 隣接行列(頂点と頂点が繋がってる、もしくは重みの値)
int color[N]; // その頂点の探索具合
const int TABLEMAX = 510000;
const int MOD = 1000000007;
//二項係数用の各階乗の値とその逆元を記録するための配列．
long long fac[TABLEMAX], finv[TABLEMAX], inv[TABLEMAX];
// 1個上から時計周り
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//上右下左
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
static const int NIL = -1;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> Vector;
typedef vector<Vector> DVector;
typedef vector<pair<ll, ll>> Vec_map;
//因数分解で使う。firstは数。secondは指数。
vector<pair<ll, ll>> prime_factor;
//因数の一覧を取得で使う
Vector factor_list;
ll n;
template <class X> void printArray(X *array, ll);
template <class X> void printVector(vector<X> &v);
template <class X> void printDimention(vector<vector<X>> &dv);
template <class X> void printMap(X);
template <class X> void printVecPair(vector<X> &v);
// 何個2がかかっているか
ll factor2(ll);
// nCr方式で組み合わせの数を求める
ll combination(int, int);
// nPrで階乗を求める
int factorial(int, int);
//桁数を返す
int find_digits(int);
// 各桁の和を計算する関数
int findSumOfDigits(int);
//次数を得る
int degree(int);
//四捨五入
int shishagonyu(double);
//切り上げ
int roundUp(double);
//切り捨て
int roundDown(double);
//四捨五入
int roundOff(double);
//最大公約数(Greatest Common Divisor)
int gcd(int, int);
//最小公倍数(Least Common Multiple)
ll lcm(ll, ll);
//素因数分解
void prime_factorization(ll);
//エラトステネスの篩
int Eratosthenes(int);
//偶奇判定。奇数ならtrue。
bool odd_even(int);
// aのmod mにおける逆元を計算する
long long modinv(long long, long long);
// a^n mod を計算する（二分累乗）
long long modpow(long long, long long, long long);
//テーブルを作る前処理
void COMinit();
//二項係数計算 nCk, 1 <= k <= n <= 10^7
long long COM(int, int);
// longlong型で絶対値を帰す。
long long abs_ll(ll);
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll, ll);
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string, vector<X> &v);
// 因数の一覧を取得する
void get_factor_list(ll);
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
ll a[n];
pair<ll, ll> one(0, 0), two(0, 0); // two.secondはいらない
rep(i, n) {
cin >> a[i];
if (one.first < a[i]) {
two.first = one.first;
two.second = one.second;
one.first = a[i];
one.second = 1;
} else if (one.first == a[i]) {
one.second++;
} else {
if (two.first < a[i]) {
two.first = a[i];
}
}
}
rep(i, n) {
if (one.first == a[i]) {
if (one.second == 1) {
cout << two.first << endl;
} else {
cout << one.first << endl;
}
} else {
cout << one.first << endl;
}
}
return 0;
}
template <class X> void printArray(X array[], ll n) {
rep(i, n) {
if (i)
cout << " ";
cout << array[i];
}
cout << endl;
}
template <class X> void printVector(vector<X> &v) {
rep(i, (int)v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
//二次元配列の表示
template <class X> void printDimention(vector<vector<X>> &dv) {
rep(i, (ll)dv.size()) {
rep(j, (ll)dv[i].size()) {
if (j)
cout << " ";
cout << dv[i][j];
}
cout << endl;
}
}
// mapの表示
template <class X> void printMap(X mp) {
for (auto it : mp) {
cout << it.first << " " << it.second << endl;
}
}
// 内部にpairを内包したvectorの表示
template <class X> void printVecPair(vector<X> &v) {
rep(i, (int)v.size()) { cout << v[i].first << " " << v[i].second << endl; }
cout << endl;
}
// numの中に何個2がかかってるか
ll factor2(ll num) {
int cnt = 0;
while (num % 2 == 0) {
num /= 2;
cnt++;
}
return cnt;
}
// nCr方式で組み合わせの数を求める
ll combination(int n, int r) {
ll up = 1, down = 1;
// 以下2行はお試し
ll half = n / 2;
if (r >= half)
r = n - r;
ll up_tmp = n, down_tmp = r;
if (r == 0)
return 1;
rep(i, r) {
up *= up_tmp;
up_tmp--;
down *= down_tmp;
down_tmp--;
}
return up / down;
}
// nPr方式で階乗を求める
int factorial(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
} else {
int res = 1;
while (r) {
r--;
res *= n;
n--;
}
return res;
}
}
//桁数を返す
int find_digits(int n) {
int digit = 0;
while (n) {
n /= 10;
digit++;
}
return digit;
}
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
//次数を得る
int degree(int n) {
int count = 0;
while (1) {
if (count <= 0)
break;
count /= 2;
count++;
}
return count;
}
//四捨五入
int shishagonyu(double x) { return (int)(x < 0.0 ? x - 0.5 : x + 0.5); }
//切り上げ
int roundUp(double n) {
if (n >= 0) {
return (int)n + 1;
} else {
return (int)n - 1;
}
}
//切り捨て
int roundDown(double n) { return (int)n; }
//四捨五入
int roundOff(double n) {
double decimal = 0;
decimal = n - (int)n;
if (decimal >= 0.5 || decimal <= -0.5) {
return roundUp(n);
} else {
return roundDown(n);
}
}
//最大公約数(Greatest Common Divisor)
int gcd(int m, int n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
//ユークリッドの互除法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
//最小公倍数(Least Common Multiple)
ll lcm(ll m, ll n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
// lcm = m * n / gcd(m, n)
return ((m / gcd(m, n)) * n);
}
//素因数分解 firstは数。secondは指数。
void prime_factorization(ll n) {
int a = 2, res;
bool flg = false;
if (n < 2) {
cout << "Error" << endl;
return;
}
while (n >= a * a) {
if (n % a == 0) {
res = a;
// resをグローバルな配列に代入すれば記録できる。
if (flg) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(0, 1));
prime_factor[prime_factor.size() - 1].first = res;
}
n /= a;
flg = true;
} else {
a++;
flg = false;
}
}
//ラス1の素因数
res = n;
if (prime_factor[prime_factor.size() - 1].first == res) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(res, 1));
}
}
//エラトステネスの篩
int Eratosthenes(int n) {
bool prime[n];
// prime[0]が1、prime[n - 1]がn。
rep(i, n) prime[i] = true;
for (int i = 2; i < sqrt(n); i++) {
if (prime[i]) {
for (int j = 0; i * (j + 2) < n; j++) {
prime[i * (j + 2)] = false;
}
}
}
int cnt = 0;
for (int i = 2; i < n; i++) {
if (prime[i]) {
cnt++;
}
}
return cnt;
}
//偶奇判定。奇数ならtrue。
bool odd_even(int num) {
bool judge;
if (num % 2) {
judge = true;
} else {
judge = false;
}
return judge;
}
// aのmod mにおける逆元を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// main関数内でCOMinitを呼んだ後，COMを呼ぶ．
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < TABLEMAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算 nCk, nCrのcombinationでも使える
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long abs_ll(ll a) {
if (a >= 0) {
return a;
} else {
return -a;
}
}
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll res, ll div) {
// res 割られる数、div 割る数
return (res + div - 1) / div;
}
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string str, vector<X> &v) {
ll num = stoll(str);
ll it = str.size() - 1;
// 桁を逆にしたい時、下をon
// ll it = 0;
v.resize(str.size());
while (num) {
v[it] = num % 10;
num /= 10;
it--;
// it++;
if (it < 0) {
cout << "reference error" << endl;
break;
}
}
}
// nに数を入れるとその約数の一覧をfactor_listに格納する
void get_factor_list(ll n) {
int a = 1, res;
while (n >= a * a) {
if (n % a == 0) {
res = a;
ll tmp = n / res;
factor_list.push_back(res);
factor_list.push_back(tmp);
a++;
} else {
a++;
}
}
sort(factor_list.begin(), factor_list.end());
} | [
"control_flow.branch.if.condition.change"
] | 775,745 | 775,746 | u669551866 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
int A[N];
int tmp = 0;
int idx = 0;
rep(i, N) {
cin >> A[i];
if (tmp <= A[i])
tmp = A[i];
idx = i;
}
sort(A, A + N, greater<int>());
rep(i, N) {
if (i == idx)
cout << A[1] << endl;
else
cout << A[0] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
int A[N];
int tmp = 0;
int idx = 0;
rep(i, N) {
cin >> A[i];
if (tmp < A[i]) {
tmp = A[i];
idx = i;
}
}
sort(A, A + N, greater<int>());
rep(i, N) {
if (i == idx)
cout << A[1] << endl;
else
cout << A[0] << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 775,758 | 775,759 | u547754910 | cpp |
p02971 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
vi a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(all(a));
for (int i = 0; i < n; i++) {
if (a[i] != b[n - 1])
cout << b[n - 1];
else
cout << b[n - 2];
cout << '\n';
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
vi a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(all(a));
for (int i = 0; i < n; i++) {
if (b[i] != a[n - 1])
cout << a[n - 1];
else
cout << a[n - 2];
cout << '\n';
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 775,785 | 775,786 | u843739531 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> ma(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
a.at(i) = ma.at(i);
}
sort(ma.begin(), ma.end());
for (int i = 0; i < n; i++) {
if (a.at(i) == ma.at(n - 1)) {
cout << ma.at(n - 2) << endl;
} else {
cout << ma.at(n - 1) << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> ma(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
ma.at(i) = a.at(i);
}
sort(ma.begin(), ma.end());
for (int i = 0; i < n; i++) {
if (a.at(i) == ma.at(n - 1)) {
cout << ma.at(n - 2) << endl;
} else {
cout << ma.at(n - 1) << endl;
}
}
} | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change"
] | 775,787 | 775,788 | u111600809 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, c;
ll a[200005];
ll b[200005];
ll const BAD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> c;
a[i] = c;
b[i] = c;
}
sort(a, a + n);
for (ll i = 0; i < n; i++) {
if (b[i] == a[n]) {
cout << a[n - 1] << '\n';
} else {
cout << a[n] << '\n';
}
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, c;
ll a[200005];
ll b[200005];
ll const BAD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> c;
a[i] = c;
b[i] = c;
}
sort(a, a + n);
for (ll i = 0; i < n; i++) {
if (b[i] == a[n - 1]) {
cout << a[n - 2] << '\n';
} else {
cout << a[n - 1] << '\n';
}
}
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.else.add"
] | 775,811 | 775,812 | u928313240 | cpp |
p02971 | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define REP_AB(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define REP_IN(i, n, x) \
for (ll i = 0; i < n; i++) \
in >> x;
#define REP_OUT(i, n, x) \
for (ll i = 0; i < n; i++) \
out << x << endl;
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define UNIQUE(v) \
sort(ALL(v)); \
v.erase(unique(ALL(v)), v.end());
#define SIZE(x) ((ll)(x).size())
#define REVERSE(v) reverse(ALL(v))
// true / false
#define BIN_SEARCH(v, a) binary_search(ALL(v), a)
// index
#define BIN_LEFT(v, a) (lower_bound(ALL(v), a) - v.begin())
#define BIN_RIGHT(v, a) (upper_bound(ALL(v), a) - v.begin())
#define BIN_INSERT(v, a) (v.insert(v.begin() + BIN_LEFT(v, a), a))
#define DEL(v, i) v.erase(v.begin() + i)
#define INSERT(v, i, a) v.insert(v.begin() + i, a)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define out cout
#define in cin
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;
}
// template end
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, max = 0, submax = -1, max_c = 0;
in >> N;
ll A[N];
REP(i, N) {
in >> A[i];
if (A[i] > submax) {
if (A[i] >= max) {
if (A[i] != max)
max_c = 0;
max = A[i];
max_c++;
} else {
submax = A[i];
}
}
}
// out << max << max_c << endl;
// out << submax << endl;
REP(i, N) {
if (A[i] == max && max_c == 1) {
out << submax << endl;
} else {
out << max << endl;
}
}
} | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define REP_AB(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define REP_IN(i, n, x) \
for (ll i = 0; i < n; i++) \
in >> x;
#define REP_OUT(i, n, x) \
for (ll i = 0; i < n; i++) \
out << x << endl;
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define UNIQUE(v) \
sort(ALL(v)); \
v.erase(unique(ALL(v)), v.end());
#define SIZE(x) ((ll)(x).size())
#define REVERSE(v) reverse(ALL(v))
// true / false
#define BIN_SEARCH(v, a) binary_search(ALL(v), a)
// index
#define BIN_LEFT(v, a) (lower_bound(ALL(v), a) - v.begin())
#define BIN_RIGHT(v, a) (upper_bound(ALL(v), a) - v.begin())
#define BIN_INSERT(v, a) (v.insert(v.begin() + BIN_LEFT(v, a), a))
#define DEL(v, i) v.erase(v.begin() + i)
#define INSERT(v, i, a) v.insert(v.begin() + i, a)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define out cout
#define in cin
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;
}
// template end
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, max = 0, submax = -1, max_c = 0;
in >> N;
ll A[N];
REP(i, N) {
in >> A[i];
if (A[i] > submax) {
if (A[i] >= max) {
if (A[i] != max) {
max_c = 0;
submax = max;
}
max = A[i];
max_c++;
} else {
submax = A[i];
}
}
}
// out << max << max_c << endl;
// out << submax << endl;
REP(i, N) {
if (A[i] == max && max_c == 1) {
out << submax << endl;
} else {
out << max << endl;
}
}
} | [
"assignment.add"
] | 775,819 | 775,820 | u703877026 | cpp |
p02971 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int n;
int a[200005];
int nax1 = -1, nax2 = -2;
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (nax1 < a[i]) {
nax2 = nax1;
nax1 = a[i];
} else if (nax2 < a[i]) {
nax2 = a[i];
}
for (int i = 1; i <= n; i++) {
if (a[i] == nax1)
cout << nax2 << endl;
else
cout << nax1 << endl;
}
}
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int n;
int a[200005];
int nax1 = -1, nax2 = -2;
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (nax1 < a[i]) {
nax2 = nax1;
nax1 = a[i];
} else if (nax2 < a[i]) {
nax2 = a[i];
}
}
for (int i = 1; i <= n; i++) {
if (a[i] == nax1)
cout << nax2 << endl;
else
cout << nax1 << endl;
}
}
| [] | 775,828 | 775,829 | u450096124 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long LL;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
LL N;
cin >> N;
vector<LL> A(N);
vector<LL> Aorg(N);
rep(i, N) {
cin >> A[i];
Aorg[i] = A[i];
}
sort(A.rbegin(), A.rend());
rep(i, N) {
if (A[i] == Aorg[i]) {
cout << A[1] << "\n";
} else {
cout << A[0] << "\n";
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long LL;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
LL N;
cin >> N;
vector<LL> A(N);
vector<LL> Aorg(N);
rep(i, N) {
cin >> A[i];
Aorg[i] = A[i];
}
sort(A.rbegin(), A.rend());
rep(i, N) {
if (A[0] == Aorg[i]) {
cout << A[1] << "\n";
} else {
cout << A[0] << "\n";
}
}
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 775,847 | 775,848 | u758765597 | cpp |
p02971 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int maxV[] = {0, 0};
vector<int> A;
cin >> N;
for (int i = 1; i < N + 1; i++) {
int a;
cin >> a;
if (a == maxV[0]) {
maxV[0] = a;
} else if (a == maxV[1]) {
maxV[1] = a;
} else if (a > maxV[0]) {
maxV[1] = maxV[0];
maxV[0] = a;
} else if (a > maxV[1]) {
maxV[1] = a;
}
A.push_back(a);
}
for (int i = 0; i < N; i++) {
if (A[i] == maxV[0]) {
cout << maxV[1] << endl;
} else {
cout << maxV[0] << endl;
}
}
return 0;
} |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int maxV[] = {0, 0};
vector<int> A;
cin >> N;
for (int i = 1; i < N + 1; i++) {
int a;
cin >> a;
if (a == maxV[0]) {
maxV[1] = a;
} else if (a == maxV[1]) {
maxV[1] = a;
} else if (a > maxV[0]) {
maxV[1] = maxV[0];
maxV[0] = a;
} else if (a > maxV[1]) {
maxV[1] = a;
}
A.push_back(a);
}
for (int i = 0; i < N; i++) {
if (A[i] == maxV[0]) {
cout << maxV[1] << endl;
} else {
cout << maxV[0] << endl;
}
}
return 0;
} | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 775,857 | 775,858 | u074372598 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repn(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define EQ(a, b) (abs((a) - (b)) < eps)
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
int main() {
int N;
cin >> N;
vi a(N);
set<int> s;
for (int i = 0; i < N; i++) {
cin >> a[i];
s.insert(a[i]);
}
for (int i = 0; i < N; i++) {
auto it = s.find(a[i]);
s.erase(it);
cout << *s.rbegin() << endl;
s.insert(a[i]);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repn(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define EQ(a, b) (abs((a) - (b)) < eps)
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
int main() {
int N;
cin >> N;
vi a(N);
multiset<int> s;
for (int i = 0; i < N; i++) {
cin >> a[i];
s.insert(a[i]);
}
for (int i = 0; i < N; i++) {
auto it = s.find(a[i]);
s.erase(it);
cout << *s.rbegin() << endl;
s.insert(a[i]);
}
return 0;
}
| [
"variable_declaration.type.change"
] | 775,865 | 775,866 | u379947938 | cpp |
p02971 | #define repi(a, b) for (i = (a); i < (b); i++)
#include <iostream>
int main() {
long n;
std::cin >> n;
long *a = new long[n];
long i;
repi(0, n) std::cin >> a[i];
long max = -1, count = 0;
repi(0, n) {
if (a[i] > max) {
max = a[i];
count = 1;
}
if (a[i] == max)
count++;
}
if (count >= 2)
repi(0, n) std::cout << max << std::endl;
else {
long max2 = -1;
repi(0, n) if (a[i] > max2 && a[i] != max) max2 = a[i];
repi(0, n) {
if (a[i] == max)
std::cout << max2 << std::endl;
else
std::cout << max << std::endl;
}
}
return 0;
}
| #define repi(a, b) for (i = (a); i < (b); i++)
#include <iostream>
int main() {
long n;
std::cin >> n;
long *a = new long[n];
long i;
repi(0, n) std::cin >> a[i];
long max = -1, count = 0;
repi(0, n) {
if (a[i] > max) {
max = a[i];
count = 1;
} else if (a[i] == max)
count++;
}
if (count >= 2)
repi(0, n) std::cout << max << std::endl;
else {
long max2 = -1;
repi(0, n) if (a[i] > max2 && a[i] != max) max2 = a[i];
repi(0, n) {
if (a[i] == max)
std::cout << max2 << std::endl;
else
std::cout << max << std::endl;
}
}
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 775,867 | 775,868 | u948212340 | cpp |
p02971 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back;
/** Dateloper */
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n), B(n);
int maxx = 0, pos = 0;
for (int i = 1; i <= n; i++) {
cin >> A[i];
B.push_back(A[i]);
}
sort(B.begin(), B.end());
for (int i = 1; i <= n; i++) {
if (A[i] != B[n - 1])
cout << B[n - 1] << endl;
else
cout << B[n - 2] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back;
/** Dateloper */
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n), B;
int maxx = 0, pos = 0;
for (int i = 1; i <= n; i++) {
cin >> A[i];
B.push_back(A[i]);
}
sort(B.begin(), B.end());
for (int i = 1; i <= n; i++) {
if (A[i] != B[n - 1])
cout << B[n - 1] << endl;
else
cout << B[n - 2] << endl;
}
return 0;
}
| [] | 775,871 | 775,872 | u453071216 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
struct Num {
int idx, num;
bool operator<(const Num &n) const {
return (num == n.num) ? idx < n.idx : num < n.num;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
set<Num> S;
cin >> N;
for (int i = 0; i < N; i++) {
Num n;
n.idx = i;
cin >> n.num;
S.insert(n);
}
for (int i = 0; i < N; i++) {
auto it = S.rbegin();
if ((*it).idx == i)
it--;
cout << (*it).num << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
struct Num {
int idx, num;
bool operator<(const Num &n) const {
return (num == n.num) ? idx < n.idx : num < n.num;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
set<Num> S;
cin >> N;
for (int i = 0; i < N; i++) {
Num n;
n.idx = i;
cin >> n.num;
S.insert(n);
}
for (int i = 0; i < N; i++) {
auto it = S.rbegin();
if ((*it).idx == i)
it++;
cout << (*it).num << endl;
}
return 0;
}
| [] | 775,875 | 775,876 | u237044327 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], B[N];
int maxi, second;
int index;
maxi = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (maxi < A[i]) {
maxi = A[i];
index = i;
}
}
memcpy(B, A, sizeof(A));
sort(B, B + N);
maxi, second = B[N - 1], B[N - 2];
for (int i = 0; i < N; i++) {
if (i != index) {
cout << maxi << endl;
} else {
cout << second << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], B[N];
int maxi, second;
int index;
maxi = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (maxi < A[i]) {
maxi = A[i];
index = i;
}
}
memcpy(B, A, sizeof(A));
sort(B, B + N);
maxi = B[N - 1];
second = B[N - 2];
for (int i = 0; i < N; i++) {
if (i != index) {
cout << maxi << endl;
} else {
cout << second << endl;
}
}
} | [
"assignment.change"
] | 775,885 | 775,886 | u447604786 | cpp |
p02971 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
int N;
int A[200000];
int main(void) {
int i, max = 0, semimax = 0;
bool maxdup = false;
cin >> N;
for (i = 0; i < N; i++) {
cin >> A[i];
if (max < A[i]) {
semimax = max;
max = A[i];
} else if (max == A[i]) {
maxdup = true;
} else if (semimax < A[i]) {
semimax = A[i];
}
}
for (i = 0; i < N; i++) {
if (A[i] == max) {
if (maxdup == false) {
cout << semimax;
} else {
cout << max;
}
} else {
cout << max;
}
cout << endl;
}
return 0;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
int N;
int A[200000];
int main(void) {
int i, max = 0, semimax = 0;
bool maxdup = false;
cin >> N;
for (i = 0; i < N; i++) {
cin >> A[i];
if (max < A[i]) {
semimax = max;
max = A[i];
maxdup = false;
} else if (max == A[i]) {
maxdup = true;
} else if (semimax < A[i]) {
semimax = A[i];
}
}
for (i = 0; i < N; i++) {
if (A[i] == max) {
if (maxdup == false) {
cout << semimax;
} else {
cout << max;
}
} else {
cout << max;
}
cout << endl;
}
return 0;
}
| [
"assignment.add"
] | 775,889 | 775,890 | u940654002 | cpp |
p02971 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define sc second
#define ALL(x) x.begin(), x.end()
#define RALL(X) x.begin(), x.end()
#define FOR(i, n, k) for (i = 0; i < n; i += k)
#define FO(i, n, k) for (i = 1; i <= n; i += k)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define N 100005
#define mid ((l + r) / 2)
#define dbg(x) (cerr << #x << " : " << x << endl)
#define endl "\n"
#define MOD 100000009
using namespace std;
typedef long long int lli;
int main() {
ios_base::sync_with_stdio(false);
int n;
vector<int> ar(n);
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
vector<int> car = ar;
sort(ALL(car));
reverse(ALL(car));
for (int i = 0; i < n; i++) {
if (ar[i] == car[0])
cout << car[1] << endl;
else
cout << car[0] << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define sc second
#define ALL(x) x.begin(), x.end()
#define RALL(X) x.begin(), x.end()
#define FOR(i, n, k) for (i = 0; i < n; i += k)
#define FO(i, n, k) for (i = 1; i <= n; i += k)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define N 100005
#define mid ((l + r) / 2)
#define dbg(x) (cerr << #x << " : " << x << endl)
#define endl "\n"
#define MOD 100000009
using namespace std;
typedef long long int lli;
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> ar(n);
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
vector<int> car = ar;
sort(ALL(car));
reverse(ALL(car));
for (int i = 0; i < n; i++) {
if (ar[i] == car[0])
cout << car[1] << endl;
else
cout << car[0] << endl;
}
return 0;
} | [] | 775,918 | 775,919 | u724515098 | cpp |
p02971 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define sc second
#define ALL(x) x.begin(), x.end()
#define RALL(X) x.begin(), x.end()
#define FOR(i, n, k) for (i = 0; i < n; i += k)
#define FO(i, n, k) for (i = 1; i <= n; i += k)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define N 100005
#define mid ((l + r) / 2)
#define dbg(x) (cerr << #x << " : " << x << endl)
#define endl "\n"
#define MOD 100000009
using namespace std;
typedef long long int lli;
int main() {
ios_base::sync_with_stdio(false);
int n;
vector<int> ar(n);
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
vector<int> car = ar;
sort(ALL(car));
reverse(ALL(car));
for (int i = 0; i < n; i++) {
if (ar[i] == car[i])
cout << car[1] << endl;
else
cout << car[0] << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define sc second
#define ALL(x) x.begin(), x.end()
#define RALL(X) x.begin(), x.end()
#define FOR(i, n, k) for (i = 0; i < n; i += k)
#define FO(i, n, k) for (i = 1; i <= n; i += k)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define N 100005
#define mid ((l + r) / 2)
#define dbg(x) (cerr << #x << " : " << x << endl)
#define endl "\n"
#define MOD 100000009
using namespace std;
typedef long long int lli;
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> ar(n);
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
vector<int> car = ar;
sort(ALL(car));
reverse(ALL(car));
for (int i = 0; i < n; i++) {
if (ar[i] == car[0])
cout << car[1] << endl;
else
cout << car[0] << endl;
}
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 775,920 | 775,919 | u724515098 | cpp |
p02971 | #include <stdio.h>
int main() {
int N;
scanf("%d", &N);
int A[N];
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
int max_1 = 0;
int max_2 = 0;
for (int i = 0; i < N; i++) {
if (A[i] > max_1) {
max_2 = max_1;
max_1 = A[i];
}
if (max_2 < A[i] && A[i] < max_1)
max_2 = A[i];
}
int x;
x = 0;
for (int i = 0; i < N; i++) {
if (A[i] == max_1)
x++;
}
if (x == 1) {
for (int i = 0; i < N; i++) {
if (A[i] == max_1)
printf("%d", max_2);
else
printf("%d", max_1);
}
}
if (x >= 2) {
for (int i = 0; i < N; i++) {
printf("%d\n", max_1);
}
}
return 0;
}
| #include <stdio.h>
int main() {
int N;
scanf("%d", &N);
int A[N];
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
int max_1 = 0;
int max_2 = 0;
for (int i = 0; i < N; i++) {
if (A[i] > max_1) {
max_2 = max_1;
max_1 = A[i];
}
if (max_2 < A[i] && A[i] < max_1)
max_2 = A[i];
}
int x;
x = 0;
for (int i = 0; i < N; i++) {
if (A[i] == max_1)
x++;
}
if (x == 1) {
for (int i = 0; i < N; i++) {
if (A[i] == max_1)
printf("%d\n", max_2);
else
printf("%d\n", max_1);
}
}
if (x >= 2) {
for (int i = 0; i < N; i++) {
printf("%d\n", max_1);
}
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 775,929 | 775,930 | u507850687 | cpp |
p02971 | #include <stdio.h>
int main() {
int N;
scanf("%d", &N);
int A[N];
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
int max_1 = 0;
int max_2 = 0;
for (int i = 0; i < N; i++) {
if (A[i] > max_1) {
max_2 = max_1;
max_1 = A[i];
}
if (max_2 < A[i] && A[i] < max_1)
max_2 = A[i];
}
int x;
x = 0;
for (int i = 0; i < N; i++) {
if (A[i] == max_1)
x++;
}
if (x == 1) {
for (int i = 0; i < N; i++) {
if (A[i] == max_1)
printf("%d", max_2);
else
printf("%d", max_1);
}
}
if (x >= 2) {
for (int i = 0; i < N; i++) {
printf("%d", max_1);
}
}
return 0;
}
| #include <stdio.h>
int main() {
int N;
scanf("%d", &N);
int A[N];
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
int max_1 = 0;
int max_2 = 0;
for (int i = 0; i < N; i++) {
if (A[i] > max_1) {
max_2 = max_1;
max_1 = A[i];
}
if (max_2 < A[i] && A[i] < max_1)
max_2 = A[i];
}
int x;
x = 0;
for (int i = 0; i < N; i++) {
if (A[i] == max_1)
x++;
}
if (x == 1) {
for (int i = 0; i < N; i++) {
if (A[i] == max_1)
printf("%d\n", max_2);
else
printf("%d\n", max_1);
}
}
if (x >= 2) {
for (int i = 0; i < N; i++) {
printf("%d\n", max_1);
}
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 775,932 | 775,930 | u507850687 | cpp |
p02971 | #include <stdio.h>
int main() {
int N;
scanf("%d", &N);
int A[N];
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
int max_1 = 0;
int max_2 = 0;
for (int i = 0; i < N; i++) {
if (A[i] > max_1) {
max_2 = max_1;
max_1 = A[i];
}
if (max_2 < A[i] && A[i] < max_1)
max_2 = A[i];
}
int x = 0;
for (int i = 0; i < N; i++) {
if (A[i] == max_1)
x++;
}
if (x = 1) {
for (int i = 0; i < N; i++) {
if (A[i] == max_1)
printf("%d", max_2);
else
printf("%d", max_1);
}
}
if (x >= 2) {
for (int i = 0; i < N; i++) {
printf("%d", max_1);
}
}
return 0;
}
| #include <stdio.h>
int main() {
int N;
scanf("%d", &N);
int A[N];
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
int max_1 = 0;
int max_2 = 0;
for (int i = 0; i < N; i++) {
if (A[i] > max_1) {
max_2 = max_1;
max_1 = A[i];
}
if (max_2 < A[i] && A[i] < max_1)
max_2 = A[i];
}
int x;
x = 0;
for (int i = 0; i < N; i++) {
if (A[i] == max_1)
x++;
}
if (x == 1) {
for (int i = 0; i < N; i++) {
if (A[i] == max_1)
printf("%d\n", max_2);
else
printf("%d\n", max_1);
}
}
if (x >= 2) {
for (int i = 0; i < N; i++) {
printf("%d\n", max_1);
}
}
return 0;
}
| [
"variable_declaration.add",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 775,933 | 775,930 | u507850687 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
vector<int> xs(n);
for (int i = 0; i < n; i++)
cin >> xs[i];
vector<int> ys = xs;
sort(ys.begin(), ys.end());
for (int i = 0; i < n; i++) {
if (xs[i] == ys[n - 1])
cout << ys[n - 2] << endl;
else
cout << ys[n - 1] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> xs(n);
for (int i = 0; i < n; i++)
cin >> xs[i];
vector<int> ys = xs;
sort(ys.begin(), ys.end());
for (int i = 0; i < n; i++) {
if (xs[i] == ys[n - 1])
cout << ys[n - 2] << endl;
else
cout << ys[n - 1] << endl;
}
}
| [] | 775,934 | 775,935 | u771276542 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
priority_queue<int, vector<int>> pq;
int MAX, second;
for (int i = 0; i < N; i++) {
cin >> a.at(i);
pq.push(a.at(i));
}
MAX = pq.top();
pq.pop();
second = pq.top();
for (int i = 0; i < N; i++) {
if (a.at(i) == MAX)
cout << MAX << endl;
else
cout << second << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
priority_queue<int, vector<int>> pq;
int MAX, second;
for (int i = 0; i < N; i++) {
cin >> a.at(i);
pq.push(a.at(i));
}
MAX = pq.top();
pq.pop();
second = pq.top();
for (int i = 0; i < N; i++) {
if (a.at(i) == MAX)
cout << second << endl;
else
cout << MAX << endl;
}
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 775,936 | 775,937 | u384561774 | cpp |
p02971 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#ifdef rd
#define trace(...) \
cout << "Line:" << __LINE__ << " "; \
__f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef float f80;
#define double long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) ((long long)x.size())
#define fr(a, b, c) for (int a = b; a <= c; a++)
#define rep(a, b, c) for (int a = b; a < c; a++)
#define trav(a, x) for (auto &a : x)
#define all(con) con.begin(), con.end()
const ll infl = 0x3f3f3f3f3f3f3f3fLL;
const int infi = 0x3f3f3f3f;
// const int mod=998244353;
const int mod = 1000000007;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
oset;
auto clk = clock();
mt19937_64
rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
uniform_int_distribution<int> uid(0, lim - 1);
return uid(rang);
}
int powm(int a, int b, int mod) {
int res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
int a[200005];
void solve() {
int n;
cin >> n;
set<int, greater<int>> s;
fr(i, 1, n) {
int d;
cin >> d;
s.insert(d);
a[i] = d;
}
fr(i, 1, n) {
if (a[i] == *s.begin()) {
auto it = s.begin();
s.erase(it);
cout << *s.begin() << endl;
s.insert(*it);
} else
cout << *s.begin() << endl;
}
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
cout << fixed << setprecision(10);
int t = 1;
// cin>>t;
fr(i, 1, t) { solve(); }
#ifdef rd
cout << endl
<< endl
<< endl
<< endl
<< "Time elapsed: " << (double)(clock() - clk) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
| #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#ifdef rd
#define trace(...) \
cout << "Line:" << __LINE__ << " "; \
__f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef float f80;
#define double long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) ((long long)x.size())
#define fr(a, b, c) for (int a = b; a <= c; a++)
#define rep(a, b, c) for (int a = b; a < c; a++)
#define trav(a, x) for (auto &a : x)
#define all(con) con.begin(), con.end()
const ll infl = 0x3f3f3f3f3f3f3f3fLL;
const int infi = 0x3f3f3f3f;
// const int mod=998244353;
const int mod = 1000000007;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
oset;
auto clk = clock();
mt19937_64
rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
uniform_int_distribution<int> uid(0, lim - 1);
return uid(rang);
}
int powm(int a, int b, int mod) {
int res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
int a[200005];
void solve() {
int n;
cin >> n;
multiset<int, greater<int>> s;
fr(i, 1, n) {
int d;
cin >> d;
s.insert(d);
a[i] = d;
}
fr(i, 1, n) {
if (a[i] == *s.begin()) {
auto it = s.begin();
s.erase(it);
cout << *s.begin() << endl;
s.insert(*it);
} else
cout << *s.begin() << endl;
}
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
cout << fixed << setprecision(10);
int t = 1;
// cin>>t;
fr(i, 1, t) { solve(); }
#ifdef rd
cout << endl
<< endl
<< endl
<< endl
<< "Time elapsed: " << (double)(clock() - clk) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
| [
"variable_declaration.type.change"
] | 775,942 | 775,943 | u753736100 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair()
#define FOR(i, a, b) for (int i = a; i < (b); i++)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
multiset<int, greater<int>> s;
int arr[n];
FOR(i, 0, n) {
int a;
cin >> a;
s.insert(a);
arr[i] = a;
}
FOR(i, 0, n) {
int st = *s.begin();
if (arr[i] != *s.begin())
cout << *s.begin() << endl;
else {
s.erase(*s.begin());
cout << *s.begin() << endl;
}
s.insert(st);
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair()
#define FOR(i, a, b) for (int i = a; i < (b); i++)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
multiset<int, greater<int>> s;
int arr[n];
FOR(i, 0, n) {
int a;
cin >> a;
s.insert(a);
arr[i] = a;
}
FOR(i, 0, n) {
int st = *s.begin();
if (arr[i] != *s.begin())
cout << *s.begin() << endl;
else {
s.erase(s.begin());
cout << *s.begin() << endl;
s.insert(st);
}
}
}
| [
"call.arguments.change"
] | 775,944 | 775,945 | u753736100 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair()
#define FOR(i, a, b) for (int i = a; i < (b); i++)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
multiset<int, greater<int>> s;
int arr[n];
FOR(i, 0, n) {
int a;
cin >> a;
s.insert(a);
arr[i] = a;
}
FOR(i, 0, n) {
int st = *s.begin();
if (arr[i] != *s.begin())
cout << *s.begin() << endl;
else {
s.erase(s.begin());
cout << *s.begin() << endl;
}
s.insert(st);
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair()
#define FOR(i, a, b) for (int i = a; i < (b); i++)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
multiset<int, greater<int>> s;
int arr[n];
FOR(i, 0, n) {
int a;
cin >> a;
s.insert(a);
arr[i] = a;
}
FOR(i, 0, n) {
int st = *s.begin();
if (arr[i] != *s.begin())
cout << *s.begin() << endl;
else {
s.erase(s.begin());
cout << *s.begin() << endl;
s.insert(st);
}
}
}
| [] | 775,946 | 775,945 | u753736100 | cpp |
p02971 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define debug(x) cerr << #x << ": " << x << endl;
const int MOD = 1e9 + 7;
template <typename T> T gcd(T m, T n) { return n == 0 ? m : gcd(n, m % n); }
template <typename T> T lcm(T m, T n) { return n * m / gcd(n, m); }
signed main(void) {
int num;
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<int> b(n);
vector<int> c(n);
b[0] = a[0];
c[n - 1] = a[n - 1];
for (int i = 1; i < n; ++i) {
b[i] = max(a[i], b[i - 1]);
c[n - 1 - i] = max(a[n - 1 - i], b[n - i]);
}
for (int i = 0; i < n; ++i) {
if (i == 0) {
cout << c[i + 1] << endl;
} else if (i == n - 1) {
cout << b[i - 1] << endl;
} else {
cout << max(b[i - 1], c[i + 1]) << endl;
}
}
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define debug(x) cerr << #x << ": " << x << endl;
const int MOD = 1e9 + 7;
template <typename T> T gcd(T m, T n) { return n == 0 ? m : gcd(n, m % n); }
template <typename T> T lcm(T m, T n) { return n * m / gcd(n, m); }
signed main(void) {
int num;
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<int> b(n);
vector<int> c(n);
b[0] = a[0];
c[n - 1] = a[n - 1];
for (int i = 1; i < n; ++i) {
b[i] = max(a[i], b[i - 1]);
c[n - 1 - i] = max(a[n - 1 - i], c[n - i]);
}
for (int i = 0; i < n; ++i) {
if (i == 0) {
cout << c[i + 1] << endl;
} else if (i == n - 1) {
cout << b[i - 1] << endl;
} else {
cout << max(b[i - 1], c[i + 1]) << endl;
}
}
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 775,970 | 775,971 | u076865901 | cpp |
p02971 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long lli;
typedef long double ld;
typedef pair<lli, lli> plli;
typedef vector<lli> vlli;
typedef vector<plli> vplli;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define lcm(a, b) ((a * b) / gcd(a, b))
#define sqr(x) (x) * (x)
#define all(a) a.begin(), a.end()
#define UN(v) sort(all(v)), v.resize(unique(all(v)) - v.begin())
#define endl '\n'
const long long INF = 100000000000000000;
const long long MOD = 1000000007;
const long long MAXN = 100005;
lli dx[] = {0, 0, -1, 1, -1, -1, 1, 1};
lli dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
lli gcd(lli a, lli b) {
if (b == 0)
return a;
a %= b;
return gcd(b, a);
}
void solve() {
lli n;
cin >> n;
vlli v(n), pre(n), suf(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
pre[0] = v[0];
suf[n - 1] = v[n - 1];
for (int i = 1; i < n; ++i) {
pre[i] = max(pre[i - 1], v[i]);
}
for (auto i = n - 2; i >= 0; --i) {
suf[i] = max(suf[i + 1], v[i]);
}
for (int i = 0; i < n; ++i) {
if (i == 0) {
cout << suf[i] << endl;
} else if (i == n - 1) {
cout << pre[i] << endl;
} else {
cout << max(pre[i - 1], suf[i + 1]) << endl;
}
}
}
int main() {
IOS;
lli t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long lli;
typedef long double ld;
typedef pair<lli, lli> plli;
typedef vector<lli> vlli;
typedef vector<plli> vplli;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define lcm(a, b) ((a * b) / gcd(a, b))
#define sqr(x) (x) * (x)
#define all(a) a.begin(), a.end()
#define UN(v) sort(all(v)), v.resize(unique(all(v)) - v.begin())
#define endl '\n'
const long long INF = 100000000000000000;
const long long MOD = 1000000007;
const long long MAXN = 100005;
lli dx[] = {0, 0, -1, 1, -1, -1, 1, 1};
lli dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
lli gcd(lli a, lli b) {
if (b == 0)
return a;
a %= b;
return gcd(b, a);
}
void solve() {
lli n;
cin >> n;
vlli v(n), pre(n), suf(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
pre[0] = v[0];
suf[n - 1] = v[n - 1];
for (int i = 1; i < n; ++i) {
pre[i] = max(pre[i - 1], v[i]);
}
for (auto i = n - 2; i >= 0; --i) {
suf[i] = max(suf[i + 1], v[i]);
}
for (int i = 0; i < n; ++i) {
if (i == 0) {
cout << suf[i + 1] << endl;
} else if (i == n - 1) {
cout << pre[i - 1] << endl;
} else {
cout << max(pre[i - 1], suf[i + 1]) << endl;
}
}
}
int main() {
IOS;
lli t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
} | [
"expression.operation.binary.add"
] | 775,974 | 775,975 | u989928804 | cpp |
p02971 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int c_head[n + 1];
int c_tail[n + 1];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
c_head[0] = 0;
c_tail[n] = 0;
for (int j = 1; j <= n; j++) {
c_head[j] = max(c_head[j - 1], a[j - 1]);
c_tail[n - j] = max(c_tail[n - j + 1], a[n - j]);
}
for (int k = 0; k < n; k++) {
if (k == 0) {
cout << c_tail[0] << endl;
} else if (k == n - 1) {
cout << c_head[n - 1] << endl;
} else {
cout << max(c_head[k - 1], c_tail[k + 1]) << endl;
}
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int c_head[n + 1];
int c_tail[n + 1];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
c_head[0] = 0;
c_tail[n] = 0;
for (int j = 1; j <= n; j++) {
c_head[j] = max(c_head[j - 1], a[j - 1]);
c_tail[n - j] = max(c_tail[n - j + 1], a[n - j]);
}
for (int k = 0; k < n; k++) {
if (k == 0) {
cout << c_tail[1] << endl;
} else if (k == n - 1) {
cout << c_head[n - 1] << endl;
} else {
cout << max(c_head[k], c_tail[k + 1]) << endl;
}
}
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change",
"expression.operation.binary.remove"
] | 775,982 | 775,983 | u883792993 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
int MAX = 0, MAXi;
for (int i = 0; i < N; i++) {
cin >> a.at(i);
if (a.at(i) > MAX) {
MAX = a.at(i);
MAXi = i;
}
}
for (int i = 0; i < N; i++) {
if (i == MAXi) {
int MAX2 = 0;
for (int j = 0; i < N; j++) {
if (j != i)
MAX2 = max(MAX2, a.at(j));
}
cout << MAX2 << endl;
} else {
cout << MAX << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
int MAX = 0, MAXi;
for (int i = 0; i < N; i++) {
cin >> a.at(i);
if (a.at(i) > MAX) {
MAX = a.at(i);
MAXi = i;
}
}
for (int i = 0; i < N; i++) {
if (i == MAXi) {
int MAX2 = 0;
for (int j = 0; j < N; j++) {
if (j != i)
MAX2 = max(MAX2, a.at(j));
}
cout << MAX2 << endl;
} else {
cout << MAX << endl;
}
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 775,984 | 775,985 | u652009496 | cpp |
p02971 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
vector<int> L(n), R(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &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]);
vector<int> ret(n);
ret[0] = R[1];
ret[n - 1] = L[n - 1];
for (int i = 1; i < n - 1; ++i) {
ret[i] = max(L[i - 1], R[i + 1]);
}
for (int i = 0; i < n; ++i) {
printf("%d\n", ret[i]);
}
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
vector<int> L(n), R(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &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]);
vector<int> ret(n);
ret[0] = R[1];
ret[n - 1] = L[n - 2];
for (int i = 1; i < n - 1; ++i) {
ret[i] = max(L[i - 1], R[i + 1]);
}
for (int i = 0; i < n; ++i) {
printf("%d\n", ret[i]);
}
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 775,986 | 775,987 | u112723190 | cpp |
p02971 | /*
Original problem: https://atcoder.jp/contests/abc134/tasks/abc134_c
Author: sammochen
*/
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define REP(x, l, u) for (ll x = l; x < u; x++)
#define RREP(x, l, u) for (ll x = l; x >= u; x--)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define MP make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef vector<ll> VLL;
typedef vector<int> VI;
const ll mod = 1e9 + 7;
namespace SOLVE {
void main() {
int n;
cin >> n;
VI A(n);
deque<int> dq;
REP(i, 0, n) {
cin >> A[i];
if (dq.size() == 0) {
dq.push_front(A[i]);
} else if (dq.size() == 1) {
if (A[i] >= dq.size()) {
dq.push_front(A[i]);
} else {
dq.push_back(A[i]);
}
} else if (A[i] >= dq.front()) {
dq.push_front(A[i]);
dq.pop_back();
} else if (A[i] >= dq.back()) {
dq.pop_back();
dq.push_back(A[i]);
}
}
REP(i, 0, n) {
if (dq.size() == 1) {
cout << dq.front() << endl;
} else {
if (A[i] == dq.front()) {
cout << dq.back() << endl;
} else {
cout << dq.front() << endl;
}
}
}
}
} // namespace SOLVE
signed main() {
int t;
t = 1;
// cin >> t;
while (t--) {
SOLVE::main();
}
return 0;
} | /*
Original problem: https://atcoder.jp/contests/abc134/tasks/abc134_c
Author: sammochen
*/
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define REP(x, l, u) for (ll x = l; x < u; x++)
#define RREP(x, l, u) for (ll x = l; x >= u; x--)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define MP make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef vector<ll> VLL;
typedef vector<int> VI;
const ll mod = 1e9 + 7;
namespace SOLVE {
void main() {
int n;
cin >> n;
VI A(n);
deque<int> dq;
// my attempt at a O(n) solution
// trying to avoid O(nlogn) sorting
REP(i, 0, n) {
cin >> A[i];
if (dq.size() == 0) {
dq.push_front(A[i]);
} else if (dq.size() == 1) {
if (A[i] >= dq.front()) {
dq.push_front(A[i]);
} else {
dq.push_back(A[i]);
}
} else if (A[i] >= dq.front()) {
dq.push_front(A[i]);
dq.pop_back();
} else if (A[i] >= dq.back()) {
dq.pop_back();
dq.push_back(A[i]);
}
}
REP(i, 0, n) {
if (dq.size() == 1) {
cout << dq.front() << endl;
} else {
if (A[i] == dq.front()) {
cout << dq.back() << endl;
} else {
cout << dq.front() << endl;
}
}
}
}
} // namespace SOLVE
signed main() {
int t;
t = 1;
// cin >> t;
while (t--) {
SOLVE::main();
}
return 0;
} | [
"call.function.change",
"control_flow.branch.if.condition.change"
] | 775,993 | 775,994 | u152558760 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n], lmax[n + 1], rmax[n + 1];
for (long long int i = 0; i < n; i++)
cin >> a[i];
lmax[0] = 0;
rmax[0] = 0;
for (long long int i = 0; i < n; i++) {
lmax[i + 1] = max(lmax[i], a[i]);
rmax[i + 1] = max(lmax[i], a[n - i - 1]);
}
for (long long int i = 0; i < n; i++)
cout << max(lmax[i], rmax[n - i - 1]) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n], lmax[n + 1], rmax[n + 1];
for (long long int i = 0; i < n; i++)
cin >> a[i];
lmax[0] = 0;
rmax[0] = 0;
for (long long int i = 0; i < n; i++) {
lmax[i + 1] = max(lmax[i], a[i]);
rmax[i + 1] = max(rmax[i], a[n - i - 1]);
}
for (long long int i = 0; i < n; i++)
cout << max(lmax[i], rmax[n - i - 1]) << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 776,001 | 776,002 | u513726585 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n], lmax[n], rmax[n];
for (long long int i = 0; i < n; i++)
cin >> a[i];
lmax[0] = 0;
rmax[0] = 0;
for (long long int i = 0; i < n; i++) {
lmax[i + 1] = max(lmax[i], a[i]);
rmax[i + 1] = max(lmax[i], a[n - i - 1]);
}
for (long long int i = 0; i < n; i++)
cout << max(lmax[i], rmax[n - i - 1]) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n], lmax[n + 1], rmax[n + 1];
for (long long int i = 0; i < n; i++)
cin >> a[i];
lmax[0] = 0;
rmax[0] = 0;
for (long long int i = 0; i < n; i++) {
lmax[i + 1] = max(lmax[i], a[i]);
rmax[i + 1] = max(rmax[i], a[n - i - 1]);
}
for (long long int i = 0; i < n; i++)
cout << max(lmax[i], rmax[n - i - 1]) << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 776,003 | 776,002 | u513726585 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
int A[n];
int max = 0, second = 0;
int place = 0;
bool exist;
for (int i = 0; i < n; i++) {
A[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> A[i];
if (max < A[i]) {
max = A[i];
exist = false;
} else if (max == A[i]) {
exist = true;
} else {
if (second < A[i]) {
second = A[i];
}
}
}
for (int i = 0; i < n; i++) {
if (A[i] == max && exist) {
cout << max << endl;
} else if (A[i] == max && !exist) {
cout << second << endl;
} else {
cout << max << endl;
}
}
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
int A[n];
int max = 0, second = 0;
int place = 0;
bool exist;
for (int i = 0; i < n; i++) {
A[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> A[i];
if (max < A[i]) {
second = max;
max = A[i];
exist = false;
} else if (max == A[i]) {
exist = true;
} else {
if (second < A[i]) {
second = A[i];
}
}
}
for (int i = 0; i < n; i++) {
if (A[i] == max && exist) {
cout << max << endl;
} else if (A[i] == max && !exist) {
cout << second << endl;
} else {
cout << max << endl;
}
}
} | [
"assignment.add"
] | 776,017 | 776,018 | u219241981 | cpp |
p02971 |
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef long double ld;
const int maxN = 200000;
int main() {
ll N;
ll A[maxN];
cin >> N;
ll firstMax = 0;
ll secondMax = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] > firstMax) {
secondMax = firstMax;
firstMax = A[i];
} else if (A[i] > secondMax) {
secondMax = A[i];
}
}
REP(i, N) {
if (A[i] = firstMax) {
cout << secondMax << endl;
} else {
cout << firstMax << endl;
}
}
}
|
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef long double ld;
const int maxN = 200000;
int main() {
ll N;
ll A[maxN];
cin >> N;
ll firstMax = 0;
ll secondMax = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] > firstMax) {
secondMax = firstMax;
firstMax = A[i];
} else if (A[i] > secondMax) {
secondMax = A[i];
}
}
REP(i, N) {
if (A[i] == firstMax) {
cout << secondMax << endl;
} else {
cout << firstMax << endl;
}
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 776,028 | 776,029 | u741556152 | cpp |
p02971 | #include <algorithm>
#include <iostream>
constexpr int MAX_N = 200000;
int A[MAX_N];
int lmax[MAX_N];
int rmax[MAX_N];
int main() {
int N;
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
}
lmax[0] = A[0];
for (int i = 1; i < N; ++i) {
lmax[i] = std::max(lmax[i - 1], A[i]);
}
rmax[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; --i) {
rmax[i] = std::max(rmax[i + 1], A[i]);
}
std::cout << rmax[1] << std::endl;
for (int i = 1; i < N - 1; ++i) {
std::cout << std::max(lmax[i - 1], rmax[i + 1]) << std::endl;
}
std::cout << lmax[N - 1] << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
constexpr int MAX_N = 200000;
int A[MAX_N];
int lmax[MAX_N];
int rmax[MAX_N];
int main() {
int N;
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
}
lmax[0] = A[0];
for (int i = 1; i < N; ++i) {
lmax[i] = std::max(lmax[i - 1], A[i]);
}
rmax[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; --i) {
rmax[i] = std::max(rmax[i + 1], A[i]);
}
std::cout << rmax[1] << std::endl;
for (int i = 1; i < N - 1; ++i) {
std::cout << std::max(lmax[i - 1], rmax[i + 1]) << std::endl;
}
std::cout << lmax[N - 2] << std::endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 776,032 | 776,033 | u123023461 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
b = a;
sort(b.begin(), b.end());
for (int i = 0; i < n; i++) {
if (a.at(i) = b.at(n - 1))
cout << b.at(n - 2) << endl;
else
cout << b.at(n - 1) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
b = a;
sort(b.begin(), b.end());
for (int i = 0; i < n; i++) {
if (a.at(i) == b.at(n - 1))
cout << b.at(n - 2) << endl;
else
cout << b.at(n - 1) << endl;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 776,038 | 776,039 | u059207724 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a, index, max1 = 0, max2 = 0;
for (i = 0; i < n; i++) {
cin >> a;
if (a >= max1) {
index = i;
max2 = max1;
max1 = a;
} else if (a >= max2) {
max2 = a;
}
}
for (i = 0; i < n; i++) {
if (i != index) {
printf("%d\n", max1);
} else {
printf("%d\n", max2);
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a, index, max1 = 0, max2 = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
if (a >= max1) {
index = i;
max2 = max1;
max1 = a;
} else if (a >= max2) {
max2 = a;
}
}
for (i = 0; i < n; i++) {
if (i != index) {
printf("%d\n", max1);
} else {
printf("%d\n", max2);
}
}
return 0;
}
| [] | 776,040 | 776,041 | u058348416 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a, index, max1 = 0, max2 = 0;
for (i = 0; i < n; i++) {
cin >> a;
if (a >= max1) {
index = i;
max2 = max1;
max1 = a;
} else if (a >= max2) {
max2 = 2;
}
}
for (i = 0; i < n; i++) {
if (i != index) {
printf("%d\n", max1);
} else {
printf("%d\n", max2);
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a, index, max1 = 0, max2 = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
if (a >= max1) {
index = i;
max2 = max1;
max1 = a;
} else if (a >= max2) {
max2 = a;
}
}
for (i = 0; i < n; i++) {
if (i != index) {
printf("%d\n", max1);
} else {
printf("%d\n", max2);
}
}
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 776,042 | 776,041 | u058348416 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (long int)n; i++)
using namespace std;
int main() {
long int n;
cin >> n;
vector<long int> a(n), b(n);
rep(i, n) { cin >> a[i]; }
b = a;
sort(b.begin(), b.end());
rep(i, n) {
if (a[i] == b[n]) {
cout << b[n - 1];
} else {
cout << b[n];
}
cout << "\n";
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (long int)n; i++)
using namespace std;
int main() {
long int n;
cin >> n;
vector<long int> a(n), b(n);
rep(i, n) { cin >> a[i]; }
b = a;
sort(b.begin(), b.end());
rep(i, n) {
if (a[i] == b[n - 1]) {
cout << b[n - 2];
} else {
cout << b[n - 1];
}
cout << "\n";
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.branch.else.add"
] | 776,048 | 776,049 | u667375816 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = a; i < b; ++i)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<ll> A(N);
loop(i, 0, N) cin >> A[i];
vector<ll> B = A;
sort(A.begin(), A.end());
loop(i, 0, N) {
if (A[i] != B[N - 1])
cout << B[N - 1] << "\n";
else
cout << B[N - 2] << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = a; i < b; ++i)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<ll> A(N);
loop(i, 0, N) cin >> A[i];
vector<ll> B = A;
sort(A.begin(), A.end());
loop(i, 0, N) {
if (B[i] != A[N - 1])
cout << A[N - 1] << "\n";
else
cout << A[N - 2] << "\n";
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 776,057 | 776,058 | u158826456 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N);
vector<int> sorted(N);
for (auto i = 0; i < N; i++)
cin >> A[i];
copy(A.begin(), A.end(), sorted.begin());
sort(sorted.begin(), sorted.end());
for (auto i = 0; i < N; i++) {
if (A[i] == *sorted.end())
cout << sorted[N - 2] << endl;
else
cout << sorted[N - 1] << endl;
}
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N);
vector<int> sorted(N);
for (auto i = 0; i < N; i++)
cin >> A[i];
copy(A.begin(), A.end(), sorted.begin());
sort(sorted.begin(), sorted.end());
for (auto i = 0; i < N; i++) {
if (A[i] == sorted[N - 1])
cout << sorted[N - 2] << endl;
else
cout << sorted[N - 1] << endl;
}
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 776,061 | 776,062 | u407539638 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
int left[N];
int right[N];
int max_e = std::numeric_limits<int>::min();
for (int i = 0; i < N; i++) {
cin >> A[i];
max_e = std::max(A[i], max_e);
left[i] = max_e;
}
if (N == 1) { // edge case
cout << A[0] << "\n";
return 0;
}
max_e = std::numeric_limits<int>::min();
for (int i = N - 1; i >= 0; i--) {
max_e = std::max(A[i], max_e);
right[i] = max_e;
}
for (int i = 0; i < N; i++) {
if (i == 0) {
cout << A[i + 1] << "\n";
} else if (i == N - 1) {
cout << A[i - 1] << "\n";
} else {
cout << std::max(left[i - 1], right[i + 1]) << "\n";
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
int left[N];
int right[N];
int max_e = std::numeric_limits<int>::min();
for (int i = 0; i < N; i++) {
cin >> A[i];
max_e = std::max(A[i], max_e);
left[i] = max_e;
}
if (N == 1) { // edge case
cout << A[0] << "\n";
return 0;
}
max_e = std::numeric_limits<int>::min();
for (int i = N - 1; i >= 0; i--) {
max_e = std::max(A[i], max_e);
right[i] = max_e;
}
for (int i = 0; i < N; i++) {
if (i == 0) {
cout << right[i + 1] << "\n";
} else if (i == N - 1) {
cout << left[i - 1] << "\n";
} else {
cout << std::max(left[i - 1], right[i + 1]) << "\n";
}
}
return 0;
} | [
"identifier.change",
"io.output.change"
] | 776,074 | 776,075 | u951665306 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
int left[N];
int right[N];
int max_e = std::numeric_limits<int>::min();
for (int i = 0; i < N; i++) {
cin >> A[i];
max_e = std::max(A[i], max_e);
left[i] = max_e;
}
if (N == 1) { // edge case
cout << A[0] << "\n";
return 0;
}
max_e = std::numeric_limits<int>::min();
for (int i = N - 1; i >= 0; i--) {
max_e = std::max(A[i], max_e);
right[i] = max_e;
}
for (int i = 0; i < N; i++) {
if (i == 0) {
cout << A[i + 1] << "\n";
} else if (i == N - 1) {
cout << A[i - 1] << "\n";
} else {
cout << std::max(A[i - 1], A[i + 1]) << "\n";
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
int left[N];
int right[N];
int max_e = std::numeric_limits<int>::min();
for (int i = 0; i < N; i++) {
cin >> A[i];
max_e = std::max(A[i], max_e);
left[i] = max_e;
}
if (N == 1) { // edge case
cout << A[0] << "\n";
return 0;
}
max_e = std::numeric_limits<int>::min();
for (int i = N - 1; i >= 0; i--) {
max_e = std::max(A[i], max_e);
right[i] = max_e;
}
for (int i = 0; i < N; i++) {
if (i == 0) {
cout << right[i + 1] << "\n";
} else if (i == N - 1) {
cout << left[i - 1] << "\n";
} else {
cout << std::max(left[i - 1], right[i + 1]) << "\n";
}
}
return 0;
} | [
"identifier.change",
"io.output.change"
] | 776,076 | 776,075 | u951665306 | cpp |
p02971 | #include <bits/stdc++.h>
typedef long long ll;
#define mod 1000000007
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define matrix vector<vll>
#define all(v) v.begin(), v.end()
#define PQ priority_queue
using namespace std;
ll pow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res *= a;
b /= 2;
a *= a;
}
return res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vii v(n);
multiset<int> ml;
for (int i = 0; i < n; i++) {
cin >> v[i];
ml.insert(v[i]);
}
for (int i = 0; i < n; i++) {
ml.erase(v[i]);
auto it = ml.rbegin();
cout << *it << "\n";
ml.insert(v[i]);
}
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
#define mod 1000000007
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define matrix vector<vll>
#define all(v) v.begin(), v.end()
#define PQ priority_queue
using namespace std;
ll pow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res *= a;
b /= 2;
a *= a;
}
return res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vii v(n);
multiset<int> ml;
for (int i = 0; i < n; i++) {
cin >> v[i];
ml.insert(v[i]);
}
for (int i = 0; i < n; i++) {
ml.erase(ml.find(v[i]));
auto it = ml.rbegin();
cout << *it << "\n";
ml.insert(v[i]);
}
return 0;
}
| [
"call.arguments.add",
"call.arguments.change"
] | 776,083 | 776,084 | u590198086 | cpp |
p02971 | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
int main() {
int n;
cin >> n;
vector<int> arr(n, 0);
for (int i = 0; i < n; i++)
cin >> arr[i];
auto it = max_element(arr.begin(), arr.end());
int idx = distance(arr.begin(), it);
int M = *it;
for (int i = idx; i < n - 1; i++) {
arr[i] = arr[idx + 1];
}
int M2 = *max_element(arr.begin(), arr.end() - 1);
for (int i = 0; i < n; i++) {
if (i == idx)
cout << M2 << endl;
else
cout << M << endl;
}
}
| #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
int main() {
int n;
cin >> n;
vector<int> arr(n, 0);
for (int i = 0; i < n; i++)
cin >> arr[i];
auto it = max_element(arr.begin(), arr.end());
int idx = distance(arr.begin(), it);
int M = *it;
for (int i = idx; i < n - 1; i++) {
arr[i] = arr[i + 1];
}
int M2 = *max_element(arr.begin(), arr.begin() + (n - 1));
for (int i = 0; i < n; i++) {
if (i == idx)
cout << M2 << endl;
else
cout << M << endl;
}
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.function.change",
"call.arguments.change"
] | 776,104 | 776,105 | u067694854 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> A(N);
for (auto &a : A)
cin >> a;
auto B = A;
sort(A.begin(), A.end(), greater<int>());
for (auto b : B) {
if (b != A[0]) {
cout << A[0] << endl;
} else {
cout << A[1] << endl;
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (auto &a : A)
cin >> a;
auto B = A;
sort(A.begin(), A.end(), greater<int>());
for (auto b : B) {
if (b != A[0]) {
cout << A[0] << endl;
} else {
cout << A[1] << endl;
}
}
return 0;
} | [] | 776,120 | 776,121 | u587172770 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<char> vchar;
typedef vector<vector<char>> vvchar;
typedef vector<long double> vdouble;
typedef vector<vector<long double>> vvdouble;
typedef vector<vector<vector<long double>>> vvvdouble;
typedef pair<ll, ll> pint;
typedef vector<pint> vpint;
typedef vector<bool> vbool;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ALL(obj) (obj).begin(), (obj).end()
// #define LLONG_MAX 9223372036854775806
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
#define vsortgr(vec) sort(vec.begin(), vec.end(), greater<ll>())
// #define MOD 1000000007
#define MOD 998244353
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;
}
//
// struct Node{
// vint children;
// ll index;
// ll prop;
// };
// struct edge{ll to; ll cost;};
int dy[] = {0, 0, 1, -1};
int dx[] = {
1,
-1,
0,
0,
};
// ll X,Y,Z,K;
// ll pmax = 30000000000;
// vint A,B,C;
// void comb(vector<vector <long long int> > &v){
// for(int i = 0;i <v.size(); i++){
// v[i][0]=1;
// v[i][i]=1;
// }
// for(int k = 1;k <v.size();k++){
// for(int j = 1;j<k;j++){
// v[k][j]=((v[k-1][j-1]+v[k-1][j])%MOD);
// }
// }
// }
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(int a, ll b) { return a * b / gcd(a, b); }
// 繰り返し二乗法
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
const int MAX = 510000;
ll fact[MAX], fact_inv[MAX];
void init_fact(ll n) {
fact[0] = 1;
// 階乗の計算
rep(i, n) fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[n] = power(fact[n], MOD - 2);
// 逆元の計算
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
ll perm(ll n, ll r) { return (fact[n] * fact_inv[n - r]) % MOD; }
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> num;
// vector<ll> dist; // rootまでの距離
UnionFind(ll N) : par(N), num(N) { //最初は全てが根であるとして初期化
for (ll i = 0; i < N; i++)
par[i] = i;
for (ll i = 0; i < N; i++)
num[i] = 1;
// for(ll i = 0; i < N; i++) dist[i] = 0;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); // xの根をrx
ll ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
num[ry] = num[rx] + num[ry];
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll size(ll x) { return num[root(x)]; }
};
vint divisor(ll n) { // nの約数
vint ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.pb(i);
if (i * i != n)
ret.pb(n / i);
}
}
vsort(ret);
return ret;
}
ll my_pow(ll x, ll y) {
ll rtn = 1;
rep(i, y) rtn *= x;
return rtn;
}
ll get_digit_in(ll n, ll i) { // i桁目の数字を得る。
for (ll j = 0; j < i - 1; j++) {
n /= 10;
}
return n % 10;
}
ll get_digit(ll n) {
ll rtn = 0;
while (n > 0) {
n /= 10;
rtn++;
}
return rtn;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> rtn;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
rtn[i]++;
n /= i;
}
}
if (n != 1)
rtn[n] = 1;
return rtn;
}
// nPnの順列に対して処理を実行する
void foreach_permutation(ll n, function<void(ll *)> f) {
ll indexes[n];
for (ll i = 0; i < n; i++)
indexes[i] = i;
do {
f(indexes);
} while (std::next_permutation(indexes, indexes + n));
}
void recursive_comb(ll *indexes, ll s, ll rest, function<void(ll *)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(ll n, ll k, function<void(ll *)> f) {
ll indexes[k];
recursive_comb(indexes, n - 1, k, f);
}
// nPkの順列に対して処理を実行する
void foreach_permutation(ll n, ll k, function<void(ll *)> f) {
foreach_comb(n, k, [&](ll *c_indexes) {
foreach_permutation(k, [&](ll *p_indexes) {
ll indexes[k];
for (ll i = 0; i < k; i++) {
indexes[i] = c_indexes[p_indexes[i]];
}
f(indexes);
});
});
}
ll arr[55556];
vint primes;
//エラトステネスの篩
void Eratosthenes() {
ll N = 55556;
for (ll i = 0; i < N; i++) {
arr[i] = 1;
}
for (ll i = 2; i < sqrt(N); i++) {
if (arr[i]) {
for (ll j = 0; i * (j + 2) < N; j++) {
arr[i * (j + 2)] = 0;
}
}
}
for (ll i = 2; i < N; i++) {
if (arr[i] && i % 5 == 1) {
primes.pb(i);
// cout << i << endl;
}
}
}
bool f(ll x, ll n, ll k) { return (n - x) * (n - x + 1) - x < k; }
ll h[4000][4000];
int main() {
cout << fixed << setprecision(12);
ll N;
cin >> N;
vint A(N);
rep(i, N) cin >> A[i];
vpint b(N);
rep(i, N) b[i] = mp(A[i], i);
sort(ALL(b));
vint c(N);
rep(i, N) c[i] = b[i].se;
rep(i, N) {
if (c[i] == N - 1) {
cout << b[N - 2].fi << endl;
} else {
cout << b[N - 1].fi << endl;
}
}
}
//
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<char> vchar;
typedef vector<vector<char>> vvchar;
typedef vector<long double> vdouble;
typedef vector<vector<long double>> vvdouble;
typedef vector<vector<vector<long double>>> vvvdouble;
typedef pair<ll, ll> pint;
typedef vector<pint> vpint;
typedef vector<bool> vbool;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ALL(obj) (obj).begin(), (obj).end()
// #define LLONG_MAX 9223372036854775806
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
#define vsortgr(vec) sort(vec.begin(), vec.end(), greater<ll>())
// #define MOD 1000000007
#define MOD 998244353
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;
}
//
// struct Node{
// vint children;
// ll index;
// ll prop;
// };
// struct edge{ll to; ll cost;};
int dy[] = {0, 0, 1, -1};
int dx[] = {
1,
-1,
0,
0,
};
// ll X,Y,Z,K;
// ll pmax = 30000000000;
// vint A,B,C;
// void comb(vector<vector <long long int> > &v){
// for(int i = 0;i <v.size(); i++){
// v[i][0]=1;
// v[i][i]=1;
// }
// for(int k = 1;k <v.size();k++){
// for(int j = 1;j<k;j++){
// v[k][j]=((v[k-1][j-1]+v[k-1][j])%MOD);
// }
// }
// }
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(int a, ll b) { return a * b / gcd(a, b); }
// 繰り返し二乗法
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
const int MAX = 510000;
ll fact[MAX], fact_inv[MAX];
void init_fact(ll n) {
fact[0] = 1;
// 階乗の計算
rep(i, n) fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[n] = power(fact[n], MOD - 2);
// 逆元の計算
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
ll perm(ll n, ll r) { return (fact[n] * fact_inv[n - r]) % MOD; }
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> num;
// vector<ll> dist; // rootまでの距離
UnionFind(ll N) : par(N), num(N) { //最初は全てが根であるとして初期化
for (ll i = 0; i < N; i++)
par[i] = i;
for (ll i = 0; i < N; i++)
num[i] = 1;
// for(ll i = 0; i < N; i++) dist[i] = 0;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); // xの根をrx
ll ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
num[ry] = num[rx] + num[ry];
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll size(ll x) { return num[root(x)]; }
};
vint divisor(ll n) { // nの約数
vint ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.pb(i);
if (i * i != n)
ret.pb(n / i);
}
}
vsort(ret);
return ret;
}
ll my_pow(ll x, ll y) {
ll rtn = 1;
rep(i, y) rtn *= x;
return rtn;
}
ll get_digit_in(ll n, ll i) { // i桁目の数字を得る。
for (ll j = 0; j < i - 1; j++) {
n /= 10;
}
return n % 10;
}
ll get_digit(ll n) {
ll rtn = 0;
while (n > 0) {
n /= 10;
rtn++;
}
return rtn;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> rtn;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
rtn[i]++;
n /= i;
}
}
if (n != 1)
rtn[n] = 1;
return rtn;
}
// nPnの順列に対して処理を実行する
void foreach_permutation(ll n, function<void(ll *)> f) {
ll indexes[n];
for (ll i = 0; i < n; i++)
indexes[i] = i;
do {
f(indexes);
} while (std::next_permutation(indexes, indexes + n));
}
void recursive_comb(ll *indexes, ll s, ll rest, function<void(ll *)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(ll n, ll k, function<void(ll *)> f) {
ll indexes[k];
recursive_comb(indexes, n - 1, k, f);
}
// nPkの順列に対して処理を実行する
void foreach_permutation(ll n, ll k, function<void(ll *)> f) {
foreach_comb(n, k, [&](ll *c_indexes) {
foreach_permutation(k, [&](ll *p_indexes) {
ll indexes[k];
for (ll i = 0; i < k; i++) {
indexes[i] = c_indexes[p_indexes[i]];
}
f(indexes);
});
});
}
ll arr[55556];
vint primes;
//エラトステネスの篩
void Eratosthenes() {
ll N = 55556;
for (ll i = 0; i < N; i++) {
arr[i] = 1;
}
for (ll i = 2; i < sqrt(N); i++) {
if (arr[i]) {
for (ll j = 0; i * (j + 2) < N; j++) {
arr[i * (j + 2)] = 0;
}
}
}
for (ll i = 2; i < N; i++) {
if (arr[i] && i % 5 == 1) {
primes.pb(i);
// cout << i << endl;
}
}
}
bool f(ll x, ll n, ll k) { return (n - x) * (n - x + 1) - x < k; }
ll h[4000][4000];
int main() {
cout << fixed << setprecision(12);
ll N;
cin >> N;
vint A(N);
rep(i, N) cin >> A[i];
vpint b(N);
rep(i, N) b[i] = mp(A[i], i);
sort(ALL(b));
vint c(N);
rep(i, N) c[b[i].se] = i;
rep(i, N) {
if (c[i] == N - 1) {
cout << b[N - 2].fi << endl;
} else {
cout << b[N - 1].fi << endl;
}
}
}
//
| [
"assignment.change"
] | 776,124 | 776,125 | u644070128 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int fmax = max(arr[0], arr[1]);
int index;
if (fmax == arr[0])
index = 0;
else
index = 1;
int smax = min(arr[0], arr[1]);
for (int i = 2; i < n; i++) {
if (arr[i] > fmax) {
smax = fmax;
fmax = arr[i];
index = i;
} else if (arr[i] < fmax && arr[i] > smax) {
smax = arr[i];
}
}
for (int i = 0; i < n; i++) {
if (i == index)
cout << smax << endl;
else
cout << fmax << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int fmax = max(arr[0], arr[1]);
int index;
if (fmax == arr[0])
index = 0;
else
index = 1;
int smax = min(arr[0], arr[1]);
for (int i = 2; i < n; i++) {
if (arr[i] >= fmax) {
smax = fmax;
fmax = arr[i];
index = i;
} else if (arr[i] < fmax && arr[i] > smax) {
smax = arr[i];
}
}
for (int i = 0; i < n; i++) {
if (i == index)
cout << smax << endl;
else
cout << fmax << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 776,133 | 776,134 | u589502773 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
const long long MOD = 1e9 + 7, INF = 1e18;
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;
}
template <class T> class SegmentTree {
private:
int N;
T initVal;
std::vector<T> ary;
std::function<T(T &, T &)> merge;
void init(int n) {
while (N < n)
N <<= 1;
ary.resize(N << 1, initVal);
}
public:
SegmentTree(int n, T initVal, std::function<T(T &, T &)> f)
: N(1), initVal(initVal), merge(f) {
init(n);
}
// -- a[i] = val;
inline void update(int i, T val) {
ary[i += N] = val;
while (i > 1) {
i >>= 1;
ary[i] = merge(ary[i << i], ary[(i << 1) + 1]);
}
}
// -- a[i] += val;
inline void add(int i, T val) { update(i, ary[i + N] + val); }
// -- [l,r)
inline T query(int l, int r) {
if (l >= r)
return initVal;
T vr = initVal, vl = initVal;
for (l += N, r += N; l != r; l >>= 1, r >>= 1) {
if (l & 1)
vl = merge(vl, ary[l++]);
if (r & 1)
vr = merge(vr, ary[--r]);
}
return merge(vl, vr);
}
/*
void debug show(){
for(iint i = N;i < N;i++)std::cerr << ary[i] << " ";
std:::cerr << "\n";
}
*/
};
using ST = SegmentTree<int>;
// SUM : ST(n,0,[](int &a,int &b){return a+b};);
// MIN : ST(n,INF,[](int &a,int &b){return min(a,b);});
signed main() {
int N;
cin >> N;
vector<int> a(N);
REP(i, N) cin >> a[i];
auto seg = ST(N, -1, [](int &a, int &b) { return max(a, b); });
REP(i, N) seg.update(i, a[i]);
REP(i, N) {
if (i == 0)
cout << seg.query(i + 1, N) << endl;
else if (i == N - 1)
cout << seg.query(0, N - 1) << endl;
else
cout << max(seg.query(0, i), seg.query(i + 1, N)) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
const long long MOD = 1e9 + 7, INF = 1e18;
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;
}
template <class T> class SegmentTree {
private:
int N;
T initVal;
std::vector<T> ary;
std::function<T(T &, T &)> merge;
void init(int n) {
while (N < n)
N <<= 1;
ary.resize(N << 1, initVal);
}
public:
SegmentTree(int n, T initVal, std::function<T(T &, T &)> f)
: N(1), initVal(initVal), merge(f) {
init(n);
}
// -- a[i] = val;
inline void update(int i, T val) {
ary[i += N] = val;
while (i > 1) {
i >>= 1;
ary[i] = merge(ary[i << 1], ary[(i << 1) + 1]);
}
}
// -- a[i] += val;
inline void add(int i, T val) { update(i, ary[i + N] + val); }
// -- [l,r)
inline T query(int l, int r) {
if (l >= r)
return initVal;
T vr = initVal, vl = initVal;
for (l += N, r += N; l != r; l >>= 1, r >>= 1) {
if (l & 1)
vl = merge(vl, ary[l++]);
if (r & 1)
vr = merge(vr, ary[--r]);
}
return merge(vl, vr);
}
/*
void debug show(){
for(iint i = N;i < N;i++)std::cerr << ary[i] << " ";
std:::cerr << "\n";
}
*/
};
using ST = SegmentTree<int>;
// SUM : ST(n,0,[](int &a,int &b){return a+b};);
// MIN : ST(n,INF,[](int &a,int &b){return min(a,b);});
signed main() {
int N;
cin >> N;
vector<int> a(N);
REP(i, N) cin >> a[i];
auto seg = ST(N, -1, [](int &a, int &b) { return max(a, b); });
REP(i, N) seg.update(i, a[i]);
REP(i, N) {
if (i == 0)
cout << seg.query(1, N) << endl;
else if (i == N - 1)
cout << seg.query(0, N - 1) << endl;
else
cout << max(seg.query(0, i), seg.query(i + 1, N)) << endl;
}
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 776,135 | 776,136 | u693027786 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
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> b = a;
sort(b.begin(), b.end());
for (int i = 0; i < n; i++) {
int ans = b[0];
if (b[0] == a[i])
ans = b[1];
cout << ans << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
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> b = a;
sort(b.rbegin(), b.rend());
for (int i = 0; i < n; i++) {
int ans = b[0];
if (b[0] == a[i])
ans = b[1];
cout << ans << endl;
}
return 0;
} | [
"call.function.change",
"call.arguments.change"
] | 776,148 | 776,149 | u228232845 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, m = 0, ms = 0, im;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a > m) {
m = a;
im = i + 1;
} else if (a <= m && a > ms)
ms = a;
}
for (int i = 0; i < n; i++)
cout << (i != im ? m : ms) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, m = 0, ms = 0, im;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a > m) {
ms = m;
m = a;
im = i;
} else if (a <= m && a > ms)
ms = a;
}
for (int i = 0; i < n; i++)
cout << (i != im ? m : ms) << endl;
return 0;
} | [
"assignment.add",
"expression.operation.binary.remove"
] | 776,152 | 776,153 | u930561195 | cpp |
p02971 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define INF (int)1e9
#define MOD (int)1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int n;
cin >> n;
vi a(n);
vi b(n), c(n);
REP(i, n) cin >> a[i];
b[0] = -1;
for (int i = 1; i < n; ++i) {
b[i] = max(b[i - 1], a[i]);
}
c[n - 1] = -1;
for (int i = n - 2; i >= 0; --i) {
c[i] = max(c[i + 1], a[i]);
}
REP(i, n) { cout << max(b[i], c[i]) << endl; }
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define INF (int)1e9
#define MOD (int)1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int n;
cin >> n;
vi a(n);
vi b(n), c(n);
REP(i, n) cin >> a[i];
b[0] = -1;
for (int i = 1; i < n; ++i) {
b[i] = max(b[i - 1], a[i - 1]);
}
c[n - 1] = -1;
for (int i = n - 2; i >= 0; --i) {
c[i] = max(c[i + 1], a[i + 1]);
}
REP(i, n) { cout << max(b[i], c[i]) << endl; }
} | [
"assignment.change"
] | 776,156 | 776,157 | u209767598 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
int main() {
int a, n, m = -1, m2 = -1, midx = -1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (max(m, a) == a) {
midx = i;
m = a;
} else if (max(m2, a) == a) {
m2 = a;
}
}
for (int i = 0; i < n; i++) {
if (i == midx) {
if (m2 == -1) {
cout << m << endl;
} else {
cout << m2 << endl;
}
} else {
cout << m << endl;
}
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
int main() {
int a, n, m = -1, m2 = -1, midx = -1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (max(m, a) == a) {
midx = i;
m2 = m;
m = a;
} else if (max(m2, a) == a) {
m2 = a;
}
}
for (int i = 0; i < n; i++) {
if (i == midx) {
if (m2 == -1) {
cout << m << endl;
} else {
cout << m2 << endl;
}
} else {
cout << m << endl;
}
}
return 0;
}
| [
"assignment.add"
] | 776,199 | 776,200 | u403813525 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int A[200020];
int B[200020];
for (int i = 1; i <= N; i++) {
cin >> A[i];
B[i] = A[i];
}
sort(B + 1, B + N + 1);
for (int i = 1; i <= N; i++) {
if (B[N] == B[N - 1])
cout << B[N];
else if (A[i] == B[N])
cout << B[N - 1];
else
cout << B[N];
cout << "¥n";
}
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int A[200020];
int B[200020];
for (int i = 1; i <= N; i++) {
cin >> A[i];
B[i] = A[i];
}
sort(B + 1, B + N + 1);
for (int i = 1; i <= N; i++) {
if (B[N] == B[N - 1])
cout << B[N];
else if (A[i] == B[N])
cout << B[N - 1];
else
cout << B[N];
cout << endl;
}
}
| [
"io.output.change"
] | 776,205 | 776,206 | u582357587 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
long long int max_no = v[0];
long long int max_no2 = v[0];
long long int num = 0;
for (long long int i = 1; i < n; i++) {
if (max_no <= v[i]) {
max_no2 = max_no;
max_no = v[i];
num = i;
} else if (max_no > v[i] && max_no2 < v[i]) {
max_no2 = v[i];
}
}
for (long long int i = 0; i < n; i++) {
if (i == num) {
cout << max_no2 << endl;
} else {
cout << max_no << endl;
}
}
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
long long int max_no = v[0];
long long int max_no2 = v[1];
long long int num = 0;
for (long long int i = 1; i < n; i++) {
if (max_no <= v[i]) {
max_no2 = max_no;
max_no = v[i];
num = i;
} else if (max_no > v[i] && max_no2 <= v[i]) {
max_no2 = v[i];
}
}
for (long long int i = 0; i < n; i++) {
if (i == num) {
cout << max_no2 << endl;
} else {
cout << max_no << endl;
}
}
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 776,207 | 776,208 | u115819033 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
long long int max_no = v[0];
long long int max_no2 = v[0];
long long int num = 0;
for (long long int i = 1; i < n; i++) {
if (max_no < v[i]) {
max_no2 = max_no;
max_no = v[i];
num = i;
} else if (max_no >= v[i] && max_no2 < v[i]) {
max_no2 = v[i];
}
}
for (long long int i = 0; i < n; i++) {
if (i == num) {
cout << max_no2 << endl;
} else {
cout << max_no << endl;
}
}
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
long long int max_no = v[0];
long long int max_no2 = v[1];
long long int num = 0;
for (long long int i = 1; i < n; i++) {
if (max_no <= v[i]) {
max_no2 = max_no;
max_no = v[i];
num = i;
} else if (max_no > v[i] && max_no2 <= v[i]) {
max_no2 = v[i];
}
}
for (long long int i = 0; i < n; i++) {
if (i == num) {
cout << max_no2 << endl;
} else {
cout << max_no << endl;
}
}
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 776,209 | 776,208 | u115819033 | 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[i];
}
int ma, man, sec;
ma = a[0];
man = 0;
sec = 0;
for (int k = 0; k < n; k++) {
if (ma <= a[k]) {
sec = ma;
ma = a[k];
man = k;
} else if (sec <= a[k] && ma > a[k])
sec = a[k];
}
for (int l = 0; l < n; l++) {
if (l == man) {
cout << sec << endl;
} else {
cout << ma << 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];
}
int ma, man, sec;
ma = a[0];
man = 0;
sec = 0;
for (int k = 1; k < n; k++) {
if (ma <= a[k]) {
sec = ma;
ma = a[k];
man = k;
} else if (sec <= a[k] && ma > a[k])
sec = a[k];
}
for (int l = 0; l < n; l++) {
if (l == man) {
cout << sec << endl;
} else {
cout << ma << endl;
}
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 776,214 | 776,215 | u756698981 | cpp |
p02971 | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
ll N;
cin >> N;
ll arr[N];
ll mx = 0;
for (ll i = 0; i < N; i++) {
cin >> arr[i];
mx = max(mx, arr[i]);
}
ll dummy[N];
std::copy(arr, arr + N, dummy);
sort(arr, arr + N);
bool first = true;
for (ll i = 0; i < N; i++) {
if (mx == dummy[i] && first) {
cout << arr[1] << "\n";
first = false;
} else
cout << mx << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
ll N;
cin >> N;
ll arr[N];
ll mx = 0;
for (ll i = 0; i < N; i++) {
cin >> arr[i];
mx = max(mx, arr[i]);
}
ll dummy[N];
std::copy(arr, arr + N, dummy);
sort(arr, arr + N);
bool first = true;
for (ll i = 0; i < N; i++) {
if (mx == dummy[i] && first) {
cout << arr[N - 2] << "\n";
first = false;
} else
cout << mx << "\n";
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,216 | 776,217 | u267902533 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const ll mod = 1e9 + 7;
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;
}
//-------------------
ll n;
ll a[200000 + 5];
ll till[200000 + 5];
ll bk[200000 + 5];
int main() {
scanf("%lld", &n);
FOR(i, 1, n) {
ll cur;
scanf("%lld", &cur);
a[i] = cur;
if (till[i - 1] < cur)
till[i] = cur;
else
till[i] = till[i - 1];
// cout << till[i] << ' ';
}
for (int i = n; i >= 1; i--) {
if (a[i] > bk[i - 1])
bk[i] = a[i];
else
bk[i] = bk[i + 1];
// cout << bk[i] << ' ';
}
FOR(i, 1, n) { cout << max(till[i - 1], bk[i + 1]) << endl; }
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const ll mod = 1e9 + 7;
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;
}
//-------------------
ll n;
ll a[200000 + 5];
ll till[200000 + 5];
ll bk[200000 + 5];
int main() {
scanf("%lld", &n);
FOR(i, 1, n) {
ll cur;
scanf("%lld", &cur);
a[i] = cur;
if (till[i - 1] < cur)
till[i] = cur;
else
till[i] = till[i - 1];
// cout << till[i] << ' ';
}
for (int i = n; i >= 1; i--) {
if (a[i] > bk[i + 1])
bk[i] = a[i];
else
bk[i] = bk[i + 1];
// cout << bk[i] << ' ';
}
FOR(i, 1, n) { cout << max(till[i - 1], bk[i + 1]) << endl; }
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 776,228 | 776,229 | u297590902 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const ll mod = 1e9 + 7;
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;
}
//-------------------
ll n;
ll a[200000 + 5];
ll till[200000 + 5];
ll bk[200000 + 5];
int main() {
scanf("%lld", &n);
FOR(i, 1, n) {
ll cur;
scanf("%lld", &cur);
a[i] = cur;
if (till[i - 1] < cur)
till[i] = cur;
else
till[i] = till[i - 1];
// cout << till[i] << ' ';
}
for (int i = n; i >= 1; i--) {
if (a[i] > bk[i - 1])
bk[i] = a[i];
else
bk[i] = bk[i - 1];
// cout << bk[i] << ' ';
}
FOR(i, 1, n) { cout << max(till[i - 1], bk[i + 1]) << endl; }
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const ll mod = 1e9 + 7;
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;
}
//-------------------
ll n;
ll a[200000 + 5];
ll till[200000 + 5];
ll bk[200000 + 5];
int main() {
scanf("%lld", &n);
FOR(i, 1, n) {
ll cur;
scanf("%lld", &cur);
a[i] = cur;
if (till[i - 1] < cur)
till[i] = cur;
else
till[i] = till[i - 1];
// cout << till[i] << ' ';
}
for (int i = n; i >= 1; i--) {
if (a[i] > bk[i + 1])
bk[i] = a[i];
else
bk[i] = bk[i + 1];
// cout << bk[i] << ' ';
}
FOR(i, 1, n) { cout << max(till[i - 1], bk[i + 1]) << endl; }
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 776,230 | 776,229 | u297590902 | cpp |
p02971 | #include <iostream>
using namespace std;
#include <vector>
int main(int argc, char *argv[]) {
int n;
int m1 = 0, m2 = 0;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
if (v[i] > m1) {
m2 = m1;
m1 = v[i];
} else if (v[i] > m2) {
m2 = v[i];
}
}
for (int i = 0; i < n; i++) {
if (v[i] == m1) {
cout << m2 << endl;
} else {
cout << m1 << endl;
}
}
return 0;
}
| #include <iostream>
using namespace std;
#include <vector>
int main(int argc, char *argv[]) {
int n;
int m1 = 0, m2 = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
if (v[i] > m1) {
m2 = m1;
m1 = v[i];
} else if (v[i] > m2) {
m2 = v[i];
}
}
for (int i = 0; i < n; i++) {
if (v[i] == m1) {
cout << m2 << endl;
} else {
cout << m1 << endl;
}
}
return 0;
}
| [] | 776,235 | 776,236 | u770567389 | cpp |
p02971 | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N;
int A[200010];
int max = 0;
int num = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
if (i == 0) {
max == A[i];
num == i;
} else {
if (max < A[i]) {
max = A[i];
num = i;
}
}
}
sort(A, A + N);
for (int j = 0; j < N; j++) {
if (j == num) {
printf("%d\n", A[N - 2]);
} else {
printf("%d\n", max);
}
}
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N;
int A[200010];
int max = 0;
int num = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
if (i == 0) {
max = A[i];
num = i;
} else {
if (max < A[i]) {
max = A[i];
num = i;
}
}
}
sort(A, A + N);
for (int j = 0; j < N; j++) {
if (j == num) {
printf("%d\n", A[N - 2]);
} else {
printf("%d\n", max);
}
}
return 0;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 776,241 | 776,242 | u956941456 | cpp |
p02971 | #include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n, a[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
int max = -1, max2t = -1, chk = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] > max) {
max2t = max;
max = a[i];
} else if (a[i] == max)
chk = 1;
else if (a[i] > max2t)
max2t = a[i];
}
for (int i = 1; i <= n; ++i) {
if (a[i] != max || (chk))
cout << max << endl;
else
cout << max2t << endl;
}
return 0;
} | #include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n, a[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
int max = -1, max2t = -1, chk = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] > max) {
max2t = max;
max = a[i];
chk = 0;
} else if (a[i] == max)
chk = 1;
else if (a[i] > max2t)
max2t = a[i];
}
for (int i = 1; i <= n; ++i) {
if ((a[i] != max) || (chk))
cout << max << endl;
else
cout << max2t << endl;
}
return 0;
} | [
"assignment.add",
"control_flow.branch.if.condition.change"
] | 776,243 | 776,244 | u990036270 | cpp |
p02971 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << endl; \
exit(0); \
} while (0)
#define int ll
using ll = long long;
using namespace std;
int A[200 * 1000 + 100];
int L[200 * 1000 + 100];
int R[200 * 1000 + 100];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
rep(i, 1, N) cin >> A[i];
rep(i, 2, N) L[i] = max(L[i - 2], A[i - 1]);
for (int i = N - 1; i >= 1; i--)
R[i] = max(R[i + 2], A[i + 1]);
rep(i, 1, N) cout << max(L[i], R[i]) << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << endl; \
exit(0); \
} while (0)
#define int ll
using ll = long long;
using namespace std;
int A[200 * 1000 + 100];
int L[200 * 1000 + 100];
int R[200 * 1000 + 100];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
rep(i, 1, N) cin >> A[i];
rep(i, 2, N) L[i] = max(L[i - 1], A[i - 1]);
for (int i = N - 1; i >= 1; i--)
R[i] = max(R[i + 1], A[i + 1]);
rep(i, 1, N) cout << max(L[i], R[i]) << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 776,245 | 776,246 | u993688697 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, i, t, s, p, a[200003];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
t = s = 0;
for (i = 0; i < n; i++) {
if (t <= a[i]) {
s = t;
t = a[i];
p = i;
} else if (s <= a[i]) {
s = a[i];
p = i;
}
}
for (i = 0; i < n; i++) {
if (i == p)
cout << s << endl;
else
cout << t << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long n, i, t, s, p, a[200003];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
t = s = 0;
for (i = 0; i < n; i++) {
if (t <= a[i]) {
s = t;
t = a[i];
p = i;
} else if (s <= a[i]) {
s = a[i];
}
}
for (i = 0; i < n; i++) {
if (i == p)
cout << s << endl;
else
cout << t << endl;
}
}
| [] | 776,247 | 776,248 | u374523333 | cpp |
p02971 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
int num1 = 0;
int num2 = 0;
int i;
cin >> n;
int array[n];
for (i = 0; i < n; i++) {
cin >> array[i];
}
for (i = 0; i < n; i++) {
if (num1 < array[i]) {
num2 = num1;
num1 = array[i];
} else if (num2 < array[i]) {
num2 = array[i];
}
}
for (i = 0; i < n; i++) {
if (array[i] != num1) {
cout << num1;
} else {
cout << num2 << endl;
;
}
}
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
int num1 = 0;
int num2 = 0;
int i;
cin >> n;
int array[n];
for (i = 0; i < n; i++) {
cin >> array[i];
}
for (i = 0; i < n; i++) {
if (num1 < array[i]) {
num2 = num1;
num1 = array[i];
} else if (num2 < array[i]) {
num2 = array[i];
}
}
for (i = 0; i < n; i++) {
if (array[i] != num1) {
cout << num1 << endl;
} else {
cout << num2 << endl;
}
}
return 0;
} | [
"io.output.newline.add"
] | 776,255 | 776,256 | u885567868 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
int rA[N];
int lA[N];
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[i] = a;
}
rA[0] = A[0];
for (int i = 1; i < N; i++) {
rA[i] = max(rA[i - 1], A[i]);
}
lA[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--) {
lA[i] = max(lA[i + 1], A[i]);
}
cout << lA[1] << endl;
for (int i = 1; i < N - 1; i++) {
cout << max(rA[i - 1], lA[i + 1]) << endl;
}
cout << rA[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
int rA[N];
int lA[N];
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[i] = a;
}
rA[0] = A[0];
for (int i = 1; i < N; i++) {
rA[i] = max(rA[i - 1], A[i]);
}
lA[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--) {
lA[i] = max(lA[i + 1], A[i]);
}
cout << lA[1] << endl;
for (int i = 1; i < N - 1; i++) {
cout << max(rA[i - 1], lA[i + 1]) << endl;
}
cout << rA[N - 2] << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,267 | 776,268 | u947426792 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep_down(i, n) for (int i = n - 1; i >= 0; --i)
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int N;
int A[200005], L[200005], R[200005];
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> N;
rep(i, N) { cin >> A[i]; }
rep(i, N) {
if (i == 0)
continue;
if (i == 1) {
L[i] = A[0];
continue;
}
L[i] = max(L[i - 2], A[i - 1]);
}
rep_down(i, N) {
if (i == N - 1)
continue;
if (i == N - 2) {
R[i] = A[N - 1];
continue;
}
R[i] = max(R[i + 2], A[i + 1]);
}
rep(i, N) {
if (i == 0) {
cout << R[0] << endl;
continue;
}
if (i == N - 1) {
cout << L[N - 1] << endl;
continue;
}
int a = max(L[i], R[i]);
cout << a << endl;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep_down(i, n) for (int i = n - 1; i >= 0; --i)
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int N;
int A[200005], L[200005], R[200005];
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> N;
rep(i, N) { cin >> A[i]; }
rep(i, N) {
if (i == 0)
continue;
if (i == 1) {
L[i] = A[0];
continue;
}
L[i] = max(L[i - 1], A[i - 1]);
}
rep_down(i, N) {
if (i == N - 1)
continue;
if (i == N - 2) {
R[i] = A[N - 1];
continue;
}
R[i] = max(R[i + 1], A[i + 1]);
}
rep(i, N) {
if (i == 0) {
cout << R[0] << endl;
continue;
}
if (i == N - 1) {
cout << L[N - 1] << endl;
continue;
}
int a = max(L[i], R[i]);
cout << a << endl;
}
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 776,271 | 776,272 | u288087195 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
int maxa = 0;
int maxN = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (maxa < A[i]) {
maxa = A[i];
maxN = i;
}
}
sort(A, A + N, greater<int>());
if (A[0] == A[1]) {
for (int i = 0; i < N; i++) {
cout << A[0] << endl;
}
} else {
for (int i = 0; i < N; i++) {
if (i != maxN) {
cout << A[0] << endl;
} else {
cout << A[i] << endl;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
int maxa = 0;
int maxN = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (maxa < A[i]) {
maxa = A[i];
maxN = i;
}
}
sort(A, A + N, greater<int>());
if (A[0] == A[1]) {
for (int i = 0; i < N; i++) {
cout << A[0] << endl;
}
} else {
for (int i = 0; i < N; i++) {
if (i != maxN) {
cout << A[0] << endl;
} else {
cout << A[1] << endl;
}
}
}
} | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,279 | 776,280 | u415916075 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define all(x) (x).begin(), (x).end()
#define SIZE(x) ((int)(x).size())
int main(void) {
// code begin
int n, a;
vi as;
cin >> n;
rep(i, n) {
cin >> a;
as.push_back(a);
}
set<int> vset;
for (const int i : as)
vset.insert(i);
vi vs(vset.begin(), vset.end());
sort(all(vs));
int ma1 = vs[vs.size() - 1];
int ma2 = vs[vs.size() - 2];
if (count(all(as), ma1) > 2) {
rep(i, as.size()) { cout << ma1 << endl; }
} else {
for (const int i : as) {
if (i == ma1) {
cout << ma2 << endl;
} else {
cout << ma1 << endl;
}
}
}
// code end
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define all(x) (x).begin(), (x).end()
#define SIZE(x) ((int)(x).size())
int main(void) {
// code begin
int n, a;
vi as;
cin >> n;
rep(i, n) {
cin >> a;
as.push_back(a);
}
set<int> vset;
for (const int i : as)
vset.insert(i);
vi vs(vset.begin(), vset.end());
sort(all(vs));
int ma1 = vs[vs.size() - 1];
int ma2 = vs[vs.size() - 2];
if (count(all(as), ma1) >= 2) {
rep(i, as.size()) { cout << ma1 << endl; }
} else {
for (const int i : as) {
if (i == ma1) {
cout << ma2 << endl;
} else {
cout << ma1 << endl;
}
}
}
// code end
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 776,285 | 776,286 | u923488187 | cpp |
p02971 | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <vector>
using namespace ::std;
int main() {
int A;
cin >> A;
int *N = new int[A];
for (int i = 0; i < A; i++) {
cin >> N[i];
}
int Max = N[1];
int SMax = 0;
int dM = 0;
for (int i = 1; i < A; i++) {
if (Max <= N[i]) {
Max = N[i];
}
}
for (int i = 0; i < A; i++) {
if (!(Max == N[i])) {
if (SMax < N[i]) {
SMax = N[i];
}
}
}
for (int i = 0; i < A; i++) {
if (Max == N[i]) {
dM++;
}
}
for (int i = 0; i < A; i++) {
if (dM > 1) {
cout << Max << endl;
} else if (N[i] == Max) {
cout << SMax << endl;
} else {
cout << Max << endl;
}
}
}
| #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <vector>
using namespace ::std;
int main() {
int A;
cin >> A;
int *N = new int[A];
for (int i = 0; i < A; i++) {
cin >> N[i];
}
int Max = N[0];
int SMax = 0;
int dM = 0;
for (int i = 1; i < A; i++) {
if (Max <= N[i]) {
Max = N[i];
}
}
for (int i = 0; i < A; i++) {
if (!(Max == N[i])) {
if (SMax < N[i]) {
SMax = N[i];
}
}
}
for (int i = 0; i < A; i++) {
if (Max == N[i]) {
dM++;
}
}
for (int i = 0; i < A; i++) {
if (dM > 1) {
cout << Max << endl;
} else if (N[i] == Max) {
cout << SMax << endl;
} else {
cout << Max << endl;
}
}
}
| [
"literal.number.change",
"variable_access.subscript.index.change"
] | 776,289 | 776,290 | u319945100 | cpp |
p02971 | // template version 1.12
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
// varibable settings
#define infile "../test/sample-1.in"
#define int long long //{{{
const int INF = 1e18;
const int MOD = 1e9 + 7; //}}}
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)((b)-1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) \
sort(all(x)); \
x.erase(unique(all(x)), x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x) - A.begin())
#define posu(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) {
if ((a) < (b))
(a) = (b);
}
template <class T> inline void chmin(T &a, const T &b) {
if ((a) > (b))
(a) = (b);
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;
template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#if defined(PCM) || defined(LOCAL)
#include "lib/dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
//}}}
int solve() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
dump(a);
vi l(n);
vi r(n);
l[0] = a[0];
r[n - 1] = a[n - 1];
rep(i, 1, n) { l[i] = max(l[i - 1], a[i]); }
rrep(i, n - 1) { r[i] = max(r[i + 1], a[i]); }
dump(l);
dump(r);
cout << r[1] << endl;
rep(i, 1, n - 1) { cout << max(l[i - 1], r[i + 1]) << endl; }
cout << l[n - 1] << endl;
return 0;
}
signed main() { //{{{
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} //}}}
| // template version 1.12
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
// varibable settings
#define infile "../test/sample-1.in"
#define int long long //{{{
const int INF = 1e18;
const int MOD = 1e9 + 7; //}}}
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)((b)-1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) \
sort(all(x)); \
x.erase(unique(all(x)), x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x) - A.begin())
#define posu(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) {
if ((a) < (b))
(a) = (b);
}
template <class T> inline void chmin(T &a, const T &b) {
if ((a) > (b))
(a) = (b);
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;
template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#if defined(PCM) || defined(LOCAL)
#include "lib/dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
//}}}
int solve() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
dump(a);
vi l(n);
vi r(n);
l[0] = a[0];
r[n - 1] = a[n - 1];
rep(i, 1, n) { l[i] = max(l[i - 1], a[i]); }
rrep(i, 0, n - 1) { r[i] = max(r[i + 1], a[i]); }
dump(l);
dump(r);
cout << r[1] << endl;
rep(i, 1, n - 1) { cout << max(l[i - 1], r[i + 1]) << endl; }
cout << l[n - 2] << endl;
return 0;
}
signed main() { //{{{
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} //}}}
| [
"call.arguments.add",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,312 | 776,313 | u314057689 | cpp |
p02971 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
vector<int> vec1(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vec[i] = x;
vec1[i] = x;
}
sort(vec.begin(), vec.end());
int First = vec[n - 1];
int Second = vec[n - 2];
for (int i = 1; i < n + 1; i++) {
if (vec[i] == First) {
cout << Second << endl;
} else {
cout << First << endl;
}
}
} | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
vector<int> vec1(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vec[i] = x;
vec1[i] = x;
}
sort(vec.begin(), vec.end());
int First = vec[n - 1];
int Second = vec[n - 2];
/// cout<<First<<endl;
// cout<<Second<<endl;
for (int i = 0; i < n; i++) {
if (vec1[i] == First) {
cout << Second << endl;
} else {
cout << First << endl;
}
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,314 | 776,315 | u759162415 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int A[200200];
rep(i, N) cin >> A[i];
int l[200200], r[200200];
l[0] = 0, r[N + 1] = 0;
rep1(i, N) { l[i] = max(l[i - 1], A[i - 1]); }
rep1(i, N) { r[i] = max(r[i + 1], A[i - 1]); }
rep(i, N) {
int ans = max(l[i], r[i + 2]);
cout << ans << endl;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int A[200200];
rep(i, N) cin >> A[i];
int l[200200], r[200200];
l[0] = 0, r[N + 1] = 0;
rep1(i, N) { l[i] = max(l[i - 1], A[i - 1]); }
per1(i, N) { r[i] = max(r[i + 1], A[i - 1]); }
rep(i, N) {
int ans = max(l[i], r[i + 2]);
cout << ans << endl;
}
return 0;
} | [
"identifier.change"
] | 776,316 | 776,317 | u508571192 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
int main() {
int N;
cin >> N;
vector<Pi> Ai(N);
rep(i, N) {
cin >> Ai[i].first;
Ai[i].second = i;
}
sort(Ai.begin(), Ai.end(), greater<Pi>());
int a = Ai[0].second;
int b = Ai[1].second;
rep(i, N) {
if (i != a)
cout << Ai[0].first << endl;
else
cout << Ai[0].first << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
int main() {
int N;
cin >> N;
vector<Pi> Ai(N);
rep(i, N) {
cin >> Ai[i].first;
Ai[i].second = i;
}
sort(Ai.begin(), Ai.end(), greater<Pi>());
int a = Ai[0].second;
int b = Ai[1].second;
rep(i, N) {
if (i != a)
cout << Ai[0].first << endl;
else
cout << Ai[1].first << endl;
}
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,320 | 776,321 | u314008046 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(void) {
ll n;
cin >> n;
vector<ll> A(n);
ll first, second;
for (int i = 0; i < n; i++) {
cin >> A[i];
if (second <= A[i]) {
if (first <= A[i]) {
second = first;
first = A[i];
} else {
second = A[i];
}
}
}
for (int i = 0; i < n; i++) {
if (A[i] == first) {
cout << second << endl;
} else {
cout << first << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(void) {
ll n;
cin >> n;
vector<ll> A(n);
ll first = 0, second = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
if (second <= A[i]) {
if (first <= A[i]) {
second = first;
first = A[i];
} else {
second = A[i];
}
}
}
for (int i = 0; i < n; i++) {
if (A[i] == first) {
cout << second << endl;
} else {
cout << first << endl;
}
}
return 0;
} | [
"variable_declaration.value.change"
] | 776,322 | 776,323 | u030848580 | cpp |
p02971 | #include <bits/stdc++.h>
#define pii pair<int, int>
#define F first
#define S second
#define mp make_pair
#define vi vector<int>
#define pb push_back
using namespace std;
const int N = 2e5 + 5;
int n, a[N], x[N], y[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
x[i] = max(x[i - 1], a[i]);
}
for (int i = n; i >= 1; i--) {
y[i] = max(y[i - 1], a[i]);
}
for (int i = 1; i <= n; i++) {
cout << max(x[i - 1], y[i + 1]) << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define pii pair<int, int>
#define F first
#define S second
#define mp make_pair
#define vi vector<int>
#define pb push_back
using namespace std;
const int N = 2e5 + 5;
int n, a[N], x[N], y[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
x[i] = max(x[i - 1], a[i]);
}
for (int i = n; i >= 1; i--) {
y[i] = max(y[i + 1], a[i]);
}
for (int i = 1; i <= n; i++) {
cout << max(x[i - 1], y[i + 1]) << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 776,326 | 776,327 | u785897267 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.