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 << ... | #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 ... | [
"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) ... | #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) ... | [
"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 ... | #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 -... | [
"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 >>... | #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 >>... | [
"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... | #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... | [
"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... | #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... | [
"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 <<... | #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)
... | [] | 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 ... | #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)... | [] | 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... | #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... | [
"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... | #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... | [
"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 ... | #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... | [
"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[... | #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[... | [
"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 <... | #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... | [] | 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... | #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... | [
"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++) {
i... | #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++) {
i... | [
"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] <... | #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 ... | [
"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; ... | #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; ... | [
"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] <<... | #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] <<... | [
"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) {
max... | #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) {
max... | [
"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 ... | #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 ... | [
"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 << end... | #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] * ... | [
"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... | #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... | [
"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 ( ... | #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 ( ... | [
"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... | #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 ... | [
"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 al... | #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 al... | [
"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... | #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... | [
"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... | #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... | [
"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) ... | // 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) ... | [
"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>
o... | #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>
o... | [] | 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] = ... | #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] = ... | [
"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 ... |
#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 ... | [
"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) ((... | #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) ((... | [
"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++;
}
... | #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++;
}... | [
"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_bac... | #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... | [] | 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... | #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... | [] | 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, s... | #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 = ... | [
"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]) {
... | #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 ... | [
"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... | #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... | [] | 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... | #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... | [
"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 =... | #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 =... | [
"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 =... | #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 =... | [
"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 =... | #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 =... | [
"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 ... | #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... | [] | 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++)... | #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++)... | [
"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
... | #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
... | [
"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<in... | #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<in... | [
"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<in... | #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<in... | [] | 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)... |
#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)... | [
"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 ... | #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 ... | [
"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]);
... | #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]);
... | [
"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... | #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... | [
"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>
#inc... | #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>
#inc... | [
"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, ... | /*
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, ... | [
"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]... | #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]... | [
"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(l... | #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]... | [
"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;
}... | #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;
}... | [
"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;... |
#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;... | [
"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]);
}
rma... | #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]);
}
rma... | [
"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
... | #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
... | [
"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) {... | #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... | [] | 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) {... | #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... | [
"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]) {
cou... | #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]) {
... | [
"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) {
... | #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) {
... | [
"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 < ... | #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 < ... | [
"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 <<... | #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 <<... | [
"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 <<... | #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 <<... | [
"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 matr... | #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 matr... | [
"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++)
c... | #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++)
c... | [
"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 {
... | #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;
} ... | [] | 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<cha... | #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<cha... | [
"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++) {
i... | #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++) {
i... | [
"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 ... | #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 ... | [
"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... | #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... | [
"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;
... | #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) <... | [
"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... | #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... | [
"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 ... | #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 ... | [
"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 <= ... | #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 <= ... | [
"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;... | #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;... | [
"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;... | #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;... | [
"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;
} els... | #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;
} els... | [
"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 ... | #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 ... | [
"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 f... | #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 f... | [
"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 f... | #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 f... | [
"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... | #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];
}
}
fo... | [] | 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 {
... | #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 {
... | [
"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) {
max... | #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) {
max... | [
"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; \... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << 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;
}
... | #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 ... | [] | 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 (nu... | #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 (nu... | [
"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... | #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... | [
"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;... | #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;... | [
"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... | #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... | [
"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... | #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... | [
"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;
f... | #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;
f... | [
"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... | // 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... | [
"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.e... | #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.e... | [
"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>
#in... | #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>
#in... | [
"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... | #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... | [
"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 {
secon... | #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 {
... | [
"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 <=... | #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 <=... | [
"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.