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 |
|---|---|---|---|---|---|---|---|
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n... | [
"assignment.change"
] | 777,886 | 777,887 | u001534842 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.change"
] | 777,888 | 777,887 | u001534842 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"identifier.change",
"assignment.change"
] | 777,889 | 777,887 | u001534842 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int inf = 1 << 30;
typedef pair<int, in... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int inf = 1 << 30;
typedef pair<int, in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,890 | 777,891 | u013803727 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int inf = 1 << 30;
typedef pair<int, in... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int inf = 1 << 30;
typedef pair<int, in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 777,892 | 777,891 | u013803727 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;... | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;... | [
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 777,905 | 777,904 | u495881622 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;... | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 777,906 | 777,904 | u495881622 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int m = 0;
for (int i = n; i >= 1; i--) {
int tempi = i * 2;
int sum = 0;
while (tempi <= n) {
sum += b[tempi];
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int m = 0;
for (int i = n; i >= 1; i--) {
int tempi = i * 2;
int sum = 0;
while (tempi <= n) {
sum += b[tempi];
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,911 | 777,912 | u342703951 | cpp |
p02972 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a[200001] = {};
cin >> n;
for (int i = 1; i... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a[200001] = {};
cin >> n;
for (int i = 1; i... | [
"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"
] | 777,913 | 777,914 | u120050685 | cpp |
p02972 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a[200001] = {};
cin >> n;
for (int i = 1; i... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a[200001] = {};
cin >> n;
for (int i = 1; i... | [
"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",
"io.output.newline.add"
] | 777,915 | 777,914 | u120050685 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | [
"expression.operation.binary.remove"
] | 777,916 | 777,917 | u293523151 | cpp |
p02972 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 777,926 | 777,927 | u863537799 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
template <typename T, typename U> bool chmin(T &a, const U &b) {
return (a > b ? a = b, true : false);
}
template <typename T, typename U> bool chmax(T &a, const U &b) {
return (a < b ? a = b, true : false);
}
typedef long long ll;
#define writeln(n) cout << n << "\n... | #include <bits/stdc++.h>
using namespace std;
template <typename T, typename U> bool chmin(T &a, const U &b) {
return (a > b ? a = b, true : false);
}
template <typename T, typename U> bool chmax(T &a, const U &b) {
return (a < b ? a = b, true : false);
}
typedef long long ll;
#define writeln(n) cout << n << "\n... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,934 | 777,935 | u020238108 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
long long gcd(long long a, long long b) {
ll gcdmax = max(a, b);
ll gcdmin = min(a, b);
while (true) {
if (gcdmax % gcdmin == 0)
break;
... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
long long gcd(long long a, long long b) {
ll gcdmax = max(a, b);
ll gcdmin = min(a, b);
while (true) {
if (gcdmax % gcdmin == 0)
break;
... | [
"assignment.change"
] | 777,938 | 777,939 | u288905450 | cpp |
p02972 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 777,940 | 777,941 | u221285045 | cpp |
p02972 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 777,942 | 777,941 | u221285045 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <uno... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <uno... | [] | 777,943 | 777,944 | u221285045 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define strall(v) (v).cbegin(), (v).cend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, cl... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define strall(v) (v).cbegin(), (v).cend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, cl... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 777,963 | 777,964 | u106635407 | cpp |
p02972 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip>... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip>... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 777,967 | 777,968 | u822725754 | cpp |
p02972 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, b, a) for (int i = (b)-1; i >= 0; --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n)-1; i >= 0; --i)
#define ITER(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define SORT(v) ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, b, a) for (int i = (b)-1; i >= 0; --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n)-1; i >= 0; --i)
#define ITER(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define SORT(v) ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"call.function.change",
"io.output.change"
] | 777,969 | 777,970 | u285991898 | cpp |
p02972 | #include "bits/stdc++.h"
#define DEBUG(x) cout << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cout << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
... | #include "bits/stdc++.h"
#define DEBUG(x) cout << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cout << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"identifier.change"
] | 777,973 | 777,974 | u531436689 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
long long n, ans = 0;
cin >> n;
long long a[n], b[n] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
long long cnt = 0;
for (int j = 2; j * i <= n; j++) {
if (b[j * i - 1] ==... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
long long n, ans = 0;
cin >> n;
long long a[n], b[n] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
long long cnt = 0;
for (int j = 2; j * i <= n; j++) {
if (b[j * i - 1] ==... | [
"io.output.change"
] | 777,975 | 777,976 | u710232726 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
vector<int> func(int n) {
vector<int> fac, sub;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
fac.push_back(i);
if (n / i != i)
sub.push_back(n / i);
}
}
int l = sub.size();
for (int i = 0; i < l; i++)
fac.pu... | #include <iostream>
#include <vector>
using namespace std;
vector<int> func(int n) {
vector<int> fac, sub;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
fac.push_back(i);
if (n / i != i)
sub.push_back(n / i);
}
}
int l = sub.size();
for (int i = 0; i < l; i++)
fac.pu... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 777,977 | 777,978 | u110383054 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
std::vector<i64> divisor(i64 n) {
std::vector<i64> res;
for (i64 i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
std::vector<i64> divisor(i64 n) {
std::vector<i64> res;
for (i64 i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n;
cin >> ... | [
"call.arguments.change"
] | 777,979 | 777,980 | u823112986 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<boo... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<boo... | [
"assignment.change"
] | 777,981 | 777,982 | u776056110 | 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.at(i);
vector<int> sample(N);
for (int i = N / 2; i < N; i++)
sample.at(i) = a.at(i);
int sum;
for (int i = N / 2 - 1; i >= 0; i--) {
sum = 0;
for (int j = ... | #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);
vector<int> sample(N);
for (int i = N / 2; i < N; i++)
sample.at(i) = a.at(i);
int sum;
for (int i = N / 2 - 1; i >= 0; i--) {
sum = 0;
for (int j = ... | [] | 777,991 | 777,992 | u936602931 | 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.at(i);
vector<int> sample(N);
for (int i = N / 2; i < N - 1; i++)
sample.at(i) = a.at(i);
int sum;
for (int i = N / 2 - 1; i >= 0; i--) {
sum = 0;
for (int ... | #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);
vector<int> sample(N);
for (int i = N / 2; i < N; i++)
sample.at(i) = a.at(i);
int sum;
for (int i = N / 2 - 1; i >= 0; i--) {
sum = 0;
for (int j = ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 777,993 | 777,992 | u936602931 | 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];
}
int count = 0;
for (int i = n - 1; i >= 0; i--) {
for (int j = i * 2 + 1; j < n; j += i + 1) {
a[i] ^= a[j];
}
count += a[i];
}
cout << coun... | #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 count = 0;
for (int i = n - 1; i >= 0; i--) {
for (int j = i * 2 + 1; j < n; j += i + 1) {
a[i] ^= a[j];
}
count += a[i];
}
cout << coun... | [
"io.output.change"
] | 777,994 | 777,995 | u154898295 | cpp |
p02972 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ball(n + 1, 0);
vector<int> ans;
for (int i = n;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ball(n + 1, 0);
vector<int> ans;
for (int i = n;... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,996 | 777,997 | u590241855 | cpp |
p02972 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ball(n + 1, 0);
vector<int> ans;
for (int i = n;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ball(n + 1, 0);
vector<int> ans;
for (int i = n;... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 777,998 | 777,997 | u590241855 | cpp |
p02972 | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int ... | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int ... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 778,011 | 778,012 | u200215998 | cpp |
p02972 | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rep1(i, n) for (int i = 1; i <= int(n); i++)
#define repR(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define rep1R(i, n) for (int i = int(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B;... | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rep1(i, n) for (int i = 1; i <= int(n); i++)
#define repR(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define rep1R(i, n) for (int i = int(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B;... | [
"assignment.value.change",
"identifier.change"
] | 778,013 | 778,014 | u200215998 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(X, N) for (ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(), (V).end()
#define INT_MAX_HALF (INT_MAX / 2)
#define EPS (1e-10)
using namespace std;
typedef long long ll;
int main() {
... | #include <bits/stdc++.h>
#define rep(X, N) for (ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(), (V).end()
#define INT_MAX_HALF (INT_MAX / 2)
#define EPS (1e-10)
using namespace std;
typedef long long ll;
int main() {
... | [
"assignment.value.change",
"identifier.change"
] | 778,024 | 778,025 | u145078501 | cpp |
p02972 | #include <cstddef>
#include <cstdint>
#include <vector>
namespace null_null {
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using usize = std::size_t;
constexpr usize operator"" _z(unsigned long long x) noexcept {
return static_cast<us... | #include <cstddef>
#include <cstdint>
#include <vector>
namespace null_null {
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using usize = std::size_t;
constexpr usize operator"" _z(unsigned long long x) noexcept {
return static_cast<us... | [
"assignment.change"
] | 778,026 | 778,027 | u876978301 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define pb(a) push_back(a)
#define mk(a, b) make_pair(a, b)
#define ll long long
#define INF 99999999... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define pb(a) push_back(a)
#define mk(a, b) make_pair(a, b)
#define ll long long
#define INF 99999999... | [
"call.arguments.change"
] | 778,028 | 778,029 | u526894223 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define pb(a) push_back(a)
#define mk(a, b) make_pair(a, b)
#define ll long long
#define INF 99999999... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define pb(a) push_back(a)
#define mk(a, b) make_pair(a, b)
#define ll long long
#define INF 99999999... | [
"call.arguments.change"
] | 778,030 | 778,029 | u526894223 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
constexpr ll INF = (1LL << 55);
constexpr int n_max = 2e5 + 1;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
constexpr ll INF = (1LL << 55);
constexpr int n_max = 2e5 + 1;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
... | [] | 778,031 | 778,032 | u108540384 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
constexpr ll INF = (1LL << 55);
constexpr int n_max = 1e5 + 1;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
constexpr ll INF = (1LL << 55);
constexpr int n_max = 2e5 + 1;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
... | [
"literal.number.change",
"expression.operation.binary.change"
] | 778,033 | 778,032 | u108540384 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int table[200005];
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
rep(i, N) { cin >> a[i + 1]; }
vector<int> b(N + 1);
vector<int> ans;
for (int i = N; i > 0; i--) {
int sum = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int table[200005];
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
rep(i, N) { cin >> a[i + 1]; }
vector<int> b(N + 1);
vector<int> ans;
for (int i = N; i > 0; i--) {
int sum = 0;
... | [
"call.arguments.change"
] | 778,034 | 778,035 | u108540384 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
int b[200005];
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) { cin >> a[i]; }
vector<int> ans;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2; j <= n; ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
int b[200005];
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) { cin >> a[i]; }
vector<int> ans;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2; j <= n; ... | [
"assignment.value.change",
"identifier.change"
] | 778,036 | 778,037 | u108540384 | cpp |
p02972 | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(... | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,038 | 778,039 | u184929210 | cpp |
p02972 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
const ll MOD = 998244353;
int main() {
int N, t = 0;
cin >> N;
vector<int> a(N + 1), b(N / 2 + 1, 0), ans(N + 1);
rep(i, N) cin >> a[i + 1];
for (int i = N; i > 0; i--) {
int s = 0;
for ... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
const ll MOD = 998244353;
int main() {
int N, t = 0;
cin >> N;
vector<int> a(N + 1), b(N / 2 + 1, 0), ans(N + 1);
rep(i, N) cin >> a[i + 1];
for (int i = N; i > 0; i--) {
int s = 0;
for ... | [
"assignment.value.change",
"identifier.change"
] | 778,040 | 778,041 | u555962250 | cpp |
p02972 | //
// 2019/03/30 Ver1.10
//
// Codeforces: ganariya
// AtCoder: ganariya2525
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
// MMMMMMMMMMMMMMMMMMMMMMMMMM... | //
// 2019/03/30 Ver1.10
//
// Codeforces: ganariya
// AtCoder: ganariya2525
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
// MMMMMMMMMMMMMMMMMMMMMMMMMM... | [
"identifier.change",
"call.arguments.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 778,042 | 778,043 | u259053514 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define int... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define int... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.bi... | 778,044 | 778,045 | u179970156 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
ty... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
ty... | [
"expression.operation.binary.remove"
] | 778,046 | 778,047 | u934272719 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
ty... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
ty... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 778,048 | 778,047 | u934272719 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
ty... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
ty... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,049 | 778,047 | u934272719 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
ty... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
ty... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 778,050 | 778,047 | u934272719 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | [
"assignment.change"
] | 778,053 | 778,054 | u624800360 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | [
"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"
] | 778,057 | 778,058 | u644332191 | cpp |
p02972 | //
// Created by Hideaki Imamura on 2020-03-18.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline boo... | //
// Created by Hideaki Imamura on 2020-03-18.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline boo... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 778,061 | 778,062 | u477855214 | cpp |
p02972 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 778,064 | 778,065 | u498141549 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <... | [] | 778,066 | 778,067 | u484274300 | cpp |
p02972 | #define rep(i, n) for (ll i = 0; i < n; i++)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n) { cin >> a[i + 1]; }
// floor(n)+1,…nまでは一意に定まる
for (int i = n / 2 + 1; i < n; i++)... | #define rep(i, n) for (ll i = 0; i < n; i++)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n) { cin >> a[i + 1]; }
// floor(n)+1,…nまでは一意に定まる
for (int i = n / 2 + 1; i <= n; i++... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,072 | 778,073 | u518206537 | cpp |
p02972 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 778,076 | 778,077 | u644778646 | cpp |
p02972 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,078 | 778,077 | u644778646 | cpp |
p02972 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int a[1000100];
int z[1000100];
int m... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int a[1000100];
int z[1000100];
int m... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 778,079 | 778,080 | u644778646 | cpp |
p02972 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int a[1000100];
int z[1000100];
int m... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int a[1000100];
int z[1000100];
int m... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 778,081 | 778,080 | u644778646 | cpp |
p02972 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int a[1000100];
int z[1000100];
int m... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int a[1000100];
int z[1000100];
int m... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.update.change",
"assignment.change"
] | 778,082 | 778,080 | u644778646 | cpp |
p02972 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int a[100010];
int z[100010];
int mai... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int a[1000100];
int z[1000100];
int m... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.update.change",
"assignment.change"
] | 778,083 | 778,080 | u644778646 | cpp |
p02972 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using... | [
"assignment.value.change",
"identifier.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 778,084 | 778,085 | u799939777 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int a[200000] = {}, res[200000] = {};
int main() {
int n, tem, i, j, m = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = n; i > 0; i--) {
j = 2;
tem = 0;
while ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int a[200000] = {}, res[200000] = {};
int main() {
int n, tem, i, j, m = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = n; i > 0; i--) {
j = 2;
tem = 0;
while ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 778,086 | 778,087 | u058348416 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int a[200000] = {}, res[200000] = {};
int main() {
int n, tem, i, j, m = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = n; i > 0; i--) {
j = 2;
tem = 0;
while ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int a[200000] = {}, res[200000] = {};
int main() {
int n, tem, i, j, m = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = n; i > 0; i--) {
j = 2;
tem = 0;
while ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"identifier.change"
] | 778,088 | 778,087 | u058348416 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int a[200000] = {}, res[200000] = {};
int main() {
int n, tem, i, j, m = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = n; i > 0; i--) {
j = 2;
tem = 0;
while ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int a[200000] = {}, res[200000] = {};
int main() {
int n, tem, i, j, m = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = n; i > 0; i--) {
j = 2;
tem = 0;
while ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"identifier.change",
"literal.string.change",
"io.output.change"
] | 778,089 | 778,087 | u058348416 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int a[200000] = {}, res[200000] = {};
int main() {
int n, tem, i, j, m = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = n; i > 0; i--) {
j = 2;
tem = 0;
while ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int a[200000] = {}, res[200000] = {};
int main() {
int n, tem, i, j, m = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = n; i > 0; i--) {
j = 2;
tem = 0;
while ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"identifier.change",
"assignment.change"
] | 778,090 | 778,087 | u058348416 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#ifdef _MSC_VER
int debug = 1;
#else
int debug = 0;
#endif
int main() {
int n;
cin >> n;
auto a = vector<int>(n + 5);
for (int i = 1; i <= n; i++)
cin >> a[i];
auto balls_in = vector<int>(n + 5);
for (int i = n; i >= 1; i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#ifdef _MSC_VER
int debug = 1;
#else
int debug = 0;
#endif
int main() {
int n;
cin >> n;
auto a = vector<int>(n + 5);
for (int i = 1; i <= n; i++)
cin >> a[i];
auto balls_in = vector<int>(n + 5);
for (int i = n; i >= 1; i... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 778,098 | 778,099 | u723394740 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#ifdef _MSC_VER
int debug = 1;
#else
int debug = 0;
#endif
int main() {
int n;
cin >> n;
auto a = vector<int>(n + 5);
for (int i = 1; i <= n; i++)
cin >> a[i];
auto balls_in = vector<int>(n + 5);
for (int i = n; i >= 1; i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#ifdef _MSC_VER
int debug = 1;
#else
int debug = 0;
#endif
int main() {
int n;
cin >> n;
auto a = vector<int>(n + 5);
for (int i = 1; i <= n; i++)
cin >> a[i];
auto balls_in = vector<int>(n + 5);
for (int i = n; i >= 1; i... | [] | 778,100 | 778,099 | u723394740 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n, 0);
for (int i = n / 2; i < n; i++) {
ans[i] = a[i];
}
for (int i = (n / 2 - 1); i >= 0; i--) {
int sum = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n, 0);
for (int i = n / 2; i < n; i++) {
ans[i] = a[i];
}
for (int i = (n / 2 - 1); i >= 0; i--) {
int sum = ... | [
"assignment.value.change",
"identifier.change"
] | 778,103 | 778,104 | u697968316 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n, 0);
for (int i = n / 2; i < n; i++) {
ans[i] = a[i];
}
for (int i = (n / 2 - 1); i >= 0; i--) {
int sum = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n, 0);
for (int i = n / 2; i < n; i++) {
ans[i] = a[i];
}
for (int i = (n / 2 - 1); i >= 0; i--) {
int sum = ... | [
"assignment.value.change",
"identifier.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 778,105 | 778,104 | u697968316 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, start, count) for (int i = (start); i < (int)(count); ++i)
#define rep(i, count) REP(i, 0, count)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
int N;
cin >> N;
vector<int> a(N + 1);
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, start, count) for (int i = (start); i < (int)(count); ++i)
#define rep(i, count) REP(i, 0, count)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
int N;
cin >> N;
vector<int> a(N + 1);
... | [
"expression.operation.binary.remove"
] | 778,109 | 778,108 | u159231764 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = mod * mod;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
ll min(ll a, ll b) {
if (a > b) {
return b;
} else {
return a;
}
}
ll max(ll a, ll b) {
if (a > ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = mod * mod;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
ll min(ll a, ll b) {
if (a > b) {
return b;
} else {
return a;
}
}
ll max(ll a, ll b) {
if (a > ... | [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 778,112 | 778,113 | u096717230 | cpp |
p02972 | //#include "stdafx.h"
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#inclu... | //#include "stdafx.h"
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#inclu... | [] | 778,144 | 778,145 | u796408111 | cpp |
p02972 | #include <cmath>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 0; i <= n; ++i) {
cin >> v[i + 1];
}
vector<set<int>> measure(n + 1);
for (int i = 1; i <= sqrt(n); ++i) {
for (int j = 1; i * j <= n; ++j) ... | #include <cmath>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 0; i <= n; ++i) {
cin >> v[i + 1];
}
vector<set<int>> measure(n + 1);
for (int i = 1; i <= sqrt(n); ++i) {
for (int j = 1; i * j <= n; ++j) ... | [
"expression.operation.binary.add"
] | 778,146 | 778,147 | u469612749 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 778,153 | 778,154 | u255001744 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define Rep(i, n) for (int i = 0; i < n; ++i)
#define rep(i, n) for (int i = 1; i <= ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define Rep(i, n) for (int i = 0; i < n; ++i)
#define rep(i, n) for (int i = 1; i <= ... | [
"call.arguments.change"
] | 778,163 | 778,164 | u337199858 | cpp |
p02972 | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
int N;
cin >> N;
vector<int> a(N + 1);
rep(i, N) cin >> a[i + 1];
int ans = 0;
vector<int> b(N + 1);
for (int... | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
int N;
cin >> N;
vector<int> a(N + 1);
rep(i, N) cin >> a[i + 1];
int ans = 0;
vector<int> b(N + 1, 0);
for (... | [
"call.arguments.add",
"assignment.value.change",
"identifier.change"
] | 778,165 | 778,166 | u895536055 | cpp |
p02972 | // D-Preparing Boxes
// https://atcoder.jp/contests/abc134/tasks/abc134_d?lang=ja
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 200000 + 4
ll n;
int a[MAX];
int main() {
scanf("%lld", &n);
for (ll i = 0; i < n; i++)
scanf("%d", &a[i + 1]);
ll m = 0;
vector<int> b(n + 1... | // D-Preparing Boxes
// https://atcoder.jp/contests/abc134/tasks/abc134_d?lang=ja
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 200000 + 4
ll n;
int a[MAX];
int main() {
scanf("%lld", &n);
for (ll i = 0; i < n; i++)
scanf("%d", &a[i + 1]);
ll m = 0;
vector<int> b(n + 1... | [
"assignment.value.change",
"identifier.change"
] | 778,169 | 778,170 | u586577600 | cpp |
p02972 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 778,171 | 778,172 | u742553775 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<ll, ll> P;
#define rep(a, n) for (int a = 0; a < n; a++)
int main(void) {
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<ll, ll> P;
#define rep(a, n) for (int a = 0; a < n; a++)
int main(void) {
... | [
"call.arguments.change"
] | 778,173 | 778,174 | u834771741 | cpp |
p02972 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
using namespace std;
#define N_MAX 200010
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
int N;
scanf("%d", &N);... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
using namespace std;
#define N_MAX 200010
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
int N;
scanf("%d", &N);... | [
"assignment.value.change",
"identifier.change"
] | 778,192 | 778,193 | u103357948 | cpp |
p02972 | /*
** Vishal Raj Roy
** Indian Institute of Technology Kharagpur
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define l... | /*
** Vishal Raj Roy
** Indian Institute of Technology Kharagpur
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define l... | [
"assignment.change"
] | 778,200 | 778,201 | u027266662 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const... | [
"assignment.value.change",
"identifier.change"
] | 778,204 | 778,205 | u339558464 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
template <typename T> T In() {
T t;
cin >> t;
return t;
}
template <typename T> vector<T> ReadVec1(int N) {
vector<T> vec(N);
for (in... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
template <typename T> T In() {
T t;
cin >> t;
return t;
}
template <typename T> vector<T> ReadVec1(int N) {
vector<T> vec(N);
for (in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,209 | 778,210 | u991692050 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#defi... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#defi... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 778,211 | 778,212 | u033620890 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
ll n;
cin >> n;
ll a[n], b[n];
rep(i, n) {
cin >> a[i];
b[i] = 0;
}
for (int i = n; i > 0; i--) {
ll tmp = i;
ll count = 0;
while ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
ll n;
cin >> n;
ll a[n], b[n];
rep(i, n) {
cin >> a[i];
b[i] = 0;
}
for (int i = n; i > 0; i--) {
ll tmp = i;
ll count = 0;
while ... | [
"assignment.change"
] | 778,219 | 778,220 | u326152409 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
int M = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (long long i = N - 1; i >= 0; i--) {
int sum = 0;
for (long long j = 2 * (i + 1); j < N; j =... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
int M = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2 * i + 1; j < N; j = j + (i + 1)) ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 778,223 | 778,224 | u148959786 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
int M = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2 * (i + 1); j < N; j = j + (i + 1)... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
int M = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2 * i + 1; j < N; j = j + (i + 1)) ... | [] | 778,225 | 778,224 | u148959786 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
int M = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2 * (i + 1); j < N + 1; j = j + (i ... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
int M = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2 * i + 1; j < N; j = j + (i + 1)) ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 778,226 | 778,224 | u148959786 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
int M = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2 * (i + 1); j < N; j = j + (i + 1)... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
int M = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
// for (int j = 2 * (i + 1); j < N; j = j + (i +... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 778,225 | 778,227 | u148959786 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
long long int S;
int r;
std... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
long long int S;
int r;
std... | [] | 778,230 | 778,231 | u786283792 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define MOD (int)1e9 + 7
#define INF (int)2e9
int main() {
int n;
cin >> n;
int a[n], b[n] = {};
rep(i, n) { cin >> a[i]; }
int m = 0;
for (int i = n; i >= 1; i--) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define MOD (int)1e9 + 7
#define INF (int)2e9
int main() {
int n;
cin >> n;
int a[n], b[n] = {};
rep(i, n) { cin >> a[i]; }
int m = 0;
for (int i = n; i >= 1; i--) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 778,232 | 778,233 | u263654061 | cpp |
p02972 | /* C++14(GCC5.4.1) */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll n;
cin >> n;
ll a[n];
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
ll b[n + 1] = {0};
// 後ろから見ていく
// 後ろ半分はaと一致
for (ll i = n; i >= 1; i--) {
ll sum_i = 0;
for (ll j = 2 * i; j <... | /* C++14(GCC5.4.1) */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll n;
cin >> n;
ll a[n];
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
ll b[n + 1] = {0};
// 後ろから見ていく
// 後ろ半分はaと一致
for (ll i = n; i >= 1; i--) {
ll sum_i = 0;
for (ll j = i; j <= n;... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,234 | 778,235 | u900688325 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<pair<int, int>> VPII;
typedef long long LL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) ... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<pair<int, int>> VPII;
typedef long long LL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) ... | [
"io.output.change"
] | 778,239 | 778,240 | u987591601 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r;
while ((r = a % b)) {
a = b... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r;
while ((r = a % b)) {
a = b... | [
"assignment.change"
] | 778,241 | 778,242 | u433162241 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r;
while ((r = a % b)) {
a = b... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r;
while ((r = a % b)) {
a = b... | [
"assignment.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 778,243 | 778,242 | u433162241 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
vector<ll> A, X;
vector<ll> R;
int main() {
cin >> N;
A.resize(N + 1);
for (ll i = 1; i <= N; ++i)
cin >> A[i];
X.resize(N + 1);
for (ll i = N; i >= 1; --i) {
X[i] = A[i];
for (ll k = 2 * i; k <= N; ++k)
X[i] ^= X[k]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
vector<ll> A, X;
vector<ll> R;
int main() {
cin >> N;
A.resize(N + 1);
for (ll i = 1; i <= N; ++i)
cin >> A[i];
X.resize(N + 1);
for (ll i = N; i >= 1; --i) {
X[i] = A[i];
for (ll k = 2 * i; k <= N; k += i)
X[i] ^= X... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 778,259 | 778,260 | u637938292 | cpp |
p02972 | #include <bits/stdc++.h>
typedef long long ll;
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> d(N);
bool M = 0;
for (int i = N; i > 0; --i) {
int tmp = i;
int cnt = 0;
while (tmp <= N) {
cnt += d[tmp - ... | #include <bits/stdc++.h>
typedef long long ll;
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> d(N);
int M = 0;
for (int i = N; i > 0; --i) {
int tmp = i;
int cnt = 0;
while (tmp <= N) {
cnt += d[tmp - 1... | [
"variable_declaration.type.primitive.change"
] | 778,261 | 778,262 | u803481017 | 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);
rep(i, n) cin >> a[i];
// rep(i,n) cout << a[i] << endl;
vector<int> b(n);
int count = 0;
for (int i = n - 1; i >= n / 2; i--) {
b[i] ... | #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);
rep(i, n) cin >> a[i];
// rep(i,n) cout << a[i] << endl;
vector<int> b(n);
int count = 0;
for (int i = n - 1; i >= n / 2; i--) {
b[i] ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.remove"
] | 778,267 | 778,268 | u806149832 | 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.at(i);
set<int> s;
for (int i = n - 1; i >= 0; i--) {
int num = 0;
for (int j = 1; (i + 1) * j < n; j++) {
if (s.count((i + 1) * j))
num++;
}
... | #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);
set<int> s;
for (int i = n - 1; i >= 0; i--) {
int num = 0;
for (int j = 1; (i + 1) * j <= n; j++) { //=の入れ忘れ？
if (s.count((i + 1) * j))
num++... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,271 | 778,272 | u661308718 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | [
"assignment.value.change",
"identifier.change"
] | 778,277 | 778,278 | u906208439 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.