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 |
|---|---|---|---|---|---|---|---|
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int input;
vector<int> k(M);
vector<vector<int>> s(M);
for (int i = 0; i < M; i++) {
cin >> k.at(i);
for (int j = 0; j < k.at(i); j++) {
cin >> input;
s.at(i).push_back(input);
}
}
vector<int> p(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int input;
vector<int> k(M);
vector<vector<int>> s(M);
for (int i = 0; i < M; i++) {
cin >> k.at(i);
for (int j = 0; j < k.at(i); j++) {
cin >> input;
s.at(i).push_back(input);
}
}
vector<int> p(... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 840,760 | 840,761 | u171046846 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | [
"identifier.change",
"call.arguments.change"
] | 840,780 | 840,781 | u600402037 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, k[10], s[10][10], p[10];
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int x;
cin >> x;
s[i][x - 1]++;
}
}
/*for(int i=0; i<m; i++) {
for(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, k[10], s[10][10], p[10];
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int x;
cin >> x;
s[i][x - 1]++;
}
}
for (int i = 0; i < m; i++)
cin >>... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 840,784 | 840,785 | u873762144 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, k[10], s[10][10], p[10];
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int x;
cin >> x;
s[i][x - 1]++;
}
}
for (int i = 0; i < m; i++)
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, k[10], s[10][10], p[10];
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int x;
cin >> x;
s[i][x - 1]++;
}
}
for (int i = 0; i < m; i++)
cin >>... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 840,786 | 840,785 | u873762144 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, k[10], s[10][10], p[10];
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int x;
cin >> x;
s[i][x - 1]++;
}
}
/*for(int i=0; i<m; i++) {
for(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, k[10], s[10][10], p[10];
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int x;
cin >> x;
s[i][x - 1]++;
}
}
/*for(int i=0; i<m; i++) {
for(i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 840,784 | 840,787 | u873762144 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, k[10], s[10][10], p[10];
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int x;
cin >> x;
s[i][x - 1]++;
}
}
for (int i = 0; i < m; i++)
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, k[10], s[10][10], p[10];
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int x;
cin >> x;
s[i][x - 1]++;
}
}
/*for(int i=0; i<m; i++) {
for(i... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 840,786 | 840,787 | u873762144 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define MP make_pair
#define SZ(v) ((int)((v).size()))
typedef long long ll;
const ll MOD = 1e9 + 7;
const int OO = (int)1e6;
const int N = (int)1e7;
void init() {
... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define MP make_pair
#define SZ(v) ((int)((v).size()))
typedef long long ll;
const ll MOD = 1e9 + 7;
const int OO = (int)1e6;
const int N = (int)1e7;
void init() {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 840,790 | 840,791 | u018679195 | cpp |
p03031 | #include <stdio.h>
int n, m, ans, k[13][12], p[12];
int mj(int x) {
int a[12], i, j, s;
bool f = 0;
for (i = m; i >= 1; i--) {
a[i] = x % 2;
x /= 2;
}
for (i = 1; i <= m; i++) {
s = 0;
for (j = 1; j <= k[i][0]; j++) {
s += a[k[i][j]];
}
s %= 2;
if (s != p[i]) {
f = 1;
... | #include <stdio.h>
int n, m, ans, k[13][12], p[12];
int mj(int x) {
int a[12], i, j, s;
bool f = 0;
for (i = n; i >= 1; i--) {
a[i] = x % 2;
x /= 2;
}
for (i = 1; i <= m; i++) {
s = 0;
for (j = 1; j <= k[i][0]; j++) {
s += a[k[i][j]];
}
s %= 2;
if (s != p[i]) {
f = 1;
... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 840,792 | 840,793 | u018679195 | cpp |
p03031 |
// auto 関数名 = [(&:ラムダ外の引数をとる時))](引数の型1 引数名1, 引数の型2,
// 引数名2, ...) { 関数の処理 }; //inside main() define function. take care of };
// for (int tmp = 0; tmp < (1 << ビット数); tmp++) {
// bitset<ビット数> s(tmp);
// // (ビット列sに対する処理)
// }
// sort(配列変数.begin(), 配列変数.end());
// do {
// // 順列に対する処理
// } while (next_permutation(配列... |
// auto 関数名 = [(&:ラムダ外の引数をとる時))](引数の型1 引数名1, 引数の型2,
// 引数名2, ...) { 関数の処理 }; //inside main() define function. take care of };
// for (int tmp = 0; tmp < (1 << ビット数); tmp++) {
// bitset<ビット数> s(tmp);
// // (ビット列sに対する処理)
// }
// sort(配列変数.begin(), 配列変数.end());
// do {
// // 順列に対する処理
// } while (next_permutation(配列... | [
"expression.operation.binary.add"
] | 840,800 | 840,801 | u340121166 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> connection(M, vector<int>(0));
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
connection[i].push_back(s);
}
}
vector<int>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> connection(M, vector<int>(0));
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
s--;
connection[i].push_back(s);
}
}
... | [
"expression.unary.arithmetic.add"
] | 840,813 | 840,814 | u597584295 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define int long long
bool isprime(int n) {
double rootn = sqrt(n);
if (n < 2) {
return false;
} else if (n == 2) {
return true;
} else if (n % 2 == 0) {
return false;
} else {
for (int i = 3; i <= rootn; i += 2) {
if (n % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
bool isprime(int n) {
double rootn = sqrt(n);
if (n < 2) {
return false;
} else if (n == 2) {
return true;
} else if (n % 2 == 0) {
return false;
} else {
for (int i = 3; i <= rootn; i += 2) {
if (n % i == 0) {
... | [
"assignment.change"
] | 840,821 | 840,822 | u658401995 | cpp |
p03031 | // https://atcoder.jp/contests/abc128/tasks/abc128_c
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll... | // https://atcoder.jp/contests/abc128/tasks/abc128_c
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll... | [
"variable_declaration.type.narrow.change"
] | 840,824 | 840,825 | u858107870 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#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.begin(), v.end(), x) != v.en... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#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.begin(), v.end(), x) != v.en... | [] | 840,832 | 840,833 | u733814820 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#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.begin(), v.end(), x) != v.en... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#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.begin(), v.end(), x) != v.en... | [
"control_flow.branch.if.condition.change"
] | 840,834 | 840,833 | u733814820 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#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.begin(), v.end(), x) != v.en... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#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.begin(), v.end(), x) != v.en... | [
"control_flow.branch.if.condition.change",
"variable_declaration.type.change"
] | 840,835 | 840,833 | u733814820 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define itn int
#define fi first
#define se second
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
int k, s[20][20], p[20], a;
int ans = 0;
int r[20] = {};
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k;
... | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define itn int
#define fi first
#define se second
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
int k, s[20][20] = {}, p[20], a;
int ans = 0;
int r[20] = {};
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k;... | [
"variable_declaration.value.change"
] | 840,836 | 840,837 | u831161882 | cpp |
p03031 | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 840,847 | 840,848 | u608773191 | cpp |
p03031 | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 840,849 | 840,848 | u608773191 | cpp |
p03031 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 0
constexpr int kMod = 1000000007;
typedef long long LL;
struct Cond {
int k;
std::vector<int> s;
int p;
};
int main() ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 0
constexpr int kMod = 1000000007;
typedef long long LL;
struct Cond {
int k;
std::vector<int> s;
int p;
};
int main() ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 840,852 | 840,853 | u116523315 | cpp |
p03031 | #include <bits/stdc++.h>
#define ll long long
#define pii_ pair<int, int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#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 show1(a) cout << #a << " = " << a << endl
#define sh... | #include <bits/stdc++.h>
#define ll long long
#define pii_ pair<int, int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#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 show1(a) cout << #a << " = " << a << endl
#define sh... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 840,872 | 840,873 | u074650488 | cpp |
p03031 | /*
Problem 11
https://atcoder.jp/contests/abc128/tasks/abc128_c
*/
#include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 100000000... | /*
Problem 11
https://atcoder.jp/contests/abc128/tasks/abc128_c
*/
#include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 100000000... | [
"expression.unary.arithmetic.add"
] | 840,881 | 840,882 | u603234915 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> connect(m);... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> connect(m);... | [
"identifier.change",
"call.arguments.change"
] | 840,883 | 840,884 | u688789047 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
// N,Mが10以下なので全探索でも間に合う
int N, M;
cin >> N >> M;
vector<vector<int>> S(12, vector<int>(12));
vector<int> P(M);
vector<int> K(M);
int k;
rep(i, M) {
cin >> K[i];
int a = K[i];
r... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
// N,Mが10以下なので全探索でも間に合う
int N, M;
cin >> N >> M;
vector<vector<int>> S(12, vector<int>(12));
vector<int> P(M);
vector<int> K(M);
int k;
rep(i, M) {
cin >> K[i];
int a = K[i];
r... | [
"assignment.change"
] | 840,892 | 840,891 | u078435079 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
ll inf = 1000000007;
ll c[55];
int main() {
int n, m;
cin >> n >> m;
int k;
vector<vector<ll>> s(m);
for (int i = 0; i < m; i++) {
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; j++) {
cin... | #include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
ll inf = 1000000007;
ll c[55];
int main() {
int n, m;
cin >> n >> m;
int k;
vector<vector<ll>> s(m);
for (int i = 0; i < m; i++) {
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; j++) {
cin... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 840,895 | 840,896 | u077051605 | cpp |
p03031 | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int k;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> vec(m);
for (int i = 0; i < m; i++) {
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> vec[i][j];
--vec[i][j];
}
}
vec... | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int k;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> vec(m);
for (int i = 0; i < m; i++) {
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> vec[i][j];
--vec[i][j];
}
}
vec... | [] | 840,897 | 840,898 | u077051605 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(11);
vector<vector<int>> s(11, vector<int>(11));
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
vector<int> p(M);
for (int i = 0; i < M; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(11);
vector<vector<int>> s(11, vector<int>(11));
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
vector<int> p(M);
for (int i = 0; i < M; i... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 840,899 | 840,900 | u936176493 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M, K, S;
cin >> N >> M;
vector<vector<int>> bulb(M);
vector<int> re(M);
for (int i = 0; i < M; i++) {
cin >> K;
for (int j = 0; j < K; j++) {
cin >> S;
S--;
bulb[i].push_back(S);
}
}
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M, K, S;
cin >> N >> M;
vector<vector<int>> bulb(M);
vector<int> re(M);
for (int i = 0; i < M; i++) {
cin >> K;
for (int j = 0; j < K; j++) {
cin >> S;
S--;
bulb[i].push_back(S);
}
}
fo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 840,901 | 840,902 | u861231819 | cpp |
p03031 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <ve... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <ve... | [
"literal.number.change",
"call.arguments.change"
] | 840,910 | 840,911 | u024383312 | cpp |
p03031 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-11 10:19:41
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 840,912 | 840,913 | u095266283 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> data(M);
for (int i = 0; i < M; i++) {
int L;
cin >> L;
for (int j = 0; j < L; j++) {
int x;
cin >> x;
data.at(i).push_back(x);
}
}
vector<int> tukuka(M);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> data(M);
for (int i = 0; i < M; i++) {
int L;
cin >> L;
for (int j = 0; j < L; j++) {
int x;
cin >> x;
x--;
data.at(i).push_back(x);
}
}
vector<int> tukuka(M);
... | [
"expression.unary.arithmetic.add"
] | 840,914 | 840,915 | u934462215 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m, ans;
cin >> n >> m;
vector<vector<int>> lmp(m);
vector<int> p(m);
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int ss;
cin >> ss;
lmp[i].push_back(ss - 1);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m, ans;
cin >> n >> m;
vector<vector<int>> lmp(m);
vector<int> p(m);
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int ss;
cin >> ss;
lmp[i].push_back(ss - 1);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 840,920 | 840,921 | u372940733 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
vector<vector<ll>> a(11);
ll ch[11], n, m, ans;
bool sw[11];
void cal() {
bool now = true;
for (ll i = 0; i < n; i++) {
ll sum = 0;
for (ll j = 0; j < a[i].size(); j++) {
if (sw[a[i][j]]) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
vector<vector<ll>> a(11);
ll ch[11], n, m, ans;
bool sw[11];
void cal() {
bool now = true;
for (ll i = 0; i < m; i++) {
ll sum = 0;
for (ll j = 0; j < a[i].size(); j++) {
if (sw[a[i][j]]) ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 840,928 | 840,929 | u166378830 | cpp |
p03031 | #include <bits/stdc++.h>
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;
for (int j = 0; j < k; j++) {
int l;
cin >> l;
l--;
s[i].push_back(l);
}
}
vector<int> p(N);
for (int i = 0;... | #include <bits/stdc++.h>
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;
for (int j = 0; j < k; j++) {
int l;
cin >> l;
l--;
s[i].push_back(l);
}
}
vector<int> p(M);
for (int i = 0;... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 840,938 | 840,939 | u945452839 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
using namespace std;
class zahyo {
public:
int x;
int y;
zahyo() {
x = 0;
y = 0;
}
zahyo(int x_, int y_) {
x = x_;
y = y_;
}
void print() { cout << x << " " << y; }
zahyo operator+(zahyo add) {
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
using namespace std;
class zahyo {
public:
int x;
int y;
zahyo() {
x = 0;
y = 0;
}
zahyo(int x_, int y_) {
x = x_;
y = y_;
}
void print() { cout << x << " " << y; }
zahyo operator+(zahyo add) {
... | [
"expression.unary.arithmetic.add"
] | 840,943 | 840,944 | u023751250 | 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;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
s[i].push_back(a);
}
}
vector<int> p(m);
for (int i = ... | #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;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
a--;
s[i].push_back(a);
}
}
vector<int> p(m);
fo... | [
"expression.unary.arithmetic.add"
] | 840,945 | 840,946 | u936558609 | cpp |
p03031 | #include <iomanip>
#include <iostream>
/*cout <<setprecision(11)<<ret<<endl;で、数字部分を計11桁表示*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// Shift+Command+bでデバッグ
//その後ターミナルで./a.outを実行
//入力を貼り付ける
////... | #include <iomanip>
#include <iostream>
/*cout <<setprecision(11)<<ret<<endl;で、数字部分を計11桁表示*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// Shift+Command+bでデバッグ
//その後ターミナルで./a.outを実行
//入力を貼り付ける
////... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 840,967 | 840,968 | u317432339 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int k;
vector<vector<int>> s(M);
for (int i = 0; i < M; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
--a;
s[i].push_back(a);
}
}
vector<int> p(M);
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int k;
vector<vector<int>> s(M);
for (int i = 0; i < M; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
--a;
s[i].push_back(a);
}
}
vector<int> p(M);
for (int i = 0; ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 840,969 | 840,970 | u084069244 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <vector>
#define MAX 10
#define PATTERN 1024
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> S(m, vector<int>(n, 0));
vector<vector<int>> temp(m, vector<int>(n, 0));
vector<int> p(m);
int k, s;
for (int i = 0; i < m; i++) ... | #include <algorithm>
#include <iostream>
#include <vector>
#define MAX 10
#define PATTERN 1024
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> S(m, vector<int>(n, 0));
vector<vector<int>> temp(m, vector<int>(n, 0));
vector<int> p(m);
int k, s;
for (int i = 0; i < m; i++) ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 840,973 | 840,974 | u790493075 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a =... | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a =... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 840,986 | 840,987 | u628332144 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#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;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
s[i].push_back(a);
... | #include <algorithm>
#include <cmath>
#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;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
s[i].push_back(a);
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 840,992 | 840,993 | u016987091 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 840,994 | 840,995 | u682686221 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define LIMIT 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < (int)n; i++)
/* 一括cin */
template <class H> void CIN(H &h) { cin >> h; }
template <class H, class... T> void CIN(H &h, T &...t) {
cin >> h;
CIN(t...);
}
/* デバッグ */
namespace /... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define LIMIT 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < (int)n; i++)
/* 一括cin */
template <class H> void CIN(H &h) { cin >> h; }
template <class H, class... T> void CIN(H &h, T &...t) {
cin >> h;
CIN(t...);
}
/* デバッグ */
namespace /... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 840,996 | 840,997 | u271743799 | cpp |
p03031 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h> //C++の機能を「全て」読み込むための命令
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define cout(x) cout << x << endl
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using Mat = vector<vector<int>>;
int ma... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h> //C++の機能を「全て」読み込むための命令
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define cout(x) cout << x << endl
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using Mat = vector<vector<int>>;
int ma... | [
"variable_declaration.value.change"
] | 841,009 | 841,010 | u000134728 | cpp |
p03031 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h> //C++の機能を「全て」読み込むための命令
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define cout(x) cout << x << endl
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using Mat = vector<vector<int>>;
int ma... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h> //C++の機能を「全て」読み込むための命令
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define cout(x) cout << x << endl
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using Mat = vector<vector<int>>;
int ma... | [
"variable_declaration.value.change",
"literal.number.change"
] | 841,011 | 841,010 | u000134728 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long long)(n); i--)
//... | #include <bits/stdc++.h>
using namespace std;
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long long)(n); i--)
//... | [
"identifier.change"
] | 841,016 | 841,017 | u931071094 | cpp |
p03031 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,022 | 841,023 | u314543767 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
// O(MN)
vector<int> s[M];
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
s[j].push_back(x - 1);
}
}
// O(M)
int p[M];
f... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
// O(MN)
vector<int> s[M];
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
s[i].push_back(x - 1); // Wow. This one thing can ruin ever... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 841,024 | 841,025 | u376616698 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(N);
for (int i = 0; i < M; i++) {
cin >> k[i];
s[i].resize(k[i]);
for (int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M);
for (int i = 0; i < M; i++) {
cin >> k[i];
s[i].resize(k[i]);
for (int... | [] | 841,026 | 841,027 | u414689295 | cpp |
p03031 | #include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (long long i = 0; i < n; i++)
//#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(N);
vector<vector<int>> s(M);
rep(i, M) {
ci... | #include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (long long i = 0; i < n; i++)
//#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(N);
vector<vector<int>> s(M);
rep(i, M) {
ci... | [
"control_flow.branch.if.condition.change"
] | 841,032 | 841,033 | u214864255 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
a--;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
a--;
... | [
"control_flow.branch.if.condition.change"
] | 841,034 | 841,035 | u233586402 | cpp |
p03031 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int f[11][11], b[11];
int main() {
int n, m, i, j, k, ans = 0;
cin >> n >> m;
int lim = (1 << n);
for (i = 1; i <= m; i++) {
cin >> k;
for (j = 1; j <= k; j++)
cin >> f[i][j];
}
for (i = 1; i <= m; i++)
cin >> b[i];
for (... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int f[11][11], b[11];
int main() {
int n, m, i, j, k, ans = 0;
cin >> n >> m;
int lim = (1 << n);
for (i = 1; i <= m; i++) {
cin >> k;
for (j = 1; j <= k; j++)
cin >> f[i][j];
}
for (i = 1; i <= m; i++)
cin >> b[i];
for (... | [] | 841,040 | 841,041 | u973991908 | cpp |
p03031 | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <float.h>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#incl... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <float.h>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#incl... | [
"assignment.value.change"
] | 841,042 | 841,043 | u152577008 | cpp |
p03031 | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <float.h>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#incl... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <float.h>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#incl... | [
"assignment.value.change"
] | 841,044 | 841,043 | u152577008 | cpp |
p03031 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
#define pi 3.14159... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
#define pi 3.14159... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,045 | 841,046 | u001858868 | cpp |
p03031 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
#define pi 3.14159... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
#define pi 3.14159... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,047 | 841,046 | u001858868 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; i++)
#define inf 1000000000
typedef long long ll;
int n, m;
vector<int> k(100), p(100);
vector<vector<int>> s(100, vector<int>(100));
ll sum = 0;
void dfs(int now, vector<int> sw) {
bool ok = true;
if (now == n + 1) {
fo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; i++)
#define inf 1000000000
typedef long long ll;
int n, m;
vector<int> k(100), p(100);
vector<vector<int>> s(100, vector<int>(100));
ll sum = 0;
void dfs(int now, vector<int> sw) {
bool ok = true;
if (now == n + 1) {
fo... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 841,054 | 841,055 | u950411977 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; i++)
#define inf 1000000000
typedef long long ll;
int n, m;
vector<int> k(100), p(100);
vector<vector<int>> s(100, vector<int>(100));
ll sum = 0;
void dfs(int now, vector<int> sw, int f) {
if (now != 1) {
if (f == 1) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; i++)
#define inf 1000000000
typedef long long ll;
int n, m;
vector<int> k(100), p(100);
vector<vector<int>> s(100, vector<int>(100));
ll sum = 0;
void dfs(int now, vector<int> sw, int f) {
if (now != 1) {
if (f == 1) {
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 841,058 | 841,057 | u950411977 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (auto i = 0; i < n; i++)
#define inf 1000000000
typedef long long ll;
int main(void) {
int n, m, k;
cin >> n >> m;
vector<int> p(m + 5);
vector<vector<int>> suichi(m + 5);
rep(i, m) {
cin >> k;
rep(j, k) {
int s;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (auto i = 0; i < n; i++)
#define inf 1000000000
typedef long long ll;
int main(void) {
int n, m, k;
cin >> n >> m;
vector<int> p(m + 5);
vector<vector<int>> suichi(m + 5);
rep(i, m) {
cin >> k;
rep(j, k) {
int s;
cin >> ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,059 | 841,060 | u950411977 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (auto i = 0; i < n; i++)
#define inf 1000000000
typedef long long ll;
int main(void) {
int n, m, k;
cin >> n >> m;
vector<int> p(m + 5);
vector<vector<int>> suichi(m + 5);
rep(i, m) {
cin >> k;
rep(j, k) {
int s;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (auto i = 0; i < n; i++)
#define inf 1000000000
typedef long long ll;
int main(void) {
int n, m, k;
cin >> n >> m;
vector<int> p(m + 5);
vector<vector<int>> suichi(m + 5);
rep(i, m) {
cin >> k;
rep(j, k) {
int s;
cin >> ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"variable_declaration.type.change"
] | 841,061 | 841,060 | u950411977 | cpp |
p03031 | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int oo = 1e9 + 7;
const int mod = 1e9 + 7, maxn = 100100;
const long double PI = acos(-1);
ll count_digits(ll n) {
int ans = 0;
while (n)
... | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int oo = 1e9 + 7;
const int mod = 1e9 + 7, maxn = 100100;
const long double PI = acos(-1);
ll count_digits(ll n) {
int ans = 0;
while (n)
... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,062 | 841,063 | u009937643 | cpp |
p03031 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))
#define vecll2(var, n, m) vector<vector<ll>> var(n, vect... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))
#define vecll2(var, n, m) vector<vector<ll>> var(n, vect... | [] | 841,064 | 841,065 | u929977034 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m, vector<int>(n));
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m, vector<int>(n));
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j ... | [] | 841,066 | 841,067 | u476027087 | cpp |
p03031 | #include <algorithm>
#include <bitset>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.else.add"
] | 841,068 | 841,069 | u734397606 | 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;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
s[i].push_back(a);
}
}
vector<int> p(M);
for (int i = ... | #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;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
a--;
s[i].push_back(a);
}
}
vector<int> p(M);
fo... | [
"expression.unary.arithmetic.add"
] | 841,070 | 841,071 | u348398921 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i =... | [
"expression.operation.binary.remove"
] | 841,072 | 841,073 | u050087249 | cpp |
p03031 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll N, M;
ll res = 0;
cin >> N >> M;
vector<int> p(M + 4);
vector<vector<int>> s(M + 4);... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll N, M;
ll res = 0;
cin >> N >> M;
vector<int> p(M + 2);
vector<vector<int>> s(M);
f... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"identifier.change",
"variable_access.subscript.index.change"
] | 841,074 | 841,075 | u503052349 | cpp |
p03031 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll N, M;
ll res = 0;
cin >> N >> M;
vector<int> p(M + 4);
vector<vector<int>> s(M + 4);... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll N, M;
ll res = 0;
cin >> N >> M;
vector<int> p(M + 2);
vector<vector<int>> s(M);
f... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"identifier.change",
"variable_access.subscript.index.change"
] | 841,076 | 841,075 | u503052349 | cpp |
p03031 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m, vector<int>());
vector<int> p(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int tmp;
cin >> tmp;
s[i].pu... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m, vector<int>());
vector<int> p(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int tmp;
cin >> tmp;
s[i].pu... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 841,086 | 841,087 | u314960567 | cpp |
p03031 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m, vector<int>());
vector<int> p(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int tmp;
cin >> tmp;
s[i].pu... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m, vector<int>());
vector<int> p(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int tmp;
cin >> tmp;
s[i].pu... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 841,088 | 841,087 | u314960567 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
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++)
cin >> p[i];
int ans = 0;
for (int bit = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
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++)
cin >> p[i];
int ans = 0;
for (int bit = 0; ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 841,111 | 841,112 | u639300218 | cpp |
p03031 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int N, M;
vector<int> a[10];
int p[10];
int main() {
cin >> N >> M;
rep(i, M) {
int temp;
cin >> temp... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int N, M;
vector<int> a[10];
int p[10];
int main() {
cin >> N >> M;
rep(i, M) {
int temp;
cin >> temp... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 841,118 | 841,119 | u605168157 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, counter, counter1, answer = 0;
int y = 0;
int aaa = 0;
cin >> N >> M;
int p[M] = {0};
int ss[M][N] = {{0}};
int k[M] = {0};
for (int j = 0; j < M; j++) {
cin >> k[j];
for (int i = 0; i < k[j]; i++) {
cin >> ss[j][i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, answer = 0;
int y = 0;
int aaa = 0;
cin >> N >> M;
int p[M] = {0};
int ss[M][N] = {{0}};
int k[M] = {0};
for (int j = 0; j < M; j++) {
cin >> k[j];
for (int i = 0; i < k[j]; i++) {
cin >> ss[j][i];
}
}
for (int i... | [
"variable_declaration.remove",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,122 | 841,123 | u722640678 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> list(M, vector<int>());
int p, q;
for (int i = 0; i < M; i++) {
cin >> p;
list[i].push_back(p);
for (int j = 0; j < p; j++) {
c... | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> list(M, vector<int>());
int p, q;
for (int i = 0; i < M; i++) {
cin >> p;
list[i].push_back(p);
for (int j = 0; j < p; j++) {
c... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,126 | 841,127 | u058742919 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define srt(x) sort((x).begin(), (x).end());
#define rsrt(x) sort((x).rbegin(), (x).rend());
#define deb(x) cout << #x << " = " << (x) << " (L" << LINE << ")" << endl;
#define vdeb(x) ... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define srt(x) sort((x).begin(), (x).end());
#define rsrt(x) sort((x).rbegin(), (x).rend());
#define deb(x) cout << #x << " = " << (x) << " (L" << LINE << ")" << endl;
#define vdeb(x) ... | [
"identifier.change",
"call.arguments.change"
] | 841,133 | 841,134 | u976940619 | cpp |
p03031 | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define per(i, n) fo... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define per(i, n) fo... | [] | 841,138 | 841,139 | u548791035 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define EPS (1e-7)
#define INF (2e9)
// cout << setprecision(10)
using n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define EPS (1e-7)
#define INF (2e9)
// cout << setprecision(10)
using n... | [
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 841,142 | 841,143 | u097408484 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int n, m;
int on[10], p[10];
vector<int> s[10];
int ans = 0;
void dfs(int i) {
if ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int n, m;
int on[11], p[11];
vector<int> s[11];
int ans = 0;
void dfs(int i) {
if ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 841,148 | 841,149 | u729337236 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int temp;
cin >> temp;
temp--;
s[i].push_back(temp);
}
}
v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int temp;
cin >> temp;
temp--;
s[i].push_back(temp);
}
}
v... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,164 | 841,165 | u255302563 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int s[100][100];
int p[100];
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int r;
cin >> r;
s[i][j] = r - 1;
}
}
for (int i = 0; i < M; i++) {
cin >> p... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int s[100][100];
int p[100];
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int r;
cin >> r;
s[i][j] = r;
}
}
for (int i = 0; i < M; i++) {
cin >> p[i];... | [
"expression.operation.binary.remove"
] | 841,166 | 841,167 | u731665172 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
... | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,170 | 841,171 | u787139585 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, s, n) for (int i = (s); i < (int)n; i++)
int INF = 1e9 + 7;
int N, M;
vector<int> k, p;
vector<vector<int>> s;
int ans = 0;
void dfs(vector<int> v) {
if (v.size() == N) {
bool flag = true;
rep(i, 0,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, s, n) for (int i = (s); i < (int)n; i++)
int INF = 1e9 + 7;
int N, M;
vector<int> k, p;
vector<vector<int>> s;
int ans = 0;
void dfs(vector<int> v) {
if (v.size() == N) {
bool flag = true;
rep(i, 0,... | [
"call.arguments.change"
] | 841,176 | 841,177 | u236658355 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = (int)(n)-1; 0 <= i; i--)
#define rrep1(i, n) for (int i = (int)(n); 1 <= i; i--)
#define each(it, c) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = (int)(n)-1; 0 <= i; i--)
#define rrep1(i, n) for (int i = (int)(n); 1 <= i; i--)
#define each(it, c) ... | [
"expression.operation.binary.remove"
] | 841,178 | 841,179 | u545385408 | cpp |
p03031 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
using l... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
using l... | [
"expression.operation.binary.add"
] | 841,180 | 841,181 | u199808440 | cpp |
p03031 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
using l... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
using l... | [
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 841,182 | 841,181 | u199808440 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,194 | 841,195 | u225474226 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> c(m, vector<int>(n, 0));
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
c.at(i).at(s - 1) = 1;
}
}
vector<int> p(n);
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> c(m, vector<int>(n, 0));
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
c.at(i).at(s - 1) = 1;
}
}
vector<int> p(m);
for ... | [] | 841,196 | 841,197 | u145855676 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define yesno(flg) \
if (flg) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define yesno(flg) \
if (flg) { ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 841,198 | 841,199 | u707053380 | cpp |
p03031 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#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; i >= 0; i--)
#define ALL(v) (v.begin(), v.end(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#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; i >= 0; i--)
#define ALL(v) (v.begin(), v.end(... | [
"call.remove"
] | 841,206 | 841,207 | u459105164 | cpp |
p03031 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,211 | 841,212 | u498141549 | cpp |
p03031 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,213 | 841,214 | u498141549 | cpp |
p03031 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 841,215 | 841,214 | u498141549 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define endl "\n"
using ll = long long;
using P = pair<int, int>;
using mp = map<string, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_std... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define endl "\n"
using ll = long long;
using P = pair<int, int>;
using mp = map<string, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_std... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 841,227 | 841,228 | u358859892 | cpp |
p03031 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size();
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size();
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | [
"control_flow.break.add"
] | 841,231 | 841,232 | u264405855 | cpp |
p03031 | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) \
cout << v[i] << " "
using... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) \
cout << v[i] << " "
using... | [] | 841,235 | 841,236 | u225053756 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<bool>> g(n, vector<bool>(m, false));
rep(i, ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<bool>> g(n, vector<bool>(m, false));
rep(i, ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 841,239 | 841,240 | u454081619 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> vv(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int h;
cin >> h;
vv[i].push_back(--h);
}
}
vector<int> swi(m);
for (auto &x : swi)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> vv(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int h;
cin >> h;
vv[i].push_back(--h);
}
}
vector<int> swi(m);
for (auto &x : swi)... | [
"control_flow.loop.for.condition.change"
] | 841,243 | 841,242 | u595893956 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> vv(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int h;
cin >> h;
vv[i].push_back(--h);
}
}
vector<int> swi(n);
for (auto &x : swi)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> vv(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int h;
cin >> h;
vv[i].push_back(--h);
}
}
vector<int> swi(m);
for (auto &x : swi)... | [
"control_flow.loop.for.condition.change"
] | 841,244 | 841,242 | u595893956 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(N);
rep(i, M) {
int k;
cin >> k;
rep(i, k) {
in... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(N);
rep(i, M) {
int k;
cin >> k;
rep(j, k) {
in... | [] | 841,245 | 841,246 | u826189900 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define INF 1000000000000 // 10^12
#define MOD 10000007 // 10^9+7
template <typename T> string printV... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define INF 1000000000000 // 10^12
#define MOD 10000007 // 10^9+7
template <typename T> string printV... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,247 | 841,248 | u505420467 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
bitset<10> bb;
cin >> n >> m;
vector<bitset<10>> sw(m);
vector<int> p(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int ii = 0; ii < k; ii++) {
int a;
cin >> a;
sw.at(i).set(a - 1);
}
}
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
bitset<10> bb;
cin >> n >> m;
vector<bitset<10>> sw(m);
vector<int> p(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int ii = 0; ii < k; ii++) {
int a;
cin >> a;
sw.at(i).set(a - 1);
}
}
for ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,249 | 841,250 | u119737518 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.