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 <bits/stdc++.h>
using namespace std;
#define LL long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(x) (x).begin(), (x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL mod = 1e9 + 7;
int main() {
int N;
cin >> N;
int... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(x) (x).begin(), (x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL mod = 1e9 + 7;
int main() {
int N;
cin >> N;
int... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 780,069 | 780,070 | u697421413 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
vector<int> ans(n + 1, 0);
for (int i = n; i > n / 2; i--) {
ans[i] = a[i];
}
for (int i = n / 2; i >= 1; i--) {
int s... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
vector<int> ans(n + 1, 0);
for (int i = n; i > n / 2; i--) {
ans[i] = a[i];
}
for (int i = n / 2; i >= 1; i--) {
int s... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 780,076 | 780,077 | u407416173 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
int main() {
int N;
cin >> N;
vi a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
int main() {
int N;
cin >> N;
vi a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 780,080 | 780,079 | u420528322 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 780,083 | 780,084 | u019780057 | cpp |
p02972 | #include <stdio.h>
using namespace std;
int main() {
int n;
int a[212345];
int b[212345];
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
int m = 0;
for (int i = n; i >= 1; i--) {
b[i] = a[i];
for (int j = i * 2; j < n; j += i) {
b[i] += b[j];
}
b[i] ... | #include <stdio.h>
using namespace std;
int main() {
int n;
int a[212345];
int b[212345];
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
int m = 0;
for (int i = n; i >= 1; i--) {
b[i] = a[i];
for (int j = i * 2; j <= n; j += i) {
b[i] += b[j];
}
b[i]... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 780,085 | 780,086 | u236990712 | 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 INF 999999999
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair... | #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 INF 999999999
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair... | [
"assignment.value.change",
"identifier.change"
] | 780,087 | 780,088 | u477561431 | 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 INF 999999999
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair... | #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 INF 999999999
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair... | [
"assignment.value.change",
"identifier.change"
] | 780,089 | 780,088 | u477561431 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
#define int long
using namespace std;
signed main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
#define int long
using namespace std;
signed main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
... | [
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"control_flow.loop.for.update.change",
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change"
] | 780,090 | 780,091 | u322714721 | cpp |
p02972 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const bool DEBAG = fa... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const bool DEBAG = fa... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 780,095 | 780,096 | u412550879 | cpp |
p02972 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
// lib/util.hpp
#ifndef UTIL_HPP
#define UTIL_HPP
typedef std::int_fast64_t i64;
typedef std::uint_fast64_t u64;
typedef std::int_fast32_t i32;
typedef std::uint_fast32_t u32;
namespace tools {
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
// lib/util.hpp
#ifndef UTIL_HPP
#define UTIL_HPP
typedef std::int_fast64_t i64;
typedef std::uint_fast64_t u64;
typedef std::int_fast32_t i32;
typedef std::uint_fast32_t u32;
namespace tools {
... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 780,097 | 780,098 | u758799884 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
std::vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
std::vector<int> res(n + 1);
for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
std::vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
std::vector<int> res(n + 1);
for (... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 780,099 | 780,100 | u440032761 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 7;
const int mod = 1e9 + 7;
typedef long long ll;
int n, m;
int ar[maxn], cnt[maxn];
int main() {
vector<int> ans;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &ar[i]);
for (int i = n; i >= 1; i--) {
int ins = 0;
for... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 7;
const int mod = 1e9 + 7;
typedef long long ll;
int n, m;
int ar[maxn], cnt[maxn];
int main() {
vector<int> ans;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &ar[i]);
for (int i = n; i >= 1; i--) {
int ins = 0;
for... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 780,103 | 780,102 | u662513110 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int &k : A)
cin >> k;
vector<int> ans(N, 0);
int M = 0;
for (int i = N; i > 0; i--) {
int sum = 0;
int count = i;
while (count < N) {
sum += ans[count - 1];
count += i;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int &k : A)
cin >> k;
vector<int> ans(N, 0);
int M = 0;
for (int i = N; i > 0; i--) { //้
ๅใฎใใคใณใฟใฎใฟ 0-origined
int sum = 0;
int count = i;
while (count <= N) {
sum += ans[count - 1];
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 780,106 | 780,107 | u507188501 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define lf long double
typedef vector<ll> vi;
typedef pair<ll, ll> ii;
typedef vector<pair<int, int>> vii;
typedef vector<vector<ll>> vv;
typedef vector<string> vs;
ll mod = 1000000007;
int main() {
ios_base:... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define lf long double
typedef vector<ll> vi;
typedef pair<ll, ll> ii;
typedef vector<pair<int, int>> vii;
typedef vector<vector<ll>> vv;
typedef vector<string> vs;
ll mod = 1000000007;
int main() {
ios_base:... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 780,108 | 780,109 | u666014704 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 780,114 | 780,115 | u953587543 | cpp |
p02972 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
bool tmp;
cin >> N;
vector<bool> arr;
for (int i = 0; i < N; i++) {
cin >> tmp;
arr.push_back(tmp);
}
map<int, bool> table;
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
bool prev_i = fals... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
bool tmp;
cin >> N;
vector<bool> arr;
for (int i = 0; i < N; i++) {
cin >> tmp;
arr.push_back(tmp);
}
map<int, bool> table;
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
bool prev_i = fals... | [
"assignment.change"
] | 780,120 | 780,121 | u816580121 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int M = 200001;
int n, A[M], m, B[M];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i + i; j <= n; j += i)
cnt += B[j];
if (cnt % 2 != A[i])
B[i... | #include <bits/stdc++.h>
using namespace std;
const int M = 200001;
int n, A[M], m, B[M];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i + i; j <= n; j += i)
cnt += B[j];
if (cnt % 2 != A[i])
B[i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 780,122 | 780,123 | u420892802 | cpp |
p02972 | #include <bits/stdc++.h>
#define lowbit(a) ((a) & (-(a)))
using namespace std;
void file(bool opt) {
if (opt && fopen("in.txt", "r")) {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
}
int n;
bool a[200000 + 5];
bool p[200000 + 5];
vector<int> ans;
int main() {
cin >> n;
for (int i ... | #include <bits/stdc++.h>
#define lowbit(a) ((a) & (-(a)))
using namespace std;
void file(bool opt) {
if (opt && fopen("in.txt", "r")) {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
}
int n;
int a[200000 + 5];
int p[200000 + 5];
vector<int> ans;
int main() {
cin >> n;
for (int i = ... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 780,127 | 780,128 | u066917439 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <iterator>
#include <set>
using namespace std;
using namespace __gnu_pbds;
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <iterator>
#include <set>
using namespace std;
using namespace __gnu_pbds;
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, in... | [
"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"
] | 780,129 | 780,130 | u888735570 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <iterator>
#include <set>
using namespace std;
using namespace __gnu_pbds;
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <iterator>
#include <set>
using namespace std;
using namespace __gnu_pbds;
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, in... | [
"call.arguments.add",
"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"
] | 780,131 | 780,130 | u888735570 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define sz(x) ((int)x.size())
#define rd(type, ...) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define sz(x) ((int)x.size())
#define rd(type, ...) ... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"... | 780,136 | 780,135 | u153798346 | cpp |
p02972 | //{{{
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
enu... | //{{{
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
enu... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 780,141 | 780,142 | u817722036 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int count(int i, int N, vector<int> &B) {
int sum = 0;
for (int j = i; j < N; j += i) {
if (B.at(j - 1) == 1)
sum++;
}
return sum;
}
int main() {
int N, in = 0;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
... | #include <bits/stdc++.h>
using namespace std;
int count(int i, int N, vector<int> &B) {
int sum = 0;
for (int j = i; j <= N; j += i) {
if (B.at(j - 1) == 1)
sum++;
}
return sum;
}
int main() {
int N, in = 0;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 780,143 | 780,144 | u122034453 | cpp |
p02972 | #include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
bool a[N];
for (int i = 0; i < N; i++)
scanf(" %d", &a[i]);
bool ans[N];
for (int i = N - 1; i >= 0; i--) {
if (i >= N / 2) {
ans[i] = a[i];
continue;
}
int j = 2 * i + 1;
bool sum = 0;
while (j < ... | #include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
bool a[N];
for (int i = 0; i < N; i++)
scanf(" %d", &a[i]);
bool ans[N];
for (int i = N - 1; i >= 0; i--) {
if (i >= N / 2) {
ans[i] = a[i];
continue;
}
int j = 2 * i + 1;
bool sum = 0;
while (j < ... | [
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 780,145 | 780,146 | u440312135 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
tree_set;
typedef long long ll;
typedef ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
tree_set;
typedef long long ll;
typedef ... | [] | 780,147 | 780,148 | u811604715 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int a[maxn], b[maxn];
bool check(int n) {
int ans = 0;
for (int i = n; i >= 1; i--) {
int tmp = 0;
for (int j = i + i; j <= n; j += i)
tmp += b[j];
if (tmp % 2 != a[i]) {
b[i] = 1;
ans++;
}
}
printf("%d\n"... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int a[maxn], b[maxn];
bool check(int n) {
int ans = 0;
for (int i = n; i >= 1; i--) {
int tmp = 0;
for (int j = i + i; j <= n; j += i)
tmp += b[j];
if (tmp % 2 != a[i]) {
b[i] = 1;
ans++;
}
}
printf("%d\n"... | [
"call.arguments.change"
] | 780,149 | 780,150 | u559470386 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef pair<int, int> pii;
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
const int N = 2e5 + 10;
int n, a[N], b[N], tag;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef pair<int, int> pii;
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
const int N = 2e5 + 10;
int n, a[N], b[N], tag;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d... | [
"call.arguments.change"
] | 780,151 | 780,152 | u976942563 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
long M = 0;
int A[200002];
int dp[200002];
cin >> N;
for (long i = 1; i <= N; i++)
cin >> A[i];
for (long i = N; i >= 1; i--) {
long counter = 0;
long j = i;
long coeff = 2;
while (j * coeff <= N) {
counter += d... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
long M = 0;
int A[200002];
int dp[200002];
cin >> N;
for (long i = 1; i <= N; i++)
cin >> A[i];
for (long i = N; i >= 1; i--) {
long counter = 0;
long j = i;
long coeff = 2;
while (j * coeff <= N) {
counter += d... | [] | 780,155 | 780,156 | u028681952 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
long M = 0;
int A[200002];
int dp[200002];
cin >> N;
for (long i = 1; i <= N; i++)
cin >> A[i];
for (long i = N; i >= 1; i--) {
long counter = 0;
long j = i;
long coeff = 2;
while (j * coeff < N) {
counter += dp... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
long M = 0;
int A[200002];
int dp[200002];
cin >> N;
for (long i = 1; i <= N; i++)
cin >> A[i];
for (long i = N; i >= 1; i--) {
long counter = 0;
long j = i;
long coeff = 2;
while (j * coeff <= N) {
counter += d... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 780,157 | 780,156 | u028681952 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void enum_divisor(ll n, map<int, ll> &mp) {
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
mp[i]++;
if (i * i != n)
mp[n / i]++;
}
}
}
int main() {
int n;
cin >> n;
vector<int> a(n);
map<int, ll> mp;
boo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void enum_divisor(ll n, map<int, ll> &mp) {
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
mp[i]++;
if (i * i != n)
mp[n / i]++;
}
}
}
int main() {
int n;
cin >> n;
vector<int> a(n);
map<int, ll> mp;
boo... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 780,158 | 780,159 | u853947407 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<LL, LL>;
using VI = vector<LL>;
using VVI = vector<VI>;
using VB = vector<bool>;
using VS = vector<string>;
using VP = vector<PII>;
#define VV(T) vector<vector<T>>
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<LL, LL>;
using VI = vector<LL>;
using VVI = vector<VI>;
using VB = vector<bool>;
using VS = vector<string>;
using VP = vector<PII>;
#define VV(T) vector<vector<T>>
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 780,166 | 780,167 | u816800341 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<LL, LL>;
using VI = vector<LL>;
using VVI = vector<VI>;
using VB = vector<bool>;
using VS = vector<string>;
using VP = vector<PII>;
#define VV(T) vector<vector<T>>
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<LL, LL>;
using VI = vector<LL>;
using VVI = vector<VI>;
using VB = vector<bool>;
using VS = vector<string>;
using VP = vector<PII>;
#define VV(T) vector<vector<T>>
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 780,168 | 780,167 | u816800341 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200000 + 10;
int n, a[N], np[N], b1[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
vector<int> v;
for (int b = n; b >= 1; b--) {
ll sum = 0;
for (int d = b * 2; d <= n; d += b)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200000 + 10;
int n, a[N], np[N], b1[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
vector<int> v;
for (int b = n; b >= 1; b--) {
ll sum = 0;
for (int d = b * 2; d <= n; d += b)
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 780,169 | 780,170 | u011129112 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
int main() {
int n;
cin >> n;
vi a(n + 1);
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
int main() {
int n;
cin >> n;
vi a(n + 1);
... | [
"assignment.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 780,173 | 780,174 | u683667873 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
int64 tmp = 0, num = 0;
cin >> N;
vector<int64> a(N + 1);
vector<int64> b(N + 1);
for (int64 i = 1; i <= N; i++) {
cin >> a[i];
b... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
int64 tmp = 0, num = 0;
cin >> N;
vector<int64> a(N + 1);
vector<int64> b(N + 1);
for (int64 i = 1; i <= N; i++) {
cin >> a[i];
b... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"variable_declaration.value.change",
"cont... | 780,177 | 780,178 | u647569169 | cpp |
p02972 | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b %... | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b %... | [] | 780,179 | 780,180 | u862237347 | cpp |
p02972 | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b %... | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b %... | [
"expression.operation.binary.remove"
] | 780,181 | 780,180 | u862237347 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
a[0] = 0;
for (int i = 1; i < n + 1; ++i) {
cin >> a[i];
}
vector<int> b(n + 1);
b[0] = 0;
int m = 0;
vector<int> out;
for (int i = n; i > 0; --i) {
if (i >= n / 2 + 1) {
// iใฎๅๆฐใฏiไธใคใใใชใใ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
a[0] = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
vector<int> b(n + 1);
b[0] = 0;
int m = 0;
vector<int> out;
for (int i = n; i > 0; --i) {
if (i >= n / 2 + 1) {
// iใฎๅๆฐใฏiไธใคใใใชใ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change"
] | 780,182 | 780,183 | u323492289 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (auto &&e : a)
std::cin >> e;
std::vector<int> ans(n);
for (int i = n - 1; i >= 0; --i) {
ans[i] = a[i];
for (int j = (i + 1) * 2; j <= n; j += i + 1)
if (a[j - 1] ==... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (auto &&e : a)
std::cin >> e;
std::vector<int> ans(n);
for (int i = n - 1; i >= 0; --i) {
ans[i] = a[i];
for (int j = (i + 1) * 2; j <= n; j += i + 1)
if (ans[j - 1] ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 780,184 | 780,185 | u492926158 | cpp |
p02972 | /**
๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ Author : Avi J Patel ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ
๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ University : DA-IICT ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ
**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define N 100000
#define ff first
#define ss sec... | /**
๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ Author : Avi J Patel ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ
๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ University : DA-IICT ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ
**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define N 100000
#define ff first
#define ss sec... | [
"literal.number.change",
"assignment.value.change"
] | 780,186 | 780,187 | u589330060 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
vector<int> a;
cin >> n;
a.push_back(0);
for (int i = 0; i < n; i++) {
cin >> k;
a.push_back(k);
}
int m = 0, b[200010] = {};
vector<int> ans;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
vector<int> a;
cin >> n;
a.push_back(0);
for (int i = 0; i < n; i++) {
cin >> k;
a.push_back(k);
}
int m = 0, b[200010] = {};
vector<int> ans;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 780,188 | 780,189 | u047554023 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 780,192 | 780,193 | u824337972 | cpp |
p02972 | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#def... | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#def... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"identifier.change"
] | 780,200 | 780,201 | u478857940 | cpp |
p02972 | #include <bits/stdc++.h>
//#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
template <typename T> vector<T> make_v(... | #include <bits/stdc++.h>
//#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
template <typename T> vector<T> make_v(... | [] | 780,202 | 780,203 | u544732702 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1), sol, vu(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
for (int i = n; i >= 1; --i) {
int j = i;
vu[i] = v[i];
while (j <= n) {
vu[i] += vu[j];
j += i;
vu[i] %= 2;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1), sol, vu(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
for (int i = n; i >= 1; --i) {
int j = 2 * i;
vu[i] = v[i];
while (j <= n) {
vu[i] += vu[j];
j += i;
vu[i] %= 2;
... | [
"assignment.change"
] | 780,206 | 780,207 | u150436276 | cpp |
p02972 | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <utility>... | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <utility>... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 780,214 | 780,215 | u224756887 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxM = 2e5 + 7;
const int maxV = 90010;
const int MOD = 1e9 + 7;
int T;
const int maxN = 2e5 + 8;
const ll INF = 1000000000000000010LL;
const int K = 15;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxM = 2e5 + 7;
const int maxV = 90010;
const int MOD = 1e9 + 7;
int T;
const int maxN = 2e5 + 8;
const ll INF = 1000000000000000010LL;
const int K = 15;... | [
"assignment.value.change",
"identifier.change"
] | 780,218 | 780,219 | u807919574 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
ll a[200001];
for (int i = 1; i <= N; i++)
cin >> a[i];
ll b[200001] = {}, sum, count = 0;
for (int i = N; i >= 1; i--) {
sum = 0;
for (int j = i; j <= N; j += i) {
sum += b[i];
}
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
ll a[200001];
for (int i = 1; i <= N; i++)
cin >> a[i];
ll b[200001] = {}, sum, count = 0;
for (int i = N; i >= 1; i--) {
sum = 0;
for (int j = i; j <= N; j += i) {
sum += b[j];
}
if... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 780,220 | 780,221 | u960997735 | cpp |
p02972 | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
vector... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
vector... | [
"assignment.value.change",
"identifier.change"
] | 780,222 | 780,223 | u658993896 | 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 main() {
int n, A[200000], num[200001] = {0};
cin >> n;
rep(i, n) cin >> A[i];
vector<int> B;
for (int i = n; i > 0; i--) {
if (num[i] % 2 != A[i - 1]) {
B.push_back(i);
int p ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, A[200000], num[200001] = {0};
cin >> n;
rep(i, n) cin >> A[i];
vector<int> B;
for (int i = n; i > 0; i--) {
if (num[i] % 2 != A[i - 1]) {
B.push_back(i);
int p ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 780,226 | 780,227 | u441296840 | cpp |
p02972 | #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... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 780,230 | 780,231 | u381714561 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define vec vector<ll>
#define ms multiset<ll>
#define f(i, x, n) for (int i = x; i < n; i++)
#define int long long
#define mod 998244353
#define endl "\n"
void fastio() {
ios_base::sync... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define vec vector<ll>
#define ms multiset<ll>
#define f(i, x, n) for (int i = x; i < n; i++)
#define int long long
#define mod 998244353
#define endl "\n"
void fastio() {
ios_base::sync... | [] | 780,232 | 780,233 | u966690395 | cpp |
p02972 | #include <bits/stdc++.h>
#ifdef DEBUG
#define PRINT(x) \
cout << "func " << __func__ << ": line " << __LINE__ << ": " << #x << " = " \
<< (x) << endl;
#define PRINTA(a, first, last) \
cout << "func... | #include <bits/stdc++.h>
#ifdef DEBUG
#define PRINT(x) \
cout << "func " << __func__ << ": line " << __LINE__ << ": " << #x << " = " \
<< (x) << endl;
#define PRINTA(a, first, last) \
cout << "func... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 780,234 | 780,235 | u537859408 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int N;
int main() {
cin >> N;
vi A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int N;
int main() {
cin >> N;
vi A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];... | [
"expression.operation.binary.add"
] | 780,239 | 780,240 | u551373727 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iso646.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef vector... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iso646.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef vector... | [
"assignment.value.change",
"identifier.change"
] | 780,241 | 780,242 | u455505352 | cpp |
p02972 | #include <algorithm>
#include <iostream>
int main() {
int a[200001], b[200001], result[200001];
long long int N, count = 0, M = 0;
std::cin >> N;
for (int i = 1; i <= N; i++)
std::cin >> a[i];
for (int i = N; i > 0; i--) {
count = 0;
for (int j = i; j < N; j = j + i) {
count += b[j];
}
... | #include <algorithm>
#include <iostream>
int main() {
int a[200001], b[200001], result[200001];
long long int N, count = 0, M = 0;
std::cin >> N;
for (int i = 1; i <= N; i++)
std::cin >> a[i];
for (int i = N; i > 0; i--) {
count = 0;
for (int j = i; j <= N; j = j + i) {
count += b[j];
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 780,247 | 780,248 | u451529323 | cpp |
p02972 | #include <algorithm>
#include <iostream>
int main() {
int a[200001], b[200001], result[200001];
long long int N, count = 0, M = 0;
std::cin >> N;
for (int i = 1; i <= N; i++)
std::cin >> a[i];
for (int i = N; i > 0; i--) {
for (int j = i; j < N; j = j + i) {
count += b[j];
}
if (a[i] != ... | #include <algorithm>
#include <iostream>
int main() {
int a[200001], b[200001], result[200001];
long long int N, count = 0, M = 0;
std::cin >> N;
for (int i = 1; i <= N; i++)
std::cin >> a[i];
for (int i = N; i > 0; i--) {
count = 0;
for (int j = i; j <= N; j = j + i) {
count += b[j];
}
... | [
"assignment.add",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 780,249 | 780,248 | u451529323 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
#define MIN(a, b) (((a) < (b... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
#define MIN(a, b) (((a) < (b... | [
"assignment.value.change",
"identifier.change"
] | 780,250 | 780,251 | u305138467 | cpp |
p02972 | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
// debug(1);
vector<bool> used(... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<bool> used(N, false);
for... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 780,254 | 780,255 | u660834360 | cpp |
p02972 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (ll(i) = m; (i) < n; (i)++)
#define all(v... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (ll(i) = m; (i) < n; (i)++)
#define all(v... | [
"call.arguments.change"
] | 780,269 | 780,270 | u190234543 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
a.at(0) == 0;
for (int i = 0; i < N; i++)
cin >> a.at(i + 1);
vector<int> b(N + 1, 0);
int count = 0;
for (int i = N; i >= 1; i--) {
int now = 0;
for (int j = 2;... | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
a.at(0) == 0;
for (int i = 0; i < N; i++)
cin >> a.at(i + 1);
vector<int> b(N + 1, 0);
int count = 0;
for (int i = N; i >= 1; i--) {
int now = 0;
for (int j = 2;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,271 | 780,272 | u618649215 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
a.at(0) == 0;
for (int i = 0; i < N; i++)
cin >> a.at(i + 1);
vector<int> b(N + 1, 0);
int count = 0;
for (int i = N; i >= 1; i--) {
int now = 0;
for (int j = 2;... | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
a.at(0) == 0;
for (int i = 0; i < N; i++)
cin >> a.at(i + 1);
vector<int> b(N + 1, 0);
int count = 0;
for (int i = N; i >= 1; i--) {
int now = 0;
for (int j = 2;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 780,273 | 780,272 | u618649215 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define N 100000
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) int(x.size())
#define OUT(a) cout << (a) << endl
#define VECIN(type, c, n) \
vec... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define N 100000
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) int(x.size())
#define OUT(a) cout << (a) << endl
#define VECIN(type, c, n) \
vec... | [
"assignment.change",
"expression.operation.binary.remove"
] | 780,276 | 780,277 | u120967809 | cpp |
p02973 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int a[100005], b[100005];
rep(i, n) cin >> a[i];
int l = 100000, r = 100001;
b[l] = a[0];
for (int i = 1; i < n; i++) {
int x = u... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int a[100005], b[100005];
rep(i, n) cin >> a[i];
int l = 100000, r = 100001;
b[l] = a[0];
for (int i = 1; i < n; i++) {
int x = l... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,295 | 780,296 | u620735210 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
const int N_MAX = pow(10, 5) + 10;
int main() {
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
const int N_MAX = pow(10, 5) + 10;
int main() {
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,297 | 780,298 | u680707192 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
multiset<int> s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
s.insert(a);
auto itr = s.lower_bound(a);
if (itr != begin(s))
s.erase(*--itr);
}
cout << s.size() << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
multiset<int> s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
s.insert(a);
auto itr = s.lower_bound(a);
if (itr != begin(s))
s.erase(
--itr); //ๅคๆๅฎใฏไธ่ดใใๅคๅ
จใฆๆถๅปใใใๅไธ่ฆ็ด ใฎๅ้คใชใใคใใฌใผใฟๆๅฎใ่ฏใใ
}
cout << s.size() <... | [
"call.arguments.change"
] | 780,299 | 780,300 | u661308718 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int n, a, b[100005];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; n++) {
scanf("%d", &a);
a++;
*(lower_bound(b, b + n, a) - 1) = a;
}
printf("%d\n", n - (lower_bound(b, b + n, 1) - b));
} | #include <bits/stdc++.h>
using namespace std;
int n, a, b[100005];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
a++;
*(lower_bound(b, b + n, a) - 1) = a;
}
printf("%d\n", n - (lower_bound(b, b + n, 1) - b));
} | [
"identifier.change"
] | 780,304 | 780,305 | u309985845 | cpp |
p02973 | #include <bits/stdc++.h>
using Int = long long;
using namespace std;
int main() {
int N;
cin >> N;
vector<Int> v(N);
for (auto &e : v)
cin >> e;
reverse(v.begin(), v.end());
Int ans = 0;
set<Int> S;
for (int i = 0; i < N; ++i) {
auto itr = S.lower_bound(v[i] + 1);
if (itr == S.end()) {
... | #include <bits/stdc++.h>
using Int = long long;
using namespace std;
int main() {
int N;
cin >> N;
vector<Int> v(N);
for (auto &e : v)
cin >> e;
reverse(v.begin(), v.end());
Int ans = 0;
multiset<Int> S;
for (int i = 0; i < N; ++i) {
auto itr = S.lower_bound(v[i] + 1);
if (itr == S.end()) {
... | [
"variable_declaration.type.change"
] | 780,306 | 780,307 | u318334550 | cpp |
p02973 | #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[n - 1 - i];
}
vector<int> dp(n, 1e9);
for (int i = 0; i < n; i++) {
int t = distance(dp.begin(), lower_bound(dp.begin(), dp.end(), a[i]));
dp[t] = a[i];
}
co... | #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[n - 1 - i];
}
vector<int> dp(n, 2e9);
for (int i = 0; i < n; i++) {
int t = distance(dp.begin(), upper_bound(dp.begin(), dp.end(), a[i]));
dp[t] = a[i];
}
co... | [
"literal.number.change",
"call.arguments.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 780,314 | 780,313 | u244626757 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int min = 1e9 + 1;
int count = 0;
multiset<int, greater<int>> nums;
int a;
cin >> a;
nums.insert(a);
count++;
for (int i = 1; i < N; i++) {
cin >> a;
auto coloredIte = nums.upper_bound(a);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int min = 1e9 + 1;
int count = 0;
multiset<int, greater<int>> nums;
int a;
cin >> a;
nums.insert(a);
count++;
for (int i = 1; i < N; i++) {
cin >> a;
auto coloredIte = nums.upper_bound(a);
... | [
"call.arguments.change"
] | 780,317 | 780,318 | u759177660 | cpp |
p02973 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T> using Vvec = vector<vector<T>>;
... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T> using Vvec = vector<vector<T>>;
... | [
"call.arguments.change"
] | 780,319 | 780,320 | u440312135 | cpp |
p02973 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T> using Vvec = vector<vector<T>>;
... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T> using Vvec = vector<vector<T>>;
... | [
"call.arguments.change"
] | 780,321 | 780,320 | u440312135 | cpp |
p02973 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
typedef long long ll;
int main() {
ll n, cnt = 0;
map<ll, ll> m;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i >= 0; i--) {
auto it = m.upper_bound(a[i]);
if (it == m.end()) {
... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
typedef long long ll;
int main() {
ll n, cnt = 0;
map<ll, ll> m;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i >= 0; i--) {
auto it = m.upper_bound(a[i]);
if (it == m.end()) {
... | [] | 780,322 | 780,323 | u352248517 | cpp |
p02973 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define MX 100005
#define ll long long
#define INF 1000000005
using namespace std;
int main() {
int n, a, col[MX], ans = 0;
cin >> n >> a;
fill(col, col + n, 0);
col[0] = -a;
rep(i, n - 1) {
cin >> a;
*upper_bound(col, col + n, -a... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define MX 100005
#define ll long long
#define INF 1000000005
using namespace std;
int main() {
int n, a, col[MX], ans = 0;
cin >> n >> a;
fill(col, col + n, 1);
col[0] = -a;
rep(i, n - 1) {
cin >> a;
*upper_bound(col, col + n, -a... | [
"literal.number.change",
"call.arguments.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 780,326 | 780,327 | u445015174 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
vector<int> v;
int n, ans = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (v.empty()) {
v.push_back(x);
++ans;
} else {
if (x <= v[0]) {
v.insert(v.begin(), x);
++ans;
} else {
... | #include <bits/stdc++.h>
using namespace std;
vector<int> v;
int n, ans = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (v.empty()) {
v.push_back(x);
++ans;
} else {
if (x <= v[0]) {
v.insert(v.begin(), x);
++ans;
} else {
... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,334 | 780,335 | u701136990 | cpp |
p02973 | #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... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,343 | 780,344 | u900727536 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int lo... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int lo... | [
"variable_declaration.type.change"
] | 780,350 | 780,351 | u282228874 | cpp |
p02973 | #include <algorithm>
#include <iostream>
#include <vector>
namespace multiset {
class multiset {
private:
std::vector<int> tree;
int MSB;
void add(int i, int x) {
for (; i < tree.size(); i += i & -i) {
tree[i] += x;
}
}
int sum(int i) {
int res = 0;
for (; i > 0; i -= i & -i) {
... | #include <algorithm>
#include <iostream>
#include <vector>
namespace multiset {
class multiset {
private:
std::vector<int> tree;
int MSB;
void add(int i, int x) {
for (; i < tree.size(); i += i & -i) {
tree[i] += x;
}
}
int sum(int i) {
int res = 0;
for (; i > 0; i -= i & -i) {
... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 780,371 | 780,372 | u606045429 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define fi first
#define se second
set<string> c;
map<ll, ll> mp;
const ll inf = (1e18);
const ll mod = 1000000007;
const ll mod2 = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define fi first
#define se second
set<string> c;
map<ll, ll> mp;
const ll inf = (1e18);
const ll mod = 1000000007;
const ll mod2 = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,379 | 780,380 | u822169805 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define fi first
#define se second
set<string> c;
map<ll, ll> mp;
const ll inf = (1e18);
const ll mod = 1000000007;
const ll mod2 = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define fi first
#define se second
set<string> c;
map<ll, ll> mp;
const ll inf = (1e18);
const ll mod = 1000000007;
const ll mod2 = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,379 | 780,381 | u822169805 | cpp |
p02973 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, len;
int a[100005], f[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
f[++len] = a[1];
for (int i = 2; i <= n; i++) {
if (f[len] >= a[i])
f[++len] = a[i];
else {
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, len;
int a[100005], f[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
f[++len] = a[1];
for (int i = 2; i <= n; i++) {
if (f[len] >= a[i])
f[++len] = a[i];
else {
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"assignment.value.change",
"call.arguments.change"
] | 780,389 | 780,390 | u307700000 | cpp |
p02973 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, len;
int a[100005], f[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
f[++len] = a[1];
for (int i = 2; i <= n; i++) {
if (f[len] >= a[i])
f[++len] = a[i];
else {
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, len;
int a[100005], f[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
f[++len] = a[1];
for (int i = 2; i <= n; i++) {
if (f[len] >= a[i])
f[++len] = a[i];
else {
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 780,391 | 780,390 | u307700000 | cpp |
p02973 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, len;
int a[100005], f[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
f[++len] = a[1];
for (int i = 2; i <= n; i++) {
if (f[len] >= a[i])
f[++len] = a[i];
else {
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, len;
int a[100005], f[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
f[++len] = a[1];
for (int i = 2; i <= n; i++) {
if (f[len] >= a[i])
f[++len] = a[i];
else {
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 780,392 | 780,390 | u307700000 | cpp |
p02973 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1111111111;
constexpr lint LINF = ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1111111111;
constexpr lint LINF = ... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,393 | 780,394 | u532573979 | cpp |
p02973 | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
con... | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
con... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,395 | 780,396 | u532573979 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int>> minHeap;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int>> minHeap;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll... | [
"call.function.change"
] | 780,397 | 780,398 | u582464343 | cpp |
p02973 | #include <bits/stdc++.h>
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin... | #include <bits/stdc++.h>
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 780,402 | 780,403 | u653807637 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> Vec;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF = 1e9;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define ALL(v) v.begin(), v.end()
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> Vec;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF = 1e9;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define ALL(v) v.begin(), v.end()
#define... | [
"control_flow.break.add"
] | 780,404 | 780,405 | u592686932 | cpp |
p02973 | // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<c... | // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<c... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 780,408 | 780,409 | u884379688 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, a[100005] = {};
vector<int> b = {0};
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
reverse(a + 1, a + n + 1);
for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, a[100005] = {};
vector<int> b = {0};
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
reverse(a + 1, a + n + 1);
for (int i =... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,412 | 780,413 | u151855078 | cpp |
p02973 | // 5_abc134_e
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#inclu... | // 5_abc134_e
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#inclu... | [
"identifier.change",
"call.function.change"
] | 780,416 | 780,417 | u811561461 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> maxes;
auto find_greater = [&](int n) {
int l = 0, r = maxes.size() - 1;
int res = r + 1;
while (l < r) {
auto c = (l + r) / 2;
if (n > maxes[c]) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> maxes;
auto find_greater = [&](int n) {
int l = 0, r = maxes.size() - 1;
int res = r + 1;
while (l <= r) {
auto c = (l + r) / 2;
if (n > maxes[c])... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 780,418 | 780,419 | u500092662 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> maxes;
auto find_greater = [&](int n) {
int l = 0, r = maxes.size() - 1;
int res = r + 1;
while (l < r) {
auto c = (l + r) / 2;
if (n > maxes[c]) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> maxes;
auto find_greater = [&](int n) {
int l = 0, r = maxes.size() - 1;
int res = r + 1;
while (l <= r) {
auto c = (l + r) / 2;
if (n > maxes[c])... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.else.add",
"assignment.add"
] | 780,420 | 780,419 | u500092662 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int A[100005], tree[400005];
map<int, int> M;
void update(int left, int right, int x, int val, int root) {
if (left > x || right < x)
return;
if (left == right) {
tree[root] = val;
return;
}
int mid = (left + right) / 2;
update(left, mid, x, val, ... | #include <bits/stdc++.h>
using namespace std;
int A[100005], tree[400005];
map<int, int> M;
void update(int left, int right, int x, int val, int root) {
if (left > x || right < x)
return;
if (left == right) {
tree[root] = val;
return;
}
int mid = (left + right) / 2;
update(left, mid, x, val, ... | [
"identifier.change",
"call.arguments.change"
] | 780,422 | 780,423 | u363653022 | cpp |
p02973 | // Sani buyuk Osman Pasa Plevneden cikmam diyor.
// FatihSultanMehmedHan
// Abdulhamid Han
// Bismillahirrahmanirrahim
//โโโโโโโโโโโโโโโโโ
//โโโโโโโโโโโโโโโโโ
//โโโโโโโโโโโโโโโโโ
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair<in... | // Sani buyuk Osman Pasa Plevneden cikmam diyor.
// FatihSultanMehmedHan
// Abdulhamid Han
// Bismillahirrahmanirrahim
//โโโโโโโโโโโโโโโโโ
//โโโโโโโโโโโโโโโโโ
//โโโโโโโโโโโโโโโโโ
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair<in... | [] | 780,426 | 780,427 | u050607149 | cpp |
p02973 | #include <cstdio>
#include <set>
using namespace std;
int main() {
int n, a, cnt = 1;
set<int> s;
scanf("%d%d", &n, &a);
s.insert(a);
for (int i = 1; i < n; ++i) {
scanf("%d", &a);
if (*s.begin() >= a)
++cnt;
else
s.erase(--s.lower_bound(a));
s.insert(a);
}
printf("%d\n", cnt... | #include <cstdio>
#include <set>
using namespace std;
int main() {
int n, a, cnt = 1;
multiset<int> s;
scanf("%d%d", &n, &a);
s.insert(a);
for (int i = 1; i < n; ++i) {
scanf("%d", &a);
if (*s.begin() >= a)
++cnt;
else
s.erase(--s.lower_bound(a));
s.insert(a);
}
printf("%d\n"... | [
"variable_declaration.type.change"
] | 780,428 | 780,429 | u359025499 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
set<int> s;
int ans = 0;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
s.insert(x);
auto it = s.lower_bound(x);
if (it == s.begin())
ans++;
else {
it--;
s.erase(it);
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
multiset<int> s;
int ans = 0;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
s.insert(x);
auto it = s.lower_bound(x);
if (it == s.begin())
ans++;
else {
it--;
s.erase(it);
}... | [
"variable_declaration.type.change"
] | 780,432 | 780,433 | u100131109 | cpp |
p02973 | #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> Color(N);
for (int i = 0; i < N; i++) {
Color[i] = -1;
}
int cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
Color[c... | #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> Color(N);
for (int i = 0; i < N; i++) {
Color[i] = -1;
}
int cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
Color[c... | [
"control_flow.break.add"
] | 780,464 | 780,465 | u883982500 | cpp |
p02973 | #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> Color(N);
for (int i = 0; i < N; i++) {
Color[i] = -1;
}
int cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
Color[c... | #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> Color(N);
for (int i = 0; i < N; i++) {
Color[i] = -1;
}
int cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
Color[c... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,466 | 780,465 | u883982500 | cpp |
p02973 | #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> Color(N);
for (int i = 0; i < N; i++) {
Color[i] = -1;
}
int cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
Color[c... | #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> Color(N);
for (int i = 0; i < N; i++) {
Color[i] = -1;
}
int cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
Color[c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,467 | 780,465 | u883982500 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.