problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02971 | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> data(n, 0);
for (int i = 0; i < n; ++i) {
cin >> data[i];
}
vector<int> lmax(n, 0);
vector<int> rmax(n, 0);
for (int i = 1; i < n; ++i) {
lmax[i] = max(lmax[i - 1], data[i]... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> data(n, 0);
for (int i = 0; i < n; ++i) {
cin >> data[i];
}
vector<int> lmax(n, 0);
vector<int> rmax(n, 0);
for (int i = 1; i < n; ++i) {
lmax[i] = max(lmax[i - 1], data[i ... | [
"assignment.change"
] | 776,328 | 776,329 | u725232444 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vi a(n);
for (auto &x : a) {
cin... | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vi a(n);
for (auto &x : a) {
cin... | [
"assignment.value.change",
"identifier.change"
] | 776,339 | 776,340 | u906129425 | cpp |
p02971 |
/*Hey, What's up?*/
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... |
/*Hey, What's up?*/
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 776,351 | 776,352 | u959479368 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i)... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i)... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 776,355 | 776,356 | u994831328 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define ll... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define ll... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 776,357 | 776,358 | u152424169 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7; // 10^9+7
int main() {
int n, a[200001];
cin >> n;
int maxl[200001], maxr[200001];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0)
maxl[i] = a[i];
else
maxl[i] = max(a[i], maxl[i -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7; // 10^9+7
int main() {
int n, a[200001];
cin >> n;
int maxl[200001], maxr[200001];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0)
maxl[i] = a[i];
else
maxl[i] = max(a[i], maxl[i -... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,359 | 776,360 | u792423109 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> as(n);
for (auto &a : as) {
cin >> a;
}
as.emplace_back(-1);
int64_t fst = 0, snd = n;
for (int64_t i = 0; i < n; i++) {
if (as[fst] <= as[i]) {
snd = fst;
fst = i;
} else if (as[s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> as(n);
for (auto &a : as) {
cin >> a;
}
as.emplace_back(-1);
int64_t fst = 0, snd = n;
for (int64_t i = 1; i < n; i++) {
if (as[fst] <= as[i]) {
snd = fst;
fst = i;
} else if (as[s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 776,369 | 776,370 | u017167684 | cpp |
p02971 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"control_flow.branch.else.add",
"function.return_value.change"
] | 776,371 | 776,372 | u633284019 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int N;
int A[200000];
int main... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int N;
int A[200000];
int main... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 776,373 | 776,374 | u379710681 | cpp |
p02971 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (i = a; i < b; i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define vi vector<int>
#define vii vector<long long int>
#define CLR(a) memset((a), 0, sizeof(a))
#define mp make_pair
#define hell 100000000... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (i = a; i < b; i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define vi vector<int>
#define vii vector<long long int>
#define CLR(a) memset((a), 0, sizeof(a))
#define mp make_pair
#define hell 100000000... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,377 | 776,378 | u216069198 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> p;
struct SegTree {
int seg_tree_size = 1;
int nums_size;
... | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> p;
struct SegTree {
int seg_tree_size = 1;
int nums_size;
... | [
"expression.operation.binary.remove"
] | 776,379 | 776,380 | u916743460 | cpp |
p02971 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#in... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#in... | [
"expression.operation.binary.add"
] | 776,381 | 776,382 | u600880717 | cpp |
p02971 | // Utkarsh.25dec
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, a, b) for (ll i = a; i <= b; i++)
#define vi vector<int>
#define vs vector<string>
#define v... | // Utkarsh.25dec
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, a, b) for (ll i = a; i <= b; i++)
#define vi vector<int>
#define vs vector<string>
#define v... | [
"expression.operation.binary.add"
] | 776,383 | 776,384 | u596750443 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int arr[200003] = {};
int mx[200003] = {};
int mx_rev[200003] = {};
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
mx[0] = arr[0];
for (int i = 1; i <= n; i++) {
mx[i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int arr[200003] = {};
int mx[200003] = {};
int mx_rev[200003] = {};
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
mx[0] = arr[0];
for (int i = 1; i <= n; i++) {
mx[i... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,387 | 776,388 | u508729896 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,389 | 776,390 | u381714561 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,391 | 776,390 | u381714561 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | [
"assignment.change",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,392 | 776,390 | u381714561 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ar[n], copy[n];
for (int i = 0; i < n; ++i) {
cin >> ar[i];
copy[i] = ar[i];
}
sort(copy, copy + n, greater<int>());
for (int i = 0; i < n; ++i) {
if (ar[i] == copy[0]) {
cout << copy[1] << "\n";
} else {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ar[n], copy[n];
for (int i = 0; i < n; ++i) {
cin >> ar[i];
copy[i] = ar[i];
}
sort(copy, copy + n, greater<int>());
for (int i = 0; i < n; ++i) {
if (ar[i] == copy[0]) {
cout << copy[1] << "\n";
} else {... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,393 | 776,394 | u328627271 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll A[200005];
ll B[200005];
ll m = -1;
bool f = false;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] > m) {
m = A[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll A[200005];
ll B[200005];
ll m = -1;
bool f = false;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] > m) {
m = A[i... | [
"io.output.change"
] | 776,397 | 776,398 | u140450365 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> A(N);
int a;
for (int i = 0; i < N; i++) {
cin >> a;
A[i] = make_pair(a, ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> A(N);
int a;
for (int i = 0; i < N; i++) {
cin >> a;
A[i] = make_pair(a, ... | [
"identifier.change",
"io.output.change"
] | 776,405 | 776,406 | u048945791 | cpp |
p02971 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.141592653589793
using namespace std;
int main() {
// cout << setprecision(100);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a[n], p... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.141592653589793
using namespace std;
int main() {
// cout << setprecision(100);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a[n], p... | [
"identifier.change",
"io.output.change"
] | 776,407 | 776,408 | u188208110 | cpp |
p02971 | #include <iostream>
using namespace std;
const int MAX_N = 2 * 1e5 + 2;
int A[MAX_N];
int left_max[MAX_N], right_max[MAX_N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = 1; i <= N; i++) {
left_max[i] = max(left_max[i... | #include <iostream>
using namespace std;
const int MAX_N = 2 * 1e5 + 10;
int A[MAX_N];
int left_max[MAX_N], right_max[MAX_N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = 1; i <= N; i++) {
left_max[i] = max(left_max[... | [
"literal.number.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 776,411 | 776,412 | u134519179 | cpp |
p02971 | #include <bits/stdc++.h>
#define M 200005
using namespace std;
int n, A[M], la[M];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
la[n] = A[n];
for (int i = n - 1; i >= 1; i--)
la[i] = max(la[i - 1], A[i]);
int mx = 0;
for (int i = 1; i <= n; i++) {
printf("%d\n",... | #include <bits/stdc++.h>
#define M 200005
using namespace std;
int n, A[M], la[M];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
la[n] = A[n];
for (int i = n - 1; i >= 1; i--)
la[i] = max(la[i + 1], A[i]);
int mx = 0;
for (int i = 1; i <= n; i++) {
printf("%d\n",... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 776,415 | 776,416 | u625437412 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 776,419 | 776,420 | u050865477 | cpp |
p02971 | #include <bits/stdc++.h>
#define me(a, x) memset(a, x, sizeof(a))
#define sc scanf
#define itn int
using namespace std;
const int N = 1e6;
const long long mod = 1e9 + 7;
const int oo = 0x7fffffff;
const int sup = 0x80000000;
typedef long long ll;
typedef unsigned long long ull;
template <typename it> void db(it *begin,... | #include <bits/stdc++.h>
#define me(a, x) memset(a, x, sizeof(a))
#define sc scanf
#define itn int
using namespace std;
const int N = 1e6;
const long long mod = 1e9 + 7;
const int oo = 0x7fffffff;
const int sup = 0x80000000;
typedef long long ll;
typedef unsigned long long ull;
template <typename it> void db(it *begin,... | [
"assignment.change"
] | 776,423 | 776,424 | u433172603 | cpp |
p02971 | #include <iostream>
using namespace std;
int main() {
int N;
int A[200000];
int l[200000];
int r[200000];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
l[0] = A[0];
for (int i = 1; i < N; i++)
l[i] = max(l[i - 1], A[i]);
r[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--)
r[i] =... | #include <iostream>
using namespace std;
int main() {
int N;
int A[200000];
int l[200000];
int r[200000];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
l[0] = A[0];
for (int i = 1; i < N; i++)
l[i] = max(l[i - 1], A[i]);
r[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--)
r[i] =... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 776,425 | 776,426 | u693133807 | cpp |
p02971 | #include <iostream>
using namespace std;
int main(void) {
int n;
int a[200000];
int leftmax[200001] = {-1};
int rightmax[200001] = {-1};
int ans[200000] = {-1};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = (n - 1); i >= 0; i--) {
if (i == (n - 1)) {
rightmax[i]... | #include <iostream>
using namespace std;
int main(void) {
int n;
int a[200000];
int leftmax[200001] = {-1};
int rightmax[200001] = {-1};
int ans[200000] = {-1};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = (n - 1); i >= 0; i--) {
if (i == (n - 1)) {
rightmax[i]... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 776,433 | 776,434 | u274657603 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int n, a[200020];
int maxx1[200020];
int maxx2[200020];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
maxx1[i] = max(maxx1[i - 1], a[i]);
}
for (int i = n; i >= 1; i--) {
maxx2[i] = max(maxx2[i - 1], a[i]);
}
for (i... | #include <bits/stdc++.h>
using namespace std;
int n, a[200020];
int maxx1[200020];
int maxx2[200020];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
maxx1[i] = max(maxx1[i - 1], a[i]);
}
for (int i = n; i >= 1; i--) {
maxx2[i] = max(maxx2[i + 1], a[i]);
}
for (i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 776,440 | 776,441 | u234165819 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int k = -1;
int g = -2;
int p;
int q;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (k < a[i]) {
g = k;
k = a[i];
p = i;
}
if (a[i] <= k && a[i] > g) {
g = a[i];
}
}
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int k = -1;
int g = -2;
int p;
int q;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (k < a[i]) {
g = k;
k = a[i];
p = i;
} else if (a[i] <= k && a[i] > g) {
g = a[i];
}
}
fo... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 776,446 | 776,447 | u758406624 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int max = 0;
int semi = 0;
for (int i = 1; i < n; i++) {
if (max < a.at(i)) {
semi = max;
max = a.at(i);
} else {
if (semi < a.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.at(i);
}
int max = 0;
int semi = 0;
for (int i = 0; i < n; i++) {
if (max < a.at(i)) {
// cout<<1<<endl;
semi = max;
max = a.at(i);
} else... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 776,448 | 776,449 | u461896927 | cpp |
p02971 | #include <iostream>
using namespace std;
int main(void) {
int n;
std::cin >> n;
int max = 0;
int next = 0;
int maxi = 0;
int nexti = 0;
for (int i = 0; i < n; i++) {
int now = 0;
std::cin >> now;
if (now >= max) {
next = max;
nexti = maxi;
max = now;
maxi = i;
} els... | #include <iostream>
using namespace std;
int main(void) {
int n;
std::cin >> n;
int max = 0;
int next = 0;
int maxi = 0;
int nexti = 0;
for (int i = 0; i < n; i++) {
int now = 0;
std::cin >> now;
if (now >= max) {
next = max;
nexti = maxi;
max = now;
maxi = i;
} els... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,450 | 776,451 | u074135432 | cpp |
p02971 | #include <iostream>
using namespace std;
int main(void) {
int n;
std::cin >> n;
int max = 0;
int next = 0;
int maxi = 0;
int nexti = 0;
for (int i = 0; i < n; i++) {
int now = 0;
std::cin >> now;
if (now > max) {
next = max;
nexti = maxi;
max = now;
maxi = i;
} else... | #include <iostream>
using namespace std;
int main(void) {
int n;
std::cin >> n;
int max = 0;
int next = 0;
int maxi = 0;
int nexti = 0;
for (int i = 0; i < n; i++) {
int now = 0;
std::cin >> now;
if (now >= max) {
next = max;
nexti = maxi;
max = now;
maxi = i;
} els... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,452 | 776,451 | u074135432 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> a(N);
cin >> a[0];
long long amax_1 = a[0];
long long amax_2 = a[0];
for (long long i = 1; i < N; i++) {
cin >> a[i];
if (a[i] > amax_1) {
amax_2 = amax_... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> a(N);
cin >> a[0];
long long amax_1 = a[0];
long long amax_2 = 0;
for (long long i = 1; i < N; i++) {
cin >> a[i];
if (a[i] > amax_1) {
amax_2 = amax_1;
... | [] | 776,453 | 776,454 | u846226907 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
v.push_back(a[i]);
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (v[n - 1] == a[i]) {
cout << v[n - 2] << endl;
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a[i];
v.push_back(a[i]);
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (v[n - 1] == a[i]) {
cout << v[n - 2] << endl;
} else {... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,461 | 776,462 | u745852541 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
std::vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
v.push_back(a[i]);
}
sort(v.begin(), v.end());
for (int i = 0; i <= n; i++) {
if (v[n - 1] == a[i]) {
cout << v[n - 2] << endl;
} ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a[i];
v.push_back(a[i]);
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (v[n - 1] == a[i]) {
cout << v[n - 2] << endl;
} else {... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,463 | 776,462 | u745852541 | cpp |
p02971 | #include <algorithm>
#include <chrono>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define inf 1e6
int main() {
int N;
... | #include <algorithm>
#include <chrono>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define inf 1e6
int main() {
int N;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 776,466 | 776,467 | u766009355 | cpp |
p02971 | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 2e5 + 9;
int s[N], f[N];
int main(void) {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> s[i], f[i] = s[i];
sort(f, f + n, greater<int>());
int a = f[0], b = f[1];
for (int i = 0; i < n; ++i)... | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 2e5 + 9;
int s[N], f[N];
int main(void) {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> s[i], f[i] = s[i];
sort(f, f + n, greater<int>());
int a = f[0], b = f[1];
for (int i = 0; i < n; ++i)... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 776,468 | 776,469 | u777148280 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ma = 0;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = max(a[i], ma);
ma = max(a[i], ma);
}
ma = 0;
for (int i = n - 1; i >= 0; i--) {
c[i] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ma = 0;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = max(a[i], ma);
ma = max(a[i], ma);
}
ma = 0;
for (int i = n - 1; i >= 0; i--) {
c[i] =... | [
"expression.operation.binary.add"
] | 776,476 | 776,477 | u125051909 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ma = 0;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = max(a[i], ma);
ma = max(a[i], ma);
}
ma = 0;
for (int i = n - 1; i >= 0; i--) {
c[i] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ma = 0;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = max(a[i], ma);
ma = max(a[i], ma);
}
ma = 0;
for (int i = n - 1; i >= 0; i--) {
c[i] =... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,478 | 776,477 | u125051909 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ma = 0;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = max(a[i], ma);
ma = max(a[i], ma);
}
ma = 0;
for (int i = n - 1; i >= 0; i--) {
c[i] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ma = 0;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = max(a[i], ma);
ma = max(a[i], ma);
}
ma = 0;
for (int i = n - 1; i >= 0; i--) {
c[i] =... | [
"expression.operation.binary.add"
] | 776,479 | 776,477 | u125051909 | cpp |
p02971 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i];... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i];... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 776,497 | 776,498 | u067128860 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long a[n + 1], b[n + 1];
for (long long i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(a, a + n);
long long m1 = a[n - 1];
long long m2 = a[n - 2];
for (long long i = 0; i < n; i++) {
if (b[i] == m1)
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n + 1], b[n + 1];
for (long long i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(a, a + n);
long long m1 = a[n - 1];
long long m2 = a[n - 2];
for (long long i = 0; i < n; i++) {
if (b[i] == ... | [] | 776,501 | 776,502 | u968285884 | cpp |
p02971 | #include <bits/stdc++.h>
int n;
int x;
std::vector<int> vec;
std::vector<int> vec2;
int main() {
std::cin >> n;
vec.assign(n, 0);
vec2.assign(n, 0);
for (int i = 0; i < n; i++) {
std::cin >> x;
vec[i] = x;
vec2[i] = x;
}
std::sort(vec2.begin(), vec2.end());
for (int j = 0; j < n; j++) {
... | #include <bits/stdc++.h>
int n;
int x;
std::vector<int> vec;
std::vector<int> vec2;
int main() {
std::cin >> n;
vec.assign(n, 0);
vec2.assign(n, 0);
for (int i = 0; i < n; i++) {
std::cin >> x;
vec[i] = x;
vec2[i] = x;
}
std::sort(vec2.begin(), vec2.end());
for (int j = 0; j < n; j++) {
... | [
"identifier.change",
"expression.operation.binary.change"
] | 776,503 | 776,504 | u537538698 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> v(a), b(a);
int tmp;
for (int i = 0; i < a; i++) {
cin >> v[i];
b[i] = v[i];
}
sort(v.begin(), v.end());
if (v[a - 1] == v[a - 2]) {
for (int i = 0; i < a; i++)
cout << v[a - 1] << endl;
} else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> v(a), b(a);
int tmp;
for (int i = 0; i < a; i++) {
cin >> v[i];
b[i] = v[i];
}
sort(v.begin(), v.end());
if (v[a - 1] == v[a - 2]) {
for (int i = 0; i < a; i++)
cout << v[a - 1] << endl;
} else ... | [] | 776,509 | 776,510 | u936271647 | cpp |
p02971 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int max = 0;
int s_max = 0;
bool max_f = false;
vector<int> num;
cin >> n;
for (int i = 0; i < n; i++) {
int inp;
cin >> inp;
num.push_back(inp);
if (inp > s_max) {
if (inp > max) {
max = inp;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int max = 0;
int s_max = 0;
bool max_f = false;
vector<int> num;
cin >> n;
for (int i = 0; i < n; i++) {
int inp;
cin >> inp;
num.push_back(inp);
if (inp > s_max) {
if (inp > max) {
s_max = max;... | [
"assignment.add"
] | 776,515 | 776,516 | u818286983 | cpp |
p02971 | #include <bits/stdc++.h>
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fo(v, a, b) for (int v = (a)... | #include <bits/stdc++.h>
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fo(v, a, b) for (int v = (a)... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 776,523 | 776,524 | u280425786 | cpp |
p02971 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie... | [] | 776,525 | 776,526 | u827841970 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<long long> A(N), B;
for (int i = 0; i < N; i++)
cin >> A[i];
B = A;
sort(B.begin(), B.end());
long long M = *max_element(A.begin(), A.end());
if (M == B[1]) {
for (int i = 0; i < N; i++)
cout << M << e... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<long long> A(N), B;
for (int i = 0; i < N; i++)
cin >> A[i];
B = A;
sort(B.rbegin(), B.rend());
long long M = *max_element(A.begin(), A.end());
if (M == B[1]) {
for (int i = 0; i < N; i++)
cout << M <<... | [
"call.function.change",
"call.arguments.change"
] | 776,527 | 776,528 | u898331860 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
ll N;
cin >> N;
vector<ll> a(N + 1), b(N + 1);
rep(i, N) cin >> a[i + 1];
for (int i = N; i >= 1; i--) {
int cnt = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
ll N;
cin >> N;
vector<ll> a(N + 1), b(N + 1);
rep(i, N) cin >> a[i + 1];
for (int i = N; i >= 1; i--) {
int cnt = 0;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 776,537 | 776,538 | u201651098 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
// sengen
int n;
// nyuryoku
cin >> n;
int a[n + 1] = {};
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int b[n + 1] = {};
int m = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
int j = 2;
while (i * j... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
// sengen
int n;
// nyuryoku
cin >> n;
int a[n + 1] = {};
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int b[n + 1] = {};
int m = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
int j = 2;
while (i * j... | [] | 776,539 | 776,540 | u002847662 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define NIL = -1;
#define all(x) x.begin(), x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0)
return 1;
return digit... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define NIL = -1;
#define all(x) x.begin(), x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0)
return 1;
return digit... | [] | 776,541 | 776,542 | u111600809 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9 + 7;
int a[200010], b[200010];
int main() {
int n;
cin >> n;
rep(i, n) cin >>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9 + 7;
int a[200010], b[200010];
int main() {
int n;
cin >> n;
rep(i, n) cin >>... | [] | 776,543 | 776,544 | u309168663 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define revrep(i, n) for (ll i = n - 1; i >= 0; --i)
inline constexpr ll Inf = (1ULL << 62) - 1;
#define fastio ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define revrep(i, n) for (ll i = n - 1; i >= 0; --i)
inline constexpr ll Inf = (1ULL << 62) - 1;
#define fastio ... | [] | 776,547 | 776,548 | u185413585 | cpp |
p02972 | #include <iostream>
#include <vector>
int main(void) {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n + 1);
a[0] = 0;
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
if (b[i] == 1)
cnt++;
... | #include <iostream>
#include <vector>
int main(void) {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n + 1);
a[0] = 0;
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
if (b[j] == 1)
cnt++;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 776,549 | 776,550 | u275256557 | cpp |
p02972 | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for (long long int i = K; i < N; i++)
#define ll long long int
#define PP 1000000007
using namespace std;
int main() {
ll N, Ans = 0;
cin >> N;
vector<ll> A(N + 1);
vector<bool> B(N + 1);
rep(i, 1, N + 1) {
... | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for (long long int i = K; i < N; i++)
#define ll long long int
#define PP 1000000007
using namespace std;
int main() {
ll N, Ans = 0;
cin >> N;
vector<ll> A(N + 1);
vector<bool> B(N + 1);
rep(i, 1, N + 1) {
... | [
"assignment.value.change",
"identifier.change"
] | 776,551 | 776,552 | u551500493 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 776,557 | 776,558 | u370785250 | cpp |
p02972 | #pragma region header
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#i... | #pragma region header
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,565 | 776,566 | u926006934 | cpp |
p02972 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i < n + 1; i++) {
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i < n + 1; i++) {
... | [
"assignment.value.change",
"identifier.change"
] | 776,567 | 776,568 | u782144261 | cpp |
p02972 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const l... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const l... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 776,569 | 776,570 | u416773418 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ball(n + 1, 0);
ll cnt = 0;
for (int i = n; i >= 1; i--) {
ll tmp = 0;
for (int j = i + i; j <= n; j += i) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ball(n + 1, 0);
ll cnt = 0;
for (int i = n; i >= 1; i--) {
ll tmp = 0;
for (int j = i + i; j <= n; j += i) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 776,575 | 776,576 | u221391729 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1, 0);
for (int i = n; i >= 1; i--) {
int tmpSum = 0;
for (int j = i + i; j <= n; j += i) {
tmpSu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1, 0);
for (int i = n; i >= 1; i--) {
int tmpSum = 0;
for (int j = i + i; j <= n; j += i) {
tmpSu... | [
"assignment.value.change",
"identifier.change"
] | 776,577 | 776,578 | u221391729 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int n;
int a[MAXN], FMax[MAXN], SMax[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
FMax[1] = a[1];
SMax[1] = a[1];
for (int i = 2; i <= n; i++) {
if (a[i] >= FMax[i - 1])
FMax[i] = a[i... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int n;
int a[MAXN], FMax[MAXN], SMax[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
FMax[1] = a[1];
SMax[1] = 0;
for (int i = 2; i <= n; i++) {
if (a[i] >= FMax[i - 1])
FMax[i] = a[i], ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 776,589 | 776,590 | u462461621 | cpp |
p02971 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define re(i, x, y) for (int i = x; i < y; i++)
long long INF = 1e9;
con... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define re(i, x, y) for (int i = x; i < y; i++)
long long INF = 1e9;
con... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 776,607 | 776,608 | u110653681 | cpp |
p02971 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> A(N);
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
}
std::vector<int> max_from(N);
int max_val = A.back();
max_from[N - 1] = max_val;
for (int i = N - 2; i >= 0; --i) {
max_val ... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> A(N);
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
}
std::vector<int> max_from(N);
int max_val = A.back();
max_from[N - 1] = max_val;
for (int i = N - 2; i >= 0; --i) {
max_val ... | [
"assignment.value.change",
"identifier.change"
] | 776,618 | 776,619 | u549516870 | cpp |
p02971 | #include <limits.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n;
scanf("%d", &n);
// get array
int *array = (int *)malloc(sizeof(int) * n);
for (int i = 0; i < n; i++) {
scanf("%d", &array[i]);
}
int max, nextMax;
int maxIndex;
// init
if (array[0] > array[1]) {
max = array... | #include <limits.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n;
scanf("%d", &n);
// get array
int *array = (int *)malloc(sizeof(int) * n);
for (int i = 0; i < n; i++) {
scanf("%d", &array[i]);
}
int max, nextMax;
int maxIndex;
// init
if (array[0] > array[1]) {
max = array... | [
"call.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"call.add"
] | 776,637 | 776,638 | u069586564 | cpp |
p02971 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
cin >> a[0] >> a[1];
int m1 = max(a[0], a[1]), m2 = min(a[0], a[1]);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= m1) {
m2 = m1;
m1 = a[i];
} else if (a[i] >= m2) {
m2 = a[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
cin >> a[0] >> a[1];
int m1 = max(a[0], a[1]), m2 = min(a[0], a[1]);
for (int i = 2; i < n; i++) {
cin >> a[i];
if (a[i] >= m1) {
m2 = m1;
m1 = a[i];
} else if (a[i] >= m2) {
m2 = a[i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 776,643 | 776,644 | u320241053 | cpp |
p02971 | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int a, b[210000], c[210000], d;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
c[i] = b[i];
}
sort(c, c + a, greater<int>());
for (int i = 0; i < a; i++) {
if (b[i] == c[0]) {
cout << c[1... | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int a, b[210000], c[210000], d;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
c[i] = b[i];
}
sort(c, c + a, greater<int>());
for (int i = 0; i < a; i++) {
if (b[i] == c[0]) {
cout << c[1... | [] | 776,675 | 776,676 | u661845689 | cpp |
p02972 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stat... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stat... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,685 | 776,686 | u690326065 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,687 | 776,688 | u742595961 | cpp |
p02972 | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG // FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdin... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG // FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdin... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 776,698 | 776,699 | u590927341 | cpp |
p02972 | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_... | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 776,703 | 776,704 | u145483532 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long modpow(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = modpow(m... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long modpow(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = modpow(m... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 776,705 | 776,706 | u687204015 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,710 | 776,711 | u314543767 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ii = pair<ll, ll>;
using vi = vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(), (x).end()
#define print(a) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ii = pair<ll, ll>;
using vi = vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(), (x).end()
#define print(a) ... | [
"assignment.variable.change",
"identifier.change"
] | 776,712 | 776,713 | u596724731 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
while (true) {
if (q > n)
break;
q = (i + 1) * j;
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
// cout<<i<<" ";
while (true) {
if (q > n)
break;
... | [
"assignment.value.change",
"identifier.change"
] | 776,718 | 776,719 | u831161882 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
while (true) {
if (q > n)
break;
q = (i + 1) * j;
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
// cout<<i<<" ";
while (true) {
if (q > n)
break;
... | [
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 776,720 | 776,719 | u831161882 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
while (true) {
if (q > n)
break;
q = (i + 1) * j;
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
// cout<<i<<" ";
while (true) {
if (q > n)
break;
... | [
"assignment.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 776,721 | 776,719 | u831161882 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[100000], b[100000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
while (true) {
if (q > n)
break;
q = (i + 1) * j;
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m = 0;
int a[500000], b[500000] = {};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
int q = i + 1, sum = 0, j = 1;
// cout<<i<<" ";
while (true) {
if (q > n)
break;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 776,722 | 776,719 | u831161882 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
auto a = vector<ll>(n + 1, 0);
auto h = vector<ll>(n + 1, 0);
auto b = vector<ll>();
for (ll i = 1; i < n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
bool sum = false;
for (ll j = i; j ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
auto a = vector<ll>(n + 1, 0);
auto h = vector<ll>(n + 1, 0);
auto b = vector<ll>();
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
bool sum = false;
for (ll j = i; j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,725 | 776,726 | u533749093 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
auto a = vector<ll>(n + 1, 0);
auto h = vector<ll>(n + 1, 0);
auto b = vector<ll>();
for (ll i = 1; i < n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
bool sum = false;
for (ll j = i; j ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
auto a = vector<ll>(n + 1, 0);
auto h = vector<ll>(n + 1, 0);
auto b = vector<ll>();
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
bool sum = false;
for (ll j = i; j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,727 | 776,726 | u533749093 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
auto a = vector<ll>(n + 1, 0);
auto h = vector<ll>(n + 1, 0);
auto b = vector<ll>();
for (ll i = 1; i < n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
bool sum = false;
for (ll j = 2 * i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
auto a = vector<ll>(n + 1, 0);
auto h = vector<ll>(n + 1, 0);
auto b = vector<ll>();
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
bool sum = false;
for (ll j = i; j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 776,728 | 776,726 | u533749093 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N + 1);
for (int i = 1; i < N; i++) {
cin >> p.at(i);
}
vector<int> q(N + 1);
vector<int> r = {};
for (int i = N; i > 0; i--) {
int Z = 0;
for (int j = 1; j <= N / i; j++) {
Z += q.at(j * i);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N + 1);
for (int i = 1; i <= N; i++) {
cin >> p.at(i);
}
vector<int> q(N + 1);
vector<int> r = {};
for (int i = N; i > 0; i--) {
int Z = 0;
for (int j = 1; j <= N / i; j++) {
Z += q.at(j * i);
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,731 | 776,732 | u158290747 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> c(N, 0);
for (int i = N - 1; i >= 0; i--) {
c[i] = a[i];
for (int j = 2 * i + 1; j < N; j += i + 1) {
c[i] ^= a[j];
}
}
vector<in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> c(N, 0);
for (int i = N - 1; i >= 0; i--) {
c[i] = a[i];
for (int j = 2 * i + 1; j < N; j += i + 1) {
c[i] ^= c[j];
}
}
vector<in... | [
"assignment.value.change",
"identifier.change"
] | 776,733 | 776,734 | u424374375 | cpp |
p02972 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++i)
te... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++i)
te... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 776,737 | 776,738 | u135572611 | cpp |
p02972 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++i)
te... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++i)
te... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,739 | 776,740 | u135572611 | cpp |
p02972 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++i)
te... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++i)
te... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,741 | 776,742 | u135572611 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace s... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace s... | [
"assignment.value.change",
"identifier.change"
] | 776,743 | 776,744 | u446371873 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[200005], b[200005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--)
for (int j = i * 2; j <= n; j++)
a[i] ^= a[j];
int ttl = 0;
for (int i = 1; i <= n; i++)
if (a[i])
ttl++;
c... | #include <bits/stdc++.h>
using namespace std;
int a[200005], b[200005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--)
for (int j = i * 2; j <= n; j += i)
a[i] ^= a[j];
int ttl = 0;
for (int i = 1; i <= n; i++)
if (a[i])
ttl++;
... | [] | 776,748 | 776,749 | u729337236 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[100005], b[100005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--)
for (int j = i * 2; j <= n; j++)
a[i] ^= a[j];
int ttl = 0;
for (int i = 1; i <= n; i++)
if (a[i])
ttl++;
c... | #include <bits/stdc++.h>
using namespace std;
int a[200005], b[200005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--)
for (int j = i * 2; j <= n; j += i)
a[i] ^= a[j];
int ttl = 0;
for (int i = 1; i <= n; i++)
if (a[i])
ttl++;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 776,750 | 776,749 | u729337236 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), \
cout << fixed << setprecision(20);
#define int long long
#define double long double
const int INF = 1e18, ... | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), \
cout << fixed << setprecision(20);
#define int long long
#define double long double
const int INF = 1e18, ... | [
"assignment.value.change",
"identifier.change",
"variable_declaration.name.change",
"io.output.change"
] | 776,764 | 776,765 | u303059352 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const long long MOD = 2;
void solve(long long N, std::vector<long long> a) {
vector<ll> ans;
vector<int> hasBall(N, 0);
for (int i = N - 1; i >= 0; --i) {
ll num = i + 1;
ll t = 2;
ll sum = a[i];
while (nu... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const long long MOD = 2;
void solve(long long N, std::vector<long long> a) {
vector<ll> ans;
vector<int> hasBall(N, 0);
for (int i = N - 1; i >= 0; --i) {
ll num = i + 1;
ll t = 2;
ll sum = a[i];
while (nu... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 776,768 | 776,769 | u943966256 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 776,770 | 776,771 | u894496005 | cpp |
p02972 | //----AUTHOR:kkdrummer----/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
// typedef unordered_set<ll> usll;
// ... | //----AUTHOR:kkdrummer----/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
// typedef unordered_set<ll> usll;
// ... | [] | 776,781 | 776,782 | u452240501 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 776,793 | 776,794 | u863279562 | cpp |
p02972 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int aa;
vector<int> a(n + 1);
rep(i, n) {
cin >> aa;
if (aa == 0) {
a[i + 1] = -1;
} else {
a[i + 1] = 1;
}
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int aa;
vector<int> a(n + 1);
rep(i, n) {
cin >> aa;
if (aa == 0) {
a[i + 1] = -1;
} else {
a[i + 1] = 1;
}
... | [
"assignment.variable.change",
"identifier.change"
] | 776,795 | 776,796 | u992471673 | cpp |
p02972 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int aa;
vector<int> a(n + 1);
rep(i, n) {
cin >> aa;
if (aa == 0) {
a[i + 1] = -1;
} else {
a[i + 1] = 1;
}
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int aa;
vector<int> a(n + 1);
rep(i, n) {
cin >> aa;
if (aa == 0) {
a[i + 1] = -1;
} else {
a[i + 1] = 1;
}
... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 776,797 | 776,796 | u992471673 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> H(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
int j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> H(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
int j... | [
"assignment.value.change",
"identifier.change"
] | 776,804 | 776,805 | u650236619 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + 1; j <= n; j += i) {
sum ^= b[j];
}
b[i] =... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] =... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 776,806 | 776,807 | u936558609 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> ans(N + 1);
rep(i, N) { cin >> A[i + 1]; }
for (int i = N; i >= 1; i--) {
int x = 0;
for (int j = i; j <= N; j += j) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> ans(N + 1);
rep(i, N) { cin >> A[i + 1]; }
for (int i = N; i >= 1; i--) {
int x = 0;
for (int j = i; j <= N; j += i) {
... | [
"assignment.value.change",
"identifier.change"
] | 776,808 | 776,809 | u859566721 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> q(N);
vector<int> ans(N, 0);
int M = 0;
for (int &e : q)
cin >> e;
for (int i = N; i > 0; i--) {
int p = N / i;
int sum = 0;
for (int j = 2; j <= p; j++)
sum += ans[p * j - 1];
if (sum % 2 !=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> q(N);
vector<int> ans(N, 0);
int M = 0;
for (int &e : q)
cin >> e;
for (int i = N; i > 0; i--) {
int p = N / i;
int sum = 0;
for (int j = 2; j <= p; j++)
sum += ans[i * j - 1];
if (sum % 2 !=... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 776,812 | 776,813 | u619653948 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.