problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03112 |
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... |
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 927,021 | 927,022 | u935586669 | cpp |
p03112 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 927,023 | 927,024 | u838742270 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
long long A, B, Q, s[100005], t[100005];
inline long long calc(long long t1, long long t2, long long x) {
if (t1 > A || t2 > B || t1 < 1 || t2 < 1)
return 0x7f7f7f7f7f7f7f7f;
long long S = s[t1], T = t[t2];
if (S >= x && T >= x)
return max(S, T) - x;
if ((... | #include <bits/stdc++.h>
using namespace std;
long long A, B, Q, s[100005], t[100005];
inline long long calc(long long t1, long long t2, long long x) {
if (t1 > A || t2 > B || t1 < 1 || t2 < 1)
return 0x7f7f7f7f7f7f7f7f;
long long S = s[t1], T = t[t2];
if (S >= x && T >= x)
return max(S, T) - x;
if ((... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 927,035 | 927,036 | u595327860 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 5;
const ll INF = 1e18 + 7;
ll a[maxn], b[maxn];
int main() {
int n, m, t;
scanf("%d%d%d", &n, &m, &t);
for (int q = 0; q < n; q++)
scanf("%lld", &a[q]);
for (int q = 0; q < m; q++)
sca... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 5;
const ll INF = 1e18 + 7;
ll a[maxn], b[maxn];
int main() {
int n, m, t;
scanf("%d%d%d", &n, &m, &t);
for (int q = 0; q < n; q++)
scanf("%lld", &a[q]);
for (int q = 0; q < m; q++)
sca... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 927,037 | 927,038 | u999919716 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 5;
const int INF = 1e18 + 7;
ll a[maxn], b[maxn];
int main() {
int n, m, t;
scanf("%d%d%d", &n, &m, &t);
for (int q = 0; q < n; q++)
scanf("%lld", &a[q]);
for (int q = 0; q < m; q++)
sc... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 5;
const ll INF = 1e18 + 7;
ll a[maxn], b[maxn];
int main() {
int n, m, t;
scanf("%d%d%d", &n, &m, &t);
for (int q = 0; q < n; q++)
scanf("%lld", &a[q]);
for (int q = 0; q < m; q++)
sca... | [
"variable_declaration.type.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 927,039 | 927,038 | u999919716 | cpp |
p03112 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e6 + 10;
ll a, b, q, s[N], t[N];
ll ans, ans1, ans2, ans3, ans4, ans5, ans6;
ll l1, r1, l2, r2, tmp, p;
int main() {
cin >> a >> b >> q;
for (int i = 1; i <= a; i++) {
cin >> s[i];
}
for... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e6 + 10;
ll a, b, q, s[N], t[N];
ll ans, ans1, ans2, ans3, ans4, ans5, ans6;
ll l1, r1, l2, r2, tmp, p;
int main() {
cin >> a >> b >> q;
for (int i = 1; i <= a; i++) {
cin >> s[i];
}
for... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 927,042 | 927,041 | u385530810 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ALL_OF(x) (x).begin(), (x).end()
#define RE... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ALL_OF(x) (x).begin(), (x).end()
#define RE... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 927,043 | 927,044 | u653187094 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<ll, ll>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int main() {
int A, B,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<ll, ll>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int main() {
int A, B,... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 927,045 | 927,046 | u482544950 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, q;
cin >> n >> m >> q;
vector<long long> s(n), t(m);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < m; i++)
cin >> t[i];
while (q--) {
long long x;
cin >> x;
lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, q;
cin >> n >> m >> q;
vector<long long> s(n), t(m);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < m; i++)
cin >> t[i];
while (q--) {
long long x;
cin >> x;
lo... | [
"assignment.change"
] | 927,051 | 927,052 | u846041485 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define trace1(x... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define trace1(x... | [
"variable_declaration.remove",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 927,053 | 927,054 | u629449150 | cpp |
p03112 | #include <algorithm>
#include <stdio.h>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, k, a, b, q, x;
scanf("%lld%lld%lld", &a, &b, &q);
ll s[a], t[b];
for (i = 0; i < a; ++i)
scanf("%lld", &s[i]);
for (i = 0; i < b; ++i)
scanf("%lld", &t[i]);
for (i = 0; i < q; ++i) {
sca... | #include <algorithm>
#include <stdio.h>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, k, a, b, q, x;
scanf("%lld%lld%lld", &a, &b, &q);
ll s[a], t[b];
for (i = 0; i < a; ++i)
scanf("%lld", &s[i]);
for (i = 0; i < b; ++i)
scanf("%lld", &t[i]);
for (i = 0; i < q; ++i) {
sca... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 927,055 | 927,056 | u440920318 | cpp |
p03112 | #include <algorithm>
#include <stdio.h>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, k, a, b, q, x;
scanf("%lld%lld%lld", &a, &b, &q);
ll s[a], t[b];
for (i = 0; i < a; ++i)
scanf("%lld", &s[i]);
for (i = 0; i < b; ++i)
scanf("%lld", &t[i]);
for (i = 0; i < q; ++i) {
sca... | #include <algorithm>
#include <stdio.h>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, k, a, b, q, x;
scanf("%lld%lld%lld", &a, &b, &q);
ll s[a], t[b];
for (i = 0; i < a; ++i)
scanf("%lld", &s[i]);
for (i = 0; i < b; ++i)
scanf("%lld", &t[i]);
for (i = 0; i < q; ++i) {
sca... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 927,057 | 927,056 | u440920318 | cpp |
p03112 | /*
Author: yww
Language: C++
Mail: weeerrr720@qq.com
*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using names... | /*
Author: yww
Language: C++
Mail: weeerrr720@qq.com
*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using names... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 927,058 | 927,059 | u818138537 | cpp |
p03112 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9 + 7)
//#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
else
return c + i_7;
}
typedef pair<ll, ll> l_l;
ll inf = (ll)1E17;
#define rep(i, l, r) for (ll i = l; i <= r; i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9 + 7)
//#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
else
return c + i_7;
}
typedef pair<ll, ll> l_l;
ll inf = (ll)1E17;
#define rep(i, l, r) for (ll i = l; i <= r; i++... | [
"assignment.change"
] | 927,065 | 927,066 | u763881112 | cpp |
p03126 | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 927,114 | 927,115 | u526639495 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int cnt[m];
for (int i = 0; i < n; i++) {
int k = 0;
cin >> k;
for (int j = 0; j < k; j++) {
int tp;
cin >> tp;
cnt[tp - 1]++;
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
if (cnt[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int cnt[m] = {0};
for (int i = 0; i < n; i++) {
int k = 0;
cin >> k;
for (int j = 0; j < k; j++) {
int tp;
cin >> tp;
cnt[tp - 1]++;
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
if... | [
"variable_declaration.value.change"
] | 927,146 | 927,147 | u739489568 | cpp |
p03126 | #include <algorithm>
#include <iostream>
using namespace std;
int h[100];
int main() {
int n, m, a, k, c = 0, i, j;
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> k;
for (j = 0; j < k; j++) {
cin >> a;
h[a]++;
}
}
for (i = 1; i < m; i++)
if (h[i] == n)
c++;
cout << c;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int h[100];
int main() {
int n, m, a, k, c = 0, i, j;
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> k;
for (j = 0; j < k; j++) {
cin >> a;
h[a]++;
}
}
for (i = 1; i <= m; i++)
if (h[i] == n)
c++;
cout << c;
}... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 927,160 | 927,161 | u597079106 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> cnt(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
cnt.at(a - 1)++;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> cnt(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
cnt[a - 1]++;
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
if (c... | [
"call.remove",
"call.arguments.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 927,167 | 927,168 | u602252807 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> v(M);
for (int X = 0; X < N; X++) {
int K;
cin >> K;
for (int Y = 0; Y < K; Y++) {
int H;
cin >> H;
v[H - 1]++;
}
}
int G = 0;
for (int X = 0; X < M; X++) {
if (v[X] == M)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> v(M);
for (int X = 0; X < N; X++) {
int K;
cin >> K;
for (int Y = 0; Y < K; Y++) {
int H;
cin >> H;
v[H - 1]++;
}
}
int G = 0;
for (int X = 0; X < M; X++) {
if (v[X] == N)... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 927,191 | 927,192 | u740002394 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> cnt(M);
for (int i = 0; i < N; i++) {
int K;
cin >> K;
for (int j = 0; j < K; j++) {
int A;
cin >> A;
cnt[A]++;
}
}
int ans = 0;
for (int i = 0; i < M; i++) {
if (cnt[i] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> cnt(M);
for (int i = 0; i < N; i++) {
int K;
cin >> K;
for (int j = 0; j < K; j++) {
int A;
cin >> A;
cnt[A - 1]++;
}
}
int ans = 0;
for (int i = 0; i < M; i++) {
if (cnt[... | [
"expression.operation.binary.add"
] | 927,193 | 927,194 | u237390401 | cpp |
p03126 | #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 rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;... | #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 rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;... | [
"expression.operation.binary.add"
] | 927,230 | 927,231 | u981759938 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, a, ans = 0;
vector<int> a_sum(31, 0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
a_sum[a]++;
}
}
for (int i = 0; i < m; i++) {
if (a_sum[i] == m)
an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, a, ans = 0;
vector<int> a_sum(31, 0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
a_sum[a]++;
}
}
for (int i = 1; i <= m; i++) {
if (a_sum[i] == n)
a... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condit... | 927,245 | 927,246 | u652660628 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int K, tmp, A[M], res = 0;
for (int h = 0; h < M; h++) {
A[h] = 0;
}
for (int i = 0; i < N; i++) {
cin >> K;
for (int j = 0; j < K; j++) {
cin >> tmp;
A[tmp]++;
}
}
for (int h = 0; h < M; h+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int K, tmp, A[M], res = 0;
for (int h = 0; h < M; h++) {
A[h] = 0;
}
for (int i = 0; i < N; i++) {
cin >> K;
for (int j = 0; j < K; j++) {
cin >> tmp;
A[tmp - 1]++;
}
}
for (int h = 0; h < M... | [
"expression.operation.binary.add"
] | 927,247 | 927,248 | u410888565 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, m, n) for (int i = m; i < n; i++)
ll mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
int c[n];
rep(i, 0, n) c[i] = 0;
rep(i, 0, m) {
int k;
cin >> k;
rep(j, 0, k) {
int a;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, m, n) for (int i = m; i < n; i++)
ll mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
int c[m];
rep(i, 0, m) c[i] = 0;
rep(i, 0, n) {
int k;
cin >> k;
rep(j, 0, k) {
int a;
... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 927,249 | 927,250 | u356701928 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, n) for (ll i = 0; i <= n; i++)
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
c... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, n) for (ll i = 0; i <= n; i++)
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
c... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 927,282 | 927,283 | u575664976 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int a[50];
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int ia;
cin >> ia;
a[ia]++;
}
}
int ans = 0;
for (int i... | #include <bits/stdc++.h>
using namespace std;
int a[50];
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int ia;
cin >> ia;
a[ia]++;
}
}
int ans = 0;
for (int i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 927,321 | 927,322 | u288035794 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M, 0);
rep(i, N) {
int K;
cin >> K;
rep(j, K) {
int k;
cin >> k;
a[k]++;
}
}
int ans = 0;
rep(i, M) {
if (a[i] == N... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M, 0);
rep(i, N) {
int K;
cin >> K;
rep(j, K) {
int k;
cin >> k;
a[k - 1]++;
}
}
int ans = 0;
rep(i, M) {
if (a[i] ... | [
"expression.operation.binary.add"
] | 927,337 | 927,338 | u914707890 | cpp |
p03126 | #include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
int a[100];
int main() {
int n, m, i, j, k, br = 0, x;
cin >> n >> m;
for (i = 0; i < n; i++)
cin >> k;
for (j = 0; j < k; j++) {
cin >> x;
a[x]++;
}
for (i = 1; i <= m; i++)
if (a[i] == n)
br++;
cout ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
int a[100];
int main() {
int n, m, i, j, k, br = 0, x;
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> k;
for (j = 0; j < k; j++) {
cin >> x;
a[x]++;
}
}
for (i = 1; i <= m; i++)
if (a[i] == n)
... | [] | 927,347 | 927,348 | u746310630 | cpp |
p03126 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
#define out(a) cout << (a) << endl
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> vec(m);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
f... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
#define out(a) cout << (a) << endl
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> vec(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
... | [
"call.arguments.add"
] | 927,349 | 927,350 | u654949547 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vdo = vector<double>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vvdo = vector<vector<double>>;
using vstr = vector<string>;
using vvstr = vector<vector<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vdo = vector<double>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vvdo = vector<vector<double>>;
using vstr = vector<string>;
using vvstr = vector<vector<... | [
"expression.operation.binary.add"
] | 927,370 | 927,371 | u919867411 | cpp |
p03126 | #include <iostream>
using namespace std;
int main() {
int a, b, x[30][30], y[30], p = 0, o = 0;
cin >> a >> b;
for (int i = 0; i < a; i++) {
cin >> y[i];
for (int j = 0; j < y[i]; j++) {
cin >> x[i][j];
}
}
for (int i = 1; i <= b; i++) {
for (int j = 0; j < a; j++) {
for (int l = 0... | #include <iostream>
using namespace std;
int main() {
int a, b, x[30][30], y[30], p = 0, o = 0;
cin >> a >> b;
for (int i = 0; i < a; i++) {
cin >> y[i];
for (int j = 0; j < y[i]; j++) {
cin >> x[i][j];
}
}
for (int i = 1; i <= b; i++) {
for (int j = 0; j < a; j++) {
for (int l = 0... | [] | 927,397 | 927,398 | u407213771 | cpp |
p03126 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int like[m];
for (int i = 0; i < m; i++) {
like[i] = 0;
}
int an;
int ln;
for (int i = 0; i < n; i++) {
cin >> an;
for ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int like[m];
for (int i = 0; i < m; i++) {
like[i] = 0;
}
int an;
int ln;
for (int i = 0; i < n; i++) {
cin >> an;
for ... | [
"expression.operation.binary.add"
] | 927,408 | 927,409 | u093941965 | cpp |
p03126 | #include <algorithm>
#include <cmath>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, m;
cin >> n >> ... | #include <algorithm>
#include <cmath>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, m;
cin >> n >> ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 927,412 | 927,413 | u595984176 | cpp |
p03126 | #include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k + k)
#define sag (k + k + 1)
#define coc g[node][i]
#define mod 1000000007
#define inf 1000000009
#define N 1000005
using namespace std;
int a, b, ar[N], c, s;
int main() {
// freopen("input.txt", "... | #include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k + k)
#define sag (k + k + 1)
#define coc g[node][i]
#define mod 1000000007
#define inf 1000000009
#define N 1000005
using namespace std;
int a, b, ar[N], c, s;
int main() {
// freopen("input.txt", "... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 927,414 | 927,415 | u863190862 | cpp |
p03126 | #include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k + k)
#define sag (k + k + 1)
#define coc g[node][i]
#define mod 1000000007
#define inf 1000000009
#define N 1000005
using namespace std;
int a, b, ar[N], c, s;
int main() {
// freopen("input.txt", "... | #include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k + k)
#define sag (k + k + 1)
#define coc g[node][i]
#define mod 1000000007
#define inf 1000000009
#define N 1000005
using namespace std;
int a, b, ar[N], c, s;
int main() {
// freopen("input.txt", "... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 927,416 | 927,415 | u863190862 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | [] | 927,429 | 927,430 | u790461875 | cpp |
p03126 | #include <iostream>
#include <string>
using namespace std;
int main() {
int c, n, m, k, a;
cin >> n >> m;
int b[m] = {0};
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
b[a]++;
}
}
int cl = 0;
for (int i = 0; i < m; i++) {
if (b[i] == n)
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, k, a;
cin >> n >> m;
int b[m] = {0};
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
b[a - 1]++;
}
}
int cl = 0;
for (int i = 0; i < m; i++) {
if (b[i] == n)
... | [
"variable_declaration.remove"
] | 927,454 | 927,455 | u287431190 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ans[m];
for (int i = 0; i < n; i++) {
int k, a;
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
ans[a - 1] += 1;
}
}
int ret = 0;
for (int l = 0; l < m; l++) {
if (ans[l] == n)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ans[m] = {0};
for (int i = 0; i < n; i++) {
int k, a;
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
ans[a - 1] += 1;
}
}
int ret = 0;
for (int l = 0; l < m; l++) {
// cout << ans[l]... | [
"variable_declaration.value.change"
] | 927,460 | 927,461 | u264547551 | cpp |
p03126 | #include <bits/stdc++.h>
int freq[35];
using namespace std;
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
for (int j = 1; j <= k; j++) {
int t;
cin >> t;
freq[t]++;
}
}
int ans = 0;
for (int i = 1; i <= m; i++)
if (freq[m] == n)
... | #include <bits/stdc++.h>
int freq[35];
using namespace std;
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
for (int j = 1; j <= k; j++) {
int t;
cin >> t;
freq[t]++;
}
}
int ans = 0;
for (int i = 1; i <= m; i++)
if (freq[i] == n)
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 927,477 | 927,478 | u729337236 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m;
int a[m], i, b;
for (i = 0; i < m; i++)
a[i] = 0;
for (i = 0; i < n; i++) {
cin >> k;
for (; k > 0; k--) {
cin >> b;
a[b - 1]++;
}
}
int c;
for (i = 0; i < m; i++) {
if (a[i] == n)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m;
int a[m], i, b;
for (i = 0; i < m; i++)
a[i] = 0;
for (i = 0; i < n; i++) {
cin >> k;
for (; k > 0; k--) {
cin >> b;
a[b - 1]++;
}
}
int c = 0;
for (i = 0; i < m; i++) {
if (a[i] == n)
... | [
"variable_declaration.value.change"
] | 927,491 | 927,492 | u621527413 | cpp |
p03126 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
int main() {
int n, m;
cin >> n >> m;
vector<int> sum(n, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
int main() {
int n, m;
cin >> n >> m;
vector<int> sum(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 927,495 | 927,496 | u735008991 | cpp |
p03126 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, K, F, ans(0);
cin >> N >> M;
vector<int> fav(M);
for (int i = 0; i < N; i++) {
cin >> K;
for (int I = 0; I < K; I++) {
cin >> F;
fav[F - 1]++;
}
}
for (int i = 0; i < N; i++) {
if (fav[i] == N)
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, K, F, ans(0);
cin >> N >> M;
vector<int> fav(M, 0);
for (int i = 0; i < N; i++) {
cin >> K;
for (int I = 0; I < K; I++) {
cin >> F;
fav[F - 1]++;
}
}
for (int i = 0; i < M; i++) {
if (fav[i] == N)
... | [
"call.arguments.add",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 927,506 | 927,507 | u456658814 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m;
vector<int> f(m);
for (int i = 0; i < n; i++) {
cin >> k;
int a;
for (int j = 0; j < k; j++) {
cin >> a;
f[a]++;
}
}
int ans = 0;
for (int l = 0; l <= m; l++) {
if (f[l] == n)
ans+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m;
vector<int> f(m);
for (int i = 0; i < n; i++) {
cin >> k;
int a;
for (int j = 0; j < k; j++) {
cin >> a;
f[a - 1]++;
}
}
int ans = 0;
for (int l = 0; l < m; l++) {
if (f[l] == n)
a... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 927,529 | 927,530 | u012298376 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
//
int N, M;
cin >> N >> M;
int ans = 0;
vector<int> L(M, 0); // 0埋め
for (int i = 0; i < N; ++i) {
int K;
cin >> K;
for (int j = 0; j < K; ++j) {
int A;
cin >> A;
L[A] += 1;
}
}
//
for (int i = 0; i < M; ++i)... | #include <bits/stdc++.h>
using namespace std;
int main() {
//
int N, M;
cin >> N >> M;
int ans = 0;
vector<int> L(M, 0); // 0埋め
for (int i = 0; i < N; ++i) {
int K;
cin >> K;
for (int j = 0; j < K; ++j) {
int A;
cin >> A;
L[A - 1] += 1;
}
}
//
for (int i = 0; i < M; ... | [
"assignment.change"
] | 927,545 | 927,546 | u981304949 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, k, a;
cin >> n >> m;
vector<int> cnt(m);
rep(i, n) {
cin >> k;
rep(i, k) {
cin >> a;
cnt[a]++;
}
}
int ans = 0;
rep(i, m) if (cnt[i] == n) ans++;
cout << ans << en... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, k, a;
cin >> n >> m;
vector<int> cnt(m);
rep(i, n) {
cin >> k;
rep(i, k) {
cin >> a;
cnt[a - 1]++;
}
}
int ans = 0;
rep(i, m) if (cnt[i] == n) ans++;
cout << ans <... | [
"expression.operation.binary.add"
] | 927,551 | 927,552 | u237022500 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
map<int, int> mp;
for (int i = 0; i < N; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
mp[a]++;
}
}
int sum = 0;
for (int i = 0; i < M; i++) {
if (mp[i] == N)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
map<int, int> mp;
for (int i = 0; i < N; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
mp[a - 1]++;
}
}
int sum = 0;
for (int i = 0; i < M; i++) {
if (mp[i] =... | [
"expression.operation.binary.add"
] | 927,625 | 927,626 | u593555034 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, a, ans;
ans = 0;
cin >> n >> m;
vector<int> f(n + 1, 0);
for (int i = 0; i < m; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
f[a]++;
}
}
for (int i = 1; i <= n; i++) {
if (f[i] == m)
ans++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, a, ans;
ans = 0;
cin >> n >> m;
vector<int> f(m + 1, 0);
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
f[a]++;
}
}
for (int i = 1; i <= m; i++) {
if (f[i] == n)
ans++... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 927,662 | 927,663 | u280114218 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N, M, cnt = 0, n_cnt = 0;
cin >> N >> M;
vector<int> K(N);
vector<int> A;
int in;
for (int i = 0; i < N; i++) {
cin >> K[i];
for (int j = 0; j < K[i]; j++) {
cin >> in;
A.push_ba... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N, M, cnt = 0, n_cnt;
cin >> N >> M;
vector<int> K(N);
vector<int> A;
int in;
for (int i = 0; i < N; i++) {
cin >> K[i];
for (int j = 0; j < K[i]; j++) {
cin >> in;
A.push_back(i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 927,664 | 927,665 | u591779169 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N, M, cnt = 0, n_cnt;
cin >> N >> M;
vector<int> K(N);
vector<int> A;
int in;
for (int i = 0; i < N; i++) {
cin >> K[i];
for (int j = 0; j < K[i]; j++) {
cin >> in;
A.push_back(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N, M, cnt = 0, n_cnt;
cin >> N >> M;
vector<int> K(N);
vector<int> A;
int in;
for (int i = 0; i < N; i++) {
cin >> K[i];
for (int j = 0; j < K[i]; j++) {
cin >> in;
A.push_back(i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 927,666 | 927,665 | u591779169 | cpp |
p03126 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c[b];
for (int i = 0; i < b; i++)
c[i] = 0;
for (int i = 0; i < a; i++) {
int d;
cin >> d;
for (int j = 0; j < d; j++) {
int e;
cin >> e;
c[a - 1]++;
}
}
int f = 0;
for (int i = 0; ... | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c[b];
for (int i = 0; i < b; i++)
c[i] = 0;
for (int i = 0; i < a; i++) {
int d;
cin >> d;
for (int j = 0; j < d; j++) {
int e;
cin >> e;
c[e - 1]++;
}
}
int f = 0;
for (int i = 0; ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 927,709 | 927,710 | u530329977 | cpp |
p03126 | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i) // 0index
#define rep1(i, n) for (int i = 1; i < (n); ++i) // 1index
#define REP(i, a, b) for (int i = a; i < (b); ++i) // aからb - 1まで
#define mREP(i, a, b) for (int i = a; i > (b); --i) //逆
#define all(x) (x).begin(), (x).end()
const int I... | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i) // 0index
#define rep1(i, n) for (int i = 1; i < (n); ++i) // 1index
#define REP(i, a, b) for (int i = a; i < (b); ++i) // aからb - 1まで
#define mREP(i, a, b) for (int i = a; i > (b); --i) //逆
#define all(x) (x).begin(), (x).end()
const int I... | [
"expression.operation.binary.add"
] | 927,719 | 927,720 | u820341516 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int menu[m + 10] = {0};
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
for (int j = 1; j <= k; j++) {
int k_i;
cin >> k_i;
menu[k_i] += 1;
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int menu[m + 10] = {0};
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
for (int j = 1; j <= k; j++) {
int k_i;
cin >> k_i;
menu[k_i] += 1;
}
}
int ans = 0;
for (int i = 1; i <= m; i++) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 927,791 | 927,792 | u245414044 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
int i, j, l, k;
for (i = 0; i < n; i++) {
cin >> k;
for (j = 0; j < k; j++) {
cin >> l;
a[l] += 1;
}
}
int ans = 0;
for (i = 0; i < m; i++) {
if (a[i] == n)
ans++;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
int i, j, l, k;
for (i = 0; i < n; i++) {
cin >> k;
for (j = 0; j < k; j++) {
cin >> l;
a[l - 1] += 1;
}
}
int ans = 0;
for (i = 0; i < m; i++) {
if (a[i] == n)
ans++;... | [
"assignment.change"
] | 927,795 | 927,796 | u479790786 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
#define llint long long int
#define REP(i, s, l) for (llint i = s; i < l; i++)
#define DEBUG 0
#define INF (1LL << 50)
#define MOD 1000000007
int main() {
int person, food, index;
index = 0;
cin >> person >> food;
vector<int> sukifood(food);
REP(i, 0, person)... | #include <bits/stdc++.h>
using namespace std;
#define llint long long int
#define REP(i, s, l) for (llint i = s; i < l; i++)
#define DEBUG 0
#define INF (1LL << 50)
#define MOD 1000000007
int main() {
int person, food, index;
index = 0;
cin >> person >> food;
vector<int> sukifood(food);
REP(i, 0, person)... | [
"expression.operation.binary.add"
] | 927,810 | 927,811 | u323690397 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
vector<int> foods(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
foods[s]++;
}
}
for (int i = 0; i < m; i++) {
if (fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
vector<int> foods(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
foods[s - 1]++;
}
}
for (int i = 0; i < m; i++) {
if... | [
"expression.operation.binary.add"
] | 927,850 | 927,851 | u885523920 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
vector<int> foods(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
foods[s]++;
}
}
for (int i = 0; i < m; i++) {
if (fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
vector<int> foods(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
foods[s - 1]++;
}
}
for (int i = 0; i < m; i++) {
if... | [
"io.output.newline.add"
] | 927,852 | 927,851 | u885523920 | cpp |
p03126 | #include "bits/stdc++.h"
using namespace std;
int n, m, k, a, likes[31], ret = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(likes, 0, 31);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
likes[a]++;
}
}
for... | #include "bits/stdc++.h"
using namespace std;
int n, m, k, a, likes[31], ret = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(likes, 0, 31);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
likes[a]++;
}
}
for... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 927,866 | 927,867 | u870610226 | cpp |
p03126 | #include "bits/stdc++.h"
using namespace std;
int n, m, k, a, likes[30], ret = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(likes, 0, 30);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
likes[a]++;
}
}
for... | #include "bits/stdc++.h"
using namespace std;
int n, m, k, a, likes[31], ret = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(likes, 0, 31);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
likes[a]++;
}
}
for... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.oper... | 927,868 | 927,867 | u870610226 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A;
cin >> N >> M;
vector<int> list(30);
for (int i = 0; i < N; i++) {
int K;
cin >> K;
for (int j = 0; j < K; j++) {
cin >> A;
list[A]++;
}
}
int ans = 0;
for (int i = 0; i < M; i++) {
if (list[i] == N)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A;
cin >> N >> M;
vector<int> list(40);
for (int i = 0; i < N; i++) {
int K;
cin >> K;
for (int j = 0; j < K; j++) {
cin >> A;
list[A]++;
}
}
int ans = 0;
for (int i = 1; i <= M; i++) {
if (list[i] == N... | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 927,884 | 927,883 | u692650171 | cpp |
p03126 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> count(m);
for (int i = 0; i < m; i++) {
count[i] = 0;
}
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int A;
cin >> A;
count[A - 1]++;... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> count(m);
for (int i = 0; i < m; i++) {
count[i] = 0;
}
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int A;
cin >> A;
count[A - 1]++;... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 927,889 | 927,890 | u456753075 | cpp |
p03126 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
template <class T> inline bool ch... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
template <class T> inline bool ch... | [
"assignment.change"
] | 927,899 | 927,900 | u187878098 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int H[m];
for (int i = 0; i < m; i++) {
H[i] = 0;
}
for (int i = 0; i < n; i++) {
int numbers;
cin >> numbers;
for (int j = 0; j < numbers; j++) {
int temp;
cin >> temp;
H[temp - 1] += 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int H[m];
for (int i = 0; i < m; i++) {
H[i] = 0;
}
for (int i = 0; i < n; i++) {
int numbers;
cin >> numbers;
for (int j = 0; j < numbers; j++) {
int temp;
cin >> temp;
H[temp - 1] += 1;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 927,903 | 927,904 | u142577570 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int K, i, j, A, num[M];
for (i = 0; i < N; i++) {
cin >> K;
for (j = 0; j < K; j++) {
cin >> A;
num[A - 1] += 1;
}
}
int ans = 0;
for (i = 0; i < M; i++) {
if (num[i] == N) {
ans += 1;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int K, i, j, A, num[M] = {};
for (i = 0; i < N; i++) {
cin >> K;
for (j = 0; j < K; j++) {
cin >> A;
num[A - 1] += 1;
}
}
int ans = 0;
for (i = 0; i < M; i++) {
if (num[i] == N) {
ans ... | [
"variable_declaration.value.change"
] | 927,941 | 927,942 | u319001729 | cpp |
p03126 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [
"identifier.change",
"call.arguments.change"
] | 927,968 | 927,969 | u010004797 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n][m] = {};
int k[n], c[m + 1] = {}, counter = 0;
for (int i = 0; i < n; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> a[i][j];
c[a[i][j]]++;
}
}
for (int t = 0; t < m; t++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n][m] = {};
int k[n], c[m + 1] = {}, counter = 0;
for (int i = 0; i < n; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> a[i][j];
c[a[i][j]]++;
}
}
for (int t = 1; t <= m; t++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 927,987 | 927,988 | u022832318 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n][m] = {};
int k[n], c[m] = {}, counter = 0;
for (int i = 0; i < n; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> a[i][j];
c[a[i][j]]++;
}
}
for (int t = 0; t < m; t++) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n][m] = {};
int k[n], c[m + 1] = {}, counter = 0;
for (int i = 0; i < n; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> a[i][j];
c[a[i][j]]++;
}
}
for (int t = 1; t <= m; t++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 927,989 | 927,988 | u022832318 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int b[105];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
int k;
scanf("%d", &k);
for (int j = 1; j <= k; j++) {
int x;
scanf("%d", x);
b[x]++;
}
}
int ans = 0;
for (int i = 1; i <= m; i++)
if ... | #include <bits/stdc++.h>
using namespace std;
int b[105];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
int k;
scanf("%d", &k);
for (int j = 1; j <= k; j++) {
int x;
scanf("%d", &x);
b[x]++;
}
}
int ans = 0;
for (int i = 1; i <= m; i++)
if... | [
"expression.operation.unary.reference.add"
] | 928,003 | 928,004 | u374819456 | cpp |
p03126 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | [
"assignment.change"
] | 928,009 | 928,010 | u437973379 | cpp |
p03126 | #include <iostream>
#include <map>
using namespace std;
int main() {
int N, M;
map<int, int> count{};
cin >> N >> M;
for (int i = 0; i < N; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
count[a]++;
}
}
int ans = 0;
for (int i = 0; i < M; i++) {... | #include <iostream>
#include <map>
using namespace std;
int main() {
int N, M;
map<int, int> count{};
cin >> N >> M;
for (int i = 0; i < N; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
count[a]++;
}
}
int ans = 0;
for (int i = 1; i <= M; i++) ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 928,048 | 928,049 | u166632863 | cpp |
p03126 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int food[M];
for (int i = 0; i < M; i++)
food[i] = 0;
int fav, food_num;
for (int i = 0; i < N; i++) {
cin >> food_num;
for (int j = 0; j < food_num; j++) {
cin >> fav;
food[fav]++;... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int food[M];
for (int i = 0; i < M; i++)
food[i] = 0;
int fav, food_num;
for (int i = 0; i < N; i++) {
cin >> food_num;
for (int j = 0; j < food_num; j++) {
cin >> fav;
food[fav - 1... | [
"expression.operation.binary.add"
] | 928,066 | 928,067 | u680707192 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, ans = 0;
cin >> n >> m;
vector<int> a(m + 1, 0);
for (i = 0; i < n; i++) {
int k;
cin >> k;
for (j = 0; j < k; j++) {
int num;
cin >> num;
a[num]++;
}
}
for (i = 1; i < n; i++) {
// cout << a[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, ans = 0;
cin >> n >> m;
vector<int> a(m + 1, 0);
for (i = 0; i < n; i++) {
int k;
cin >> k;
for (j = 0; j < k; j++) {
int num;
cin >> num;
a[num - 1]++;
}
}
for (i = 0; i < m; i++) {
// cout <<... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 928,136 | 928,137 | u167755809 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, ans = 0;
cin >> n >> m;
vector<int> a(m + 1, 0);
for (i = 0; i < n; i++) {
int k;
cin >> k;
for (j = 0; j < k; j++) {
int num;
cin >> num;
a[num - 1]++;
}
}
for (i = 0; i < n; i++) {
// cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, ans = 0;
cin >> n >> m;
vector<int> a(m + 1, 0);
for (i = 0; i < n; i++) {
int k;
cin >> k;
for (j = 0; j < k; j++) {
int num;
cin >> num;
a[num - 1]++;
}
}
for (i = 0; i < m; i++) {
// cout <<... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 928,138 | 928,137 | u167755809 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> c(m, 0);
REP(i, n) {
int k;
cin >> k;
REP(j, k) {
int l;
cin >> l;
++c[l - 1];
}... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> c(m, 0);
REP(i, n) {
int k;
cin >> k;
REP(j, k) {
int l;
cin >> l;
++c[l - 1];
}... | [] | 928,144 | 928,145 | u349293635 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> food(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int l = 0; l < k; l++) {
int j;
cin >> j;
foo... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> food(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int l = 0; l < k; l++) {
int j;
cin >> j;
foo... | [
"expression.operation.binary.add"
] | 928,158 | 928,159 | u426397594 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> food(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int i = 0; i < k; i++) {
int j;
cin >> j;
foo... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> food(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int l = 0; l < k; l++) {
int j;
cin >> j;
foo... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 928,160 | 928,159 | u426397594 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int n, m, ans = 0;
cin >> n >> m;
int food[m];
for (int i = 0; i < m; i++) {
food[m] = 0;
};
for (int i = 0; i < n; i++) {
int ... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int n, m, ans = 0;
cin >> n >> m;
int food[m];
for (int i = 0; i < m; i++) {
food[i] = 0;
}
for (int i = 0; i < n; i++) {
int k... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 928,161 | 928,162 | u160036974 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int n, m, ans = 0;
cin >> n >> m;
int food[m];
for (int i = 0; i < m; i++) {
food[m] = 0;
};
for (int i = 0; i < n; i++) {
int ... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int n, m, ans = 0;
cin >> n >> m;
int food[m];
for (int i = 0; i < m; i++) {
food[i] = 0;
}
for (int i = 0; i < n; i++) {
int k... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 928,163 | 928,162 | u160036974 | cpp |
p03126 | /*#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#de... | /*#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#de... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 928,179 | 928,180 | u764234894 | cpp |
p03126 | #include <iostream>
using namespace std;
int main() {
int N, M;
int A[50][50];
int bucket[50];
cin >> N >> M;
for (int i = 0; i < N; i++) {
int K;
cin >> K;
for (int j = 0; j < K; j++) {
cin >> A[i][j];
bucket[A[i][j] + 1]++;
}
}
int count = 0;
for (int i = 1; i <= N; i++) ... | #include <iostream>
using namespace std;
int main() {
int N, M;
int A[50][50];
int bucket[50];
cin >> N >> M;
for (int i = 0; i < N; i++) {
int K;
cin >> K;
for (int j = 0; j < K; j++) {
cin >> A[i][j];
bucket[A[i][j]]++;
}
}
int count = 0;
for (int i = 1; i <= M; i++) {
... | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 928,184 | 928,185 | u865014539 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, b, k;
cin >> n >> m;
int a[m];
int count;
for (int i = 0; i < m; i++)
a[i] = 0;
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> b;
a[b - 1]++;
}
}
for (int i = 0; i < m; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, b, k;
cin >> n >> m;
int a[m];
int count = 0;
for (int i = 0; i < m; i++)
a[i] = 0;
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> b;
a[b - 1]++;
}
}
for (int i = 0; i < m; i++... | [
"variable_declaration.value.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 928,200 | 928,201 | u440904221 | cpp |
p03126 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v),... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v),... | [
"expression.operation.binary.add"
] | 928,208 | 928,209 | u135572611 | cpp |
p03126 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int count[m + 1] = {}, k, a, ans = 0;
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
count[a]++;
}
}
for (int i = 1; i <= n; i++) {
if (count[i] == n... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int count[m + 1] = {}, k, a, ans = 0;
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
count[a]++;
}
}
for (int i = 1; i <= m; i++) {
if (count[i] == n... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 928,239 | 928,240 | u804999113 | cpp |
p03126 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
int result = 0;
cin >> N >> M;
vector<int> foods(M, 0);
for (int i = 0; i < N; i++) {
int K, tempfood;
cin >> K;
for (int j = 0; j < K; j++) {
cin >> tempfood;
foods[tempfood - 1] += 1;
}
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
int result = 0;
cin >> N >> M;
vector<int> foods(M, 0);
for (int i = 0; i < N; i++) {
int K, tempfood;
cin >> K;
for (int j = 0; j < K; j++) {
cin >> tempfood;
foods[tempfood - 1] += 1;
}
}
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 928,261 | 928,262 | u791411211 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define sz size
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORN(i, a, b) for (int i = a; i <= b; i++)
#define FORRN(i, a, b) for (int i = (a); i >= (b); i--)
#define FORR(i, a, b) fo... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define sz size
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORN(i, a, b) for (int i = a; i <= b; i++)
#define FORRN(i, a, b) for (int i = (a); i >= (b); i--)
#define FORR(i, a, b) fo... | [
"control_flow.break.remove"
] | 928,285 | 928,286 | u921592714 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int n, m, k;
int a[33];
map<int, int> mp;
int ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> k;
for (int j = 1; j <= k; j++) {
cin >> a[i];
mp[a[i]]++;
}
}
for (int i = 1; i <= m; i++) {
if (mp[a[i]] == n)
a... | #include <bits/stdc++.h>
using namespace std;
int n, m, k;
int a[33];
map<int, int> mp;
int ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> k;
for (int j = 1; j <= k; j++) {
cin >> a[i];
mp[a[i]]++;
}
}
for (int i = 1; i <= m; i++) {
if (mp[i] == n)
ans+... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 928,291 | 928,292 | u817240026 | cpp |
p03126 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | [
"expression.operation.binary.add"
] | 928,358 | 928,359 | u426855695 | cpp |
p03126 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M);
for (int i = 0; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M);
for (int i = 0; ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 928,368 | 928,369 | u698142380 | cpp |
p03126 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const double EPS = 1e-10;
int main() {
ll n, m;
ll ans = 0;
cin >> n >> m;
vector<ll> a(m, ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const double EPS = 1e-10;
int main() {
ll n, m;
ll ans = 0;
cin >> n >> m;
vector<ll> a(m, ... | [
"expression.operation.binary.add"
] | 928,370 | 928,371 | u569367525 | cpp |
p03126 | #include <cstdio>
#include <cstdlib>
#define INF (__INT32_MAX__ / 2);
#define MAX 30
using namespace std;
int n, m;
int A[MAX];
int main(int argc, char **argv) {
scanf("%d", &n);
scanf("%d", &m);
for (int i = 0; i < n; ++i) {
int k;
scanf("%d", &k);
for (int j = 0; j < k; ++j) {
int food;
... | #include <cstdio>
#include <cstdlib>
#define INF (__INT32_MAX__ / 2);
#define MAX 30
using namespace std;
int n, m;
int A[MAX];
int main(int argc, char **argv) {
scanf("%d", &n);
scanf("%d", &m);
for (int i = 0; i < n; ++i) {
int k;
scanf("%d", &k);
for (int j = 0; j < k; ++j) {
int food;
... | [
"expression.operation.binary.add"
] | 928,428 | 928,429 | u777137418 | cpp |
p03126 | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
typedef... | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
typedef... | [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 928,434 | 928,435 | u863279562 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
int K, a;
int A[30] = {0};
for (int i = 0; i < N; i++) {
cin >> K;
for (int j = 0; j < K; j++) {
cin >> a;
A[a]++;
}
}
int count = 0;
for (int i = 1; i <= 30; i++) {
if (A[i] == N)
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
int K, a;
int A[31] = {0};
for (int i = 0; i < N; i++) {
cin >> K;
for (int j = 0; j < K; j++) {
cin >> a;
A[a]++;
}
}
int count = 0;
for (int i = 1; i <= 30; i++) {
if (A[i] == N)
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 928,450 | 928,451 | u413492096 | cpp |
p03126 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define INF 1000000000
#define MOD 1000000007
using namespace std;
ll dp[100][2];
int main() {
int n, m;
cin >> n >> m;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define INF 1000000000
#define MOD 1000000007
using namespace std;
ll dp[100][2];
int main() {
int n, m;
cin >> n >> m;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 928,457 | 928,458 | u387055019 | cpp |
p03126 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
int num = 0;
int count = 0;
cin >> n >> m;
vector<vector<int>> item = vector<vector<int>>(n, vector<int>(m, 0));
for (int i = 0; i < n; i++) {
cin >> item[i][0];
for (int j = 0; j < item[i][0]; j++) {
cin >> i... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
int num = 0;
int count = 0;
cin >> n >> m;
vector<vector<int>> item = vector<vector<int>>(n, vector<int>(m + 1, 0));
for (int i = 0; i < n; i++) {
cin >> item[i][0];
for (int j = 0; j < item[i][0]; j++) {
cin ... | [
"expression.operation.binary.remove"
] | 928,474 | 928,473 | u133607477 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int cnt[n + 1];
fill(cnt, cnt + n + 1, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
cnt[a]++;
}
}
int ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int cnt[m + 1];
fill(cnt, cnt + m + 1, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
cnt[a]++;
}
}
int ans = 0;
... | [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 928,499 | 928,498 | u357265888 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int cnt[n + 1];
fill(cnt, cnt + n + 1, false);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
cnt[a]++;
}
}
int ans = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int cnt[m + 1];
fill(cnt, cnt + m + 1, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
cnt[a]++;
}
}
int ans = 0;
... | [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 928,500 | 928,498 | u357265888 | cpp |
p03126 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> K(n);
vector<int> memo(m, 0);
for (int i = 0; i < n; i++) {
cin >> K[i];
for (int j = 0; j < K[i]; j++) {
int a;
cin >> a;
memo[a]++;
}
}
int count = 0;
for (int i... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> K(n, 0);
vector<int> memo(m, 0);
for (int i = 0; i < n; i++) {
cin >> K[i];
for (int j = 0; j < K[i]; j++) {
int a;
cin >> a;
memo[a - 1]++;
}
}
int count = 0;
for... | [
"call.arguments.add"
] | 928,507 | 928,508 | u033128909 | cpp |
p03126 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int n, m;
int a, k;
int ans[40];
int ANS;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
ans[a]++;
}
}
for ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int n, m;
int a, k;
int ans[40];
int ANS;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> a;
ans[a]++;
}
}
for ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 928,509 | 928,510 | u037143188 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int intpow(int x, int y) {
double a = x, b = y;
return pow(a, b);
} //(x,y) xをy乗する
int intfabs(int x) {
double a = x;
return fabs(a);
} //(x) の絶対値
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i... | #include <bits/stdc++.h>
using namespace std;
int intpow(int x, int y) {
double a = x, b = y;
return pow(a, b);
} //(x,y) xをy乗する
int intfabs(int x) {
double a = x;
return fabs(a);
} //(x) の絶対値
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i... | [
"expression.operation.binary.add"
] | 928,540 | 928,541 | u160321725 | cpp |
p03126 | #include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> A(M);
for (int i = 0; i < N; i++) {
int K;
std::cin >> K;
for (int j = 0; j < K; j++) {
int temp;
std::cin >> temp;
A[temp] += 1;
}
}
int sum = 0;
for (int i = 0; i < M; i++... | #include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> A(M);
for (int i = 0; i < N; i++) {
int K;
std::cin >> K;
for (int j = 0; j < K; j++) {
int temp;
std::cin >> temp;
A[temp - 1] += 1;
}
}
int sum = 0;
for (int i = 0; i < M;... | [
"assignment.change"
] | 928,553 | 928,554 | u892351900 | cpp |
p03126 | #include <bits/stdc++.h>
using namespace std;
int N, M, ans, a;
int K[35], A[35][35];
map<int, int> MA;
int main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> K[i];
for (int j = 0; j < K[i]; j++) {
cin >> a;
MA[a] += 1;
}
}
for (int i = 0; i < M; i++) {
if (MA[i] == N)
... | #include <bits/stdc++.h>
using namespace std;
int N, M, ans, a;
int K[35], A[35][35];
map<int, int> MA;
int main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> K[i];
for (int j = 0; j < K[i]; j++) {
cin >> a;
MA[a] += 1;
}
}
for (int i = 1; i <= M; i++) {
if (MA[i] == N)
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 928,559 | 928,560 | u522548464 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.