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;
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",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,251 | 841,250 | u119737518 | cpp |
p03031 | #define TST 0
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// for loop
#define F(i, L, R) for (long i = L; i ... | #define TST 0
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// for loop
#define F(i, L, R) for (long i = L; i ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,255 | 841,256 | u177076864 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
vector<int> p(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]--;
}
}
for (int i = 0; i < m;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
vector<int> p(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]--;
}
}
for (int i = 0; i < m;... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,270 | 841,271 | u244626757 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<int>;
#define rep(n) for (int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define gSort(a) sort(a.begin(), a.end(), greater<int>())
#define pout(n, a) cout << fixed << setprecision(n) << (a)
#define Cast(dig, n) s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<int>;
#define rep(n) for (int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define gSort(a) sort(a.begin(), a.end(), greater<int>())
#define pout(n, a) cout << fixed << setprecision(n) << (a)
#define Cast(dig, n) s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,274 | 841,275 | u043377689 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
signed main(void) {
int n, m, cnt, ans;
cin >> n >> m;
vector<int> s[m];
int p[m];
bool ok;
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int st;
cin >> st;
s[i].push_back(st);
}
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
signed main(void) {
int n, m, cnt, ans;
cin >> n >> m;
vector<int> s[m];
int p[m];
bool ok;
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int st;
cin >> st;
s[i].push_back(st);
}
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,278 | 841,279 | u890331732 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
int D1[10] = {};
int D2[100] = {};
int D3[1000] = {};
int main() {
int N, M;
cin >> N >> M;
bool Sk[M][N] = {};
int k, sj;
rep(i, M) {
cin >> k;
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
int D1[10] = {};
int D2[100] = {};
int D3[1000] = {};
int main() {
int N, M;
cin >> N >> M;
bool Sk[M][N] = {};
int k, sj;
rep(i, M) {
cin >> k;
r... | [
"assignment.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change"
] | 841,280 | 841,281 | u494249944 | cpp |
p03031 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T> void cout_vector(vector<T> A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
int main() {
int N, M;
cin >> N >> M;
vector<vecto... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T> void cout_vector(vector<T> A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
int main() {
int N, M;
cin >> N >> M;
vector<vecto... | [
"control_flow.loop.for.condition.change"
] | 841,284 | 841,285 | u879294842 | cpp |
p03031 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T> void cout_vector(vector<T> A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
int main() {
int N, M;
cin >> N >> M;
vector<vecto... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T> void cout_vector(vector<T> A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
int main() {
int N, M;
cin >> N >> M;
vector<vecto... | [
"control_flow.loop.for.condition.change"
] | 841,286 | 841,285 | u879294842 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
REP(i, m) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
REP(i, m) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,287 | 841,288 | u852839243 | cpp |
p03031 | //
// main.cpp
// CoderProj
//
// Created by Minoru Hayashi on 2020/04/04.
// Copyright © 2020 Minoru Hayashi. All rights reserved.
//
// ABC128
//
//
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) b... | //
// main.cpp
// CoderProj
//
// Created by Minoru Hayashi on 2020/04/04.
// Copyright © 2020 Minoru Hayashi. All rights reserved.
//
// ABC128
//
//
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) b... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 841,289 | 841,290 | u671267423 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m, sw[10];
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k;
bitset<10> s;
cin >> k;
for (int j = 0; j < k; j++) {
int sw_tmp;
cin >> sw_tmp;
s.set(sw_tmp - 1);
}
sw[i] = s.to_ulong();
}
int p[2... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m, sw[10];
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k;
bitset<10> s;
cin >> k;
for (int j = 0; j < k; j++) {
int sw_tmp;
cin >> sw_tmp;
s.set(sw_tmp - 1);
}
sw[i] = s.to_ulong();
}
int p[2... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,296 | 841,297 | u576375251 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> light(m);
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
light[i].resize(k); // kore!!!!
cin >> light[i][j];
--light[i][j];
}
}
vecto... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> light(m);
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
light[i].resize(k); // kore!!!!
cin >> light[i][j];
--light[i][j];
}
}
vecto... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,298 | 841,299 | u576375251 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#include <map>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
template <class T> i... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#include <map>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
template <class T> i... | [] | 841,302 | 841,301 | u579355226 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = ve... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,307 | 841,308 | u518042385 | cpp |
p03031 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod =... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod =... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.remove"
] | 841,311 | 841,312 | u986568278 | cpp |
p03031 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[m];
bool s[m][n] = {};
int tmp;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> tmp;
s[i][tmp - 1] = true;
}
}
int p[m];
for (int... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[m];
bool s[m][n] = {};
int tmp;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> tmp;
s[i][tmp - 1] = true;
}
}
int p[m];
for (int... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 841,313 | 841,314 | u568501780 | cpp |
p03031 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[m];
bool s[m][n] = {};
int tmp;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> tmp;
s[i][tmp - 1] = true;
}
}
int p[m];
for (int... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[m];
bool s[m][n] = {};
int tmp;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> tmp;
s[i][tmp - 1] = true;
}
}
int p[m];
for (int... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 841,315 | 841,314 | u568501780 | cpp |
p03031 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
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 s;
cin >> s;
s--;
S[i].push_back(s);
... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
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 s;
cin >> s;
s--;
S[i].push_back(s);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,334 | 841,335 | u119098168 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000001;
constexpr ll INF = 1e18;
constexpr ll MOD = 998244353;
const double PI = 3.1415926535897;
typedef pair<ll, ll> P;
int main() {
int N, M;
cin >> N >> M;
vector<int> S[20];
for (int i = 0; i < M; i++) {
int A;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000001;
constexpr ll INF = 1e18;
constexpr ll MOD = 998244353;
const double PI = 3.1415926535897;
typedef pair<ll, ll> P;
int main() {
int N, M;
cin >> N >> M;
vector<int> S[20];
for (int i = 0; i < M; i++) {
int A;... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change"
] | 841,336 | 841,337 | u322714721 | cpp |
p03031 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
... | [
"assignment.add"
] | 841,342 | 841,343 | u981388291 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int counter_function(int x) {
if (x == 0) {
return 0;
}
return counter_function(x >> 1) + (x & 1);
}
int main() {
int N, M, k, on_switch_cnt, on_light_cnt, all_light;
vector<vector<int>> s;
vector<int> p;
cin >> N >> M;
s.resize(M);
p.resize(M);
f... | #include <bits/stdc++.h>
using namespace std;
int counter_function(int x) {
if (x == 0) {
return 0;
}
return counter_function(x >> 1) + (x & 1);
}
int main() {
int N, M, k, on_switch_cnt, on_light_cnt, all_light;
vector<vector<int>> s;
vector<int> p;
cin >> N >> M;
s.resize(M);
p.resize(M);
f... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,346 | 841,347 | u440276250 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 841,376 | 841,377 | u547754910 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
int convBin(int n) {
int t = 1;
for (int i = 1; i < n; ++i) {
t *= 2;
}
return t;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> switches(n);
vector<int> lights(m);
for (int i = 0; i < m; ++i) {
int cn;
cin >> cn;
int ke... | #include <iostream>
#include <vector>
using namespace std;
int convBin(int n) {
int t = 1;
for (int i = 1; i < n; ++i) {
t *= 2;
}
return t;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> switches(n);
vector<int> lights(m);
for (int i = 0; i < m; ++i) {
int cn;
cin >> cn;
int ke... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,378 | 841,379 | u469612749 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int n, m, cnt = 0;
int k[12], p[12], s[12][12], ison[12];
void solve(int num) {
if (num <= n) {
ison[num] = 1;
solve(num + 1);
ison[num] = 0;
solve(num + 1);
} else {
for (int i = 0; i < m; ++i) {
int oncnt = 0;
for (int j = 0; j < k[i]... | #include <bits/stdc++.h>
using namespace std;
int n, m, cnt = 0;
int k[12], p[12], s[12][12], ison[12];
void solve(int num) {
if (num <= n) {
ison[num] = 1;
solve(num + 1);
ison[num] = 0;
solve(num + 1);
} else {
for (int i = 0; i < m; ++i) {
int oncnt = 0;
for (int j = 0; j < k[i]... | [
"control_flow.branch.if.condition.change"
] | 841,388 | 841,389 | u314988220 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | [
"call.add"
] | 841,394 | 841,395 | u127768253 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | [
"call.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 841,397 | 841,395 | u127768253 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, s_, ans = 0;
cin >> n >> m;
int s[m] = {0}, p[m] = {0};
for (int i = 0; i < m; ++i) {
cin >> k;
for (int j = 0; j < k; ++j) {
cin >> s_;
s[i] += pow(2, s_ - 1);
}
}
for (int i = 0; i < m; ++i) {
cin >> p[i];... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, s_, ans = 0;
cin >> n >> m;
int s[m] = {0}, p[m] = {0};
for (int i = 0; i < m; ++i) {
cin >> k;
for (int j = 0; j < k; ++j) {
cin >> s_;
s[i] += pow(2, s_ - 1);
}
}
for (int i = 0; i < m; ++i) {
cin >> p[i];... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,398 | 841,399 | u021083776 | cpp |
p03031 | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M;
cin >> N >> M;
long long res = 0;
int a[M + 7][N + 7];
for (int i = 0; i < M; i++) {
int k;
cin >> k;
a[i][0] = k;
for (int j = 1; j <= k; j++) {
cin >> a[i][j];
}
}
int b[M + 1];
for (int i = 0; i < M; i+... | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M;
cin >> N >> M;
long long res = 0;
int a[M + 7][N + 7];
for (int i = 0; i < M; i++) {
int k;
cin >> k;
a[i][0] = k;
for (int j = 1; j <= k; j++) {
cin >> a[i][j];
}
}
int b[M + 1];
for (int i = 0; i < M; i+... | [
"identifier.change",
"expression.operation.binary.change"
] | 841,408 | 841,409 | u466568754 | cpp |
p03031 | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M;
cin >> N >> M;
int res = 0;
int a[M + 7][N + 7];
for (int i = 0; i < M; i++) {
int k;
cin >> k;
a[i][0] = k;
for (int j = 1; j <= k; j++) {
cin >> a[i][j];
}
}
int b[M + 1];
for (int i = 0; i < M; i++) {
... | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M;
cin >> N >> M;
long long res = 0;
int a[M + 7][N + 7];
for (int i = 0; i < M; i++) {
int k;
cin >> k;
a[i][0] = k;
for (int j = 1; j <= k; j++) {
cin >> a[i][j];
}
}
int b[M + 1];
for (int i = 0; i < M; i+... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"expression.operation.binary.change"
] | 841,410 | 841,409 | u466568754 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define INF (1ll << 60)
typedef long long lint;
const lint MOD = 1000000007;
int main() {
lint N, M, ans... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define INF (1ll << 60)
typedef long long lint;
const lint MOD = 1000000007;
int main() {
lint N, M, ans... | [
"assignment.add"
] | 841,411 | 841,412 | u768204022 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<ll> switches(M);
rep(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<ll> switches(M);
rep(... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,427 | 841,428 | u979920726 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 99999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end())... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 99999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end())... | [] | 841,431 | 841,432 | u618604643 | cpp |
p03031 | #include <bits/stdc++.h>
/**
||||||||||||| ||||| ||||| ||||||||||
|||||||||||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| |||||
|||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
... | #include <bits/stdc++.h>
/**
||||||||||||| ||||| ||||| ||||||||||
|||||||||||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| |||||
|||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,437 | 841,438 | u129611452 | cpp |
p03031 | #include <bits/stdc++.h>
/**
||||||||||||| ||||| ||||| ||||||||||
|||||||||||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| |||||
|||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
... | #include <bits/stdc++.h>
/**
||||||||||||| ||||| ||||| ||||||||||
|||||||||||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| |||||
|||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
... | [
"control_flow.return.add",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,439 | 841,438 | u129611452 | cpp |
p03031 | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
... | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
... | [
"literal.number.change",
"call.arguments.change"
] | 841,449 | 841,450 | u475546258 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
vector<int> binaryConvert(int x, int digit) {
vector<int> binary(1);
while (x > 0) {
binary.insert(binary.begin(), x % 2);
x = x / 2;
}
binary.pop_back();
while (binary.size() < digit) {
binary.insert(binary.begin(), 0);
}
return... | #include <iostream>
#include <vector>
using namespace std;
vector<int> binaryConvert(int x, int digit) {
vector<int> binary(1);
while (x > 0) {
binary.insert(binary.begin(), x % 2);
x = x / 2;
}
binary.pop_back();
while (binary.size() < digit) {
binary.insert(binary.begin(), 0);
}
return... | [
"variable_declaration.add",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,458 | 841,459 | u580631296 | cpp |
p03031 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define INF 1e9
#define MOD 1000000007
#define All(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
REP(i, M) {
int k;
cin >> k;
REP(j, k) ... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define INF 1e9
#define MOD 1000000007
#define All(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
REP(i, M) {
int k;
cin >> k;
REP(j, k) ... | [] | 841,471 | 841,472 | u144980750 | cpp |
p03031 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 841,484 | 841,485 | u548768105 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, m, s = 0;
cin >> n >> m;
vector<vector<int>> v(m);
vector<int> p(m);
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int r;
cin >> r;
v[i].push_back(r);
}
}
rep(i, m)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, m, s = 0;
cin >> n >> m;
vector<vector<int>> v(m);
vector<int> p(m);
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int r;
cin >> r;
v[i].push_back(r - 1);
}
}
rep(i... | [
"expression.operation.binary.add"
] | 841,488 | 841,489 | u757584836 | cpp |
p03031 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_back
#define P pair<int, int>
#define ... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_back
#define P pair<int, int>
#define ... | [
"control_flow.branch.if.condition.change"
] | 841,490 | 841,491 | u341406884 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <typename T> void view(T cont) { std::cout << cont << std::endl; }
template <typename T> void view(T *cont, ll sz) {
rep(i, sz) std::cout << cont[i] << " ";
std::cout << std::endl;
}
temp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <typename T> void view(T cont) { std::cout << cont << std::endl; }
template <typename T> void view(T *cont, ll sz) {
rep(i, sz) std::cout << cont[i] << " ";
std::cout << std::endl;
}
temp... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 841,496 | 841,497 | u998880072 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod = 1e9 + 7;
stati... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod = 1e9 + 7;
stati... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 841,500 | 841,501 | u698883164 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod = 1e9 + 7;
stati... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod = 1e9 + 7;
stati... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 841,502 | 841,501 | u698883164 | 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, k;
cin >> n >> m;
vector<bitset<10>> a(m);
vector<int> c(m);
rep(i, m) {
cin >> k;
int b;
bitset<10> bs;
rep(j, k) {
cin >> b;
bs.set(b);
}
a[i] = bs;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m, k;
cin >> n >> m;
vector<bitset<10>> a(m);
vector<int> c(m);
rep(i, m) {
cin >> k;
int b;
bitset<10> bs;
rep(j, k) {
cin >> b;
bs.set(b - 1);
}
a[i] = b... | [
"expression.operation.binary.add"
] | 841,505 | 841,506 | u983711104 | cpp |
p03031 | #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 drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, i... | #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 drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, i... | [
"variable_declaration.type.change",
"misc.typo",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 841,511 | 841,512 | u115838990 | 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);
vector<int> P(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
S[i].push_back(s);
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(M);
vector<int> P(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
S[i].push_back(s);
}
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,517 | 841,518 | u278057806 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned 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].emplace_back(a);
}
}
vector<int> p(m);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned 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].emplace_back(a);
}
}
vector<int> p(m);
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,523 | 841,524 | u519194615 | cpp |
p03031 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 841,529 | 841,530 | u438265890 | cpp |
p03031 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | [
"expression.operation.binary.remove"
] | 841,531 | 841,530 | u438265890 | cpp |
p03031 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | [
"expression.operation.binary.remove"
] | 841,532 | 841,530 | u438265890 | cpp |
p03031 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | [
"expression.operation.binary.remove"
] | 841,533 | 841,530 | u438265890 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> sw(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
vector<int> s(k);
for (int j = 0; j < k; j++)
cin >> s[j];
sw[i] = s;
}
vector<int> p(m);
for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> sw(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
vector<int> s(k);
for (int j = 0; j < k; j++)
cin >> s[j];
sw[i] = s;
}
vector<int> p(m);
for (... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,538 | 841,537 | u331197998 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define rd(x) scanf("%d", &x)
#define rd2(x, y) scanf("%d %d", &x, &y)
#define rd3(x, y, z) scanf("%d %d %d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define rd(x) scanf("%d", &x)
#define rd2(x, y) scanf("%d %d", &x, &y)
#define rd3(x, y, z) scanf("%d %d %d... | [
"identifier.change",
"call.arguments.change"
] | 841,544 | 841,545 | u431615124 | cpp |
p03031 | #include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> light(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
light[i].push_back(a);
... | #include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> light(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
light[i].push_back(a);
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 841,555 | 841,556 | u813559924 | cpp |
p03031 | #include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> light(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
light[i].push_back(a);
... | #include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> light(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
light[i].push_back(a);
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,557 | 841,556 | u813559924 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define ALL(a... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define ALL(a... | [] | 841,558 | 841,559 | u761582382 | 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;
cin >> n >> m;
vector<int> k(m), p(m);
vector<vector<int>> s(m, vector<int>(n));
rep(i, m) {
cin >> k[i];
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, m) cin >> p[i];
int cnt2 = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m), p(m);
vector<vector<int>> s(m, vector<int>(n));
rep(i, m) {
cin >> k[i];
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, m) cin >> p[i];
int cnt2 = 0;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 841,560 | 841,561 | u928712536 | cpp |
p03031 | #include <assert.h>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <limits>
#include <math.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 yesno(flg) \
if (flg) { ... | #include <assert.h>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <limits>
#include <math.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 yesno(flg) \
if (flg) { ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,564 | 841,565 | u591824072 | cpp |
p03031 | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define deb(x) cout << #x << " = " << x << "\n";
#define F first
#define S second
signed main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
/**********************************... | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define deb(x) cout << #x << " = " << x << "\n";
#define F first
#define S second
signed main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
/**********************************... | [] | 841,566 | 841,567 | u193862001 | cpp |
p03031 | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define deb(x) cout << #x << " = " << x << "\n";
#define F first
#define S second
signed main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
/**********************************... | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define deb(x) cout << #x << " = " << x << "\n";
#define F first
#define S second
signed main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
/**********************************... | [] | 841,566 | 841,568 | u193862001 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m);
int ss;
vector<int> p(m);
int bit = 0;
int i, j;
for (i = 0; i < m; i++) {
cin >> k[i];
for (j = 0; j < k[i]; j++) {
cin >> ss;
s[i].push_back(ss);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m);
int ss;
vector<int> p(m);
int bit = 0;
int i, j;
for (i = 0; i < m; i++) {
cin >> k[i];
for (j = 0; j < k[i]; j++) {
cin >> ss;
s[i].push_back(ss);
}
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 841,575 | 841,576 | u523698212 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int N, M;
int main() {
cin >> N >> M;
vector<int> lst[M];
rep(i, M) {
int k;
cin >> k;
rep(j, k) {
int s;
cin >> s;
lst[i].push_back(s);
}
}
vector<int> P(N, 0... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int N, M;
int main() {
cin >> N >> M;
vector<int> lst[M];
rep(i, M) {
int k;
cin >> k;
rep(j, k) {
int s;
cin >> s;
lst[i].push_back(s);
}
}
vector<int> P(M, 0... | [
"identifier.change",
"call.arguments.change"
] | 841,579 | 841,580 | u480887263 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
rep(i, m) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
s[i].push_back(a - 1);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
rep(i, m) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
s[i].push_back(a - 1);
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change"
] | 841,593 | 841,594 | u981304949 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 841,599 | 841,600 | u917049698 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> adj[m + 5];
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
adj[i].push_back(a);
}
}
int frr[m + 5];
for (int i = 0; i < m; i++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> adj[m + 5];
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
adj[i].push_back(a);
}
}
int frr[m + 5];
for (int i = 0; i < m; i++)
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,605 | 841,606 | u837843177 | cpp |
p03031 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pai... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pai... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,613 | 841,614 | u744305661 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
cin >> a >> b;
int y = 0;
vector<vector<int>> d(b);
for (int i = 0; i < b; i++) {
int z;
cin >> z;
int k = 0;
for (int j = 0; j < z; j++) {
int rrr;
cin >> rrr;
d.at(i).push_back(rrr);
}
}
vec... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
cin >> a >> b;
int y = 0;
vector<vector<int>> d(b);
for (int i = 0; i < b; i++) {
int z;
cin >> z;
int k = 0;
for (int j = 0; j < z; j++) {
int rrr;
cin >> rrr;
d.at(i).push_back(rrr - 1);
}
}
... | [
"expression.operation.binary.add"
] | 841,618 | 841,619 | u577774192 | cpp |
p03031 | #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 + 1); ++i)
using namespace std;
using ll = long long;
const int INF = -100100100;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m, vector<int>(n));
vector<i... | #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 + 1); ++i)
using namespace std;
using ll = long long;
const int INF = -100100100;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m, vector<int>(n));
vector<i... | [
"expression.operation.binary.add"
] | 841,629 | 841,630 | u412659798 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int count_bit(int chk_bit, int bit_num) {
int count = 0;
for (int i = 0; i < bit_num; i++) {
if (chk_bit & (1 << i))
count++;
}
return count;
}
int main(void) {
int N, M = 0;
int pa... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int count_bit(int chk_bit, int bit_num) {
int count = 0;
for (int i = 0; i < bit_num; i++) {
if (chk_bit & (1 << i))
count++;
}
return count;
}
int main(void) {
int N, M = 0;
int pa... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,631 | 841,632 | u942653486 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> b(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int i = 0; i < k; i++) {
int s;
cin >> s;
b[i].push_back(s);
}
}
vector<int> p(m);
for (int i = 0; i < m... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> b(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
b[i].push_back(s);
}
}
vector<int> p(m);
for (int i = 0; i < m... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,635 | 841,636 | u185967517 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int to[12][12];
int p[12];
bool switch1[12];
int connect[12];
int cnt = 0;
int N, M;
void count() { // switchの状態の数をすべて試したとき、いくつの電球がついているのかをしらべる
for (int i = 1; i <= M; i++) {
connect[i] = 0;
}
... | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int to[12][12];
int p[12];
bool switch1[12];
int connect[12];
int cnt = 0;
int N, M;
void count() { // switchの状態の数をすべて試したとき、いくつの電球がついているのかをしらべる
for (int i = 1; i <= M; i++) {
connect[i] = 0;
}
... | [
"call.add"
] | 841,644 | 841,645 | u904123392 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define INIT(a, n, x) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define INIT(a, n, x) ... | [
"expression.unary.arithmetic.add"
] | 841,649 | 841,650 | u168017191 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int N, M;
vector<vector<int>> S;
vector<int> P;
vector<bool> isOn;
int rec(int n) {
if (n == 0) { // すべて条件を満たしているか判定を行う
int ok = 1;
for (int i = 0; i < M; i++) {
int cnt = 0;
for (int j : S[i]) {
if (isOn[j])
cnt++;
}
if... | #include <bits/stdc++.h>
using namespace std;
int N, M;
vector<vector<int>> S;
vector<int> P;
vector<bool> isOn;
int rec(int n) {
if (n == 0) { // すべて条件を満たしているか判定を行う
int ok = 1;
for (int i = 0; i < M; i++) {
int cnt = 0;
for (int j : S[i]) {
if (isOn[j])
cnt++;
}
if... | [
"expression.operation.binary.add"
] | 841,651 | 841,652 | u271063202 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define INF (1LL << 50)
#define MOD 1000000007
int k[11];
int p[11];
int s[11][11];
int N[11];
// 数字をスイッチに変換(Nbit) N[0]は使わない
void num2switch(int i) {
int j = 1;
while (i) {
if (i % 2 == 1) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define INF (1LL << 50)
#define MOD 1000000007
int k[11];
int p[11];
int s[11][11];
int N[11];
// 数字をスイッチに変換(Nbit) N[0]は使わない
void num2switch(int i) {
int j = 1;
while (i) {
if (i % 2 == 1) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,659 | 841,660 | u870092796 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 3;
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
const int inf = 1e9;
int n, m, a[N], k, q, u, v, x, y, tc, c, l, r, ans, sz[N], b[N];
char s[N];
vector<int>... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 3;
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
const int inf = 1e9;
int n, m, a[N], k, q, u, v, x, y, tc, c, l, r, ans, sz[N], b[N];
char s[N];
vector<int>... | [
"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,675 | 841,676 | u318875010 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> a(m);
for (int i = 0; i < m; i++) {
int s;
cin >> s;
a[i].resize(s);
for (int j = 0; j < s; j++)
cin >> a[i][j];
}
vector<int> p(m);
vector<int> s(n);
for (int i = 0; i < m; i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> a(m);
for (int i = 0; i < m; i++) {
int s;
cin >> s;
a[i].resize(s);
for (int j = 0; j < s; j++)
cin >> a[i][j];
}
vector<int> p(m);
vector<int> s(n);
for (int i = 0; i < m; i++)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,688 | 841,689 | u161616073 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define rep2(i, N) for (int i = 1; i <= N; i++)
using namespace std;
long long INF = 1e18;
long long mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> light(m);
rep(l, m) {
int k;
cin >> k;
rep(i, k) {
... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define rep2(i, N) for (int i = 1; i <= N; i++)
using namespace std;
long long INF = 1e18;
long long mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> light(m);
rep(l, m) {
int k;
cin >> k;
rep(i, k) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,692 | 841,693 | u120564432 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define s(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
int n, m;
cin >> n >> m;
vector<vl> a(m);
rep(i, m) {
... | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define s(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
int n, m;
cin >> n >> m;
vector<vl> a(m);
rep(i, m) {
... | [
"expression.unary.arithmetic.add"
] | 841,694 | 841,695 | u495881622 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define s(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
int n, m;
cin >> n >> m;
vector<vl> a(m);
rep(i, m) {
... | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define s(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
int n, m;
cin >> n >> m;
vector<vl> a(m);
rep(i, m) {
... | [
"expression.unary.arithmetic.add",
"identifier.change",
"variable_access.subscript.index.change"
] | 841,696 | 841,695 | u495881622 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
using ll = long long;
using vll = vector<ll>;
int main() {
//入力
ll N, M;
cin >> N >> M;
vector<vector<ll>> s(M);
rep(i, M) {
ll k;
cin >> k;
rep(j, k) {
ll a;
cin >> a;
s[i].push_back(a);
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
using ll = long long;
using vll = vector<ll>;
int main() {
//入力
ll N, M;
cin >> N >> M;
vector<vector<ll>> s(M);
rep(i, M) {
ll k;
cin >> k;
rep(j, k) {
ll a;
cin >> a;
a--;
s[i].pus... | [
"expression.unary.arithmetic.add"
] | 841,697 | 841,698 | u615178274 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Welcome to my source code!
int main() {
int n, m;
cin >> n >> m;
int k[m], s[m][10], p[m];
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 >> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Welcome to my source code!
int main() {
int n, m;
cin >> n >> m;
int k[m], s[m][10], p[m];
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 >> ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 841,699 | 841,700 | u440217234 | cpp |
p03031 | #include "bits/stdc++.h"
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long l... | #include "bits/stdc++.h"
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long l... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,714 | 841,715 | u564412651 | cpp |
p03031 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 841,726 | 841,727 | u726501606 | cpp |
p03031 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 841,728 | 841,727 | u726501606 | cpp |
p03031 | #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 irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(V,... | #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 irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(V,... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,736 | 841,737 | u020746846 | cpp |
p03031 | #include <bits/stdc++.h>
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define INF 1145141919
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reprev(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define Flag(x) (1 << (x))
#define Flagcount(x) __built... | #include <bits/stdc++.h>
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define INF 1145141919
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reprev(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define Flag(x) (1 << (x))
#define Flagcount(x) __built... | [
"assignment.add"
] | 841,740 | 841,741 | u601444374 | cpp |
p03031 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
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];
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
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];
... | [
"control_flow.branch.if.condition.change"
] | 841,742 | 841,743 | u835561357 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vpll = vector<pll>;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vpll = vector<pll>;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 841,760 | 841,761 | u666721654 | cpp |
p03031 | #include <bits/stdc++.h>
#define endl '\n'
#define INF (1 << 21)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
const int MOD = 1000000009;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
int k[15];
int s[15][15];
int p[15];
... | #include <bits/stdc++.h>
#define endl '\n'
#define INF (1 << 21)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
const int MOD = 1000000009;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
int k[15];
int s[15][15];
int p[15];
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,770 | 841,771 | u188534680 | cpp |
p03031 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M, vector<int>(N));
vector<int> p(M);
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; ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M, vector<int>(N));
vector<int> p(M);
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; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,785 | 841,786 | u096717230 | cpp |
p03031 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M, vector<int>(N));
vector<int> p(M);
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; ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M, vector<int>(N));
vector<int> p(M);
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; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,787 | 841,786 | u096717230 | cpp |
p03031 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define sc second
#define ALL(x) x.begin(), x.end()
#define RALL(X) x.begin(), x.end()
#define FOR(i, n, k) for (i = 0; i < n; i += k)
#define FO(i, n, k) for (i = 1; i <= n; i += k)
#define CLEAR(a, b) memset... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define sc second
#define ALL(x) x.begin(), x.end()
#define RALL(X) x.begin(), x.end()
#define FOR(i, n, k) for (i = 0; i < n; i += k)
#define FO(i, n, k) for (i = 1; i <= n; i += k)
#define CLEAR(a, b) memset... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,788 | 841,789 | u724515098 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(n);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#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... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 841,792 | 841,793 | u231458241 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(n);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#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... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 841,794 | 841,793 | u231458241 | cpp |
p03031 | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef vector<pair<int, int>> vpi;
int n, m;
vvi v;... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef vector<pair<int, int>> vpi;
int n, m;
vvi v;... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,802 | 841,803 | u519883882 | cpp |
p03031 | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef vector<pair<int, int>> vpi;
int n, m;
vvi v;... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef vector<pair<int, int>> vpi;
int n, m;
vvi v;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,802 | 841,804 | u519883882 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
int k[M];
int s[M][N];
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
s[i][j] = 0;
}
}
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
int k[M];
int s[M][N];
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
s[i][j] = 0;
}
}
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,805 | 841,806 | u995725911 | cpp |
p03031 | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = (a), i##Len_ = (b); i < i##Len_; i++)
//参考
// http://drken1215.hatenablog.com/entry/2019/06/15/135300
int main() {
ll N, M, res;
cin >> N >> M;
vect... | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = (a), i##Len_ = (b); i < i##Len_; i++)
//参考
// http://drken1215.hatenablog.com/entry/2019/06/15/135300
int main() {
ll N, M, res;
cin >> N >> M;
vect... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 841,811 | 841,812 | u485731913 | cpp |
p03031 | #include <iostream>
#include <vector>
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);
... | #include <iostream>
#include <vector>
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);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,813 | 841,814 | u633402865 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
auto k = vector<int>(m);
auto s = vector<vector<int>>(m);
auto p = vector<int>(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
f... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
auto k = vector<int>(m);
auto s = vector<vector<int>>(m);
auto p = vector<int>(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
f... | [
"assignment.change"
] | 841,819 | 841,820 | u855985627 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.