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 8
values |
|---|---|---|---|---|---|---|---|
p03032 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
using Graph... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
using Graph... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,897 | 842,898 | u799939777 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,906 | 842,907 | u406237526 | cpp |
p03032 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,921 | 842,922 | u882039496 | cpp |
p03032 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 842,923 | 842,922 | u882039496 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const ll MOD = 1000000007, MOD2 = 998... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const ll MOD = 1000000007, MOD2 = 998... | [
"expression.operation.binary.add"
] | 842,934 | 842,935 | u387221709 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> s... | [
"expression.operation.binary.add"
] | 842,942 | 842,943 | u213868052 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> s... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 842,944 | 842,943 | u213868052 | cpp |
p03032 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec) { // for debug
ll n = vec.size();
co... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec) { // for debug
ll n = vec.size();
co... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 842,945 | 842,946 | u628597699 | cpp |
p03032 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int N, K;
cin >> N >> K;
vector<int> V;
rep(i, ... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int N, K;
cin >> N >> K;
vector<int> V;
rep(i, ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 842,955 | 842,956 | u289578952 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pa... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pa... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 842,957 | 842,958 | u274883254 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
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;
}
return false;
}
using ll = long long;
using P = pair<int, in... | #include <bits/stdc++.h>
using namespace std;
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;
}
return false;
}
using ll = long long;
using P = pair<int, in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,959 | 842,960 | u971089878 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
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;
}
return false;
}
int n, k;
vector<long long> V(55, 0);
int ... | #include <bits/stdc++.h>
using namespace std;
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;
}
return false;
}
int n, k;
vector<long long> V(55, 0);
int ... | [
"control_flow.loop.for.condition.change"
] | 842,961 | 842,962 | u971089878 | cpp |
p03032 | #include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 842,979 | 842,980 | u222866518 | cpp |
p03032 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<int> vin... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<int> vin... | [
"expression.operation.binary.add"
] | 842,983 | 842,984 | u376082984 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.b... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.b... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 842,987 | 842,988 | u733814820 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k, ans = 0;
cin >> n >> k;
vector<int> v;
rep(i, n) { cin >> v[i]; }
rep(l, k + 1) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k, ans = 0;
cin >> n >> k;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
rep(l, k + 1) {... | [] | 842,999 | 843,000 | u828388155 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template <class T> using pq ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template <class T> using pq ... | [
"expression.operation.binary.add"
] | 843,016 | 843,017 | u836743234 | cpp |
p03032 | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <deque>
#include <functional> //sort第三引数greater<型名>()で降順
#include <iomanip> //cout<<setw(数字) で空白による桁揃え
#include <iostream> //cout<<right で右揃え
#include <map>
#include <queue>
#include <string>
#include <vector>
u... | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <deque>
#include <functional> //sort第三引数greater<型名>()で降順
#include <iomanip> //cout<<setw(数字) で空白による桁揃え
#include <iostream> //cout<<right で右揃え
#include <map>
#include <queue>
#include <string>
#include <vector>
u... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 843,034 | 843,035 | u022890424 | cpp |
p03032 |
// Problem : D - equeue
// Contest : AtCoder - AtCoder Beginner Contest 128
// URL : https://atcoder.jp/contests/abc128/tasks/abc128_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define ll long long int... |
// Problem : D - equeue
// Contest : AtCoder - AtCoder Beginner Contest 128
// URL : https://atcoder.jp/contests/abc128/tasks/abc128_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define ll long long int... | [
"control_flow.loop.for.condition.change"
] | 843,036 | 843,037 | u152447503 | cpp |
p03032 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,042 | 843,043 | u000212387 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll;
t... | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll;
t... | [
"expression.operation.binary.add"
] | 843,060 | 843,061 | u714564133 | cpp |
p03032 | /*Whose woods these are I think I know.
His house is in the village though;
He will not see me stopping here
To watch his woods fill up with snow.
My little horse must think it queer
To stop without a farmhouse near
Between the woods and frozen lake
The darkest evening of the year.
He gives his harness bells a shake
... | /*Whose woods these are I think I know.
His house is in the village though;
He will not see me stopping here
To watch his woods fill up with snow.
My little horse must think it queer
To stop without a farmhouse near
Between the woods and frozen lake
The darkest evening of the year.
He gives his harness bells a shake
... | [
"assignment.value.change",
"identifier.change"
] | 843,062 | 843,063 | u217942651 | cpp |
p03032 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 843,064 | 843,065 | u809967037 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll res = 0;
for (ll i = 0; i <= min(k, n); i++) {
for (ll j = 0; i + j <= min(k, n); j++) {
vector<ll> b;
ll cur = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll res = 0;
for (ll i = 0; i <= min(k, n); i++) {
for (ll j = 0; i + j <= min(k, n); j++) {
vector<ll> b;
ll cur = 0;... | [] | 843,070 | 843,071 | u246343119 | cpp |
p03032 | #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, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
int ans = 0;
rep(l, k) {
rep(r, k - l) {
if (l + r > n)
break;
int d = k - l - r;
... | #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, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
int ans = 0;
rep(l, k + 1) {
rep(r, k - l + 1) {
if (l + r > n)
break;
int d = k - l - ... | [
"expression.operation.binary.add"
] | 843,095 | 843,096 | u915797797 | cpp |
p03032 | #include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll ans = 0;
for (int a = 0; a < min(n, k); a++) {
for (int b = 0; a + b <= min(n, k); b++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll ans = 0;
for (int a = 0; a <= min(n, k); a++) {
for (int b = 0; a + b <= min(n, k); b++) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.variable.change",
"identifier.change"
] | 843,105 | 843,106 | u139300044 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int, i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int, i... | [
"expression.operation.binary.add"
] | 843,111 | 843,112 | u853721692 | cpp |
p03032 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(), (x).end()
#define re... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(), (x).end()
#define re... | [
"control_flow.branch.if.condition.change"
] | 843,115 | 843,116 | u062736195 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> V(N);
rep(i, N) { cin >> V[i]; }
ll res = 0;
rep(a, min(N, K) + 1) {
rep(b,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> V(N);
rep(i, N) { cin >> V[i]; }
ll res = 0;
rep(a, min(N, K) + 1) {
rep(b,... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 843,119 | 843,120 | u137542041 | cpp |
p03032 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPvec(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007 // 1e9+7
using namespace std;
typedef long long int ll;
typedef vector<int> vecint;
typedef vector<ll> vecll;
typ... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPvec(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007 // 1e9+7
using namespace std;
typedef long long int ll;
typedef vector<int> vecint;
typedef vector<ll> vecll;
typ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 843,121 | 843,122 | u138062788 | cpp |
p03032 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, k, mx, a[55];
vector<int> vt;
void f(int p) {
int i, s = 0;
if (p < 0)
return;
sort(vt.begin(), vt.end());
for (i = 0; i < vt.size(); i++) {
if (i < p && vt[i] < 0)
continue;
s += vt[i];
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, k, mx, a[55];
vector<int> vt;
void f(int p) {
int i, s = 0;
if (p < 0)
return;
sort(vt.begin(), vt.end());
for (i = 0; i < vt.size(); i++) {
if (i < p && vt[i] < 0)
continue;
s += vt[i];
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 843,133 | 843,134 | u093170535 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K, ans = 0;
cin >> N >> K;
vector<int64_t> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int l = 0; l < K; l++) {
for (int r = 0; r < K - l; r++) {
if (l + r > N)
continue;
int64_t d = K - l - r, n =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K, ans = 0;
cin >> N >> K;
vector<int64_t> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K - l; r++) {
if (l + r > N)
continue;
int64_t d = K - l - r, n... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 843,135 | 843,136 | u543466827 | cpp |
p03031 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int k[15], s[15][15], p[15];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
s[i][j]--;
}
}
int ans = 0;
for (int i = 0; i < m; i++)
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int k[15], s[15][15], p[15];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
s[i][j]--;
}
}
int ans = 0;
for (int i = 0; i < m; i++)
... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 843,139 | 843,140 | u127194462 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int s[15][15];
int p[15];
int state[15];
int main() {
int N, M;
scanf("%d%d", &N, &M);
memset(s, 0, sizeof(s));
for (int i = 0; i < M; i++) {
int k;
scanf("%d", &k);
for (int j = 0; j < k; j++) {
int x;
scanf("%d", &x);
s[i][x] = ... | #include <bits/stdc++.h>
using namespace std;
int s[15][15];
int p[15];
int state[15];
int main() {
int N, M;
scanf("%d%d", &N, &M);
memset(s, 0, sizeof(s));
for (int i = 0; i < M; i++) {
int k;
scanf("%d", &k);
for (int j = 0; j < k; j++) {
int x;
scanf("%d", &x);
s[i][x - 1... | [
"assignment.change"
] | 843,141 | 843,142 | u113883426 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> a[11];
int p[11];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
for (int j = 0; j < x; j++) {
int y;
cin >> y;
a[i].push_back(y);
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> a[11];
int p[11];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
for (int j = 0; j < x; j++) {
int y;
cin >> y;
a[i].push_back(y);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,143 | 843,144 | u064087840 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> a[11];
int p[11];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
for (int i = 0; i < x; i++) {
int y;
cin >> y;
a[i].push_back(y);
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> a[11];
int p[11];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
for (int j = 0; j < x; j++) {
int y;
cin >> y;
a[i].push_back(y);
... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 843,145 | 843,144 | u064087840 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
// 左づめでの10進数xをdigits桁のN進数vectorにしてを返す
vector<int> baseNumber(int N, int digits, int x) {
vector<int> ret(digits, 0);
// 商
int quotient = x;
int counter = 0;
while (quotient > 0) {
// 余り
int remainder = quotient % N;
quotient /= N;
ret[counter] = r... | #include <bits/stdc++.h>
using namespace std;
// 左づめでの10進数xをdigits桁のN進数vectorにしてを返す
vector<int> baseNumber(int N, int digits, int x) {
vector<int> ret(digits, 0);
// 商
int quotient = x;
int counter = 0;
while (quotient > 0) {
// 余り
int remainder = quotient % N;
quotient /= N;
ret[counter] = r... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 843,155 | 843,156 | u987594251 | cpp |
p03031 | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int N, M;
cin >> N >> M;
int k[10], s[10][10], p[10];
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < M; i+... | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int N, M;
cin >> N >> M;
int k[10], s[10][10], p[10];
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < M; i+... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 843,172 | 843,173 | u403848488 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx2,avx,fma")
#define ll long long int
#define io \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx2,avx,fma")
#define ll long long int
#define io \
ios_base::sync_with_stdio(false); ... | [
"identifier.change",
"call.arguments.change"
] | 843,176 | 843,177 | u445107674 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, M, i, j;
cin >> N >> M;
vector<vector<int>> s(M);
vector<int> p(M);
rep(j, M) {
int k;
cin >> k;
s[j].resize(k);
rep(i, k) {
cin >> s[j][i];
--s[j][i];
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, M, i, j;
cin >> N >> M;
vector<vector<int>> s(M);
vector<int> p(M);
rep(j, M) {
int k;
cin >> k;
s[j].resize(k);
rep(i, k) {
cin >> s[j][i];
--s[j][i];
}
... | [
"assignment.add"
] | 843,178 | 843,179 | u243122218 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int s[15][15];
int p[15];
int z[15];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a;
cin >> a;
while (a--) {
int b;
cin >> b;
s[i][b] = 1;
}
}
int ans = 0;
for (int i = 1; i <= m; i++)
cin >> p[i]... | #include <bits/stdc++.h>
using namespace std;
int s[15][15];
int p[15];
int z[15];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a;
cin >> a;
while (a--) {
int b;
cin >> b;
s[i][b] = 1;
}
}
int ans = 0;
for (int i = 1; i <= m; i++)
cin >> p[i]... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,186 | 843,187 | u114362525 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int s[12][12];
int p[12];
int z[12];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a;
cin >> a;
while (a--) {
int b;
cin >> b;
s[i][b] = 1;
}
}
int ans = 0;
for (int i = 1; i <= m; i++)
cin >> p[i]... | #include <bits/stdc++.h>
using namespace std;
int s[15][15];
int p[15];
int z[15];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a;
cin >> a;
while (a--) {
int b;
cin >> b;
s[i][b] = 1;
}
}
int ans = 0;
for (int i = 1; i <= m; i++)
cin >> p[i]... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,188 | 843,187 | u114362525 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
/**
2 2
2 1 2
1 2
0 1
*/
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> f(m); // bulb -> vector<int> (the lights id)
// cout<<"n:"<<n<<" m:"<<m<<endl;
for (int i = 0; i < m; ++i) {
// cout<<"read line:"<<i + ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
/**
2 2
2 1 2
1 2
0 1
*/
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> f(m); // bulb -> vector<int> (the lights id)
// cout<<"n:"<<n<<" m:"<<m<<endl;
for (int i = 0; i < m; ++i) {
// cout<<"read line:"<<i + ... | [] | 843,189 | 843,190 | u655810450 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define allarr(a) a, a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio \
... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define allarr(a) a, a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio \
... | [
"assignment.add"
] | 843,191 | 843,192 | u179395482 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> vec[i][j];
--vec[i][j];
}
}
vector<int> p(M);
for (int i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> vec[i][j];
--vec[i][j];
}
}
vector<int> p(M);
for (int i... | [
"literal.string.change",
"io.output.change"
] | 843,193 | 843,194 | u595786324 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int k[15];
int s[15][15];
int p[15];
bool use[15];
int cnt = 0;
void dfs(int x, int y, int z) {
if (x == z) {
bool ok = true;
for (int i = 0; i < m; i++) {
int ans = 0;
for (int j = 0; j < k[i]; j++) {
if (use[s[i][j] - 1]) {
... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int k[15];
int s[15][15];
int p[15];
bool use[15];
int cnt = 0;
void dfs(int x, int y, int z) {
if (x == z) {
bool ok = true;
for (int i = 0; i < m; i++) {
int ans = 0;
for (int j = 0; j < k[i]; j++) {
if (use[s[i][j] - 1]) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,212 | 843,213 | u426657245 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
// all_ofを使ってみたかったver
int n, m;
vector<int> s[10];
int p[10];
int on[10] = {0};
int dfs(int i) {
// cerr << i << ' ' << n << '\n';
if (i == n) {
int idx[n];
iota(idx, idx + n, 0);
bool yes = all_of(idx... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
// all_ofを使ってみたかったver
int n, m;
vector<int> s[10];
int p[10];
int on[10] = {0};
int dfs(int i) {
// cerr << i << ' ' << n << '\n';
if (i == n) {
int idx[m];
iota(idx, idx + m, 0);
bool yes = all_of(idx... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 843,214 | 843,215 | u956758464 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int s[m];
for (int i = 0; i < m; i++) {
s[i] = 0;
}
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int l;
cin >> l;
s[i] += (1 << (n - l));
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int s[m];
for (int i = 0; i < m; i++) {
s[i] = 0;
}
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int l;
cin >> l;
s[i] += (1 << (n - l));
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,223 | 843,224 | u445619807 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
return os;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
return os;... | [
"variable_declaration.value.change"
] | 843,225 | 843,226 | u354075848 | cpp |
p03031 | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>:... | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>:... | [
"literal.number.change",
"assignment.value.change"
] | 843,229 | 843,230 | u101513772 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >... | [
"expression.operation.binary.remove"
] | 843,231 | 843,232 | u196432341 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >... | [
"expression.operation.binary.remove"
] | 843,233 | 843,232 | u196432341 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >... | [] | 843,234 | 843,232 | u196432341 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using INT64 = long long;
int main(void) {
IOS int n, m;
... | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using INT64 = long long;
int main(void) {
IOS int n, m;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,262 | 843,263 | u330661451 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using INT64 = long long;
int main(void) {
IOS int n, m;
... | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using INT64 = long long;
int main(void) {
IOS int n, m;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,264 | 843,263 | u330661451 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> s[i][j];
--s[i][j];
}
}
vector<int> p(M);
for ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> s[i][j];
--s[i][j];
}
}
vector<int> p(M);
for ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,265 | 843,266 | u067267922 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> s[i][j];
--s[i][j];
}
}
vector<int> p(M);
for ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> s[i][j];
--s[i][j];
}
}
vector<int> p(M);
for ... | [
"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"
] | 843,267 | 843,266 | u067267922 | cpp |
p03031 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define mkp make_pair
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define mkp make_pair
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,270 | 843,271 | u754112329 | cpp |
p03032 | /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typed... | /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typed... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,276 | 843,277 | u506295831 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define Pair pair<string, int>;
const int INF = 1E9;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; ++i) {
cin >> V[i];
}
lint largest = 0;
for (int i = 0; i <= min(K, N); ++i) {
for (int j... | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define Pair pair<string, int>;
const int INF = 1E9;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; ++i) {
cin >> V[i];
}
lint largest = 0;
for (int i = 0; i <= min(K, N); ++i) {
for (int j... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 843,282 | 843,283 | u432456012 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<ll> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
ll maxv = 0;
for (int i = 0; i <= N && i <= K; i++) {
for (int j = 0; j <= N && j <= (K - i); j++) {
vector<ll> tmp;
//左
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<ll> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
ll maxv = 0;
for (int i = 0; i <= N && i <= K; i++) {
for (int j = 0; j <= (N - i) && j <= (K - i); j++) {
vector<ll> tmp;
... | [
"control_flow.loop.for.condition.change"
] | 843,297 | 843,298 | u523303964 | cpp |
p03032 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 843,317 | 843,318 | u297007413 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 843,319 | 843,320 | u532573979 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); (i)++)
#define all(x) x.begin(), x.end()
struct revran {
const i64 b, e;
struct iter {
i64 i;
constexpr iter(const i64 i) noexcept : i(i) {}
void operator++() noexcept { --i; }
co... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); (i)++)
#define all(x) x.begin(), x.end()
struct revran {
const i64 b, e;
struct iter {
i64 i;
constexpr iter(const i64 i) noexcept : i(i) {}
void operator++() noexcept { --i; }
co... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 843,325 | 843,326 | u852585808 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265
#define int long long
main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int r = min(n, k);
int record = 0;
for (int i = 0; i <= r; i++) {
for (int j = n - 1; j >= 0; j--) {... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265
#define int long long
main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int r = min(n, k);
int record = 0;
for (int i = 0; i <= r; i++) {
for (int j = n - 1; j != -1; j--) ... | [
"control_flow.loop.for.condition.change",
"variable_declaration.type.change"
] | 843,331 | 843,330 | u889817605 | cpp |
p03032 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define N_MAX 51
int N, K;
int V[N_MAX];
int sim(int l, int r) {
if (l + r > N || l + r > K) {
return -1;
}
vector<int> table;
for (int i = 0; i < l; i++) {
... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define N_MAX 51
int N, K;
int V[N_MAX];
int sim(int l, int r) {
if (l + r > N || l + r > K) {
return -1;
}
vector<int> table;
for (int i = 0; i < l; i++) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,343 | 843,344 | u103357948 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
long long maxSumV = -9223372036854775808;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; +... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
long long maxSumV = -9223372036854775807;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; +... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,347 | 843,348 | u055685044 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
#define ALL(a) (a).begin(), (a).end()
ll N, K, ans = 0;
void Main() {
cin >> N >> K;
vector<ll> queue(N);
For(i, 0, N) cin >> queue.at(i);
For(i, 0, min(N, K)) {
For(j, 0, i + 1) {
v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
#define ALL(a) (a).begin(), (a).end()
ll N, K, ans = 0;
void Main() {
cin >> N >> K;
vector<ll> queue(N);
For(i, 0, N) cin >> queue.at(i);
For(i, 0, min(N, K) + 1) {
For(j, 0, i + 1) {
... | [
"expression.operation.binary.add"
] | 843,357 | 843,356 | u813174766 | cpp |
p03032 | //#include "pch.h"
//#include "stdafx.h"
#include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
定義
----------------------------------------... | //#include "pch.h"
//#include "stdafx.h"
#include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
定義
----------------------------------------... | [
"variable_declaration.specifier.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,373 | 843,374 | u796408111 | cpp |
p03032 | //#include "pch.h"
//#include "stdafx.h"
#include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
定義
----------------------------------------... | //#include "pch.h"
//#include "stdafx.h"
#include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
定義
----------------------------------------... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,375 | 843,374 | u796408111 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(V) V.begin(), V.end()
using i64 = int_fast64_t;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
vector<i64> V(N);
rep(i, N) cin >> V[i];
i64 ans = 0;
for (int left = 0; left < min... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(V) V.begin(), V.end()
using i64 = int_fast64_t;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
vector<i64> V(N);
rep(i, N) cin >> V[i];
i64 ans = 0;
for (int left = 0; left <= mi... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,376 | 843,377 | u031178961 | cpp |
p03032 | #include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
... | #include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,384 | 843,385 | u026537738 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ok2 printf("ok2\n");
#define M 1000000000000000000LL
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define REPR(i, s, n) for (int i... | #include <bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ok2 printf("ok2\n");
#define M 1000000000000000000LL
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define REPR(i, s, n) for (int i... | [
"expression.operation.binary.add"
] | 843,386 | 843,387 | u373958718 | cpp |
p03032 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb() {
fact[0] = fact[1] = 1;
fact_inv[0] = fa... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb() {
fact[0] = fact[1] = 1;
fact_inv[0] = fa... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 843,388 | 843,389 | u083910207 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int ans = 0;
for (int l = 0; l < k; ++l) {
for (int r = 0; r < k - l; r++) {
if (l + r > n)
continue;
int d = k... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int ans = 0;
for (int l = 0; l <= k; ++l) {
for (int r = 0; r <= k - l; r++) {
if (l + r > n)
continue;
int d =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,398 | 843,399 | u506858457 | cpp |
p03032 | #include <bits/stdc++.h> //C++の標準ライブラリを一行で一括でインクルードする
#include <math.h> //数学関数と数学定数を利用する
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
in... | #include <bits/stdc++.h> //C++の標準ライブラリを一行で一括でインクルードする
#include <math.h> //数学関数と数学定数を利用する
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
in... | [
"expression.operation.binary.add"
] | 843,408 | 843,409 | u014967455 | cpp |
p03032 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define N 55
using namespace std;
typedef long long ll;
ll n, k, mx, v[N];
vector<ll> a;
void f(int p) {
ll i, s = 0;
if (p < 0)
return;
sort(a.begin(), a.end());
for (i = 0; i < a.size(); i++) {
if (i < p && a[i] < 0)
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define N 55
using namespace std;
typedef long long ll;
ll n, k, mx, v[N];
vector<ll> a;
void f(int p) {
ll i, s = 0;
if (p < 0)
return;
sort(a.begin(), a.end());
for (i = 0; i < a.size(); i++) {
if (i < p && a[i] < 0)
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 843,410 | 843,411 | u230265105 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(obj) (obj).begin(), ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(obj) (obj).begin(), ... | [
"expression.operation.binary.add"
] | 843,415 | 843,416 | u145179061 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// graph
const ll MAX_V = 1;
const ll MAX_E = 1;
struct edge {
ll from, to, cost;
};
edge ES[MAX_E];
vector<edge> G[MAX_V];
ll d[MAX_V];
ll prev_path[MAX_V];
ll V, E;
const ll MOD = (ll)1e9 + 7;
const int MAX_INT = 1 << 17;
vector<bool> prime;
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// graph
const ll MAX_V = 1;
const ll MAX_E = 1;
struct edge {
ll from, to, cost;
};
edge ES[MAX_E];
vector<edge> G[MAX_V];
ll d[MAX_V];
ll prev_path[MAX_V];
ll V, E;
const ll MOD = (ll)1e9 + 7;
const int MAX_INT = 1 << 17;
vector<bool> prime;
#... | [
"expression.operation.binary.add"
] | 843,417 | 843,418 | u181806820 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, k;
cin >> N >> k;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
int Asum = 0;
priority_queue<int> q;
priority_queue<int> s;
for (int i = 0; i < k + 1; i++) {
if (i != 0 && i < N + 1) {
Asum += v.at(i -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, k;
cin >> N >> k;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
int Asum = 0;
priority_queue<int> q;
priority_queue<int> s;
for (int i = 0; i < k + 1; i++) {
if (i != 0 && i < N + 1) {
Asum += v.at(i -... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 843,423 | 843,424 | u985686845 | cpp |
p03032 | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>:... | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>:... | [
"expression.operator.compare.change"
] | 843,429 | 843,430 | u101513772 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i, start, end) for (ll i = (ll)start; i < (ll)end; i++)
#define print(a) cout << a << endl;
#define printarray(a... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i, start, end) for (ll i = (ll)start; i < (ll)end; i++)
#define print(a) cout << a << endl;
#define printarray(a... | [
"control_flow.loop.for.initializer.change",
"call.add",
"call.arguments.add"
] | 843,437 | 843,438 | u656995812 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void ABC128... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void ABC128... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 843,445 | 843,446 | u227117171 | cpp |
p03032 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 843,450 | 843,451 | u050698451 | cpp |
p03032 | #include "bits/stdc++.h"
#define int long long
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define itr(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#defi... | #include "bits/stdc++.h"
#define int long long
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define itr(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#defi... | [
"expression.operation.binary.add"
] | 843,460 | 843,461 | u203033720 | cpp |
p03032 | #include "bits/stdc++.h"
#define int long long
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define itr(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#defi... | #include "bits/stdc++.h"
#define int long long
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define itr(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#defi... | [
"expression.operation.binary.add"
] | 843,462 | 843,461 | u203033720 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define all(v) (v).begin(), v.end()
#define fi first
#define se second
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... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define all(v) (v).begin(), v.end()
#define fi first
#define se second
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... | [
"identifier.change",
"call.arguments.change"
] | 843,481 | 843,482 | u822169805 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define all(v) (v).begin(), v.end()
#define fi first
#define se second
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... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define all(v) (v).begin(), v.end()
#define fi first
#define se second
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... | [
"identifier.change",
"call.arguments.change"
] | 843,481 | 843,483 | u822169805 | cpp |
p03032 | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int N, K;
vector<int> V;
int main() {
cin >> N;
cin >> K;
long long ans = 0;
V = vector<int>(N);
vector<int> acc_fw = vector<int>(N + 1, 0);
vector<priority_queue<int>> mns_fw = vector<priority_queue<int>>(N + 1);
vector<int... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int N, K;
vector<int> V;
int main() {
cin >> N;
cin >> K;
long long ans = 0;
V = vector<int>(N);
vector<int> acc_fw = vector<int>(N + 1, 0);
vector<priority_queue<int>> mns_fw = vector<priority_queue<int>>(N + 1);
vector<int... | [
"expression.operation.unary.logical.remove",
"call.arguments.change"
] | 843,488 | 843,489 | u647974562 | cpp |
p03032 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <numeric>
using namespace std;
int main(void) {
int N, K;
int V[50] = {};
int takenV[50] = {};
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> V[i];
int res = 0;
for (int i = 0; i < min(N, K); i++) {
for (int j = 0; j < min... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <numeric>
using namespace std;
int main(void) {
int N, K;
int V[50] = {};
int takenV[50] = {};
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> V[i];
int res = 0;
for (int i = 0; i <= min(N, K); i++) {
for (int j = 0; j <= m... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,491 | 843,492 | u486097563 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
int mi = min(n, k);
int ans = 0;
for (int a = 0; a <= mi; ++a) {
for (int b = 0; b <= mi; ++b) {
if (a + b > mi)
break;
int sum = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
int mi = min(n, k);
int ans = 0;
for (int a = 0; a <= mi; ++a) {
for (int b = 0; b <= mi; ++b) {
if (a + b > mi)
break;
int sum = 0;... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.condition.change"
] | 843,493 | 843,494 | u559765551 | cpp |
p03032 | #include "stdio.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#inc... | #include "stdio.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#inc... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 843,505 | 843,506 | u468440945 | cpp |
p03032 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 998244353;
const ll inf = 1e18;
#define REP(i, n) for (ll... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 998244353;
const ll inf = 1e18;
#define REP(i, n) for (ll... | [
"expression.operation.binary.add"
] | 843,522 | 843,523 | u702582248 | cpp |
p03032 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++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 FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++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 FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,532 | 843,533 | u532894762 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++... | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 843,557 | 843,558 | u892438699 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++... | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 843,559 | 843,558 | u892438699 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
long long ans = -1e10;
for (int ope = 0; ope... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
long long ans = -1e10;
for (int ope = 0; ope... | [] | 843,564 | 843,565 | u048945791 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
ll cont[55];
f(n) cin >> cont[i];
ll ans... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
ll cont[55];
f(n) cin >> cont[i];
ll ans... | [
"variable_declaration.type.change"
] | 843,570 | 843,571 | u308590217 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
int cont[55];
f(n) cin >> cont[i];
int a... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
ll cont[55];
f(n) cin >> cont[i];
ll ans... | [
"variable_declaration.type.change"
] | 843,572 | 843,571 | u308590217 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
int cont[55];
f(n) cin >> cont[i];
int a... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
ll cont[55];
f(n) cin >> cont[i];
ll ans... | [
"variable_declaration.type.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 843,573 | 843,571 | u308590217 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.