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 |
|---|---|---|---|---|---|---|---|
p02970 | // abc134_b
// #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
int N, D;
cin >> N >> D;
int count = 0;
int i = D + 1;
for (; i <= N; i = i + 2 * D + 1) {
count++;
// cout << i << endl;
}
if (N > i - D) {
count++;
// cout << i - D << endl;
}
cout << c... | // abc134_b
// #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
int N, D;
cin >> N >> D;
int count = 0;
int i = D + 1;
for (; i <= N; i = i + 2 * D + 1) {
count++;
}
if (N > i - D - 1) {
count++;
}
cout << count << endl;
} | [
"control_flow.branch.if.condition.change"
] | 774,718 | 774,719 | u798557584 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << ceil(a / (b * 2 + 1)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
cout << ceil(a / (b * 2 + 1)) << endl;
} | [
"variable_declaration.type.primitive.change"
] | 774,733 | 774,734 | u913008467 | cpp |
p02970 | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
namespace io ... | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
namespace io ... | [
"call.arguments.change"
] | 774,754 | 774,755 | u465699806 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int i = 0;
while ((2 * D + 1) * i < N) {
i++;
}
cout << i + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int i = 0;
while ((2 * D + 1) * i < N) {
i++;
}
cout << i << endl;
}
| [
"expression.operation.binary.remove"
] | 774,769 | 774,770 | u591755251 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int tph = 2 * d + 1;
int ans = 0;
for (int i = 0; i < n; i++) {
if (n > tph * i) {
ans = i;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int tph = 2 * d + 1;
int ans = 0;
for (int i = 0; i < n; i++) {
if (n > tph * i) {
ans = i + 1;
}
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 774,785 | 774,786 | u453634104 | cpp |
p02970 | #include <iostream>
using namespace std;
int main() {
int n, d, num;
cin >> n >> d;
num = (n + (2 * d - 1)) / (2 * d);
cout << num << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, d, num;
cin >> n >> d;
num = (n + (2 * d)) / (2 * d + 1);
cout << num << endl;
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 774,799 | 774,800 | u830087664 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans;
double n, d, reg;
cin >> n;
cin >> d;
reg = n / (2 * d + 1);
ans = int(reg + 0.9);
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans;
double n, d, reg;
cin >> n;
cin >> d;
reg = n / (2 * d + 1);
ans = int(reg + 0.999);
cout << ans;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 774,814 | 774,815 | u540741303 | cpp |
p02970 | #include <stdio.h>
int main() {
int n, d, j;
int i = 0;
scanf("%d", &n);
scanf("%d", &d);
for (j = 1; j <= n; j = j + (2 * d) + 1) {
i++;
}
printf("%d", i + 1);
return 0;
} | #include <stdio.h>
int main() {
int n, d, j;
int i = 0;
scanf("%d", &n);
scanf("%d", &d);
for (j = 1; j <= n; j = j + (2 * d) + 1) {
i++;
}
printf("%d", i);
return 0;
} | [
"expression.operation.binary.remove"
] | 774,851 | 774,852 | u488700515 | cpp |
p02970 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
int n, d;
cin >> n >> d;
int a = d * 2 - 1;
cout << (n + a - 1) / a << endl;
return 0;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
int n, d;
cin >> n >> d;
int a = d * 2 + 1;
cout << (n + a - 1) / a << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 774,869 | 774,870 | u654240084 | cpp |
p02970 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
int n, d;
cin >> n >> d;
int a = d * 2;
cout << (n + a - 1) / a << endl;
return 0;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
int n, d;
cin >> n >> d;
int a = d * 2 + 1;
cout << (n + a - 1) / a << endl;
} | [
"assignment.change"
] | 774,871 | 774,870 | u654240084 | cpp |
p02970 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int k = N / (2 * D + 1);
int l = (N % (2 * D + 1)) / (2 * D + 1);
cout << k + l << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int k = N / (2 * D + 1);
int l = ((N % (2 * D + 1)) + 2 * D) / (2 * D + 1);
cout << k + l << endl;
} | [] | 774,877 | 774,878 | u548684908 | cpp |
p02970 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int x;
x = ceil(N / 2.0 / D);
cout << x << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int x;
x = ceil(N / (2.0 * D + 1));
cout << x << endl;
return 0;
} | [
"call.arguments.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 774,883 | 774,884 | u975472502 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, d;
cin >> n >> d;
cout << ceil(n / ((2 * d) + 1)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, d;
cin >> n >> d;
cout << ceil((float)n / (float)((2 * d) + 1)) << endl;
return 0;
} | [
"type_conversion.add"
] | 774,908 | 774,909 | u230086201 | cpp |
p02970 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int NN = 1;
int main() {
double ans;
double a, b;
scanf... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int NN = 1;
int main() {
double ans;
double a, b;
scanf... | [
"assignment.change"
] | 774,932 | 774,933 | u463734200 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, d, a;
cin >> N >> d;
a = 0;
for (int now = 0; now <= N;) {
a++;
now += 2 * d + 1;
}
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, d, a;
cin >> N >> d;
a = 0;
for (int now = 0; now < N;) {
a++;
now += 2 * d + 1;
}
cout << a << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 774,936 | 774,937 | u222866518 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, d, a;
cin >> N >> d;
a = 0;
for (int now = d; now <= N;) {
a++;
now += 2 * d + 1;
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, d, a;
cin >> N >> d;
a = 0;
for (int now = 0; now < N;) {
a++;
now += 2 * d + 1;
}
cout << a << endl;
}
| [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 774,938 | 774,937 | u222866518 | cpp |
p02970 | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr int mo = 1e9 + 7;
constexpr int mod = mo;
constexpr ll inf = 1ll << 62;
int main() {
int n, d;
cin >> n >> d;
d = 2 * d + 1;
d *= 2;
n = (d - 1) + n;
cout << n / d << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr int mo = 1e9 + 7;
constexpr int mod = mo;
constexpr ll inf = 1ll << 62;
int main() {
int n, d;
cin >> n >> d;
d = 2 * d + 1;
n = (d - 1) + n;
cout << n / d << endl;
return 0;
}
| [] | 774,939 | 774,940 | u699193595 | cpp |
p02970 | #include <math.h>
#include <stdio.h>
int cul(int, int);
int main(void) {
int N, D, num;
scanf("%d %d", &N, &D);
num = cul(N, D);
printf("%d\n", num);
return 0;
}
int cul(int N, int D) {
int num;
num = ceil(double(N) / (2 * double(D + 1)));
return num;
} | #include <math.h>
#include <stdio.h>
int cul(int, int);
int main(void) {
int N, D, num;
scanf("%d %d", &N, &D);
num = cul(N, D);
printf("%d\n", num);
return 0;
}
int cul(int N, int D) {
int num;
num = ceil(double(N) / (2 * double(D) + 1));
return num;
} | [
"call.arguments.change"
] | 774,941 | 774,942 | u456658814 | cpp |
p02970 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
using namespace std;
const int M = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, d;
cin >> n >> d;
int ans = 0;
int i = 1;
while (i < n) {
i = i + d + d + 1;
ans++;
}
cout << ans << endl... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
using namespace std;
const int M = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, d;
cin >> n >> d;
int ans = 0;
int i = 1;
while (i <= n) {
i = i + d + d + 1;
// cout<<i<<endl;
ans++;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 774,969 | 774,970 | u912430437 | cpp |
p02970 | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // p... | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // p... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 774,987 | 774,988 | u933068010 | cpp |
p02970 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
... | [
"assignment.value.change",
"assignment.change"
] | 775,004 | 775,005 | u219786796 | cpp |
p02970 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i, n) for (int i = 0; i < n; ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i, n) for (int i = 0; i < n; ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 775,006 | 775,007 | u511344501 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << (n + 2 * d - 1) / (2 * d) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << (n + 2 * d) / (2 * d + 1) << endl;
}
| [
"expression.operation.binary.remove"
] | 775,011 | 775,012 | u215722591 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | [
"expression.operation.binary.add"
] | 775,017 | 775,018 | u090325904 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, D;
cin >> N >> D;
cout << (N + 2 * D - 1) / (2 * D) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, D;
cin >> N >> D;
cout << (N + 2 * D) / (2 * D + 1) << endl;
} | [
"expression.operation.binary.remove"
] | 775,021 | 775,022 | u679366464 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ldb = long double;
using pa = pair<ll, ll>;
using vec = vector<ll>;
#define pb push_back
#define po pop_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define f(i, x, n) for (ll i = x; i < n; i++)
#define unique_... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ldb = long double;
using pa = pair<ll, ll>;
using vec = vector<ll>;
#define pb push_back
#define po pop_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define f(i, x, n) for (ll i = x; i < n; i++)
#define unique_... | [
"expression.operation.binary.add"
] | 775,058 | 775,059 | u063404629 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), ... | #include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 775,070 | 775,071 | u276588887 | cpp |
p02970 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b,... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b,... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 775,078 | 775,079 | u375619974 | cpp |
p02970 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
int main() {
int n, d;
cin >> n >> d;
int p = 1;
int res = 0;
while (p < n) {
res+... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
int main() {
int n, d;
cin >> n >> d;
int p = 1;
int res = 0;
while (p <= n) {
res... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 775,080 | 775,081 | u969116807 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int D;
cin >> N >> D;
if (N % (D * 2) > 0) {
cout << N / (D * 2) + 1 << endl;
} else {
cout << N / (D * 2) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int D;
cin >> N >> D;
if (N % (D * 2 + 1) > 0) {
cout << N / (D * 2 + 1) + 1 << endl;
} else {
cout << N / (D * 2 + 1) << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 775,082 | 775,083 | u820051975 | cpp |
p02970 | #include <bits/stdc++.h>
#define ___ \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define endl '\n'
#define pii pair<in... | #include <bits/stdc++.h>
#define ___ \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define endl '\n'
#define pii pair<in... | [
"expression.operation.binary.add"
] | 775,098 | 775,099 | u699580536 | cpp |
p02970 | #include <bits/stdc++.h>
#define ___ \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define endl '\n'
#define pii pair<in... | #include <bits/stdc++.h>
#define ___ \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define endl '\n'
#define pii pair<in... | [
"assignment.change",
"expression.operation.binary.add"
] | 775,100 | 775,099 | u699580536 | cpp |
p02970 | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <istream>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
double n, d;
cin >> n >> d;
cout << ceil(n / (2 * d)) << endl;
} | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <istream>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
double n, d;
cin >> n >> d;
cout << ceil(n / ((2 * d) + 1)) << endl;
} | [
"call.arguments.change"
] | 775,118 | 775,119 | u230139835 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int count = 0;
int ans = 1;
while (count < n) {
count += 2 * d + 1;
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int count = 0;
int ans = 0;
while (count < n) {
count += 2 * d + 1;
ans++;
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 775,127 | 775,128 | u006721330 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
cout << ceil(N / (2 * D + 1));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
cout << ceil(N / (double)(2 * D + 1));
return 0;
} | [
"type_conversion.add"
] | 775,158 | 775,159 | u947426792 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
int main() {
int N;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
int main() {
int N;
... | [
"assignment.change"
] | 775,175 | 775,176 | u878454346 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
vector<ll> vec(a);
for (ll i = 0; i < a; i++) {
cin >> vec.at(i);
}
vector<ll> veco(a);
veco = vec;
sort(vec.begin(), vec.end());
for (ll i = 0; i < a; i++) {
if (veco.at(i) == veco.at(a - 1)) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
vector<ll> vec(a);
for (ll i = 0; i < a; i++) {
cin >> vec.at(i);
}
vector<ll> veco(a);
veco = vec;
sort(vec.begin(), vec.end());
for (ll i = 0; i < a; i++) {
if (veco.at(i) == vec.at(a - 1)) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 775,185 | 775,186 | u883297128 | cpp |
p02971 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) { cin >> A.at(i); }
vector<int> right(N);
vector<int> left(N);
for (int i = 1; i < N; i++)
left.at(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) { cin >> A.at(i); }
vector<int> right(N);
vector<int> left(N);
for (int i = 1; i < N; i++)
left.at(... | [
"assignment.change"
] | 775,189 | 775,190 | u575988755 | cpp |
p02971 | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | [
"expression.operation.binary.remove"
] | 775,191 | 775,192 | u818349438 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
#define int long long
using P = pair<int, int>;
signed main() {
int n;
cin >> n;
vector<int> migi(n), hidari(n);
int a[n];
rep(i, n) cin >> a[i];
int now = 0;
rep(i, n) {
hidari[i] = max... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
#define int long long
using P = pair<int, int>;
signed main() {
int n;
cin >> n;
vector<int> migi(n), hidari(n);
int a[n];
rep(i, n) cin >> a[i];
int now = 0;
rep(i, n) {
hidari[i] = max... | [
"assignment.value.change",
"identifier.change"
] | 775,193 | 775,194 | u818349438 | cpp |
p02971 | #define _CRT_SECURE_NO_WARNINGS
#pragma warning(disable : 4244) // 最悪をします
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include... | #define _CRT_SECURE_NO_WARNINGS
#pragma warning(disable : 4244) // 最悪をします
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 775,195 | 775,196 | u783675879 | cpp |
p02971 | #include <algorithm>
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD = 1000000007;
int modpow(int a, int x) {
if (a < 0)
a += MOD;
int ans = 1;
while (x > 0) {
if (x & 1)
... | #include <algorithm>
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD = 1000000007;
int modpow(int a, int x) {
if (a < 0)
a += MOD;
int ans = 1;
while (x > 0) {
if (x & 1)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 775,203 | 775,204 | u532514769 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> v(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(X);
v.at(X) = vec.at(X);
}
sort(v.begin(), v.end());
for (int X = 0; X < N; X++) {
if (vec.at(X) = v.at(N - 1)) {
cout << v.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> v(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(X);
v.at(X) = vec.at(X);
}
sort(v.begin(), v.end());
for (int X = 0; X < N; X++) {
if (vec.at(X) == v.at(N - 1)) {
cout << v.at... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 775,205 | 775,206 | u740002394 | cpp |
p02971 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 775,211 | 775,212 | u590825760 | cpp |
p02971 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
long double const pi = std::acos(-1.0L);
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
long double const pi = std::acos(-1.0L);
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vec... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 775,222 | 775,223 | u186506670 | cpp |
p02971 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
void solve() {}
int ma... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
void solve() {}
int ma... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 775,224 | 775,225 | u931173291 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Pair = pair<int, int>;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define INF 1000000007
#define SEP " "
int main() {
int n;
vector<int> a(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Pair = pair<int, int>;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define INF 1000000007
#define SEP " "
int main() {
int n;
cin >> n;
vector<int> a(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i... | [] | 775,253 | 775,254 | u894418077 | cpp |
p02971 | //インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <chrono> //実行時間計測
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点... | //インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <chrono> //実行時間計測
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"io.output.change"
] | 775,277 | 775,278 | u345693891 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | [
"literal.number.change",
"io.output.change"
] | 775,279 | 775,280 | u946082956 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
const double pi = 3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
const double pi = 3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 775,281 | 775,282 | u492660436 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int max1 = 0, max2 = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (a.at(i) > max1) {
max2 = max1;
max1 = a.at(i);
} else if (a.at(i) == max1 || a.at(i) > max2) {
max2 = a.at(i);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int max1 = 0, max2 = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (a.at(i) > max1) {
max2 = max1;
max1 = a.at(i);
} else if (a.at(i) == max1 || a.at(i) > max2) {
max2 = a.at(i);... | [
"identifier.change",
"io.output.change"
] | 775,292 | 775,293 | u442714890 | cpp |
p02971 | // ABC_128_B// pair型の中にpair型
/*int main() {
int n;
cin >> n;
vector<pair<pair<string,int>,int>> a(n);
for(int i=0;i<n;i++){
string s;
cin >> s;
int num;
cin >> num;
num = num * -1;
a.at(i).first.first = s;
a.at(i).first.second = num;
a.at(i).second = i;
}
sort(a.begin(),... | // ABC_128_B// pair型の中にpair型
/*int main() {
int n;
cin >> n;
vector<pair<pair<string,int>,int>> a(n);
for(int i=0;i<n;i++){
string s;
cin >> s;
int num;
cin >> num;
num = num * -1;
a.at(i).first.first = s;
a.at(i).first.second = num;
a.at(i).second = i;
}
sort(a.begin(),... | [
"identifier.change",
"expression.operation.binary.change"
] | 775,300 | 775,301 | u037563046 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 100000000;
#define rep1(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, k, n) for (ll i = k; i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 100000000;
#define rep1(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, k, n) for (ll i = k; i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return ... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"io.output.change"
] | 775,306 | 775,307 | u913016812 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#define MAX_N 200'000
using namespace std;
int A[MAX_N];
int main() {
int N;
cin >> N;
int x, y;
cin >> x >> y;
A[0] = x;
A[1] = y;
if (x < y) {
swap(x, y);
}
for (int i = 2; i < N; ++i) {
cin >> A[i];
if (x <= A[i]) {
y... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#define MAX_N 200'000
using namespace std;
int A[MAX_N];
int main() {
int N;
cin >> N;
int x, y;
cin >> x >> y;
A[0] = x;
A[1] = y;
if (x < y) {
swap(x, y);
}
for (int i = 2; i < N; ++i) {
cin >> A[i];
if (x <= A[i]) {
y... | [
"call.arguments.change",
"io.output.change"
] | 775,316 | 775,317 | u763280125 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool comp(int a, int b) { return a > b; }
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<int> A, B;
A.resize(N);
B.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
B = A;
sort(A.begin(), A.... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool comp(int a, int b) { return a > b; }
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<int> A, B;
A.resize(N);
B.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
B = A;
sort(A.begin(), A.... | [] | 775,323 | 775,324 | u912952979 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool comp(int a, int b) { return a > b; }
int main(int argc, char const *argv[]) {
int N;
cin >> N;
int tmp;
vector<int> A;
vector<int> B;
for (int i = 0; i < N; i++) {
cin >> tmp;
A.emplace_back(tmp);
}
B = A;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool comp(int a, int b) { return a > b; }
int main(int argc, char const *argv[]) {
int N;
cin >> N;
int tmp;
vector<int> A;
vector<int> B;
for (int i = 0; i < N; i++) {
cin >> tmp;
A.emplace_back(tmp);
}
B = A;
... | [] | 775,325 | 775,326 | u912952979 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int inf = 100000000;
int main() {
int n;
cin >> n;
vector<P> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i].first;
vec[i].second = i;
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int inf = 100000000;
int main() {
int n;
cin >> n;
vector<P> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i].first;
vec[i].second = i;
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
for (int i = 0; i <... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 775,327 | 775,328 | u529089914 | cpp |
p02971 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int INF = 100100101;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
rep(i, n) {
cin >> a[i];
b[i] = a[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int INF = 100100101;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
rep(i, n) {
cin >> a[i];
b[i] = a[i... | [
"identifier.change",
"io.output.change"
] | 775,333 | 775,334 | u415671616 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector... | [
"assignment.change"
] | 775,337 | 775,338 | u734397606 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), copy(n);
int i;
for (i = 0; i < n; i++) {
cin >> a.at(i);
copy.at(i) = a.at(i);
}
sort(copy.begin(), copy.end());
reverse(copy.begin(), copy.end());
int p_1 = copy.at(0), p_2 = copy.at(1);
for (i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), copy(n);
int i;
for (i = 0; i < n; i++) {
cin >> a.at(i);
copy.at(i) = a.at(i);
}
sort(copy.begin(), copy.end());
reverse(copy.begin(), copy.end());
int p_1 = copy.at(0), p_2 = copy.at(1);
for (i = ... | [
"identifier.change",
"io.output.change"
] | 775,349 | 775,350 | u130651752 | cpp |
p02971 | #include <algorithm>
#include <iostream>
using namespace std;
int n, a[200005], b[200005], o;
bool cmp(int x, int y) { return x > y; }
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n, cmp);
for (int i = 0; i < n; i++) {
if (a[i] <= b[0]) {
cout ... | #include <algorithm>
#include <iostream>
using namespace std;
int n, a[200005], b[200005], o;
bool cmp(int x, int y) { return x > y; }
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n, cmp);
for (int i = 0; i < n; i++) {
if (a[i] < b[0]) {
cout <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 775,351 | 775,352 | u816631826 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 775,353 | 775,354 | u820341516 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N);
int max = -100;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (max < A[i]) {
max = A[i];
}
}
for (int i = 0; i < N; i++) {
if (max == A[i])
sum++;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N);
int max = -100;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (max < A[i]) {
max = A[i];
}
}
for (int i = 0; i < N; i++) {
if (max == A[i])
sum++;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 775,355 | 775,356 | u109191542 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> a;
bool comp(int i, int j) { return a[i] > a[j]; }
int main(int argc, char *argv[]) {
int N;
cin >> N;
a.reserve(N);
vector<int> indices(N);
for (int i = 0; i < N; ++i) {
int tmp;
cin >> tmp;
a.push_ba... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> a;
bool comp(int i, int j) { return a[i] > a[j]; }
int main(int argc, char *argv[]) {
int N;
cin >> N;
a.reserve(N);
vector<int> indices(N);
for (int i = 0; i < N; ++i) {
int tmp;
cin >> tmp;
a.push_ba... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 775,383 | 775,384 | u894471318 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll n;
cin >> n;
ll a[n];
ll b[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
bool flag = false;
if (a[n - 1] == a[n - 2])
flag = true;
ll m... | #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll n;
cin >> n;
ll a[n];
ll b[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
bool flag = false;
if (b[n - 1] == b[n - 2])
flag = true;
ll m... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 775,407 | 775,408 | u371051907 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_op(i, a, n) for (int i = a; i < n; i++)
#define rep_d(j, n) for (int j = n; j >= 0; j--)
#define rep_d_op(j, n, a) for (int j = n; j >= a; j--)
template <class T> i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_op(i, a, n) for (int i = a; i < n; i++)
#define rep_d(j, n) for (int j = n; j >= 0; j--)
#define rep_d_op(j, n, a) for (int j = n; j >= a; j--)
template <class T> i... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 775,409 | 775,410 | u496074393 | cpp |
p02971 | // url:
// problem name:
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return ... | // url:
// problem name:
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 775,438 | 775,439 | u446371873 | cpp |
p02971 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A1[N + 2], A2[N + 2];
fill(A1, A1 + N + 2, 0);
fill(A2, A2 + N + 2, 0);
for (int i = 1; i <= N; i++) {
cin >> A1[i];
A2[i] = A1[i];
}
for (int i = 1, j = N; i <= N; i++, j--) {
A1[i] = max(A1[i], A1[i - 1]);
... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A1[N + 2], A2[N + 2];
fill(A1, A1 + N + 2, 0);
fill(A2, A2 + N + 2, 0);
for (int i = 1; i <= N; i++) {
cin >> A1[i];
A2[i] = A1[i];
}
for (int i = 1, j = N; i <= N; i++, j--) {
A1[i] = max(A1[i], A1[i - 1]);
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 775,447 | 775,448 | u131000248 | cpp |
p02971 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
rep(i, N) {
cin >> A[i];
B[i] = A[i];
}
sort(B.begin(), B.begin());
rep(i, N) {
if (A[i] != B[N - 1]) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
rep(i, N) {
cin >> A[i];
B[i] = A[i];
}
sort(B.begin(), B.end());
rep(i, N) {
if (A[i] != B[N - 1]) {
... | [
"call.function.change",
"call.arguments.change"
] | 775,451 | 775,452 | u454081619 | cpp |
p02971 | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void ... | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void ... | [
"assignment.change"
] | 775,453 | 775,454 | u449573758 | cpp |
p02971 | #include <bits/stdc++.h>
#define lint long long int
using namespace std;
lint num_1 = 0;
lint num_2 = 0;
void max_dp(vector<lint> v, int n) {
vector<lint> dp(n + 1);
vector<lint> dp_2(n + 1);
dp[1] = v[0];
for (int i = 2; i <= n; ++i) {
dp[i] = max(dp[i - 1], v[i - 1]);
}
num_1 = dp[n];
for (int i = 0... | #include <bits/stdc++.h>
#define lint long long int
using namespace std;
lint num_1 = 0;
lint num_2 = 0;
void max_dp(vector<lint> v, int n) {
vector<lint> dp(n + 1);
vector<lint> dp_2(n + 1);
dp[1] = v[0];
for (int i = 2; i <= n; ++i) {
dp[i] = max(dp[i - 1], v[i - 1]);
}
num_1 = dp[n];
for (int i = 0... | [
"control_flow.continue.remove",
"control_flow.break.add"
] | 775,464 | 775,465 | u363550661 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> v1(n), v2(n);
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> v1(n), v2(n);
for (int i... | [
"identifier.change",
"call.arguments.change",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 775,470 | 775,471 | u856877925 | cpp |
p02971 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
int i, n, first, second;
cin >> n;
vector<int> v(n);
int a[n];
map<int, int> score;
first = 0;
second = 0;
rep(i, n) {
cin >> a[i];
v.push_back(a[i]);
score[a[i]]++;
}
sort... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
int i, n, first, second;
cin >> n;
vector<int> v(n);
int a[n];
map<int, int> score;
first = 0;
second = 0;
rep(i, n) {
cin >> a[i];
v.push_back(a[i]);
score[a[i]]++;
}
sort... | [
"call.remove",
"control_flow.branch.if.condition.change"
] | 775,482 | 775,483 | u890331732 | cpp |
p02971 | #include <iostream>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
long int n;
cin >> n;
vector<long int> a(n);
rep(i, n) cin >> a[i];
vector<long int> lm(n, 0);
vector<long int> rm(n, 0);
for (int i = 1; i < n; i++)
lm[i] = max(lm[i - 1], a[... | #include <iostream>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
long int n;
cin >> n;
vector<long int> a(n);
rep(i, n) cin >> a[i];
vector<long int> lm(n, 0);
vector<long int> rm(n, 0);
for (int i = 1; i < n; i++)
lm[i] = max(lm[i - 1], a[... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 775,486 | 775,487 | u651109406 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int n, a[200005], b[200005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i], b[i] = a[i];
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
if (b[i] == a[1])
cout << a[2] << endl;
else
cout << a[1] << endl;
}
return ... | #include <bits/stdc++.h>
using namespace std;
int n, a[200005], b[200005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i], b[i] = a[i];
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
if (b[i] == a[n])
cout << a[n - 1] << endl;
else
cout << a[n] << endl;
}
ret... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 775,504 | 775,505 | u469639111 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#inclu... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#inclu... | [
"io.output.change"
] | 775,510 | 775,511 | u698883164 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
int ans = 0;
sort(b.begin(), b.end());
for (int i = 0; i < n; i++) {
if (a[i] == b[n - 1])
cout << a[n - 2] << endl;
else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
int ans = 0;
sort(b.begin(), b.end());
for (int i = 0; i < n; i++) {
if (a[i] == b[n - 1])
cout << b[n - 2] << endl;
else
... | [
"identifier.change",
"io.output.change"
] | 775,516 | 775,517 | u057810841 | cpp |
p02971 | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
#define mp map<int, int>
using namespace std;
int a[200005], b[200005];
int main() {
int n;
cin >> n;
rep(i, 1, n) cin >> a[i], b[i] = a[i];
sort(b + 1, b ... | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
#define mp map<int, int>
using namespace std;
int a[200005], b[200005];
int main() {
int n;
cin >> n;
rep(i, 1, n) cin >> a[i], b[i] = a[i];
sort(b + 1, b ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 775,527 | 775,528 | u796123030 | cpp |
p02971 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int n;
int main() {
cin >> n;
vector<int> a(n + 1);
vector<int> r(n + 1), l(n + 1);
rep(i, n) cin >> a[i];
l[0] = a[0]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int n;
int main() {
cin >> n;
vector<int> a(n + 1);
vector<int> r(n + 1), l(n + 1);
rep(i, n) cin >> a[i];
l[0] = a[0]... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 775,531 | 775,532 | u620269708 | cpp |
p02971 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int n;
int main() {
cin >> n;
vector<int> a(n + 1);
vector<int> r(n + 1), l(n + 1);
rep(i, n) cin >> a[i];
l[0] = a[0]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int n;
int main() {
cin >> n;
vector<int> a(n + 1);
vector<int> r(n + 1), l(n + 1);
rep(i, n) cin >> a[i];
l[0] = a[0]... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 775,533 | 775,532 | u620269708 | cpp |
p02971 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a, b, c, n;
string s, t;
int main() {
cin >> n;
vec... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a, b, c, n;
string s, t;
int main() {
cin >> n;
vec... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.rem... | 775,538 | 775,539 | u465760322 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> a_tmp(n);
int max_index = 0;
int max = 0;
int second_max = 0;
int max_cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max) {
max_index = i;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> a_tmp(n);
int max_index = 0;
int max = 0;
int second_max = 0;
int max_cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max) {
max_index = i;
... | [
"assignment.add"
] | 775,540 | 775,541 | u596311864 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
multiset<int> s;
vector<int> v(n);
int m = n;
for (auto &i : v) {
cin >> i;
s.insert(i);
}
for (auto i : v) {
s.erase(i);
cout << *s.rbegin() << "\n";
s.insert(i);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
multiset<int> s;
vector<int> v(n);
int m = n;
for (auto &i : v) {
cin >> i;
s.insert(i);
}
for (auto i : v) {
s.erase(s.find(i));
cout << *s.rbegin() << "\n";
s.insert(i);
}
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 775,546 | 775,547 | u767871438 | cpp |
p02971 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
co... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
co... | [
"call.arguments.add"
] | 775,555 | 775,556 | u571173211 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef... | [
"identifier.change",
"call.function.change",
"call.arguments.add",
"call.arguments.change"
] | 775,557 | 775,558 | u143100985 | cpp |
p02971 | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define MOD 1000000007
#define INF 1e9
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "... | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define MOD 1000000007
#define INF 1e9
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "... | [
"literal.number.change",
"variable_declaration.value.change"
] | 775,560 | 775,561 | u952289831 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 775,571 | 775,572 | u341447450 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(in) in.begin(), in.end()
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS 0.0000000001
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(in) in.begin(), in.end()
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS 0.0000000001
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
... | [
"expression.operation.binary.add"
] | 775,573 | 775,574 | u318334550 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(in) in.begin(), in.end()
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS 0.0000000001
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(in) in.begin(), in.end()
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS 0.0000000001
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
... | [] | 775,575 | 775,576 | u318334550 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 775,577 | 775,578 | u790461875 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[200200];
int maxx1 = 0;
int maxx2 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
maxx1 = max(maxx1, a[i]);
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] == maxx1)
cnt++;
else
maxx2 = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[200200];
int maxx1 = 0;
int maxx2 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
maxx1 = max(maxx1, a[i]);
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] == maxx1)
cnt++;
else
maxx2 = ... | [
"control_flow.loop.for.condition.change"
] | 775,583 | 775,584 | u796877631 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i) {
b[i] = a[i];
}
sort(b.begin(), b.end());
for (int i = 0; i < n; ++i) {
if (a[i] != b[n -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i) {
b[i] = a[i];
}
sort(b.begin(), b.end());
for (int i = 0; i < n; ++i) {
if (a[i] != b[n -... | [
"io.output.newline.add"
] | 775,585 | 775,586 | u417563928 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(0, 0), A(0, 0), B(0, 0);
int x = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
x = max(x, a);
data.push_back(a);
A.push_back(x);
}
x = 0;
for (int i = N - 1; i >= 0; i--) {
x = max(x,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(0, 0), A(0, 0), B(0, 0);
int x = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
x = max(x, a);
data.push_back(a);
A.push_back(x);
}
x = 0;
for (int i = N - 1; i >= 0; i--) {
x = max(x,... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 775,587 | 775,588 | u071282706 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(0, 0), A(0, 0), B(0, 0);
int x = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
x = max(x, a);
data.push_back(a);
A.push_back(x);
}
x = 0;
for (int i = N - 1; i >= 0; i--) {
x = max(x,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(0, 0), A(0, 0), B(0, 0);
int x = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
x = max(x, a);
data.push_back(a);
A.push_back(x);
}
x = 0;
for (int i = N - 1; i >= 0; i--) {
x = max(x,... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 775,589 | 775,588 | u071282706 | cpp |
p02971 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
int s[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
s[i] = A[i];
}
int max = 0;
for (int i = 0; i < N; i++) {
if (max < A[i]) {
max = A[i];
}
}
sort(s, s + N);
for (int i... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
int s[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
s[i] = A[i];
}
int max = 0;
for (int i = 0; i < N; i++) {
if (max < A[i]) {
max = A[i];
}
}
sort(s, s + N);
for (int i... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 775,590 | 775,591 | u584787460 | 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 largest = A[0];
int next_largest = A[1];
if (largest < next_largest)
swap(largest, next_largest);
for (int i = 0; i < N; i++) {
if (A[i] >= largest) ... | #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 largest = A[0];
int next_largest = A[1];
if (largest < next_largest)
swap(largest, next_largest);
for (int i = 2; i < N; i++) {
if (A[i] >= largest) ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 775,592 | 775,593 | u599568485 | cpp |
p02971 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), e(n);
for (int i = 0; i < n; i++)
cin >> a[i];
b[0] = a[0], e[n - 1] = a[n - 1];
for (int i = 1; i < n; i++)
b[i]... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), e(n);
for (int i = 0; i < n; i++)
cin >> a[i];
b[0] = a[0], e[n - 1] = a[n - 1];
for (int i = 1; i < n; i++)
b[i]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 775,608 | 775,609 | u427571081 | cpp |
p02971 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), e(n);
for (int i = 0; i < n; i++)
cin >> a[i];
b[0] = a[0], e[n - 1] = a[n - 1];
for (int i = 1; i < n; i++)
b[i]... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), e(n);
for (int i = 0; i < n; i++)
cin >> a[i];
b[0] = a[0], e[n - 1] = a[n - 1];
for (int i = 1; i < n; i++)
b[i]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change",
"expression.operation.binary.change"
] | 775,610 | 775,609 | u427571081 | cpp |
p02971 | #include <iostream>
int main() {
int N, A[200000];
int max = 0;
int max2 = 0;
int flag = 0;
scanf("%d", &N);
for (int i = 0; i <= N - 1; i++) {
scanf("%d", &A[i]);
if (A[i] > max) {
max = A[i];
}
if (A[i] > max2) {
if (A[i] != max) {
max2 = A[i];
}
}
}
for ... | #include <iostream>
int main() {
int N, A[200000];
int max = 0;
int max2 = 0;
int flag = 0;
scanf("%d", &N);
for (int i = 0; i <= N - 1; i++) {
scanf("%d", &A[i]);
if (A[i] > max) {
max2 = max;
max = A[i];
}
if (A[i] > max2) {
if (A[i] != max) {
max2 = A[i];
... | [
"assignment.add"
] | 775,632 | 775,633 | u392164874 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> numbers(N);
int max_number = 0;
int max_index = 0;
int n;
for (int i = 0; i < N; i++) {
cin >> numbers.at(i);
if (max_number < numbers.at(i)) {
max_number = numbers.at(i);
ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> numbers(N);
int max_number = 0;
int max_index = 0;
int n;
for (int i = 0; i < N; i++) {
cin >> numbers.at(i);
if (max_number < numbers.at(i)) {
max_number = numbers.at(i);
ma... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 775,634 | 775,635 | u975658594 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.