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 |
|---|---|---|---|---|---|---|---|
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>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
auto &in = std::cin;
auto &out = std::cout;
#define all_range(C) std::begin(C), std::end(C)
const double PI =
3.141592653589793238462643383279502884197169399375105820974944;
int32_t N, M, Q;
int64_t S[100100];
int64_t T[100100];
int64_t X[100100];
int main() {
using std::endl;
in.sync_with_stdio(false);
out.sync_with_stdio(false);
in.tie(nullptr);
out.tie(nullptr);
in >> N >> M >> Q;
for (size_t i = 1; i <= N; i++) {
in >> S[i];
}
N += 2;
S[0] = -100000000001000000;
S[N - 1] = 100000000001000000;
for (size_t i = 1; i <= M; i++) {
in >> T[i];
}
M += 2;
T[0] = -100000000001000000;
T[N - 1] = 100000000001000000;
for (size_t i = 0; i < Q; i++) {
in >> X[i];
}
for (size_t i = 0; i < Q; i++) {
auto iter1 = std::lower_bound(S, S + N, X[i]);
auto iter2 = std::lower_bound(T, T + M, X[i]);
out << std::min({
std::max(*iter1 - X[i], *iter2 - X[i]),
std::max(X[i] - *(iter1 - 1), X[i] - *(iter2 - 1)),
(*iter1 - X[i]) * 2 + X[i] - *(iter2 - 1),
(*iter2 - X[i]) * 2 + X[i] - *(iter1 - 1),
(*iter1 - X[i]) + (X[i] - *(iter2 - 1)) * 2,
(*iter2 - X[i]) + (X[i] - *(iter1 - 1)) * 2,
})
<< endl;
}
return 0;
}
#endif
|
#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>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
auto &in = std::cin;
auto &out = std::cout;
#define all_range(C) std::begin(C), std::end(C)
const double PI =
3.141592653589793238462643383279502884197169399375105820974944;
int32_t N, M, Q;
int64_t S[100100];
int64_t T[100100];
int64_t X[100100];
int main() {
using std::endl;
in.sync_with_stdio(false);
out.sync_with_stdio(false);
in.tie(nullptr);
out.tie(nullptr);
in >> N >> M >> Q;
for (size_t i = 1; i <= N; i++) {
in >> S[i];
}
N += 2;
S[0] = -100000000001000000;
S[N - 1] = 100000000001000000;
for (size_t i = 1; i <= M; i++) {
in >> T[i];
}
M += 2;
T[0] = -100000000001000000;
T[M - 1] = 100000000001000000;
for (size_t i = 0; i < Q; i++) {
in >> X[i];
}
for (size_t i = 0; i < Q; i++) {
auto iter1 = std::lower_bound(S, S + N, X[i]);
auto iter2 = std::lower_bound(T, T + M, X[i]);
out << std::min({
std::max(*iter1 - X[i], *iter2 - X[i]),
std::max(X[i] - *(iter1 - 1), X[i] - *(iter2 - 1)),
(*iter1 - X[i]) * 2 + X[i] - *(iter2 - 1),
(*iter2 - X[i]) * 2 + X[i] - *(iter1 - 1),
(*iter1 - X[i]) + (X[i] - *(iter2 - 1)) * 2,
(*iter2 - X[i]) + (X[i] - *(iter1 - 1)) * 2,
})
<< endl;
}
return 0;
}
#endif
| [
"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) for (int i = 1; i <= (int)(n); i++)
//#define ARRAY(type,n) (type *)malloc(sizeof(type)*n)
template <typename T> T *ARRAY(int n) { (T *)malloc(sizeof(T) * n); }
template <typename T> T **ARRAY2(int m, int n) {
T **type = (T **)malloc(sizeof(T *) * m);
for (int i = 0; i < m; i++) {
type[i] = (T *)malloc(sizeof(T) * n);
}
return type;
}
int main(void) {
ll a, b, q;
cin >> a >> b >> q;
ll s[100010];
ll t[100010];
ll x[100010];
s[100008] = -99999999999;
s[100009] = 99999999999;
t[100008] = -99999999999;
t[100009] = 99999999999;
rep(i, a) { cin >> s[i]; }
rep(i, b) { cin >> t[i]; }
rep(i, q) { cin >> x[i]; }
sort(s, s + a);
sort(t, t + a);
rep(i, q) {
ll point = x[i];
ll ans = 999999999999;
ll sb = 0;
ll se = a - 1;
ll tb = 0;
ll te = b - 1;
ll check;
while (se - sb >= 2) {
check = (sb + se) / 2;
if (s[check] <= point) {
sb = check;
} else {
se = check;
}
}
while (te - tb >= 2) {
check = (tb + te) / 2;
if (t[check] <= point) {
tb = check;
} else {
te = check;
}
}
if (s[sb] > point) {
se = sb;
sb = 100008;
}
if (s[se] < point) {
sb = se;
se = 100009;
}
if (t[tb] > point) {
te = tb;
tb = 100008;
}
if (t[te] < point) {
tb = te;
te = 100009;
}
ans = min(ans, max(point - s[sb], point - t[tb]));
ans = min(ans, max(s[se] - point, t[te] - point));
ans = min(ans, min((point - s[sb]) * 2 + t[te] - point,
point - s[sb] + (t[te] - point) * 2));
ans = min(ans, min((point - t[tb]) * 2 + s[se] - point,
(point - t[tb]) + (s[se] - point) * 2));
cout << ans << endl;
}
return 0;
} | #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) for (int i = 1; i <= (int)(n); i++)
//#define ARRAY(type,n) (type *)malloc(sizeof(type)*n)
template <typename T> T *ARRAY(int n) { (T *)malloc(sizeof(T) * n); }
template <typename T> T **ARRAY2(int m, int n) {
T **type = (T **)malloc(sizeof(T *) * m);
for (int i = 0; i < m; i++) {
type[i] = (T *)malloc(sizeof(T) * n);
}
return type;
}
int main(void) {
ll a, b, q;
cin >> a >> b >> q;
ll s[100010];
ll t[100010];
ll x[100010];
s[100008] = -99999999999;
s[100009] = 99999999999;
t[100008] = -99999999999;
t[100009] = 99999999999;
rep(i, a) { cin >> s[i]; }
rep(i, b) { cin >> t[i]; }
rep(i, q) { cin >> x[i]; }
sort(s, s + a);
sort(t, t + b);
rep(i, q) {
ll point = x[i];
ll ans = 999999999999;
ll sb = 0;
ll se = a - 1;
ll tb = 0;
ll te = b - 1;
ll check;
while (se - sb >= 2) {
check = (sb + se) / 2;
if (s[check] <= point) {
sb = check;
} else {
se = check;
}
}
while (te - tb >= 2) {
check = (tb + te) / 2;
if (t[check] <= point) {
tb = check;
} else {
te = check;
}
}
if (s[sb] > point) {
se = sb;
sb = 100008;
}
if (s[se] < point) {
sb = se;
se = 100009;
}
if (t[tb] > point) {
te = tb;
tb = 100008;
}
if (t[te] < point) {
tb = te;
te = 100009;
}
ans = min(ans, max(point - s[sb], point - t[tb]));
ans = min(ans, max(s[se] - point, t[te] - point));
ans = min(ans, min((point - s[sb]) * 2 + t[te] - point,
point - s[sb] + (t[te] - point) * 2));
ans = min(ans, min((point - t[tb]) * 2 + s[se] - point,
(point - t[tb]) + (s[se] - point) * 2));
cout << ans << endl;
}
return 0;
} | [
"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 ((S <= x && T >= x) || (T <= x && S >= x))
return abs(S - T) + min(abs(T - x), abs(S - x));
if (S <= x && T <= x)
return x - min(S, T);
return 0x7f7f7f7f7f7f7f7f;
}
int main() {
cin >> A >> B >> Q;
for (int i = 1; i <= A; ++i)
scanf("%lld", s + i);
for (int i = 1; i <= B; ++i)
scanf("%lld", t + i);
sort(s + 1, s + A + 1);
sort(t + 1, t + A + 1);
while (Q--) {
long long x;
scanf("%lld", &x);
long long t1 = lower_bound(s + 1, s + A + 1, x) - s;
long long t2 = lower_bound(t + 1, t + B + 1, x) - t;
long long res = 0x7f7f7f7f7f7f7f7f;
res = min(res, calc(t1 - 1, t2, x));
res = min(res, calc(t1, t2, x));
res = min(res, calc(t1 - 1, t2 - 1, x));
res = min(res, calc(t1, t2 - 1, x));
printf("%lld\n", res);
}
return 0;
}
| #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 ((S <= x && T >= x) || (T <= x && S >= x))
return abs(S - T) + min(abs(T - x), abs(S - x));
if (S <= x && T <= x)
return x - min(S, T);
return 0x7f7f7f7f7f7f7f7f;
}
int main() {
cin >> A >> B >> Q;
for (int i = 1; i <= A; ++i)
scanf("%lld", s + i);
for (int i = 1; i <= B; ++i)
scanf("%lld", t + i);
sort(s + 1, s + A + 1);
sort(t + 1, t + B + 1);
while (Q--) {
long long x;
scanf("%lld", &x);
long long t1 = lower_bound(s + 1, s + A + 1, x) - s;
long long t2 = lower_bound(t + 1, t + B + 1, x) - t;
long long res = 0x7f7f7f7f7f7f7f7f;
res = min(res, calc(t1 - 1, t2, x));
res = min(res, calc(t1, t2, x));
res = min(res, calc(t1 - 1, t2 - 1, x));
res = min(res, calc(t1, t2 - 1, x));
printf("%lld\n", res);
}
return 0;
}
| [
"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++)
scanf("%lld", &b[q]);
ll x, s;
while (t--) {
scanf("%lld", &x);
int t1 = lower_bound(a, a + n, x) - a;
int t2 = lower_bound(b, b + m, x) - b;
s = INF;
if (t1 != 0) {
if (t2 != 0) {
s = min(s, abs(x - b[t2 - 1]) + abs(b[t2 - 1] - a[t1 - 1]));
s = min(s, abs(x - a[t1 - 1]) + abs(a[t1 - 1] - b[t2 - 1]));
}
if (t2 != n) {
s = min(s, abs(x - b[t2]) + abs(b[t2] - a[t1 - 1]));
s = min(s, abs(x - a[t1 - 1]) + abs(a[t1 - 1] - b[t2]));
}
}
if (t1 != n) {
if (t2 != 0) {
s = min(s, abs(x - b[t2 - 1]) + abs(b[t2 - 1] - a[t1]));
s = min(s, abs(x - a[t1]) + abs(a[t1] - b[t2 - 1]));
}
if (t2 != n) {
s = min(s, abs(x - b[t2]) + abs(b[t2] - a[t1]));
s = min(s, abs(x - a[t1]) + abs(a[t1] - b[t2]));
}
}
printf("%lld\n", s);
}
return 0;
} | #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++)
scanf("%lld", &b[q]);
ll x, s;
while (t--) {
scanf("%lld", &x);
int t1 = lower_bound(a, a + n, x) - a;
int t2 = lower_bound(b, b + m, x) - b;
s = INF;
if (t1 != 0) {
if (t2 != 0) {
s = min(s, abs(x - b[t2 - 1]) + abs(b[t2 - 1] - a[t1 - 1]));
s = min(s, abs(x - a[t1 - 1]) + abs(a[t1 - 1] - b[t2 - 1]));
}
if (t2 != m) {
s = min(s, abs(x - b[t2]) + abs(b[t2] - a[t1 - 1]));
s = min(s, abs(x - a[t1 - 1]) + abs(a[t1 - 1] - b[t2]));
}
}
if (t1 != n) {
if (t2 != 0) {
s = min(s, abs(x - b[t2 - 1]) + abs(b[t2 - 1] - a[t1]));
s = min(s, abs(x - a[t1]) + abs(a[t1] - b[t2 - 1]));
}
if (t2 != m) {
s = min(s, abs(x - b[t2]) + abs(b[t2] - a[t1]));
s = min(s, abs(x - a[t1]) + abs(a[t1] - b[t2]));
}
}
printf("%lld\n", s);
}
return 0;
} | [
"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++)
scanf("%lld", &b[q]);
ll x, s;
while (t--) {
scanf("%lld", &x);
int t1 = lower_bound(a, a + n, x) - a;
int t2 = lower_bound(b, b + m, x) - b;
s = INF;
if (t1 != 0) {
if (t2 != 0) {
s = min(s, abs(x - b[t2 - 1]) + abs(b[t2 - 1] - a[t1 - 1]));
s = min(s, abs(x - a[t1 - 1]) + abs(a[t1 - 1] - b[t2 - 1]));
}
if (t2 != n) {
s = min(s, abs(x - b[t2]) + abs(b[t2] - a[t1 - 1]));
s = min(s, abs(x - a[t1 - 1]) + abs(a[t1 - 1] - b[t2]));
}
}
if (t1 != n) {
if (t2 != 0) {
s = min(s, abs(x - b[t2 - 1]) + abs(b[t2 - 1] - a[t1]));
s = min(s, abs(x - a[t1]) + abs(a[t1] - b[t2 - 1]));
}
if (t2 != n) {
s = min(s, abs(x - b[t2]) + abs(b[t2] - a[t1]));
s = min(s, abs(x - a[t1]) + abs(a[t1] - b[t2]));
}
}
printf("%lld\n", s);
}
return 0;
} | #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++)
scanf("%lld", &b[q]);
ll x, s;
while (t--) {
scanf("%lld", &x);
int t1 = lower_bound(a, a + n, x) - a;
int t2 = lower_bound(b, b + m, x) - b;
s = INF;
if (t1 != 0) {
if (t2 != 0) {
s = min(s, abs(x - b[t2 - 1]) + abs(b[t2 - 1] - a[t1 - 1]));
s = min(s, abs(x - a[t1 - 1]) + abs(a[t1 - 1] - b[t2 - 1]));
}
if (t2 != m) {
s = min(s, abs(x - b[t2]) + abs(b[t2] - a[t1 - 1]));
s = min(s, abs(x - a[t1 - 1]) + abs(a[t1 - 1] - b[t2]));
}
}
if (t1 != n) {
if (t2 != 0) {
s = min(s, abs(x - b[t2 - 1]) + abs(b[t2 - 1] - a[t1]));
s = min(s, abs(x - a[t1]) + abs(a[t1] - b[t2 - 1]));
}
if (t2 != m) {
s = min(s, abs(x - b[t2]) + abs(b[t2] - a[t1]));
s = min(s, abs(x - a[t1]) + abs(a[t1] - b[t2]));
}
}
printf("%lld\n", s);
}
return 0;
} | [
"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 (int i = 1; i <= b; i++) {
cin >> t[i];
}
for (int i = 1; i <= q; i++) {
cin >> p;
r1 = lower_bound(s + 1, s + a + 1, p) - s;
l1 = r1 - 1;
r2 = lower_bound(t + 1, t + b + 1, p) - t;
l2 = r2 - 1;
ans1 = ans2 = ans3 = ans4 = ans5 = ans6 = INF;
if (r1 != a + 1 && r2 != b + 1)
ans1 = max((s[r1] - p), (t[r2] - p));
if (l1 && l2)
ans1 = max((p - s[l1]), (p - t[l2]));
if (r1 != a + 1 && l2)
ans3 = 2 * (s[r1] - p) + (p - t[l2]);
if (r2 != b + 1 && r1)
ans4 = 2 * (t[r2] - p) + (p - s[l1]);
if (l1 && r2 != b + 1)
ans5 = 2 * (p - s[l1]) + (t[r2] - p);
if (l2 && r1 != a + 1)
ans6 = 2 * (p - t[l2]) + (s[r1] - p);
ans = min(ans1, ans2);
tmp = min(min(ans3, ans4), min(ans5, ans6));
ans = min(tmp, ans);
cout << ans << endl;
}
return 0;
}
|
#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 (int i = 1; i <= b; i++) {
cin >> t[i];
}
for (int i = 1; i <= q; i++) {
cin >> p;
r1 = lower_bound(s + 1, s + a + 1, p) - s;
l1 = r1 - 1;
r2 = lower_bound(t + 1, t + b + 1, p) - t;
l2 = r2 - 1;
ans1 = ans2 = ans3 = ans4 = ans5 = ans6 = INF;
if (r1 != a + 1 && r2 != b + 1)
ans1 = max((s[r1] - p), (t[r2] - p));
if (l1 && l2)
ans2 = max((p - s[l1]), (p - t[l2]));
if (r1 != a + 1 && l2)
ans3 = 2 * (s[r1] - p) + (p - t[l2]);
if (r2 != b + 1 && l1)
ans4 = 2 * (t[r2] - p) + (p - s[l1]);
if (l1 && r2 != b + 1)
ans5 = 2 * (p - s[l1]) + (t[r2] - p);
if (l2 && r1 != a + 1)
ans6 = 2 * (p - t[l2]) + (s[r1] - p);
ans = min(ans1, ans2);
tmp = min(min(ans3, ans4), min(ans5, ans6));
ans = min(tmp, ans);
cout << ans << endl;
}
return 0;
}
| [
"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 REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFF
#define Yes(q) (q ? "Yes" : "No")
#define YES(q) (q ? "YES" : "NO")
#define PInt pair<int, int>
#define PLL pair<long long, long long>
#define VInt vector<int>
#define VLL vector<long long>
#define MatrixInt vector<vector<int>>
#define MatrixLL vector<vector<long long>>
typedef long long ll;
using namespace std;
int main() {
int a, b, q;
cin >> a >> b >> q;
VLL s(a, 0), t(b, 0), x(q, 0);
REP(i, a) cin >> s[i];
REP(i, b) cin >> t[i];
REP(i, q) cin >> x[i];
sort(ALL_OF(s));
sort(ALL_OF(t));
REP(i, q) {
int js = lower_bound(ALL_OF(s), x[i]) - s.begin();
int jt = lower_bound(ALL_OF(t), x[i]) - t.begin();
ll ans = 0x7FFFFFFFFFFFFFFFLL;
chmin(ans, abs(s[js] - x[i]) + abs(s[js] - s[jt]));
chmin(ans, abs(t[jt] - x[i]) + abs(s[js] - t[jt]));
if (js > 0) {
chmin(ans, abs(s[js - 1] - x[i]) + abs(s[js - 1] - t[jt]));
chmin(ans, abs(t[jt] - x[i]) + abs(s[js - 1] - t[jt]));
}
if (jt > 0) {
chmin(ans, abs(t[jt - 1] - x[i]) + abs(t[jt - 1] - s[js]));
chmin(ans, abs(s[js] - x[i]) + abs(t[jt - 1] - s[js]));
}
if (js > 0 && jt > 0) {
chmin(ans, abs(t[jt - 1] - x[i]) + abs(t[jt - 1] - s[js - 1]));
chmin(ans, abs(s[js - 1] - x[i]) + abs(t[jt - 1] - s[js - 1]));
}
cout << ans << endl;
}
} | #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 REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFF
#define Yes(q) (q ? "Yes" : "No")
#define YES(q) (q ? "YES" : "NO")
#define PInt pair<int, int>
#define PLL pair<long long, long long>
#define VInt vector<int>
#define VLL vector<long long>
#define MatrixInt vector<vector<int>>
#define MatrixLL vector<vector<long long>>
typedef long long ll;
using namespace std;
int main() {
int a, b, q;
cin >> a >> b >> q;
VLL s(a, 0), t(b, 0), x(q, 0);
REP(i, a) cin >> s[i];
REP(i, b) cin >> t[i];
REP(i, q) cin >> x[i];
sort(ALL_OF(s));
sort(ALL_OF(t));
REP(i, q) {
int js = lower_bound(ALL_OF(s), x[i]) - s.begin();
int jt = lower_bound(ALL_OF(t), x[i]) - t.begin();
ll ans = 0x7FFFFFFFFFFFFFFFLL;
chmin(ans, abs(s[js] - x[i]) + abs(s[js] - t[jt]));
chmin(ans, abs(t[jt] - x[i]) + abs(s[js] - t[jt]));
if (js > 0) {
chmin(ans, abs(s[js - 1] - x[i]) + abs(s[js - 1] - t[jt]));
chmin(ans, abs(t[jt] - x[i]) + abs(s[js - 1] - t[jt]));
}
if (jt > 0) {
chmin(ans, abs(t[jt - 1] - x[i]) + abs(t[jt - 1] - s[js]));
chmin(ans, abs(s[js] - x[i]) + abs(t[jt - 1] - s[js]));
}
if (js > 0 && jt > 0) {
chmin(ans, abs(t[jt - 1] - x[i]) + abs(t[jt - 1] - s[js - 1]));
chmin(ans, abs(s[js - 1] - x[i]) + abs(t[jt - 1] - s[js - 1]));
}
cout << ans << endl;
}
} | [
"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, Q;
cin >> A >> B >> Q;
vector<ll> s(A), t(B);
rep(i, A) cin >> s[i];
rep(i, B) cin >> t[i];
sort(s.begin(), s.end());
sort(t.begin(), t.end());
rep(i, Q) {
ll x;
cin >> x;
ll mi = 1e18;
// 神社から始めた場合
{
int sidx = lower_bound(s.begin(), s.end(), x) - s.begin();
int ridx = -1, lidx = -1;
if (sidx == A) {
lidx = sidx - 1;
} else if (sidx == 0) {
ridx = 0;
} else {
ridx = sidx;
lidx = sidx - 1;
}
// 左
if (ridx != -1) {
int tidx = lower_bound(t.begin(), t.end(), s[ridx]) - t.begin();
int r2idx = -1, l2idx = -1;
if (tidx == B) {
l2idx = tidx - 1;
} else if (tidx == 0) {
r2idx = 0;
} else {
r2idx = tidx;
l2idx = tidx - 1;
}
if (r2idx != -1) {
mi = min(mi, abs(x - s[ridx]) + abs(s[ridx] - t[r2idx]));
}
if (l2idx != -1) {
mi = min(mi, abs(x - s[ridx]) + abs(s[ridx] - t[l2idx]));
}
}
if (lidx != -1) {
int tidx = lower_bound(t.begin(), t.end(), s[lidx]) - t.begin();
int r2idx = -1, l2idx = -1;
if (tidx == B) {
l2idx = tidx - 1;
} else if (tidx == 0) {
r2idx = 0;
} else {
r2idx = tidx;
l2idx = tidx - 1;
}
if (r2idx != -1) {
mi = min(mi, abs(x - s[lidx]) + abs(s[lidx] - t[r2idx]));
}
if (l2idx != -1) {
mi = min(mi, abs(x - s[lidx]) + abs(s[lidx] - t[l2idx]));
}
}
}
{
int tidx = lower_bound(t.begin(), t.end(), x) - t.begin();
int ridx = -1, lidx = -1;
if (tidx == B) {
lidx = tidx - 1;
} else if (tidx == 0) {
ridx = 0;
} else {
ridx = tidx;
lidx = tidx - 1;
}
// 左
if (ridx != -1) {
int sidx = lower_bound(s.begin(), s.end(), t[ridx]) - s.begin();
int r2idx = -1, l2idx = -1;
if (sidx == A) {
l2idx = sidx - 1;
} else if (sidx == 0) {
r2idx = 0;
} else {
r2idx = tidx;
l2idx = tidx - 1;
}
if (r2idx != -1) {
mi = min(mi, abs(x - t[ridx]) + abs(t[ridx] - s[r2idx]));
}
if (l2idx != -1) {
mi = min(mi, abs(x - t[ridx]) + abs(t[ridx] - s[l2idx]));
}
}
if (lidx != -1) {
int sidx = lower_bound(s.begin(), s.end(), t[lidx]) - s.begin();
int r2idx = -1, l2idx = -1;
if (sidx == A) {
l2idx = sidx - 1;
} else if (sidx == 0) {
r2idx = 0;
} else {
r2idx = tidx;
l2idx = tidx - 1;
}
if (r2idx != -1) {
mi = min(mi, abs(x - t[lidx]) + abs(t[lidx] - s[r2idx]));
}
if (l2idx != -1) {
mi = min(mi, abs(x - t[lidx]) + abs(t[lidx] - s[l2idx]));
}
}
}
cout << mi << endl;
}
}
| #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, Q;
cin >> A >> B >> Q;
vector<ll> s(A), t(B);
rep(i, A) cin >> s[i];
rep(i, B) cin >> t[i];
sort(s.begin(), s.end());
sort(t.begin(), t.end());
rep(i, Q) {
ll x;
cin >> x;
ll mi = 1e18;
// 神社から始めた場合
{
int sidx = lower_bound(s.begin(), s.end(), x) - s.begin();
int ridx = -1, lidx = -1;
if (sidx == A) {
lidx = sidx - 1;
} else if (sidx == 0) {
ridx = 0;
} else {
ridx = sidx;
lidx = sidx - 1;
}
// 左
if (ridx != -1) {
int tidx = lower_bound(t.begin(), t.end(), s[ridx]) - t.begin();
int r2idx = -1, l2idx = -1;
if (tidx == B) {
l2idx = tidx - 1;
} else if (tidx == 0) {
r2idx = 0;
} else {
r2idx = tidx;
l2idx = tidx - 1;
}
if (r2idx != -1) {
mi = min(mi, abs(x - s[ridx]) + abs(s[ridx] - t[r2idx]));
}
if (l2idx != -1) {
mi = min(mi, abs(x - s[ridx]) + abs(s[ridx] - t[l2idx]));
}
}
if (lidx != -1) {
int tidx = lower_bound(t.begin(), t.end(), s[lidx]) - t.begin();
int r2idx = -1, l2idx = -1;
if (tidx == B) {
l2idx = tidx - 1;
} else if (tidx == 0) {
r2idx = 0;
} else {
r2idx = tidx;
l2idx = tidx - 1;
}
if (r2idx != -1) {
mi = min(mi, abs(x - s[lidx]) + abs(s[lidx] - t[r2idx]));
}
if (l2idx != -1) {
mi = min(mi, abs(x - s[lidx]) + abs(s[lidx] - t[l2idx]));
}
}
}
// 寺から始めた場合
{
int tidx = lower_bound(t.begin(), t.end(), x) - t.begin();
int ridx = -1, lidx = -1;
if (tidx == B) {
lidx = tidx - 1;
} else if (tidx == 0) {
ridx = 0;
} else {
ridx = tidx;
lidx = tidx - 1;
}
// 左
if (ridx != -1) {
int sidx = lower_bound(s.begin(), s.end(), t[ridx]) - s.begin();
int r2idx = -1, l2idx = -1;
if (sidx == A) {
l2idx = sidx - 1;
} else if (sidx == 0) {
r2idx = 0;
} else {
r2idx = sidx;
l2idx = sidx - 1;
}
if (r2idx != -1) {
mi = min(mi, abs(x - t[ridx]) + abs(t[ridx] - s[r2idx]));
}
if (l2idx != -1) {
mi = min(mi, abs(x - t[ridx]) + abs(t[ridx] - s[l2idx]));
}
}
if (lidx != -1) {
int sidx = lower_bound(s.begin(), s.end(), t[lidx]) - s.begin();
int r2idx = -1, l2idx = -1;
if (sidx == A) {
l2idx = sidx - 1;
} else if (sidx == 0) {
r2idx = 0;
} else {
r2idx = sidx;
l2idx = sidx - 1;
}
if (r2idx != -1) {
mi = min(mi, abs(x - t[lidx]) + abs(t[lidx] - s[r2idx]));
}
if (l2idx != -1) {
mi = min(mi, abs(x - t[lidx]) + abs(t[lidx] - s[l2idx]));
}
}
}
cout << mi << endl;
}
}
| [
"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;
long long ret = 9e18;
int ind = lower_bound(s.begin(), s.end(), x) - s.begin();
int jnd = lower_bound(t.begin(), t.end(), x) - t.begin();
if (ind < n && jnd < m) {
ret = min(ret, max(s[ind], t[jnd]) - x);
}
if (ind > 0 && jnd > 0) {
ret = min(ret, x - min(s[ind - 1], t[jnd - 1]));
}
if (ind > 0 && jnd < m) {
ret = min(ret, (x - s[ind - 1]) * 2 + (t[jnd] - x));
ret = min(ret, (x - s[ind - 1]) + 2 * (t[jnd] - x));
}
if (ind < n && jnd > 0) {
ret = min(ret, (s[ind] - x) * 2 + (x - t[jnd]));
ret = min(ret, (s[ind] - x) + 2 * (x - t[jnd]));
}
cout << ret << '\n';
}
return 0;
} | #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;
long long ret = 9e18;
int ind = lower_bound(s.begin(), s.end(), x) - s.begin();
int jnd = lower_bound(t.begin(), t.end(), x) - t.begin();
if (ind < n && jnd < m) {
ret = min(ret, max(s[ind], t[jnd]) - x);
}
if (ind > 0 && jnd > 0) {
ret = min(ret, x - min(s[ind - 1], t[jnd - 1]));
}
if (ind > 0 && jnd < m) {
ret = min(ret, (x - s[ind - 1]) * 2 + (t[jnd] - x));
ret = min(ret, (x - s[ind - 1]) + 2 * (t[jnd] - x));
}
if (ind < n && jnd > 0) {
ret = min(ret, (s[ind] - x) * 2 + (x - t[jnd - 1]));
ret = min(ret, (s[ind] - x) + 2 * (x - t[jnd - 1]));
}
cout << ret << '\n';
}
return 0;
} | [
"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) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define ll long long
#define endl '\n'
#define pi 3.14159265
ll p(ll a, ll b) {
ll res = 1;
while (b) {
if (b % 2 != 0)
res *= a;
a *= a;
b /= 2;
}
return res;
}
int main() {
IOS;
ll a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b);
for (ll i = 0; i < a; i++)
cin >> s[i];
for (ll j = 0; j < b; j++)
cin >> t[j];
sort(s.begin(), s.end());
sort(t.begin(), t.end());
while (q--) {
ll x;
cin >> x;
ll ans = 1e18;
ll tmp = 0;
auto it1 = lower_bound(s.begin(), s.end(), x);
auto it2 = lower_bound(t.begin(), t.end(), x);
auto it3 = lower_bound(s.begin(), s.end(), x);
auto it4 = lower_bound(t.begin(), t.end(), x);
if (it1 != s.end() || it2 != t.end())
ans = min(ans, max(*it1, *it2) - x);
if ((*it1 != x && it1 == s.begin()) || (*it2 != x && it2 == t.begin())) {
;
} else {
if (*it1 != x)
it1--;
if (*it2 != x)
it2--;
ans = min(ans, x - min(*it1, *it2));
}
if (it3 != s.end()) {
if (*it4 != x && it4 == t.begin()) {
;
} else {
if (*it4 != x)
it4--;
ans = min(ans, min(abs(x - *it4), abs(x - *it3)) * 2 +
max(abs(x - *it4), abs(x - *it3)));
it4 = lower_bound(t.begin(), t.end(), x);
;
}
}
if (it4 != t.end()) {
if (*it3 != x && it3 == s.begin()) {
;
} else {
if (*it3 != x)
it3--;
ans = min(ans, min(abs(x - *it4), abs(x - *it3)) * 2 +
max(abs(x - *it4), abs(x - *it3)));
}
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define ll long long
#define endl '\n'
#define pi 3.14159265
ll p(ll a, ll b) {
ll res = 1;
while (b) {
if (b % 2 != 0)
res *= a;
a *= a;
b /= 2;
}
return res;
}
int main() {
IOS;
ll a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b);
for (ll i = 0; i < a; i++)
cin >> s[i];
for (ll j = 0; j < b; j++)
cin >> t[j];
sort(s.begin(), s.end());
sort(t.begin(), t.end());
while (q--) {
ll x;
cin >> x;
ll ans = 1e18;
auto it1 = lower_bound(s.begin(), s.end(), x);
auto it2 = lower_bound(t.begin(), t.end(), x);
auto it3 = lower_bound(s.begin(), s.end(), x);
auto it4 = lower_bound(t.begin(), t.end(), x);
if (it1 != s.end() && it2 != t.end())
ans = min(ans, max(*it1, *it2) - x);
if ((*it1 != x && it1 == s.begin()) || (*it2 != x && it2 == t.begin())) {
;
} else {
if (*it1 != x)
it1--;
if (*it2 != x)
it2--;
ans = min(ans, x - min(*it1, *it2));
}
if (it3 != s.end()) {
if (*it4 != x && it4 == t.begin()) {
;
} else {
if (*it4 != x)
it4--;
ans = min(ans, min(abs(x - *it4), abs(x - *it3)) * 2 +
max(abs(x - *it4), abs(x - *it3)));
it4 = lower_bound(t.begin(), t.end(), x);
;
}
}
if (it4 != t.end()) {
if (*it3 != x && it3 == s.begin()) {
;
} else {
if (*it3 != x)
it3--;
ans = min(ans, min(abs(x - *it4), abs(x - *it3)) * 2 +
max(abs(x - *it4), abs(x - *it3)));
}
}
cout << ans << endl;
}
} | [
"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) {
scanf("%lld", &x);
ll ans = 1e18, bs = -1e18, as = 1e18, bt = -1e18, at = 1e18;
if (upper_bound(s, s + a, x) != s)
bs = s[upper_bound(s, s + a, x) - s - 1];
if (upper_bound(t, t + b, x) != t)
bt = t[upper_bound(t, t + b, x) - t - 1];
if (lower_bound(s, s + a, x) != s + a)
as = *(lower_bound(s, s + a, x));
if (lower_bound(t, t + a, x) != t + b)
at = *(lower_bound(t, t + b, x));
ans = x + at - 2 * bs;
if (ans > x + as - 2 * bt)
ans = x + as - 2 * bt;
if (ans > 2 * at - x - bs)
ans = 2 * at - x - bs;
if (ans > 2 * as - x - bt)
ans = 2 * as - x - bt;
if (ans > max(as, at) - x)
ans = max(as, at) - x;
if (ans > -min(bs, bt) + x)
ans = -min(bs, bt) + x;
printf("%lld\n", ans);
}
return 0;
} | #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) {
scanf("%lld", &x);
ll ans = 1e18, bs = -1e18, as = 1e18, bt = -1e18, at = 1e18;
if (upper_bound(s, s + a, x) != s)
bs = s[upper_bound(s, s + a, x) - s - 1];
if (upper_bound(t, t + b, x) != t)
bt = t[upper_bound(t, t + b, x) - t - 1];
if (lower_bound(s, s + a, x) != s + a)
as = *(lower_bound(s, s + a, x));
if (lower_bound(t, t + b, x) != t + b)
at = *(lower_bound(t, t + b, x));
ans = x + at - 2 * bs;
if (ans > x + as - 2 * bt)
ans = x + as - 2 * bt;
if (ans > 2 * at - x - bs)
ans = 2 * at - x - bs;
if (ans > 2 * as - x - bt)
ans = 2 * as - x - bt;
if (ans > max(as, at) - x)
ans = max(as, at) - x;
if (ans > -min(bs, bt) + x)
ans = -min(bs, bt) + x;
printf("%lld\n", ans);
}
return 0;
} | [
"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) {
scanf("%lld", &x);
ll ans = 1e18, bs = -1e18, as = 1e18, bt = -1e18, at = 1e18;
if (upper_bound(s, s + a, x) != s)
bs = s[upper_bound(s, s + a, x) - s - 1];
if (upper_bound(t, t + b, x) != t)
bt = t[upper_bound(t, t + b, x) - t - 1];
if (lower_bound(s, s + a, x) != s + a)
as = *(lower_bound(s, s + a, x));
if (lower_bound(t, t + a, x) != t + a)
at = *(lower_bound(t, t + b, x));
ans = x + at - 2 * bs;
if (ans > x + as - 2 * bt)
ans = x + as - 2 * bt;
if (ans > 2 * at - x - bs)
ans = 2 * at - x - bs;
if (ans > 2 * as - x - bt)
ans = 2 * as - x - bt;
if (ans > max(as, at) - x)
ans = max(as, at) - x;
if (ans > -min(bs, bt) + x)
ans = -min(bs, bt) + x;
printf("%lld\n", ans);
}
return 0;
} | #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) {
scanf("%lld", &x);
ll ans = 1e18, bs = -1e18, as = 1e18, bt = -1e18, at = 1e18;
if (upper_bound(s, s + a, x) != s)
bs = s[upper_bound(s, s + a, x) - s - 1];
if (upper_bound(t, t + b, x) != t)
bt = t[upper_bound(t, t + b, x) - t - 1];
if (lower_bound(s, s + a, x) != s + a)
as = *(lower_bound(s, s + a, x));
if (lower_bound(t, t + b, x) != t + b)
at = *(lower_bound(t, t + b, x));
ans = x + at - 2 * bs;
if (ans > x + as - 2 * bt)
ans = x + as - 2 * bt;
if (ans > 2 * at - x - bs)
ans = 2 * at - x - bs;
if (ans > 2 * as - x - bt)
ans = 2 * as - x - bt;
if (ans > max(as, at) - x)
ans = max(as, at) - x;
if (ans > -min(bs, bt) + x)
ans = -min(bs, bt) + x;
printf("%lld\n", ans);
}
return 0;
} | [
"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 namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void open(const char *s) {
#ifndef ONLINE_JUDGE
char str[100];
sprintf(str, "%s.in", s);
freopen(str, "r", stdin);
sprintf(str, "%s.out", s);
freopen(str, "w", stdout);
#endif
}
void open2(const char *s) {
#ifdef DEBUG
char str[100];
sprintf(str, "%s.in", s);
freopen(str, "r", stdin);
sprintf(str, "%s.out", s);
freopen(str, "w", stdout);
#endif
}
template <class T> int upmin(T &a, const T &b) {
return (b < a ? a = b, 1 : 0);
}
template <class T> int upmax(T &a, const T &b) {
return (b > a ? a = b, 1 : 0);
}
namespace io {
const int SIZE = (1 << 20) + 1;
char ibuf[SIZE], *iS, *iT;
char obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1;
int getc() {
(iS == iT ? iS = ibuf, iT = ibuf + fread(ibuf, 1, SIZE, stdin) : 0);
return iS == iT ? EOF : *(iS++);
}
int f;
char c;
template <class T> void get(T &x) {
f = 1;
for (c = getc(); (c < '0' || c > '9') && c != '-'; c = getc())
;
(c == '-' ? f = -1, c = getc() : 0);
x = 0;
for (; c >= '0' && c <= '9'; c = getc())
x = x * 10 + c - '0';
x *= f;
}
void flush() {
fwrite(obuf, 1, oS - obuf, stdout);
oS = obuf;
}
void putc(char x) {
*(oS++) = x;
if (oS == oT)
flush();
}
int a[55], t;
template <class T> void put(T x) {
if (!x)
putc('0');
x < 0 ? putc('-'), x = -x : 0;
while (x) {
a[++t] = x % 10;
x /= 10;
}
while (t)
putc(a[t--] + '0');
}
void space() { putc(' '); }
void enter() { putc('\n'); }
struct flusher {
~flusher() { flush(); }
} io_flusher;
} // namespace io
ll query(ll x, ll y, ll z) {
return min(abs(x - y) + abs(y - z), abs(x - z) + abs(y - z));
}
const int N = 100010;
ll a[N], b[N];
int n, m, q;
ll x;
int main() {
scanf("%d%d%d", &n, &m, &q);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 1; i <= m; i++)
scanf("%lld", &b[i]);
for (int i = 1; i <= q; i++) {
scanf("%lld", &x);
int t1 = lower_bound(a + 1, a + n + 1, x) - a;
int t2 = lower_bound(b + 1, b + m + 1, x) - b;
ll ans = 0x7fffffffffffffffll;
if (t1 <= n) {
if (t2 <= n)
ans = min(ans, query(x, a[t1], b[t2]));
if (t2 > 1)
ans = min(ans, query(x, a[t1], b[t2 - 1]));
}
if (t1 > 1) {
if (t2 <= n)
ans = min(ans, query(x, a[t1 - 1], b[t2]));
if (t2 > 1)
ans = min(ans, query(x, a[t1 - 1], b[t2 - 1]));
}
printf("%lld\n", ans);
}
return 0;
} | /*
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 namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void open(const char *s) {
#ifndef ONLINE_JUDGE
char str[100];
sprintf(str, "%s.in", s);
freopen(str, "r", stdin);
sprintf(str, "%s.out", s);
freopen(str, "w", stdout);
#endif
}
void open2(const char *s) {
#ifdef DEBUG
char str[100];
sprintf(str, "%s.in", s);
freopen(str, "r", stdin);
sprintf(str, "%s.out", s);
freopen(str, "w", stdout);
#endif
}
template <class T> int upmin(T &a, const T &b) {
return (b < a ? a = b, 1 : 0);
}
template <class T> int upmax(T &a, const T &b) {
return (b > a ? a = b, 1 : 0);
}
namespace io {
const int SIZE = (1 << 20) + 1;
char ibuf[SIZE], *iS, *iT;
char obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1;
int getc() {
(iS == iT ? iS = ibuf, iT = ibuf + fread(ibuf, 1, SIZE, stdin) : 0);
return iS == iT ? EOF : *(iS++);
}
int f;
char c;
template <class T> void get(T &x) {
f = 1;
for (c = getc(); (c < '0' || c > '9') && c != '-'; c = getc())
;
(c == '-' ? f = -1, c = getc() : 0);
x = 0;
for (; c >= '0' && c <= '9'; c = getc())
x = x * 10 + c - '0';
x *= f;
}
void flush() {
fwrite(obuf, 1, oS - obuf, stdout);
oS = obuf;
}
void putc(char x) {
*(oS++) = x;
if (oS == oT)
flush();
}
int a[55], t;
template <class T> void put(T x) {
if (!x)
putc('0');
x < 0 ? putc('-'), x = -x : 0;
while (x) {
a[++t] = x % 10;
x /= 10;
}
while (t)
putc(a[t--] + '0');
}
void space() { putc(' '); }
void enter() { putc('\n'); }
struct flusher {
~flusher() { flush(); }
} io_flusher;
} // namespace io
ll query(ll x, ll y, ll z) {
return min(abs(x - y) + abs(y - z), abs(x - z) + abs(y - z));
}
const int N = 100010;
ll a[N], b[N];
int n, m, q;
ll x;
int main() {
scanf("%d%d%d", &n, &m, &q);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 1; i <= m; i++)
scanf("%lld", &b[i]);
for (int i = 1; i <= q; i++) {
scanf("%lld", &x);
int t1 = lower_bound(a + 1, a + n + 1, x) - a;
int t2 = lower_bound(b + 1, b + m + 1, x) - b;
ll ans = 0x7fffffffffffffffll;
if (t1 <= n) {
if (t2 <= m)
ans = min(ans, query(x, a[t1], b[t2]));
if (t2 > 1)
ans = min(ans, query(x, a[t1], b[t2 - 1]));
}
if (t1 > 1) {
if (t2 <= m)
ans = min(ans, query(x, a[t1 - 1], b[t2]));
if (t2 > 1)
ans = min(ans, query(x, a[t1 - 1], b[t2 - 1]));
}
printf("%lld\n", ans);
}
return 0;
} | [
"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++)
#define pb push_back
ll max(ll a, ll b) {
if (a < b)
return b;
else
return a;
}
ll min(ll a, ll b) {
if (a > b)
return b;
else
return a;
}
void Max(ll &pos, ll val) { pos = max(pos, val); } // Max(dp[n],dp[n-1]);
void Min(ll &pos, ll val) { pos = min(pos, val); }
void Add(ll &pos, ll val) { pos = mod(pos + val); }
long double EPS = 1E-9;
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
////////////////////////////////////////
ll cal(ll p, ll x, ll y) {
ll res = inf;
Min(res, abs(p - x) + abs(x - y));
Min(res, abs(p - y) + abs(y - x));
return res;
}
int main() {
fastio;
ll a, b, q;
cin >> a >> b >> q;
ll s[a + 2];
rep(i, 1, a) cin >> s[i];
s[0] = -inf;
s[a + 1] = inf;
ll t[b + 2];
rep(i, 1, b) cin >> t[i];
t[0] = -inf;
t[b + 1] = inf;
while (q--) {
ll p;
cin >> p;
ll x = lower_bound(s, s + 2, p) - s;
ll y = lower_bound(t, t + 2, p) - t;
ll ans = inf;
Min(ans, cal(p, s[x], t[y]));
Min(ans, cal(p, s[x - 1], t[y]));
Min(ans, cal(p, s[x], t[y - 1]));
Min(ans, cal(p, s[x - 1], t[y - 1]));
cout << ans << endl;
}
return 0;
}
| #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++)
#define pb push_back
ll max(ll a, ll b) {
if (a < b)
return b;
else
return a;
}
ll min(ll a, ll b) {
if (a > b)
return b;
else
return a;
}
void Max(ll &pos, ll val) { pos = max(pos, val); } // Max(dp[n],dp[n-1]);
void Min(ll &pos, ll val) { pos = min(pos, val); }
void Add(ll &pos, ll val) { pos = mod(pos + val); }
long double EPS = 1E-9;
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
////////////////////////////////////////
ll cal(ll p, ll x, ll y) {
ll res = inf;
Min(res, abs(p - x) + abs(x - y));
Min(res, abs(p - y) + abs(y - x));
return res;
}
int main() {
fastio;
ll a, b, q;
cin >> a >> b >> q;
ll s[a + 2];
rep(i, 1, a) cin >> s[i];
s[0] = -inf;
s[a + 1] = inf;
ll t[b + 2];
rep(i, 1, b) cin >> t[i];
t[0] = -inf;
t[b + 1] = inf;
while (q--) {
ll p;
cin >> p;
ll x = lower_bound(s, s + a + 2, p) - s;
ll y = lower_bound(t, t + b + 2, p) - t;
ll ans = inf;
Min(ans, cal(p, s[x], t[y]));
Min(ans, cal(p, s[x - 1], t[y]));
Min(ans, cal(p, s[x], t[y - 1]));
Min(ans, cal(p, s[x - 1], t[y - 1]));
cout << ans << endl;
}
return 0;
}
| [
"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(NULL); \
return 0; \
}();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll, ll>
#define debug(x) cout << x << "\n";
#define debugg cout << "debugged\n";
#define setpr(xval) cout << fixed << setprecision(12) << xval << endl;
#define minval -2e9
#define maxval 2e9
long double PI = 3.14159265358979323846;
const ll M = 1e9 + 7;
const ll inf = 1e18;
const ll ms = 2e5 + 5;
fast;
ll n, m, k, ans;
void solve() {
cin >> n >> m;
vector<ll> ar(m + 1, 0);
for (ll i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
ll a;
cin >> a;
ar[a]++;
}
}
for (ll i = 1; i <= m; i++) {
if (ar[i] == m)
ans++;
}
cout << ans << endl;
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// int t;cin>>t;while(t--)
{ solve(); }
return 0;
} | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
return 0; \
}();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll, ll>
#define debug(x) cout << x << "\n";
#define debugg cout << "debugged\n";
#define setpr(xval) cout << fixed << setprecision(12) << xval << endl;
#define minval -2e9
#define maxval 2e9
long double PI = 3.14159265358979323846;
const ll M = 1e9 + 7;
const ll inf = 1e18;
const ll ms = 2e5 + 5;
fast;
ll n, m, k, ans;
void solve() {
cin >> n >> m;
vector<ll> ar(m + 1, 0);
for (ll i = 0; i < n; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
ll a;
cin >> a;
ar[a]++;
}
}
for (ll i = 1; i <= m; i++) {
if (ar[i] == n)
ans++;
}
cout << ans << endl;
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// int t;cin>>t;while(t--)
{ solve(); }
return 0;
} | [
"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[i] == n)
ans++;
}
cout << ans << endl;
} | #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 (cnt[i] == n)
ans++;
}
cout << ans << endl;
} | [
"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 (cnt.at(i) == n)
ans++;
}
cout << ans << endl;
} | #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 (cnt.at(i) == n)
ans++;
}
cout << ans << endl;
} | [
"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) {
G++;
}
}
cout << G << endl;
}
| #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) {
G++;
}
}
cout << G << endl;
} | [
"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] == N) {
ans++;
}
}
cout << ans << endl;
} | #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[i] == N) {
ans++;
}
}
cout << ans << endl;
} | [
"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;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
int n, m;
cin >> n >> m;
vector<int> d(m);
rep(i, n) {
int k;
cin >> k;
rep(j, k) {
int a;
cin >> a;
d[a]++;
}
}
int ans = 0;
rep(i, m) {
if (d[i] == n)
ans++;
}
cout << ans << endl;
} | #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;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
int n, m;
cin >> n >> m;
vector<int> d(m);
rep(i, n) {
int k;
cin >> k;
rep(j, k) {
int a;
cin >> a;
d[a - 1]++;
}
}
int ans = 0;
rep(i, m) {
if (d[i] == n)
ans++;
}
cout << ans << endl;
}
| [
"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)
ans++;
}
cout << ans << endl;
} | #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)
ans++;
}
cout << ans << endl;
} | [
"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++) {
if (A[h] == N) {
res++;
}
}
cout << res << endl;
return 0;
} | #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; h++) {
if (A[h] == N) {
res++;
}
}
cout << res << endl;
return 0;
} | [
"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;
cin >> a;
c[a - 1]++;
}
}
int d = 0;
rep(i, 0, n) {
if (c[i] == m)
d++;
}
cout << d << endl;
} | #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;
cin >> a;
c[a - 1]++;
}
}
int d = 0;
rep(i, 0, m) {
if (c[i] == n)
d++;
}
cout << d << endl;
} | [
"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
const double PI = acos(-1);
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
ll modm(ll val, ll m) {
ll res = val % m;
if (res < 0)
res += m;
return res;
}
int main() {
ios_base::sync_with_stdio(false);
ll n, m, k, ans = 0;
cin >> n >> m;
vector<vector<ll>> A(n, vector<ll>(m, 0));
vector<ll> s(m, 0);
rep(i, n) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> A[i][j];
A[i][j]--;
s[A[i][j]]++;
}
}
rep(c, m) {
if (s[k] == n) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| #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
const double PI = acos(-1);
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
ll modm(ll val, ll m) {
ll res = val % m;
if (res < 0)
res += m;
return res;
}
int main() {
ios_base::sync_with_stdio(false);
ll n, m, k, ans = 0;
cin >> n >> m;
vector<vector<ll>> A(n, vector<ll>(m, 0));
vector<ll> s(m, 0);
rep(i, n) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> A[i][j];
A[i][j]--;
s[A[i][j]]++;
}
}
rep(c, m) {
if (s[c] == n) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"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 = 0; i < m; i++) {
if (a[i] == n)
ans++;
}
cout << ans << "\n";
return 0;
}
| #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 = 0; i < m; i++) {
if (a[i + 1] == n)
ans++;
}
cout << ans << "\n";
return 0;
}
| [
"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) {
ans++;
}
}
cout << ans << endl;
}
| #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] == N) {
ans++;
}
}
cout << ans << endl;
} | [
"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 << br;
}
| #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 << br;
}
| [] | 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;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
vec[a]++;
}
}
int cnt = 0;
for (int i = 0; i < m; i++) {
if (vec[i] == n)
cnt++;
}
out(cnt);
} | #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;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
vec[a - 1]++;
}
}
int cnt = 0;
for (int i = 0; i < m; i++) {
if (vec[i] == n)
++cnt;
}
out(cnt);
} | [
"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<string>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define _GLIBCXX_DEBUG
int main() {
int n, m;
cin >> n >> m;
vin k(n);
vvin a(n, vin(m));
rep(i, n) {
cin >> k[i];
rep(j, k[i]) cin >> a[i][j];
}
vin b(m, 0);
for (int i = 1; i <= m; i++) {
rep(j, n) {
rep(l, k[j]) {
if (a[j][l] == i)
b[i]++;
}
}
}
int sum = 0;
rep(i, m) {
if (b[i] == n)
sum++;
}
cout << sum << endl;
} | #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<string>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define _GLIBCXX_DEBUG
int main() {
int n, m;
cin >> n >> m;
vin k(n);
vvin a(n, vin(m));
rep(i, n) {
cin >> k[i];
rep(j, k[i]) cin >> a[i][j];
}
vin b(m, 0);
for (int i = 1; i <= m; i++) {
rep(j, n) {
rep(l, k[j]) {
if (a[j][l] == i)
b[i - 1]++;
}
}
}
int sum = 0;
rep(i, m) {
if (b[i] == n)
sum++;
}
cout << sum << endl;
} | [
"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; l < y[j]; l++) {
if (x[j][l] == i)
p++;
break;
}
}
if (p == a)
o++;
p = 0;
}
cout << o << endl;
return 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; l < y[j]; l++) {
if (x[j][l] == i)
p++;
}
}
if (p == a)
o++;
p = 0;
}
cout << o << endl;
return 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 (int j = 0; j < an; j++) {
cin >> ln;
like[ln]++;
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
if (like[i] == n) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #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 (int j = 0; j < an; j++) {
cin >> ln;
like[ln - 1]++;
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
if (like[i] == n) {
ans++;
}
}
cout << ans << endl;
return 0;
} | [
"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 >> m;
map<int, int> mp;
for (int i = 1; i <= m; ++i)
mp[i] = 0;
long long c, e;
for (int i = 0; i < n; ++i) {
cin >> c;
for (int j = 0; j < c; ++j) {
cin >> e;
mp[e]++;
}
}
long long ans = 0;
for (int i = 0; i < m; ++i)
if (mp[i] == n)
ans++;
cout << ans;
} | #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 >> m;
map<int, int> mp;
for (int i = 1; i <= m; ++i)
mp[i] = 0;
long long c, e;
for (int i = 0; i < n; ++i) {
cin >> c;
for (int j = 0; j < c; ++j) {
cin >> e;
mp[e]++;
}
}
long long ans = 0;
for (int i = 1; i <= m; ++i)
if (mp[i] == n)
ans++;
cout << ans;
} | [
"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", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> a >> b;
for (int i = 0; i < a; ++i) {
cin >> c;
for (int i = 0; i < c; ++i) {
cin >> s;
ar[s]++;
}
}
int ans = 0;
for (int i = 1; i < b; ++i) {
if (ar[i] == a)
ans++;
}
cout << ans;
return 0;
}
| #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", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> a >> b;
for (int i = 0; i < a; ++i) {
cin >> c;
for (int i = 0; i < c; ++i) {
cin >> s;
ar[s]++;
}
}
int ans = 0;
for (int i = 1; i < b + 1; ++i) {
if (ar[i] == a)
ans++;
}
cout << ans;
return 0;
} | [
"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", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> a >> b;
for (int i = 0; i < a; ++i) {
cin >> c;
for (int i = 0; i < c; ++i) {
cin >> s;
ar[s]++;
}
}
int ans = 0;
for (int i = 1; i < b; ++i) {
if (ar[i] == 3)
ans++;
}
cout << ans;
return 0;
}
| #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", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> a >> b;
for (int i = 0; i < a; ++i) {
cin >> c;
for (int i = 0; i < c; ++i) {
cin >> s;
ar[s]++;
}
}
int ans = 0;
for (int i = 1; i < b + 1; ++i) {
if (ar[i] == a)
ans++;
}
cout << ans;
return 0;
} | [
"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()
#define pb(a) push_back(a) //追加//
#define pp() pop_back() //削除//
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
signed main() {
int n, m;
cin >> n >> m;
int ans = 0;
V<int> b(m, 0);
for (int i = 0; i < n; i++) {
int k;
V<int> a(k);
fo(j, k) { cin >> a[j]; }
fo(j, k) { b[a[j] - 1]++; }
}
fo(i, m) {
if (b[i] == n)
ans++;
}
cout << ans << endl;
}
| #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()
#define pb(a) push_back(a) //追加//
#define pp() pop_back() //削除//
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
signed main() {
int n, m;
cin >> n >> m;
int ans = 0;
V<int> b(m, 0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
V<int> a(k);
fo(j, k) { cin >> a[j]; }
fo(j, k) { b[a[j] - 1]++; }
}
fo(i, m) {
if (b[i] == n)
ans++;
}
cout << ans << endl;
}
| [] | 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)
cl++;
}
cout << cl << endl;
return 0;
}
| #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)
cl++;
}
cout << cl << endl;
return 0;
}
| [
"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)
ret++;
}
cout << ret << endl;
}
| #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] << endl;
if (ans[l] == n)
ret++;
}
cout << ret << endl;
} | [
"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)
ans++;
cout << ans << endl;
} | #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)
ans++;
cout << ans << endl;
} | [
"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)
c++;
}
cout << c;
return 0;
} | #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)
c++;
}
cout << c;
return 0;
} | [
"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++) {
int a;
cin >> a;
sum[a - 1]++;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (sum[i] == n)
ans++;
}
cout << ans << endl;
return 0;
}
| #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++) {
int a;
cin >> a;
sum[a - 1]++;
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
if (sum[i] == n)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"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)
ans++;
}
cout << ans << endl;
} | #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)
ans++;
}
cout << ans << endl;
} | [
"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++;
}
cout << ans << endl;
} | #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)
ans++;
}
cout << ans << endl;
} | [
"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) {
if (L[i] == N)
ans += 1;
}
cout << ans << endl;
} | #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; ++i) {
if (L[i] == N)
ans += 1;
}
cout << ans << endl;
} | [
"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 << endl;
return 0;
}
| #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 << endl;
return 0;
}
| [
"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)
sum++;
}
cout << sum;
}
| #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] == N)
sum++;
}
cout << sum;
}
| [
"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++;
}
cout << ans << endl;
}
| #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++;
}
cout << ans << endl;
}
| [
"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_back(in);
}
}
for (int i = 0; i < M; i++) {
n_cnt = count(A.begin(), A.end(), i);
if (n_cnt == N)
cnt++;
}
cout << cnt;
} | #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(in);
}
}
for (int i = 1; i <= M; i++) {
n_cnt = count(A.begin(), A.end(), i);
if (n_cnt == N)
cnt++;
}
cout << cnt;
} | [
"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(in);
}
}
for (int i = 0; i < M; i++) {
n_cnt = count(A.begin(), A.end(), i);
if (n_cnt == N)
cnt++;
}
cout << cnt;
} | #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(in);
}
}
for (int i = 1; i <= M; i++) {
n_cnt = count(A.begin(), A.end(), i);
if (n_cnt == N)
cnt++;
}
cout << cnt;
} | [
"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; i < b; i++) {
if (c[i] == a) {
f++;
}
}
cout << f << endl;
}
| #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; i < b; i++) {
if (c[i] == a) {
f++;
}
}
cout << f << endl;
}
| [
"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 INF = 1000000007; //最大値兼MOD
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } // GCD
bool is_prime(long long n) { //素数判定
for (int64_t i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> v(50);
rep0(i, n) {
int k;
cin >> k;
rep0(j, k) {
int temp;
cin >> temp;
v[temp]++;
}
}
int ans = 0;
rep1(l, m) {
if (v[l] == n) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| #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 INF = 1000000007; //最大値兼MOD
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } // GCD
bool is_prime(long long n) { //素数判定
for (int64_t i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> v(50);
rep0(i, n) {
int k;
cin >> k;
rep0(j, k) {
int temp;
cin >> temp;
v[temp]++;
}
}
int ans = 0;
rep1(l, m + 1) {
if (v[l] == n) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"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++) {
if (menu[i] == n)
ans += 1;
}
cout << ans << endl;
} | #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++) {
if (menu[i] == n)
ans += 1;
}
cout << ans << endl;
} | [
"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++;
}
cout << ans << endl;
} | #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++;
}
cout << ans << endl;
} | [
"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) {
int foodkazu;
cin >> foodkazu;
REP(t, 0, foodkazu) {
int foodindex;
cin >> foodindex;
sukifood[foodindex]++;
}
}
REP(i, 0, food) {
if (sukifood[i] == person)
index++;
}
cout << index << endl;
return 0;
} | #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) {
int foodkazu;
cin >> foodkazu;
REP(t, 0, foodkazu) {
int foodindex;
cin >> foodindex;
sukifood[foodindex - 1]++;
}
}
REP(i, 0, food) {
if (sukifood[i] == person)
index++;
}
cout << index << endl;
return 0;
} | [
"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 (foods[i] == n) {
ans++;
}
}
cout << ans << endl;
} | #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 (foods[i] == n) {
ans++;
}
}
cout << ans << endl;
} | [
"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 (foods[i] == n) {
ans++;
}
}
cout << ans;
} | #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 (foods[i] == n) {
ans++;
}
}
cout << ans << endl;
} | [
"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 (int i = 1; i < m; i++) {
if (likes[i] == n)
ret++;
}
cout << ret;
return 0;
} | #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 (int i = 1; i <= m; i++) {
if (likes[i] == n)
ret++;
}
cout << ret;
return 0;
} | [
"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 (int i = 0; i < m; i++) {
if (likes[i] == n)
ret++;
}
cout << ret;
return 0;
} | #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 (int i = 1; i <= m; i++) {
if (likes[i] == n)
ret++;
}
cout << ret;
return 0;
} | [
"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) {
ans++;
}
}
cout << ans << endl;
} | #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) {
ans++;
}
}
cout << ans << endl;
} | [
"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]++;
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
if (count[i] = n) {
ans++;
}
}
cout << ans << endl;
} | #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]++;
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
if (count[i] == n) {
ans++;
}
}
cout << ans << endl;
} | [
"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 chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> pref_vec(M);
int tmp_K;
int tmp_A;
for (int i = 0; i < N; i++) {
cin >> tmp_K;
for (int j = 0; j < tmp_K; j++) {
cin >> tmp_A;
pref_vec[tmp_A] += 1;
}
}
int ans = 0;
for (int i = 0; i < M; i++) {
if (pref_vec[i] == N) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| #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 chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> pref_vec(M);
int tmp_K;
int tmp_A;
for (int i = 0; i < N; i++) {
cin >> tmp_K;
for (int j = 0; j < tmp_K; j++) {
cin >> tmp_A;
pref_vec[tmp_A - 1] += 1;
}
}
int ans = 0;
for (int i = 0; i < M; i++) {
if (pref_vec[i] == N) {
ans = ans + 1;
}
}
cout << ans << endl;
return 0;
}
| [
"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;
}
}
int ans;
ans = 0;
for (int i = 0; i < n; i++) {
if (H[i] == n) {
ans += 1;
}
}
cout << ans << endl;
} | #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;
}
}
int ans;
ans = 0;
for (int i = 0; i < m; i++) {
if (H[i] == n) {
ans += 1;
}
}
cout << ans << endl;
} | [
"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;
}
}
cout << ans << endl;
} | #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;
}
}
cout << ans << endl;
} | [
"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>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) cout << " " << v[_]; \
puts(""); \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
#define mt make_tuple
typedef tuple<int, int, int, int> tp;
typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
// template<class C>constexpr int size(const C &c){return (int)c.size();}
// template<class T,size_t N> constexpr int size(const T
// (&xs)[N])noexcept{return (int)N;}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
// int dx[]={0,1,0,-1};
// int dy[]={1,0,-1,0};//RDLU
#define yes puts("YES")
#define no puts("NO")
int dp[310][310][310];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vi co(m);
rep(i, n) {
int a;
cin >> a;
rep(j, a) {
int b;
cin >> b;
co[b - 1]++;
}
}
int c = 0;
rep(i, n) if (n == co[i]) c++;
cout << c << endl;
}
| // 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>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) cout << " " << v[_]; \
puts(""); \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
#define mt make_tuple
typedef tuple<int, int, int, int> tp;
typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
// template<class C>constexpr int size(const C &c){return (int)c.size();}
// template<class T,size_t N> constexpr int size(const T
// (&xs)[N])noexcept{return (int)N;}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
// int dx[]={0,1,0,-1};
// int dy[]={1,0,-1,0};//RDLU
#define yes puts("YES")
#define no puts("NO")
int dp[310][310][310];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vi co(m);
rep(i, n) {
int a;
cin >> a;
rep(j, a) {
int b;
cin >> b;
co[b - 1]++;
}
}
int c = 0;
rep(i, m) if (n == co[i]) c++;
cout << c << endl;
}
| [
"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++) {
if (c[t] == n)
counter++;
}
cout << counter << endl;
return 0;
} | #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++) {
if (c[t] == n)
counter++;
}
cout << counter << endl;
return 0;
} | [
"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 (c[t] == n)
counter++;
}
cout << counter << endl;
return 0;
} | #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++) {
if (c[t] == n)
counter++;
}
cout << counter << endl;
return 0;
} | [
"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 (b[i] == n)
ans++;
printf("%d\n", ans);
return 0;
} | #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 (b[i] == n)
ans++;
printf("%d\n", ans);
return 0;
} | [
"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(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define INF (ll)1e18
#define MOD (ll)1e9 + 7
#define pb push_back
typedef long long ll;
typedef long long int llt;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
char dif = 'A' - 'a';
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
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]++;
}
}
int sum = 0;
for (int i = 1; i <= m; i++) {
if (cnt[i] == n)
sum++;
}
cout << sum << endl;
return 0;
} | #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(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define INF (ll)1e18
#define MOD (ll)1e9 + 7
#define pb push_back
typedef long long ll;
typedef long long int llt;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
char dif = 'A' - 'a';
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> 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 sum = 0;
for (int i = 1; i <= m; i++) {
if (cnt[i] == n)
sum++;
}
cout << sum << endl;
return 0;
} | [
"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++) {
if (count[i] == N)
ans++;
}
cout << ans;
}
| #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++) {
if (count[i] == N)
ans++;
}
cout << ans;
}
| [
"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]++;
}
}
int result = 0;
for (int i = 0; i < M; i++)
if (food[i] == N)
result++;
cout << result << endl;
return 0;
} | #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]++;
}
}
int result = 0;
for (int i = 0; i < M; i++)
if (food[i] == N)
result++;
cout << result << endl;
return 0;
} | [
"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] << endl;
if (n == a[i])
ans++;
}
cout << ans << endl;
return 0;
} | #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 << a[i] << endl;
if (n == a[i])
ans++;
}
cout << ans << endl;
return 0;
} | [
"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 << a[i] << endl;
if (n == a[i])
ans++;
}
cout << ans << endl;
return 0;
} | #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 << a[i] << endl;
if (n == a[i])
ans++;
}
cout << ans << endl;
return 0;
} | [
"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];
}
}
int res = 0;
REP(i, n) {
if (c[i] == n) {
++res;
}
}
cout << res << endl;
return 0;
} | #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];
}
}
int res = 0;
REP(i, m) {
if (c[i] == n) {
++res;
}
}
cout << res << endl;
return 0;
} | [] | 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;
food[j]++;
}
}
int count = 0;
for (int i = 0; i < m; i++) {
if (food[i] == n)
count++;
}
cout << count << endl;
return 0;
} | #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;
food[j - 1]++;
}
}
int count = 0;
for (int i = 0; i < m; i++) {
if (food[i] == n)
count++;
}
cout << count << endl;
return 0;
} | [
"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;
food[j]++;
}
}
int count = 0;
for (int i = 0; i < m; i++) {
if (food[i] == n)
count++;
}
cout << count << endl;
return 0;
} | #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;
food[j - 1]++;
}
}
int count = 0;
for (int i = 0; i < m; i++) {
if (food[i] == n)
count++;
}
cout << count << endl;
return 0;
} | [
"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 k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
food[a - 1]++;
}
}
for (int i = 0; i < m; i++) {
if (food[i] == n)
ans++;
}
cout << ans << endl;
return 0;
}
| #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;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
food[a - 1]++;
}
}
for (int i = 0; i < m; i++) {
if (food[i] == n)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"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 k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
food[a]++;
}
}
for (int i = 0; i < m; i++) {
if (food[i] == n)
ans++;
}
cout << ans << endl;
return 0;
}
| #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;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
food[a - 1]++;
}
}
for (int i = 0; i < m; i++) {
if (food[i] == n)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"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
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
const ll INF = LLONG_MAX - 100;
const ll mod = 1e9 + 7;
const int MAX_N = 5e5 + 5;
int dx[] = {-1LL, 0, 1LL, 0}, dy[] = {0, 1LL, 0, -1LL};
vector<ll> prime;
ll inv[MAX_N], fac[MAX_N];
template <class T = ll> T in() {
T x;
cin >> x;
return (x);
}
inline ll GCD(ll a, ll b) {
ll c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
inline ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
inline ll POW(ll a, ll b) {
ll c = 1LL;
while (b > 0) {
if (b & 1LL) {
c = a * c % mod;
}
a = a * a % mod;
b >>= 1LL;
}
return c;
}
inline void _nCr() {
fac[0] = 1LL;
for (int i = 1LL; i < MAX_N; i++) {
fac[i] = fac[i - 1LL] * i % mod;
}
for (int i = 0; i < MAX_N; i++) {
inv[i] = POW(fac[i], mod - 2);
}
}
inline ll nCr(ll n, ll r) { return (fac[n] * inv[r] % mod) * inv[n - r] % mod; }
inline void PRI(ll n) {
bool a[n + 1LL];
for (int i = 0; i < n + 1LL; i++) {
a[i] = 1LL;
}
for (int i = 2; i < n + 1LL; i++) {
if (a[i]) {
prime.pb(i);
ll b = i;
while (b <= n) {
a[b] = 0;
b += i;
}
}
}
}
typedef pair<int, pair<int, int>> edge;
class UnionFind {
private:
vector<int> par;
public:
UnionFind(int N) { par = vector<int>(N, -1LL); }
int find(int x);
ll size(int x);
void unite(int x, int y);
bool same(int x, int y);
};
class Kruskal {
private:
UnionFind *uf;
vector<edge> e;
public:
vector<edge> mst;
Kruskal(int N) { uf = new UnionFind(N); }
void add(int x, int y, ll z);
void run();
};
//----UnionFind-------------------------------
int UnionFind::find(int x) {
if (par[x] < 0)
return x;
else
return par[x] = find(par[x]);
}
ll UnionFind::size(int x) { return -par[find(x)]; }
void UnionFind::unite(int x, int y) {
x = find(x);
y = find(y);
//大きい方に小さい方をくっ付ける
if (size(x) < size(y))
swap(x, y);
par[x] += par[y];
par[y] = x;
}
bool UnionFind::same(int x, int y) {
x = find(x);
y = find(y);
return x == y;
}
//----Kruskal-------------------------------
void Kruskal::add(int x, int y, ll z) {
// x < y
if (x > y)
swap(x, y);
e.push_back({z, {x, y}});
}
void Kruskal::run() {
sort(e.begin(), e.end());
e.erase(unique(e.begin(), e.end()), e.end());
for (auto x : e) {
if (uf->same(x.second.first, x.second.second)) {
continue;
} else {
mst.push_back(x);
uf->unite(x.second.first, x.second.second);
}
}
}
signed main() {
int n, m;
cin >> n >> m;
int cnt[m];
REP(i, m) cnt[i] = 0;
for (int i = 0; i < m; i++) {
int x = in();
for (int j = 0; j < x; j++)
cnt[in() - 1]++;
}
int ans = 0;
REP(i, m) if (cnt[i] == n) ans++;
cout << ans << endl;
} | /*#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
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
const ll INF = LLONG_MAX - 100;
const ll mod = 1e9 + 7;
const int MAX_N = 5e5 + 5;
int dx[] = {-1LL, 0, 1LL, 0}, dy[] = {0, 1LL, 0, -1LL};
vector<ll> prime;
ll inv[MAX_N], fac[MAX_N];
template <class T = ll> T in() {
T x;
cin >> x;
return (x);
}
inline ll GCD(ll a, ll b) {
ll c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
inline ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
inline ll POW(ll a, ll b) {
ll c = 1LL;
while (b > 0) {
if (b & 1LL) {
c = a * c % mod;
}
a = a * a % mod;
b >>= 1LL;
}
return c;
}
inline void _nCr() {
fac[0] = 1LL;
for (int i = 1LL; i < MAX_N; i++) {
fac[i] = fac[i - 1LL] * i % mod;
}
for (int i = 0; i < MAX_N; i++) {
inv[i] = POW(fac[i], mod - 2);
}
}
inline ll nCr(ll n, ll r) { return (fac[n] * inv[r] % mod) * inv[n - r] % mod; }
inline void PRI(ll n) {
bool a[n + 1LL];
for (int i = 0; i < n + 1LL; i++) {
a[i] = 1LL;
}
for (int i = 2; i < n + 1LL; i++) {
if (a[i]) {
prime.pb(i);
ll b = i;
while (b <= n) {
a[b] = 0;
b += i;
}
}
}
}
typedef pair<int, pair<int, int>> edge;
class UnionFind {
private:
vector<int> par;
public:
UnionFind(int N) { par = vector<int>(N, -1LL); }
int find(int x);
ll size(int x);
void unite(int x, int y);
bool same(int x, int y);
};
class Kruskal {
private:
UnionFind *uf;
vector<edge> e;
public:
vector<edge> mst;
Kruskal(int N) { uf = new UnionFind(N); }
void add(int x, int y, ll z);
void run();
};
//----UnionFind-------------------------------
int UnionFind::find(int x) {
if (par[x] < 0)
return x;
else
return par[x] = find(par[x]);
}
ll UnionFind::size(int x) { return -par[find(x)]; }
void UnionFind::unite(int x, int y) {
x = find(x);
y = find(y);
//大きい方に小さい方をくっ付ける
if (size(x) < size(y))
swap(x, y);
par[x] += par[y];
par[y] = x;
}
bool UnionFind::same(int x, int y) {
x = find(x);
y = find(y);
return x == y;
}
//----Kruskal-------------------------------
void Kruskal::add(int x, int y, ll z) {
// x < y
if (x > y)
swap(x, y);
e.push_back({z, {x, y}});
}
void Kruskal::run() {
sort(e.begin(), e.end());
e.erase(unique(e.begin(), e.end()), e.end());
for (auto x : e) {
if (uf->same(x.second.first, x.second.second)) {
continue;
} else {
mst.push_back(x);
uf->unite(x.second.first, x.second.second);
}
}
}
signed main() {
int n, m;
cin >> n >> m;
int cnt[m];
REP(i, m) cnt[i] = 0;
for (int i = 0; i < n; i++) {
int x = in();
for (int j = 0; j < x; j++)
cnt[in() - 1]++;
}
int ans = 0;
REP(i, m) if (cnt[i] == n) ans++;
cout << ans << endl;
} | [
"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++) {
if (bucket[i] == N)
count++;
}
cout << count << endl;
return 0;
} | #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++) {
if (bucket[i] == N)
count++;
}
cout << count << endl;
return 0;
} | [
"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++) {
if (a[i] == n)
count++;
}
cout << count << endl;
} | #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++) {
if (a[i] == n)
count++;
}
cout << count << endl;
return 0;
}
| [
"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), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll INF = 1LL << 60;
int main() {
ll n, m, k;
cin >> n >> m;
vector<ll> tab(m, 0);
ll ans = 0;
rep(i, n) {
cin >> k;
vector<ll> a(k);
rep(j, k) {
cin >> a[j];
++tab[a[j]];
}
}
for (auto itr = tab.begin(); itr != tab.end(); ++itr) {
if (*itr == n) {
++ans;
}
}
cout << ans << endl;
} | #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), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll INF = 1LL << 60;
int main() {
ll n, m, k;
cin >> n >> m;
vector<ll> tab(m, 0);
ll ans = 0;
rep(i, n) {
cin >> k;
vector<ll> a(k);
rep(j, k) {
cin >> a[j];
++tab[a[j] - 1];
}
}
for (auto itr = tab.begin(); itr != tab.end(); ++itr) {
if (*itr == n) {
++ans;
}
}
cout << ans << endl;
} | [
"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)
ans++;
}
cout << ans << endl;
} | #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)
ans++;
}
cout << ans << endl;
} | [
"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;
}
}
for (auto i = 0; i < N; i++) {
if (foods[i] == N)
result += 1;
}
cout << result << endl;
return 0;
} | #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;
}
}
for (auto i = 0; i < M; i++) {
if (foods[i] == N)
result += 1;
}
cout << result << endl;
return 0;
} | [
"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) for (int i = (a); i > (b); i--)
typedef unsigned long long ull;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false); // Fast I/O
cin.tie(0);
cout.tie(0);
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
int n, m;
cin >> n >> m;
map<int, int> M;
FOR(i, 0, n) {
int t;
cin >> t;
while (t--) {
int x;
cin >> x;
M[x]++;
}
}
int res = 0;
FORN(i, 1, m) {
if (M[i] == n) {
res = i;
break;
}
}
cout << res << endl;
return 0;
}
| #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) for (int i = (a); i > (b); i--)
typedef unsigned long long ull;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false); // Fast I/O
cin.tie(0);
cout.tie(0);
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
int n, m;
cin >> n >> m;
map<int, int> M;
FOR(i, 0, n) {
int t;
cin >> t;
while (t--) {
int x;
cin >> x;
M[x]++;
}
}
int res = 0;
FORN(i, 1, m) {
if (M[i] == n) {
res++;
}
}
cout << res << endl;
return 0;
}
| [
"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)
ans++;
}
cout << ans << endl;
} | #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++;
}
cout << ans << endl;
} | [
"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 rep(i, N) for (int i = 0; i < N; i++)
#define loop(i, N, M) for (int i = N; i < M; i++)
#define MAX(v) *max_element(v.begin(), v.end())
#define MIN(v) *min_element(v.begin(), v.end())
#define SORTL2S(type, v) sort(v.begin(), v.end(), greater<type>())
#define SORTS2L(type, v) sort(v.begin(), v.end())
#define SORTMF(v, func) sort(v.begin(), v.end(), func)
//変数
ll N, M;
vector<int> vec;
//解法
void solve() {
ll ans = 0;
rep(i, M) {
if (vec[i] == N)
ans++;
}
cout << ans;
return;
}
int main() {
//入力
cin >> N >> M;
vec.resize(M, 0);
rep(i, N) {
int K;
cin >> K;
rep(j, K) {
int a;
cin >> a;
vec[a]++;
}
}
solve();
cout << endl;
return 0;
} | #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 rep(i, N) for (int i = 0; i < N; i++)
#define loop(i, N, M) for (int i = N; i < M; i++)
#define MAX(v) *max_element(v.begin(), v.end())
#define MIN(v) *min_element(v.begin(), v.end())
#define SORTL2S(type, v) sort(v.begin(), v.end(), greater<type>())
#define SORTS2L(type, v) sort(v.begin(), v.end())
#define SORTMF(v, func) sort(v.begin(), v.end(), func)
//変数
ll N, M;
vector<int> vec;
//解法
void solve() {
ll ans = 0;
rep(i, M) {
if (vec[i] == N)
ans++;
}
cout << ans;
return;
}
int main() {
//入力
cin >> N >> M;
vec.resize(M, 0);
rep(i, N) {
int K;
cin >> K;
rep(j, K) {
int a;
cin >> a;
vec[a - 1]++;
}
}
solve();
cout << endl;
return 0;
} | [
"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; i < M; i++) {
L[i] = 0;
}
int K;
int A;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> A;
L[A - 1] += 1;
}
}
int ans = 0;
for (int i = 0; i < M; i++) {
if (L[i] == N) {
ans++;
}
}
cout << ans << endl;
return 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; i < M; i++) {
L[i] = 0;
}
int K;
int A;
for (int i = 0; i < N; i++) {
cin >> K;
for (int j = 0; j < K; j++) {
cin >> A;
L[A - 1] += 1;
}
}
int ans = 0;
for (int i = 0; i < M; i++) {
if (L[i] == N) {
ans++;
}
}
cout << ans << endl;
return 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, 0);
ll k, kk;
for (ll i = 0; i < n; i++) {
cin >> k;
for (ll j = 0; j < k; j++) {
cin >> kk;
a[kk]++;
}
}
for (ll i = 0; i < m; i++) {
if (a[i] == n)
ans++;
}
cout << ans << endl;
}
| #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, 0);
ll k, kk;
for (ll i = 0; i < n; i++) {
cin >> k;
for (ll j = 0; j < k; j++) {
cin >> kk;
a[kk - 1]++;
}
}
for (ll i = 0; i < m; i++) {
if (a[i] == n)
ans++;
}
cout << ans << endl;
}
| [
"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;
scanf("%d", &food);
A[food]++;
}
}
int res = 0;
for (int i = 0; i < m; ++i) {
if (A[i] == n)
++res;
}
printf("%d\n", res);
} | #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;
scanf("%d", &food);
A[food - 1]++;
}
}
int res = 0;
for (int i = 0; i < m; ++i) {
if (A[i] == n)
++res;
}
printf("%d\n", res);
} | [
"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 pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
int main(int argc, char const *argv[]) {
int N, M, like[60], ans = 0;
std::cin >> N >> M;
for (int i = 0; i < N; i++) {
int k;
std::cin >> k;
for (int j = 0; j < k; j++) {
int a;
std::cin >> a;
like[a]++;
}
}
for (int i = 0; i < M; i++) {
if (like[i] == N)
ans++;
}
std::cout << ans << '\n';
return 0;
}
| #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 pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
int main(int argc, char const *argv[]) {
int N, M, like[60] = {}, ans = 0;
std::cin >> N >> M;
for (int i = 0; i < N; i++) {
int k;
std::cin >> k;
for (int j = 0; j < k; j++) {
int a;
std::cin >> a;
like[a]++;
}
}
for (int i = 1; i <= M; i++) {
if (like[i] == N)
ans++;
}
std::cout << ans << '\n';
return 0;
}
| [
"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)
count++;
}
cout << count << endl;
}
| #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)
count++;
}
cout << count << endl;
} | [
"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;
vector<int> k(n);
vector<vector<int>> a;
a.resize(n);
for (int i = 0; i < n; i++) {
cin >> k[i];
a[i].resize(k[i]);
for (int j = 0; j < k[i]; j++) {
cin >> a[i][j];
}
sort(a[i].begin(), a[i].end());
}
vector<int> b(m + 1);
for (int i = 0; i < n; i++) {
for (int j = 0; j < k[i]; j++) {
b[a[i][j]]++;
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
if (b[i] == n)
ans++;
}
cout << ans << endl;
}
| #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;
vector<int> k(n);
vector<vector<int>> a;
a.resize(n);
for (int i = 0; i < n; i++) {
cin >> k[i];
a[i].resize(k[i]);
for (int j = 0; j < k[i]; j++) {
cin >> a[i][j];
}
sort(a[i].begin(), a[i].end());
}
vector<int> b(m + 1);
for (int i = 0; i < n; i++) {
for (int j = 0; j < k[i]; j++) {
b[a[i][j]]++;
}
}
int ans = 0;
for (int i = 1; i <= m; i++) {
if (b[i] == n)
ans++;
}
cout << ans << endl;
}
| [
"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 >> item[i][j + 1];
}
}
vector<int> ans(m + 1, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < item[i][0]; j++) {
ans[item[i][j + 1]]++;
}
}
for (int i : ans) {
if (i == n) {
count++;
}
}
cout << count << endl;
return 0;
} | #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 >> item[i][j + 1];
}
}
vector<int> ans(m, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < item[i][0]; j++) {
ans[item[i][j + 1] - 1]++;
}
}
for (int i : ans) {
if (i == n) {
count++;
}
}
cout << count << endl;
return 0;
} | [
"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;
for (int i = 1; i <= n; i++) {
if (cnt[i] == n)
ans++;
}
cout << ans << endl;
}
| #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;
for (int i = 1; i <= m; i++) {
if (cnt[i] == n)
ans++;
}
cout << ans << endl;
}
| [
"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;
for (int i = 1; i <= n; i++) {
if (cnt[i] == n)
ans++;
}
cout << ans << endl;
} | #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;
for (int i = 1; i <= m; i++) {
if (cnt[i] == n)
ans++;
}
cout << ans << endl;
}
| [
"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 = 0; i < m; i++) {
if (memo[i] == n) {
count++;
}
}
cout << count << endl;
return 0;
}
| #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 (int i = 0; i < m; i++) {
if (memo[i] == n) {
count++;
}
}
cout << count << endl;
return 0;
}
| [
"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 (int i = 1; i <= m; i++) {
if (ans[i] == 1) {
ANS++;
}
}
cout << ANS << endl;
return 0;
} | #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 (int i = 1; i <= m; i++) {
if (ans[i] == n) {
ANS++;
}
}
cout << ANS << endl;
return 0;
} | [
"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++) {
cin >> x[i];
}
} //配列の受け取り
main() {
int n = in(), m = in(), l[m], k, a, ans = 0;
for (int i = 0; i < m; i++)
l[i] = 0;
for (int i = 0; i < n; i++) {
cin >> k;
for (int i2 = 0; i2 < k; i2++) {
cin >> a;
l[a]++;
}
}
for (int i = 0; i < m; i++) {
if (l[i] == n)
ans++;
}
cout << ans << endl;
} | #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++) {
cin >> x[i];
}
} //配列の受け取り
main() {
int n = in(), m = in(), l[m], k, a, ans = 0;
for (int i = 0; i < m; i++)
l[i] = 0;
for (int i = 0; i < n; i++) {
cin >> k;
for (int i2 = 0; i2 < k; i2++) {
cin >> a;
l[a - 1]++;
}
}
for (int i = 0; i < m; i++) {
if (l[i] == n)
ans++;
}
cout << ans << endl;
}
| [
"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++) {
if (A[i] == N) {
sum += 1;
}
}
std::cout << sum << std::endl;
return 0;
}
| #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; i++) {
if (A[i] == N) {
sum += 1;
}
}
std::cout << sum << std::endl;
return 0;
}
| [
"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)
ans++;
}
cout << ans << endl;
return 0;
}
| #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)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"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.