buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <stdio.h>
int main() {
int i, n, m, t, ans = 0;
int a[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", a + i);
}
scanf("%d", &m);
while (m-- > 0) {
scanf("%d", &t);
for (i = 0; i < n; i++) {
if (a[i] == t)
ans++;
}
}
printf("%d\n", ans);
retu... | #include <stdio.h>
int main() {
int i, n, m, t, ans = 0;
int a[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", a + i);
}
scanf("%d", &m);
while (m-- > 0) {
scanf("%d", &t);
for (i = 0; i < n; i++) {
if (a[i] == t) {
ans++;
break;
}
}
}
pr... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 132 | 4 |
#include <stdio.h>
#define N 1000000
int main() {
int i;
int j;
int n;
int q;
int count = 0;
int s[N];
int t[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &t[i]);
}
for (i = 0; i < n; i++) {
for... | #include <stdio.h>
#define N 1000000
int main() {
int i;
int j;
int n;
int q;
int count = 0;
int s[N];
int t[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &t[i]);
}
for (i = 0; i < q; i++) {
for... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 71, 22], ["+", 0, 57, 15, 2... | 0 | 178 | 8 |
#include <stdio.h>
#define N 10000
#define Q 500
int linearSearch();
int i, j, n, q, S[N], T[Q], c = 0;
int main() {
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
scanf("%d", &q);
for (i = 0; i < q; i++)
scanf("%d", &T[i]);
printf("%d\n", linearSearch());
return 0;
}
int linearSearch... | #include <stdio.h>
#define N 10000
#define Q 500
int linearSearch();
int i, j, n, q, S[N], T[Q], c = 0;
int main() {
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
scanf("%d", &q);
for (i = 0; i < q; i++)
scanf("%d", &T[i]);
printf("%d\n", linearSearch());
return 0;
}
int linearSearch... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 71, 22], ["+", 0, 57, 15, 2... | 0 | 185 | 10 |
#include <stdio.h>
#define MAX 100000
int linearSearch(int, int);
int S[MAX], T[MAX];
int main() {
int n, q, i, j, k, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
}
for (i = 0; i < n; i++) {
co... | #include <stdio.h>
#define MAX 100000
int linearSearch(int, int);
int S[MAX], T[MAX];
int main() {
int n, q, i, j, k, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
}
for (i = 0; i < q; i++) {
co... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 11, 12, 16, 12, 2, 3, 4, 0, 22], ["+", 0, 11, 12, 16, 12, 2, 3, 4, 0, 22]] | 0 | 210 | 4 |
#include <stdio.h>
#define Max 10000
int main() {
int i, T[Max], S[Max], k, j = 0, count = 0, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &T[i]);
}
scanf("%d", &k);
for (i = 0; i < k; i++) {
scanf("%d", &S[i]);
}
for (i = 0; i < k; i++) {
j = 0;
T[n] = S[i];
while (T[j]... | #include <stdio.h>
#define Max 10000
int main() {
int i, T[Max], S[Max], k, j = 0, count = 0, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &T[i]);
}
scanf("%d", &k);
for (i = 0; i < k; i++) {
scanf("%d", &S[i]);
}
for (i = 0; i < k; i++) {
j = 0;
T[n] = S[i];
while (T[j]... | [["-", 0, 57, 15, 23, 0, 16, 12, 23, 0, 24], ["-", 15, 23, 0, 16, 12, 23, 0, 16, 17, 72], ["-", 15, 23, 0, 16, 12, 23, 0, 16, 12, 13], ["-", 0, 57, 15, 23, 0, 16, 12, 23, 0, 25]] | 0 | 184 | 4 |
#include <stdio.h>
int main() {
int n, q, i, j, count = 0;
int S[1000000000], T[1000000000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
}
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
if (S... | #include <stdio.h>
int main() {
int n, q, i, j, count = 0;
int S[10000], T[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
}
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
if (S[j] == T[i]... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 180 | 4 |
#include <stdio.h>
#define N 10000
#define Q 500
int linearSearch(int *A, int key, int length) {
int i = 0;
A[length] = key;
while (A[i] != key) {
i++;
}
if (i == length)
return 0;
return 1;
}
int main() {
int n, q, i;
int num = 0;
int s[N], t[Q];
scanf("%d", &n);
for (i = 0; i < n;... | #include <stdio.h>
#define N 10000
#define Q 500
int linearSearch(int *A, int key, int length) {
int i = 0;
A[length] = key;
while (A[i] != key) {
i++;
}
if (i == length)
return 0;
return 1;
}
int main() {
int n, q, i;
int num = 0;
int s[N], t[Q];
scanf("%d", &n);
for (i = 0; i < n;... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["-", 8, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 8, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 0, 11, 12, 2, 3, 4, 0, 69, 28, 22], ["+", 8, 1, 0, 11, 12, 2, 3, 4, 0, 22]] | 0 | 202 | 8 |
#include <iostream>
using namespace std;
const int MAX_N = 10000;
bool linearSearch(int *S, int n, int key) {
S[n] = key;
int i = 0;
while (S[i] == key)
i++;
return i != n;
}
int main() {
int n, q;
int S[MAX_N + 1];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
i... | #include <iostream>
using namespace std;
const int MAX_N = 10000;
bool linearSearch(int *S, int n, int key) {
S[n] = key;
int i = 0;
while (S[i] != key) {
i++;
}
return i != n;
}
int main() {
int n, q;
int S[MAX_N + 1];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 79], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 157 | 6 |
#include <cstdio>
#include <iostream>
using namespace std;
int a[10010], b[510];
int main() {
int n, m, h = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
scanf("%d", &m);
for (int i = 0; i < m; i++)
scanf("%d", &b[i]);
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j+... | #include <cstdio>
#include <iostream>
using namespace std;
int a[10010], b[510];
int main() {
int n, m, h = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
scanf("%d", &m);
for (int i = 0; i < m; i++)
scanf("%d", &b[i]);
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j+... | [["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 7, 8, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 46]] | 1 | 166 | 4 |
#include <stdio.h>
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main() {
int i, n, A[10000 + 1], q, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", A[i]);
}
scanf("%d", q);
for (i = 0; i < q; i++) {
scanf(... | #include <stdio.h>
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main() {
int i, n, A[10000 + 1], q, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scan... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 171 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int m... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int m... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 209 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int S[10000], n, q, x, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> x;
for (int j = 0; j < n; j++) {
if (S[j] == x)
ans++;
}
}
cout << ans <<... | #include <iostream>
#include <string>
using namespace std;
int main() {
int S[10010], n, q, x, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> x;
for (int j = 0; j < n; j++) {
if (S[j] == x) {
ans++;
break;
}
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 116 | 6 |
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m, b, j, ans = 0;
cin >> n;
int a[n + 1];
for (int i = 0; i <= n; i++)
cin >> a[i];
cin >> m;
for (in... | #include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m, b, j, ans = 0;
cin >> n;
int a[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
cin >> m;
for (int... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 137 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
int main(void) {
int N, Q, *S, x, num = 0;
cin >> N;
S = (int *)malloc(N);
for (int i = 0; i < N; i++) {
cin >> S[i];
}
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> x;
for (... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
int main(void) {
int N, Q, *S, x, num = 0;
cin >> N;
S = (int *)malloc(N);
for (int i = 0; i < N; i++) {
cin >> S[i];
}
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> x;
for (... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 136 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
int cnt = 0;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
vector<int> t(q);
for (int i = 0; i < q; i++) {
cin >> t[i];
}
for (int i = 0; i < q; i++) {
for (int j = 0... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
int cnt = 0;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
vector<int> t(q);
for (int i = 0; i < q; i++) {
cin >> t[i];
}
for (int i = 0; i < q; i++) {
for (int j = 0... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 154 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
long long S[10000], T[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++)
cin >> T[i];
int count = 0;
for (int j = 0; j < q; j++)
for (int i = 0; i < n; i++) {
if (S[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
long long S[10000], T[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++)
cin >> T[i];
int count = 0;
for (int j = 0; j < q; j++)
for (int i = 0; i < n; i++) {
if (S[i]... | [["+", 8, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 7, 8, 7, 8, 9, 0, 116, 0, 117], ["-", 0, 7, 8, 7, 8, 9, 0, 116, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 141 | 5 |
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> s(n, 0);
for (int i = 0; i < n; i++) {
std::cin >> s[i];
}
int q;
std::cin >> q;
std::vector<int> t(q, 0);
for (int i = 0; i < q; i++) {
std::cin >> t[i];
}
int count = 0;
for (auto i : s) {
f... | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> s(n, 0);
for (int i = 0; i < n; i++) {
std::cin >> s[i];
}
int q;
std::cin >> q;
std::vector<int> t(q, 0);
for (int i = 0; i < q; i++) {
std::cin >> t[i];
}
int count = 0;
for (auto i : t) {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 338, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 338, 12, 22], ["-", 8, 9, 0, 338, 8, 9, 0, 338, 12, 22], ["+", 8, 9, 0, 338, 8, 9, 0, 338, 12, 22]] | 1 | 150 | 13 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> S(n, 0);
for (auto &&x : S) {
cin >> x;
}
int q;
cin >> q;
vector<int> T(q, 0);
for (auto &&x : T) {
cin >> x;
}
int C = 0;
for (int i = 0; i < q; ++i) {
for (int j = 0; j < n; ++... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> S(n, 0);
for (auto &&x : S) {
cin >> x;
}
int q;
cin >> q;
vector<int> T(q, 0);
for (auto &&x : T) {
cin >> x;
}
int C = 0;
for (int i = 0; i < q; ++i) {
for (int j = 0; j < n; ++... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 138 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q, c = 0, s, t;
vector<int> S, T;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
S.push_back(s);
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
T.push_back(t);
}
for (int i = 0; i < n; i++) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q, c = 0, s, t;
vector<int> S, T;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
S.push_back(s);
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
T.push_back(t);
}
for (int i = 0; i < q; i++) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", ... | 1 | 152 | 10 |
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int n, q;
int a = 0;
int c = 0;
int s[10000] = {};
int t[10000] = {};
int main() {
cin >> n;
for (int i = 0; i < n; i+... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int n, q;
int a = 0;
int c = 0;
int s[10000] = {};
int t[10000] = {};
int main() {
cin >> n;
for (int i = 0; i < n; i+... | [["-", 64, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 64, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 187 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, q, S[10000], T, C, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
C = 0;
while (q--) {
cin >> T;
for (i = 0; i < n; i++) {
if (S[i] == T) {
C++;
}
}
}
cout << C << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, q, S[10000], T, C, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
C = 0;
while (q--) {
cin >> T;
for (i = 0; i < n; i++) {
if (S[i] == T) {
C++;
break;
}
}
}
cout << C << endl;
r... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 111 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define fori(i, k, n) for (int i = k; i < (int)n; i++)
using namespace... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define fori(i, k, n) for (int i = k; i < (int)n; i++)
using namespace... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 273 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n;
int S[n];
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
int T[q];
for (int i = 0; i < q; i++)
cin >> T[i];
int A[10000];
int x = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < q; j++) {
if (S[i] ... | #include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n;
int S[n];
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
int T[q];
for (int i = 0; i < q; i++)
cin >> T[i];
int A[10000];
int x = 0;
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (S[j] ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", ... | 1 | 158 | 10 |
#include <iostream>
#include <vector>
using namespace std;
#define rep2(x, from, to) for (int x = (from); x < (to); (x)++)
#define rep(x, to) rep2(x, 0, to)
vector<int> s, t;
int main() {
int n, q;
cin >> n;
rep(i, n) {
int a;
cin >> a;
s.push_back(a);
}
cin >> q;
rep(i, q) {
int b;
cin ... | #include <iostream>
#include <vector>
using namespace std;
#define rep2(x, from, to) for (int x = (from); x < (to); (x)++)
#define rep(x, to) rep2(x, 0, to)
vector<int> s, t;
int main() {
int n, q;
cin >> n;
rep(i, n) {
int a;
cin >> a;
s.push_back(a);
}
cin >> q;
rep(i, q) {
int b;
cin ... | [["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 142 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#includ... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 172 | 2 |
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int s[n];
rep(i, n) cin >> s[i];
int q;
cin >> q;
int t, cou = 0;
rep(i, q) {
cin >> t;
rep(j, n) if (s[j] == t) cou++;
}
cout << ... | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int s[n];
rep(i, n) cin >> s[i];
int q;
cin >> q;
int t, cou = 0;
rep(i, q) {
cin >> t;
rep(j, n) {
if (s[j] == t) {
cou... | [["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["+", 0, 14, 8, 9, 0, 14, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 14, 8, 9, 0, 46]] | 1 | 115 | 7 |
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
void read_separated_string(vector<int> &v, string str) {
istringstream istr(str);
string tmp;
while (getline(istr, tmp, ' ')) {
v.push_back(stoi(tmp));
}
}
int main() {
int N, Q;
vector<int> n;
vector<in... | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
void read_separated_string(vector<int> &v, string str) {
istringstream istr(str);
string tmp;
while (getline(istr, tmp, ' ')) {
v.push_back(stoi(tmp));
}
}
int main() {
int N, Q;
vector<int> n;
vector<in... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 175 | 2 |
#include <iostream>
#include <stdio.h>
using namespace std;
long long int N[100001] = {};
int main() {
int n, q;
int y;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> N[i];
}
// sort(N,N+1000000);
int c = 0, w[50001] = {};
cin >> q;
for (int i = 0; i < q; i++) {
cin >> y;
for (int j = ... | #include <iostream>
#include <stdio.h>
using namespace std;
long long int N[10001] = {};
int main() {
int n, q;
int y;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> N[i];
}
// sort(N,N+1000000);
int c = 0, w[50001] = {};
cin >> q;
for (int i = 0; i < q; i++) {
cin >> y;
for (int j = 0... | [["-", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 7, 8, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 46]] | 1 | 133 | 6 |
#include <iostream>
#define rep(i, a) for (i = 0; i < a; i++)
using namespace std;
int main(void) {
int i, j, n, q, T, C;
cin >> n;
int S[n];
rep(i, n) { cin >> S[i]; }
cin >> q;
C = 0;
rep(i, q) {
cin >> T;
rep(j, n) {
if (T == S[j]) {
C++;
}
}
}
cout << C << endl;... | #include <iostream>
#define rep(i, a) for (i = 0; i < a; i++)
using namespace std;
int main(void) {
int i, j, n, q, T, C;
cin >> n;
int S[n];
rep(i, n) { cin >> S[i]; }
cin >> q;
C = 0;
rep(i, q) {
cin >> T;
rep(j, n) {
if (T == S[j]) {
C++;
break;
}
}
}
cou... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 110 | 2 |
#include <iostream>
int S[10001], T[501];
int main() {
int n, m;
std::cin >> n;
for (int i = 0; i < n; ++i) {
std::cin >> S[i];
}
std::cin >> m;
for (int i = 0; i < m; ++i) {
std::cin >> T[i];
}
int ans = 0;
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
if (T[i] == S[... | #include <iostream>
int S[10001], T[501];
int main() {
int n, m;
std::cin >> n;
for (int i = 0; i < n; ++i) {
std::cin >> S[i];
}
std::cin >> m;
for (int i = 0; i < m; ++i) {
std::cin >> T[i];
}
int ans = 0;
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
if (T[i] == S[... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 148 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int q;
cin >> q;
int t[q];
for (int i = 0; i < q; i++) {
cin >> t[i];
}
int count = 0;
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (s... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int q;
cin >> q;
int t[q];
for (int i = 0; i < q; i++) {
cin >> t[i];
}
int count = 0;
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (s... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 142 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *S = new int[n];
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
int q;
cin >> q;
int *T = new int[q];
for (int i = 0; i < q; ++i) {
cin >> T[i];
}
int count = 0;
for (int i = 0; i < q; ++i) {
for (int j = 0;... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *S = new int[n];
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
int q;
cin >> q;
int *T = new int[q];
for (int i = 0; i < q; ++i) {
cin >> T[i];
}
int count = 0;
for (int i = 0; i < q; ++i) {
for (int j = 0;... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 163 | 4 |
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
struct pond {
int startPos;
int volume;
};
int main() {
int n, q;
cin >> n;
int s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
int t[n];
for (int i = 0; i < q; i++) ... | #include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
struct pond {
int startPos;
int volume;
};
int main() {
int n, q;
cin >> n;
int s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
int t[q];
for (int i = 0; i < q; i++) ... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 339... | 1 | 167 | 10 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int S[100000];
int q;
int T[1000];
int count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
cin >> q;
for (int j = 0; j < q; j++) {
cin >> T[j... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int S[100000];
int q;
int T[1000];
int count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
cin >> q;
for (int j = 0; j < q; j++) {
cin >> T[j... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 170 | 2 |
#include <bits/stdc++.h>
int main(void) {
int n;
int q;
int S[16384];
int T[512];
std::cin >> n;
for (int i = 0; i < n; ++i) {
std::cin >> S[i];
}
std::cin >> q;
for (int i = 0; i < q; ++i) {
std::cin >> T[i];
}
int ans = 0;
for (int i = 0; i < q; ++i) {
int num = T[i];
for (... | #include <bits/stdc++.h>
int main(void) {
int n;
int q;
int S[16384];
int T[512];
std::cin >> n;
for (int i = 0; i < n; ++i) {
std::cin >> S[i];
}
std::cin >> q;
for (int i = 0; i < q; ++i) {
std::cin >> T[i];
}
int ans = 0;
for (int i = 0; i < q; ++i) {
int num = T[i];
for (... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 160 | 4 |
#include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<int> &a_rvoTarget, vector<int> &a_rvoSearch) {
int iTargetCnt;
cin >> iTargetCnt;
a_rvoTarget.resize(iTargetCnt + 1);
for (int i = 0; i < iTargetCnt; i++)
cin >> a_rvoTarget[i];
int iSearchCnt;
cin >> iSearchCnt;
a_rvoS... | #include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<int> &a_rvoTarget, vector<int> &a_rvoSearch) {
int iTargetCnt;
cin >> iTargetCnt;
a_rvoTarget.resize(iTargetCnt + 1);
for (int i = 0; i < iTargetCnt; i++)
cin >> a_rvoTarget[i];
int iSearchCnt;
cin >> iSearchCnt;
a_rvoS... | [["-", 8, 9, 0, 52, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 79]] | 1 | 264 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> S(n);
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
int q;
cin >> q;
int C = 0;
int t;
for (int i = 0; i < q; ++i) {
cin >> t;
for (int j = 0; j < n; ++j) {
if (t == S[j]) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> S(n);
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
int q;
cin >> q;
int C = 0;
int t;
for (int i = 0; i < q; ++i) {
cin >> t;
for (int j = 0; j < n; ++j) {
if (t == S[j]) {
... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 127 | 2 |
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(int... | #define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(int... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 227 | 2 |
#include <iostream>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> S(n);
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
int q;
cin >> q;
vector<int> T(q);
for (int i = 0; i < q; ++i) {
cin >> T[i];
}
int ans = 0;
for (int i = 0; i < q; ++i) {
for (... | #include <iostream>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> S(n);
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
int q;
cin >> q;
vector<int> T(q);
for (int i = 0; i < q; ++i) {
cin >> T[i];
}
int ans = 0;
for (int i = 0; i < q; ++i) {
for (... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 167 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
vector<int> S, T;
cin >> n;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
S.push_back(s);
}
cin >> q;
for (int i = 0; i < q; i++) {
int t;
cin >> t;
T.push_back(t);
}
// O(n^2)
int C = 0;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
vector<int> S, T;
cin >> n;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
S.push_back(s);
}
cin >> q;
for (int i = 0; i < q; i++) {
int t;
cin >> t;
T.push_back(t);
}
// O(n^2)
int C = 0;
... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 159 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int ls(int S[], int n, int T[], int q) {
int count = 0;
for (int i = 0; i < q; ++i)
for (int j = 0; j < n; j++)
if (T[i] == S[j])
count++;
return count;
}
int main() {
int n;
cin >> n;
int S[n];
for (int i = 0; i < n; ++i)
... | #include <cstdio>
#include <iostream>
using namespace std;
int ls(int S[], int n, int T[], int q) {
int count = 0;
for (int i = 0; i < q; ++i)
for (int j = 0; j < n; j++)
if (T[i] == S[j]) {
count++;
break;
}
return count;
}
int main() {
int n;
cin >> n;
int S[n];
for (in... | [["+", 0, 7, 8, 7, 8, 57, 64, 9, 0, 45], ["+", 8, 7, 8, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 7, 8, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 7, 8, 57, 64, 9, 0, 46]] | 1 | 169 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
int S[10000], T[500];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; ++i) {
cin >> T[i];
}
int count = 0;
for (int i = 0; i < n; ++i) {
for (... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
int S[10000], T[500];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; ++i) {
cin >> T[i];
}
int count = 0;
for (int i = 0; i < q; ++i) {
for (i... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 0, 57,... | 1 | 151 | 8 |
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int i, j, n, q;
int count = 0;
cin >> n;
int S[n];
for (i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
int T[q];
for (i = 0; i < q; i++) {
cin >> T[i];
}
for (j = 0; j < q; j++) {
for (i = 0; j < n;... | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int i, j, n, q;
int count = 0;
cin >> n;
int S[n];
for (i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
int T[q];
for (i = 0; i < q; i++) {
cin >> T[i];
}
for (j = 0; j < q; j++) {
for (i = 0; i < n;... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22]] | 1 | 155 | 11 |
#include <iostream>
using namespace std;
int linear_search(int a[], int b[], int n, int q) {
int count = 0;
for (int i = 0; i < q; ++i) {
for (int j = 0; j < n; ++j) {
if (a[j] == b[i]) {
++count;
}
}
}
return count;
}
int main() {
int n, q, S[10000], T[500];
cin >> n;
for (... | #include <iostream>
using namespace std;
int linear_search(int a[], int b[], int n, int q) {
int count = 0;
for (int i = 0; i < q; ++i) {
for (int j = 0; j < n; ++j) {
if (a[j] == b[i]) {
++count;
break;
}
}
}
return count;
}
int main() {
int n, q, S[10000], T[500];
ci... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 177 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, a[10000], m, b, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
cin >> m;
while (m--) {
cin >> b;
for (int i = 0; i < n; i++)
if (a[i] == b)
ans++;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a[10000], m, b, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
cin >> m;
while (m--) {
cin >> b;
for (int i = 0; i < n; i++)
if (a[i] == b) {
ans++;
break;
}
}
cout << ans << endl;
return 0;... | [["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 7, 8, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 46]] | 1 | 103 | 4 |
#include <iostream>
using namespace std;
int main() {
int n[10000], s[10000], N, S, cnt = 0;
cin >> N;
for (int i = 0; i < N; i++)
cin >> n[i];
cin >> S;
for (int i = 0; i < S; i++)
cin >> s[i];
for (int i = 0; i < S; i++)
for (int j = 0; j < N; j++)
if (n[j] == s[i])
cnt++;
co... | #include <iostream>
using namespace std;
int main() {
int n[10000], s[10000], N, S, cnt = 0;
cin >> N;
for (int i = 0; i < N; i++)
cin >> n[i];
cin >> S;
for (int i = 0; i < S; i++)
cin >> s[i];
for (int i = 0; i < S; i++)
for (int j = 0; j < N; j++)
if (n[j] == s[i]) {
cnt++;
... | [["+", 0, 7, 8, 7, 8, 57, 64, 9, 0, 45], ["+", 8, 7, 8, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 7, 8, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 7, 8, 57, 64, 9, 0, 46]] | 1 | 133 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#include <sstream>
using namespace std;
int main() {
int n;
vector<int> s;
int q;
vector<int> t;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
s.push... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#include <sstream>
using namespace std;
int main() {
int n;
vector<int> s;
int q;
vector<int> t;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
s.push... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 173 | 2 |
#include <iostream>
using namespace std;
int S[100000];
int T[100000];
bool serch(int n, int *T, int size) {
for (int i = 0; i < size; i++) {
if (T[i] == n)
return true;
}
return false;
}
int main() {
int n, q;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; ... | #include <iostream>
using namespace std;
int S[100000];
int T[100000];
bool serch(int n, int *T, int size) {
for (int i = 0; i < size; i++) {
if (T[i] == n)
return true;
}
return false;
}
int main() {
int n, q;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0;... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 15, 339, 51, 2, 3, 4, 0, 69, 28, 22], ["+", 15, 339, 51, 2, 3, 4, 0, 69, 28, 22], ["-", 0, 57, 15, 339, 51, 2, 3, 4, 0, 22], ["+", 0, 57, 15, 339, 51, 2, 3, 4, 0, 22]] | 1 | 172 | 6 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 175 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> vc1(N);
for (auto &x : vc1) {
cin >> x;
}
int Q;
cin >> Q;
vector<int> vc2(Q);
for (auto &x : vc2) {
cin >> x;
}
int count{};
for (auto &&x : vc2) {
f... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> vc1(N);
for (auto &x : vc1) {
cin >> x;
}
int Q;
cin >> Q;
vector<int> vc2(Q);
for (auto &x : vc2) {
cin >> x;
}
int count{};
for (auto &&x : vc2) {
... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 131 | 21 |
#include <cstdio>
int main() {
int n1, n2, t, cnt = 0;
scanf("%d", &n1);
int A[n1];
for (int i = 0; i < n1; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &n2);
for (int i = 0; i < n2; i++) {
scanf("%d", &t);
for (int j = 0; j < n1; j++) {
if (t == A[j])
cnt += 1;
}
}
printf(... | #include <cstdio>
int main() {
int n1, n2, t, cnt = 0;
scanf("%d", &n1);
int A[n1];
for (int i = 0; i < n1; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &n2);
for (int i = 0; i < n2; i++) {
scanf("%d", &t);
for (int j = 0; j < n1; j++) {
if (t == A[j]) {
cnt += 1;
break;
... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 142 | 4 |
#include <stdio.h>}
int main(void) {
int n, i, S[100000], q, j, T, C = 0, M;
scanf("%d", &n);
for (i = 0; i != n; i++) {
scanf("%d", &S[i]);
}
for (i = 0; i != n; i++) {
for (j = 0; j != n; j++) {
if (S[i] < S[j]) {
M = S[i];
S[i] = S[j];
S[j] = M;
}
}
}
sc... | #include <stdio.h>}
int main(void) {
int n, i, S[100000], q, j, T, C = 0, M;
scanf("%d", &n);
for (i = 0; i != n; i++) {
scanf("%d", &S[i]);
}
for (i = 0; i != n; i++) {
for (j = 0; j != n; j++) {
if (S[i] < S[j]) {
M = S[i];
S[i] = S[j];
S[j] = M;
}
}
}
sc... | [["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 217 | 2 |
#include <iostream>
using namespace std;
int main() {
long long n, q, s[1000000001], t, k;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
k = 0;
for (long long i = 0; i < q; i++) {
cin >> t;
for (long long j = 0; j < n; j++) {
if (s[j] == t) {
k++;
... | #include <iostream>
using namespace std;
int main() {
long long n, q, s[10001], t, k;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
k = 0;
for (long long i = 0; i < q; i++) {
cin >> t;
for (long long j = 0; j < n; j++) {
if (s[j] == t) {
k++;
bre... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 126 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int Count = 0;
int n;
cin >> n;
vector<int> S;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
S.push_back(s);
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int t;
cin >> t;
for (int j = 0; j < n; j++) {... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int Count = 0;
int n;
cin >> n;
vector<int> S;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
S.push_back(s);
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int t;
cin >> t;
for (int j = 0; j < n; j++) {... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 129 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int n, q, C = 0;
int S[10001], T[501];
cin >> n;
for (int i = 0; i < n; ++i) {
scanf("%d", &S[i]);
}
cin >> q;
for (int i = 0; i < q; ++i) {
scanf("%d", &T[i]);
}
for (int i = 0; i < q; ++i) {... | #include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int n, q, C = 0;
int S[10001], T[501];
cin >> n;
for (int i = 0; i < n; ++i) {
scanf("%d", &S[i]);
}
cin >> q;
for (int i = 0; i < q; ++i) {
scanf("%d", &T[i]);
}
for (int i = 0; i < q; ++i) {... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 167 | 2 |
#include <cstdio>
int main() {
int n, q, c = 0;
int s[10000];
int t[500];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", s + i);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", t + i);
}
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (s[j] ... | #include <cstdio>
int main() {
int n, q, c = 0;
int s[10000];
int t[500];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", s + i);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", t + i);
}
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (s[j] ... | [["-", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 1 | 167 | 2 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n[10001], q[501], x, y, s = 0;
cin >> x;
for (int i = 0; i < x; i++)
cin >> n[i];
cin >> y;
for (int i = 0; i < y; i++)
cin >> q[i];
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
if... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n[10000], q[500], x, y, s = 0;
cin >> x;
for (int i = 0; i < x; i++)
cin >> n[i];
cin >> y;
for (int i = 0; i < y; i++)
cin >> q[i];
for (int i = 0; i < y; i++) {
for (int j = 0; j < x; j++) {
if... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51,... | 1 | 147 | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, q, S[10000], T, res = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
for (int i = 0; i < q; i++) {
cin >> T;
for (int j = 0; j < n; j++) {
if (T == S[j]) {
res++;
break;
}
}
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q, S[10000], T, res = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> T;
for (int j = 0; j < n; j++) {
if (T == S[j]) {
res++;
break;
}
}
... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 116 | 4 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
size_t n;
scanf("%zu", &n);
vector<int> S(n);
for (size_t i = 0; i < n; ++i)
scanf("%d", &S[i]);
size_t q;
scanf("%zu", &q);
vector<int> T(q);
for (size_t i = 0; i < q; ++i)
scanf("%d", &T[i]);
ptr... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
size_t n;
scanf("%zu", &n);
vector<int> S(n);
for (size_t i = 0; i < n; ++i)
scanf("%d", &S[i]);
size_t q;
scanf("%zu", &q);
vector<int> T(q);
for (size_t i = 0; i < q; ++i)
scanf("%d", &T[i]);
ptr... | [["+", 0, 7, 8, 1, 0, 11, 12, 91, 17, 111], ["+", 8, 1, 0, 11, 12, 91, 28, 91, 17, 111]] | 1 | 168 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, s[10000], q, t[500], i, j, count = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
for (i = 0; i < q; i++) {
cin >> t[i];
}
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
if (s[j] == t[i]) {
cou... | #include <iostream>
using namespace std;
int main() {
int n, s[10000], q, t[500], i, j, count = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
for (i = 0; i < q; i++) {
cin >> t[i];
}
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
if (s[j] == t[i]) {
cou... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 143 | 2 |
// SEE http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_A
#include <stdio.h>
int main() {
int n, q, S[10000], T[500];
int C = 0;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; ++i) {
scanf("%d", &T[i]);
}
for (i... | #include <stdio.h>
int main() {
int n, q, S[10000], T[500];
int C = 0;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; ++i) {
scanf("%d", &T[i]);
}
for (int i = 0; i < q; ++i) {
for (int j = 0; j < n; ++j) {
if (T[i] ==... | [["-", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 1 | 171 | 2 |
#include <iostream>
using namespace std;
const int MAX_N = 10000;
const int MAX_Q = 500;
int main() {
int n, q, s[MAX_N], t, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
for (int i = 0; i < n; i++) {
if (t == s[i])
... | #include <iostream>
using namespace std;
const int MAX_N = 10000;
const int MAX_Q = 500;
int main() {
int n, q, s[MAX_N], t, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
for (int i = 0; i < n; i++) {
if (t == s[i]) {
... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 128 | 4 |
#include <iostream>
#include <stdio.h>
#include <vector>
#define FOR(i, k, n) for ((i) = (k); (i) < (n); (i)++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(a) (a).begin(), (a).end()
using namespace std;
int main() {
int n, q, s, temp, i, j;
int count = 0;
vector<int> S;
cin... | #include <iostream>
#include <stdio.h>
#include <vector>
#define FOR(i, k, n) for ((i) = (k); (i) < (n); (i)++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(a) (a).begin(), (a).end()
using namespace std;
int main() {
int n, q, s, temp, i, j;
int count = 0;
vector<int> S;
cin... | [["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 138 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[10000], b, c[500], i, k = 0, j;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> b;
for (i = 0; i < b; i++)
cin >> c[i];
for (i = 0; i < b; i++) {
for (k = j = 0; j < n; j++) {
if (c[i] == a[j]) {
k++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[10000], b, c[500], i, k = 0, j;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> b;
for (i = 0; i < b; i++)
cin >> c[i];
for (i = 0; i < b; i++) {
for (j = 0; j < n; j++) {
if (c[i] == a[j]) {
k++;
bre... | [["-", 0, 7, 8, 9, 0, 7, 10, 11, 31, 22], ["-", 0, 7, 8, 9, 0, 7, 10, 11, 17, 32]] | 1 | 140 | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int tmp;
int tmp2;
int cnt = 0;
cin >> tmp;
int ar1[tmp];
for (int i = 0; i < tmp; i++)
cin >> ar1[i];
cin >> tmp2;
int ar2[tmp2];
for (int i = 0; i < tmp2; i++)
cin >> ar2[i];
for (int i = 0; i < tmp... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int tmp;
int tmp2;
int cnt = 0;
cin >> tmp;
int ar1[tmp];
for (int i = 0; i < tmp; i++)
cin >> ar1[i];
cin >> tmp2;
int ar2[tmp2];
for (int i = 0; i < tmp2; i++)
cin >> ar2[i];
for (int i = 0; i < tmp... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 150 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, q, S[10000], T[500];
int count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> T[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < q; j++) {
if (S[i] == T... | #include <iostream>
using namespace std;
int main() {
int n, q, S[10000], T[500];
int count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> T[i];
}
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (T[i] == S... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 0, 57,... | 1 | 143 | 8 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, n) FOR(i, 0, n)
#define DEBUG(x) cout << #x << ": " << x << endl
#define vint vector<int>
#define vdouble ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, n) FOR(i, 0, n)
#define DEBUG(x) cout << #x << ": " << x << endl
#define vint vector<int>
#define vdouble ve... | [["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 194 | 2 |
#include <iostream>
using namespace std;
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main() {
int n, A[10001], q, key, sum = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
for (int i = 0; i < q; i++) {
cin >> key;
if... | #include <iostream>
using namespace std;
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main() {
int n, A[10001], q, key, sum = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 141 | 4 |
#include <algorithm>
#include <cstdio>
typedef long long int lli;
lli s[20000], t[2000];
int main(void) {
int n, q;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%lld", &s[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++)
scanf("%lld", &t[i]);
std::sort(s, s + n);
std::sort(t, t + q);
... | #include <algorithm>
#include <cstdio>
typedef long long int lli;
lli s[20000], t[2000];
int main(void) {
int n, q;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%lld", &s[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++)
scanf("%lld", &t[i]);
std::sort(s, s + n);
std::sort(t, t + q);
... | [["-", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98]] | 1 | 207 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, m;
int s[10001], t[502];
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
cin >> m;
int count = 0;
for (int i = 0; i < m; i++)
cin >> t[i];
for (int i = 0; i < n; i++) {
t[n] = s[i];
int j = 0;
while (s[i] != t[j]) {
... | #include <iostream>
using namespace std;
int main() {
int n, m;
int s[10002], t[502];
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
cin >> m;
int count = 0;
for (int i = 0; i < m; i++)
cin >> t[i];
for (int i = 0; i < m; i++) {
s[n] = t[i];
int j = 0;
while (s[j] != t[i]) {
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 11... | 1 | 146 | 12 |
#include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, q, v, count = 0;
;
cin >> n;
int s[n];
REP(i, n) {
cin >> v;
s[i] = v;
}
cin >> q;
int t[q];
REP(i, q) {
cin >> v;
t[i] = v;
}
REP(i, q) {
REP(j, n) {
if (t[i] ==... | #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, q, v, count = 0;
;
cin >> n;
int s[n];
REP(i, n) {
cin >> v;
s[i] = v;
}
cin >> q;
int t[q];
REP(i, q) {
cin >> v;
t[i] = v;
}
REP(i, q) {
REP(j, n) {
if (t[i] ==... | [["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 130 | 4 |
#include <cstdio>
#include <iostream>
int n, n1[10000], q, t[500], cnt = 0;
void test(int a) {
for (int i = 0; i < n; i++) {
if (n1[i] == a) {
cnt++;
}
}
}
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &n1[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; i++)... | #include <cstdio>
#include <iostream>
int n, n1[10000], q, t[500], cnt = 0;
void test(int a) {
for (int i = 0; i < n; i++) {
if (n1[i] == a) {
cnt++;
break;
}
}
}
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &n1[i]); // 333333333 345
}
scanf("%d", &q);... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 183 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, m;
int hi1[10000], a, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> hi1[i];
cin >> m;
for (int i = 0; i < m; i++) {
cin >> a;
for (int j = 0; j < n; j++) {
if (hi1[j] == a)
cnt++;
}
}
cout << cnt << endl;
... | #include <iostream>
using namespace std;
int main() {
int n, m;
long hi1[10001], a, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> hi1[i];
cin >> m;
for (int i = 0; i < m; i++) {
cin >> a;
for (int j = 0; j < n; j++) {
if (hi1[j] == a) {
cnt++;
break;
}
}
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35], ["+", 0, 7, 8, 9, 0, 57, 64... | 1 | 115 | 8 |
#include <stdio.h>
int main() {
int i, j;
int n, q;
int s[20000];
int t[20000];
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &t[i]);
}
for (i = 0; i < n; i++) {
for (j = 0; j < q; j++) {
i... | #include <stdio.h>
int main() {
int i, j;
int n, q;
int s[20000];
int t[20000];
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &t[i]);
}
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
i... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 0, 57,... | 1 | 172 | 10 |
#include <iostream>
using namespace std;
int main() {
int cnt = 0;
int x;
cin >> x;
int s[x];
for (int i = 0; i < x; i++)
cin >> s[i];
int y;
cin >> y;
int t[y];
for (int j = 0; j < y; j++) {
cin >> t[j];
for (int i = 0; i < x; i++) {
if (t[j] == s[i])
cnt++;
}
}
co... | #include <iostream>
using namespace std;
int main() {
int cnt = 0;
int x;
cin >> x;
long s[x];
for (int i = 0; i < x; i++)
cin >> s[i];
int y;
cin >> y;
long t[y];
for (int j = 0; j < y; j++) {
cin >> t[j];
for (int i = 0; i < x; i++) {
if (t[j] == s[i]) {
cnt++;
br... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 124 | 8 |
#include <iostream>
#include <stack>
using namespace std;
int main() {
stack<int> s, t, shonn, thonn;
int n, q, st, goukei = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> st;
s.push(st);
}
cin >> q;
shonn = s;
for (int i = 0; i < q; i++) {
cin >> st;
t.push(st);
}
thonn = t;
w... | #include <iostream>
#include <stack>
using namespace std;
int main() {
stack<int> s, t, shonn, thonn;
int n, q, st, goukei = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> st;
s.push(st);
}
cin >> q;
shonn = s;
for (int i = 0; i < q; i++) {
cin >> st;
t.push(st);
}
thonn = t;
w... | [["+", 0, 57, 75, 76, 0, 9, 0, 93, 0, 94], ["+", 0, 57, 75, 76, 0, 9, 0, 93, 0, 35]] | 1 | 199 | 2 |
#include <iostream>
using namespace std;
int LinearSearch(int numT, int numS, const int S[], const int T[]) {
int num = 0;
for (int t = 0; t < numT; t++) {
for (int s = 0; s < numS; s++) {
if (S[s] == T[t]) {
num++;
}
}
}
return num;
}
int main() {
int numS, numT;
int S[10000],... | #include <iostream>
using namespace std;
int LinearSearch(int numT, int numS, const int S[], const int T[]) {
int num = 0;
for (int t = 0; t < numT; t++) {
for (int s = 0; s < numS; s++) {
if (S[s] == T[t]) {
num++;
break;
}
}
}
return num;
}
int main() {
int numS, numT;
... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 185 | 2 |
#include <iostream>
using namespace std;
bool linearSearch(int S[], int numS, int key) {
int i = 0;
S[numS] = key;
while (i != key)
i++;
if (i == numS)
return false;
return true;
}
int main() {
int numS, numT;
int S[100000 + 1];
int key;
int num = 0;
cin >> numS;
for (int i = 0; i < nu... | #include <iostream>
using namespace std;
bool linearSearch(int S[], int numS, int key) {
int i = 0;
S[numS] = key;
while (S[i] != key)
i++;
if (i == numS)
return false;
return true;
}
int main() {
int numS, numT;
int S[100000 + 1];
int key;
int num = 0;
cin >> numS;
for (int i = 0; i <... | [["+", 0, 52, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 156 | 5 |
#include <stdio.h>
int main() {
int i, j, s[10003], n, q, k = 0, t;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &t);
for (j = 0; j < n; j++) {
if (s[j] == t)
k++;
}
}
printf("%d\n", k);
return 0;... | #include <stdio.h>
int main() {
int i, j, s[10003], n, q, k = 0, t;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &t);
for (j = 0; j < n; j++) {
if (s[j] == t) {
k++;
break;
}
}
}
print... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 141 | 4 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a... | [["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 235 | 4 |
#include <cstdio>
#include <iostream>
#include <vector>
int counter = 0;
void solve(std::vector<int> &data1, std::vector<int> &data2) {
for (int i = 0; i < data1.size(); i++) {
for (int j = 0; j < data2.size(); j++) {
if (data1[i] == data2[j]) {
counter++;
}
}
}
}
int main() {
int f... | #include <cstdio>
#include <iostream>
#include <vector>
int counter = 0;
void solve(std::vector<int> &data1, std::vector<int> &data2) {
for (int i = 0; i < data2.size(); i++) {
for (int j = 0; j < data1.size(); j++) {
if (data2[i] == data1[j]) {
counter++;
break;
}
}
}
}
int m... | [["-", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], [... | 1 | 211 | 10 |
#include <stdio.h>
int linearSearch(int S[], int T[], int n, int q) {
int k = 0;
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (T[i] == S[j]) {
k++;
break;
}
}
}
return k;
}
int main() {
int n, q;
int S[10000], T[500];
scanf("%d", &n);
for (int i = ... | #include <stdio.h>
int linearSearch(int S[], int T[], int n, int q) {
int k = 0;
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (T[i] == S[j]) {
k++;
break;
}
}
}
return k;
}
int main() {
int n, q;
int S[10000], T[500];
scanf("%d", &n);
for (int i = ... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 202 | 2 |
#include <iostream>
using namespace std;
int LinearSearch(int S[], int n, int T[], int q) {
int count = 0;
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (S[j] == T[i]) {
count++;
}
}
}
return count;
}
int main() {
int n = 0, q = 0;
cin >> n;
int *S = new... | #include <iostream>
using namespace std;
int LinearSearch(int S[], int n, int T[], int q) {
int count = 0;
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (S[j] == T[i]) {
count++;
break;
}
}
}
return count;
}
int main() {
int n = 0, q = 0;
cin >> n;... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 191 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
constexpr int Nmax = 10000;
int S[Nmax];
int main() {
ios::sync_with_stdio(false);
int same = 0;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
in... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
constexpr int Nmax = 10000;
int S[Nmax];
int main() {
ios::sync_with_stdio(false);
int same = 0;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
in... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 139 | 2 |
#include <stdio.h>
int main() {
int T[500], S[10000], i, j, count = 0, n, q;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
scanf("%d", &q);
for (j = 0; j < q; j++)
scanf("%d", &T[j]);
for (i = 0; i < n; i++) {
for (j = 0; j < q; j++) {
if (T[i] == S[j]) {
count++;... | #include <stdio.h>
int main() {
int T[500], S[10000], i, j, count = 0, n, q;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
scanf("%d", &q);
for (j = 0; j < q; j++)
scanf("%d", &T[j]);
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
if (T[i] == S[j]) {
count++;... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 165 | 30 |
#include <stdio.h>
int main() {
int i, j, k = 0, n, q, S[10000], T[500];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
scanf("%d", &q);
for (i = 0; i < q; i++)
scanf("%d", &T[i]);
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
if (S[j] == T[i])
k++;
}
}
... | #include <stdio.h>
int main() {
int i, j, k = 0, n, q, S[10000], T[500];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
scanf("%d", &q);
for (i = 0; i < q; i++)
scanf("%d", &T[i]);
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
if (S[j] == T[i]) {
k++;
... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 161 | 4 |
#include <iostream>
using namespace std;
#define MAX_S 10000
#define MAX_T 500
int main() {
int n, q;
int S[MAX_S], T[MAX_T];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> T[i];
}
int cnt = 0;
for (int i = 0; i < q; i++) {
for ... | #include <iostream>
using namespace std;
#define MAX_S 10000
#define MAX_T 500
int main() {
int n, q;
int S[MAX_S], T[MAX_T];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> T[i];
}
int cnt = 0;
for (int i = 0; i < q; i++) {
for ... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 149 | 4 |
#include <iostream>
using namespace std;
int main() {
int N, q;
cin >> N;
int S[N];
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
cin >> q;
int T[q];
for (int i = 0; i < q; ++i) {
cin >> T[i];
}
int n = 0;
for (int i = 0; i < q; ++i) {
for (int j = 0; j < N; ++j) {
if (T[i] ... | #include <iostream>
using namespace std;
int main() {
int N, q;
cin >> N;
int S[N];
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
cin >> q;
int T[q];
for (int i = 0; i < q; ++i) {
cin >> T[i];
}
int n = 0;
for (int i = 0; i < q; ++i) {
for (int j = 0; j < N; ++j) {
if (T[i] ... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 146 | 2 |
#include <cstdio>
int linearSearch(int *S, int key, int n) {
int i, count;
count = 0;
for (i = 0; i < n; i++) {
if (S[i] == key) {
count++;
}
}
return count;
}
int main(void) {
int i, n, q, key, count;
int *S;
count = 0;
scanf("%d", &n);
S = new int[n];
for (i = 0; i < n; i++) {
... | #include <cstdio>
int linearSearch(int *S, int key, int n) {
int i, count;
count = 0;
for (i = 0; i < n; i++) {
if (S[i] == key) {
count++;
break;
}
}
return count;
}
int main(void) {
int i, n, q, key, count;
int *S;
count = 0;
scanf("%d", &n);
S = new int[n];
for (i = 0; i <... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 189 | 2 |
#include <bits/stdc++.h>
using namespace std;
int S[10000];
int n, q;
int C;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
int t;
cin >> t;
for (int j = 0; j < n; j++) {
if (S[j] == t) {
C++;
}
}
}
cout... | #include <bits/stdc++.h>
using namespace std;
int S[10000];
int n, q;
int C;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
int t;
cin >> t;
for (int j = 0; j < n; j++) {
if (S[j] == t) {
C++;
break;
}
... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 116 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
const int INF = 0x3f3f3f3f;
int main() {
int S[10005], T[10005];
int n, q, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
const int INF = 0x3f3f3f3f;
int main() {
int S[10005], T[10005];
int n, q, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (... | [["+", 0, 7, 8, 7, 8, 57, 64, 9, 0, 45], ["+", 8, 7, 8, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 7, 8, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 7, 8, 57, 64, 9, 0, 46]] | 1 | 152 | 4 |
#include <iostream>
#include <vector>
int main(void) {
int count = 0;
int n;
std::cin >> n;
std::vector<int> s(n, 0);
for (int i = 0; i < n; i++) {
std::cin >> s[i];
}
int q;
std::cin >> q;
std::vector<int> t(q, 0);
for (int i = 0; i < q; i++) {
std::cin >> t[i];
}
for (int i = 0; i ... | #include <iostream>
#include <vector>
int main(void) {
int count = 0;
int n;
std::cin >> n;
std::vector<int> s(n, 0);
for (int i = 0; i < n; i++) {
std::cin >> s[i];
}
int q;
std::cin >> q;
std::vector<int> t(q, 0);
for (int i = 0; i < q; i++) {
std::cin >> t[i];
}
for (int i = 0; i ... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 172 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b[10000], c, d[500], e[500] = {}, f = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
}
cin >> c;
for (int i = 0; i < c; i++) {
cin >> d[i];
}
for (int i = 0; i < c; i++) {
for (int j = 0; j < a; j++) {
if (b[j]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b[10000], c, d[500], e[500] = {}, f = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
}
cin >> c;
for (int i = 0; i < c; i++) {
cin >> d[i];
}
for (int i = 0; i < a; i++) {
for (int j = 0; j < c; j++) {
if (b[i]... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", ... | 1 | 175 | 8 |
#include <iostream>
#include <stdio.h>
using namespace std;
bool searchEdge(const int a[][2], int n, int edge[]);
int calcArea(const int a[][2], const int edge[]);
int main(void) {
int n, s[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[n];
int q, t[500];
cin >> q;
for (int i = 0; i < q; i++)... | #include <iostream>
#include <stdio.h>
using namespace std;
bool searchEdge(const int a[][2], int n, int edge[]);
int calcArea(const int a[][2], const int edge[]);
int main(void) {
int n, s[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
int q, t[500];
cin >> q;
for (int i = 0; i < q; i++)... | [["-", 8, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 8, 1, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 186 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, q, s[10000], t, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
for (int j = 0; j < n; j++)
if (s[j] == t)
ans++;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, q, s[10000], t, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
for (int j = 0; j < n; j++)
if (s[j] == t) {
ans++;
break;
}
}
cout << ans << e... | [["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 7, 8, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 46]] | 1 | 112 | 4 |
#include <iostream>
#include <vector>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) {
is >> x;
}
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] <<... | #include <iostream>
#include <vector>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) {
is >> x;
}
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] <<... | [["-", 0, 30, 0, 14, 8, 9, 0, 338, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 338, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 338, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 338, 12, 22], ["-", 0, 57, 15, 339, 51, 2, 3, 4, 0, 22], ["+", 0, 57, 15, 339, 51, 2, 3, 4, 0, 22]] | 1 | 239 | 8 |
#include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int n, q;
int S[10000], T[500];
cin >> n;
for (int i = 0; i < n; ++i)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; ++i)
cin >> T[i];
int count = 0;
for (int i = 0; i < q; ++i) {
for (int j = 0; j < n; ++j) ... | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int n, q;
int S[10000], T[500];
cin >> n;
for (int i = 0; i < n; ++i)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; ++i)
cin >> T[i];
int count = 0;
for (int i = 0; i < q; ++i) {
for (int j = 0; j < n; ++j) ... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 148 | 4 |
#include <cstdio>
using namespace std;
const int MAX_N = 10000;
const int MAX_Q = 500;
int n, S[MAX_N], q, T[MAX_Q];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &S[i]);
scanf("%d", &q);
int answer = 0;
for (int i = 0; i < q; i++) {
scanf("%d", &T[i]);
for (int j = 0; j... | #include <cstdio>
using namespace std;
const int MAX_N = 10000;
const int MAX_Q = 500;
int n, S[MAX_N], q, T[MAX_Q];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &S[i]);
scanf("%d", &q);
int answer = 0;
for (int i = 0; i < q; i++) {
scanf("%d", &T[i]);
for (int j = 0; j... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 161 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, S[10000];
int q, T[500];
int sw = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> T[i];
}
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (T[i] ==... | #include <iostream>
using namespace std;
int main() {
int n, S[10000];
int q, T[500];
int sw = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> T[i];
}
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (T[i] ==... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 143 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n2;
int n1, S[100000000];
int T[100000000], sum = 0;
cin >> n1;
for (int i = 0; i < n1; i++) {
cin >> S[i];
}
cin >> n2;
for (int i = 0; i < n2; i++) {
int y = min(n1, n2);
cin >> T[i];
for (int j = 0; j < ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n2;
int n1, S[100000];
int T[100000], sum = 0;
cin >> n1;
for (int i = 0; i < n1; i++) {
cin >> S[i];
}
cin >> n2;
for (int i = 0; i < n2; i++) {
int y = max(n1, n2);
cin >> T[i];
for (int j = 0; j < y; j++... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22]] | 1 | 143 | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.