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 n, q, i, j, C;
int S[100000];
int 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 (T[i] == S[j]) {
... | #include <stdio.h>
int main() {
int n, q, i, j, C = 0;
int S[100000];
int 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 (T[i] == S[j... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 168 | 3 |
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char **argv) {
int n;
int q;
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]);
}
int count = 0;
for (int a = 0; a ... |
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char **argv) {
int n;
int q;
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]);
}
int count = 0;
for (int a = 0; a ... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 0 | 182 | 2 |
#include <stdio.h>
int main() {
int n, m;
int i, j, cnt = 0;
scanf("%d", &n);
int S[n];
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &m);
int T[m];
for (i = 0; i < m; i++) {
scanf("%d", &T[i]);
}
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
if (T[i]... | #include <stdio.h>
int main() {
int n, m;
int i, j, cnt = 0;
scanf("%d", &n);
int S[n];
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &m);
int T[m];
for (i = 0; i < m; i++) {
scanf("%d", &T[i]);
}
for (i = 0; i < m; i++) {
for (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]] | 0 | 172 | 2 |
#include <stdio.h>
int main() {
int i, j, n, q, S[10000], T[1000], a, b, c, d, count = 0, count2 = 0;
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 (a = 0; a < q; a++) {
for (b = 0; b < n; b++) {
if... | #include <stdio.h>
int main() {
int i, j, n, q, S[10000], T[1000], a, b, c, d, count = 0, count2 = 0;
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 (a = 0; a < q; a++) {
for (b = 0; b < n; b++) {
if... | [["-", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["+", 64, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 0, 57,... | 0 | 197 | 8 |
#include <stdio.h>
int linearSearch(int a[], int n, int key) {
int i = 0;
a[n] = key;
while (a[i] != key)
i++;
if (i == n) {
return 0;
} else {
return 1;
}
}
int main() {
int i, ary[10001], judge = 0, n, key, q;
scanf("%d", n);
for (i = 0; i < n; i++) {
scanf("%d", &ary[i]);
}
sc... | #include <stdio.h>
int linearSearch(int a[], int n, int key) {
int i = 0;
a[n] = key;
while (a[i] != key)
i++;
if (i == n) {
return 0;
} else {
return 1;
}
}
int main() {
int i, ary[10001], judge = 0, n, key, q;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &ary[i]);
}
s... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 182 | 1 |
#include <stdio.h>
#define N 10000
#define Q 500
#define S 1000000000
#define T 1000000000
int LSearch(int, int, int *);
int main() {
int i, n[N], q[Q], non, noq, ans = 0;
scanf("%d", &non);
for (i = 0; i < non; i++) {
scanf("%d", &n[i]);
}
scanf("%d", &noq);
for (i = 0; i < noq; i++) {
scanf("%... | #include <stdio.h>
#define N 10000
#define Q 500
#define S 1000000000
#define T 1000000000
int LSearch(int, int, int *);
int main() {
int i, n[N], q[Q], non, noq, ans = 0;
scanf("%d", &non);
for (i = 0; i < non; i++) {
scanf("%d", &n[i]);
}
scanf("%d", &noq);
for (i = 0; i < noq; i++) {
scanf("%... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 218 | 4 |
#include <stdio.h>
int search(int S[], int n, int t) {
int i = 0;
S[n] = t;
while (S[i] != t)
i++;
return i = n;
}
int main() {
int n, i, ans = 0, S[10001], q, 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);... |
#include <stdio.h>
int search(int S[], int n, int t) {
int i = 0;
S[n] = t;
while (S[i] != t)
i++;
return i == n;
}
int main() {
int n, i, ans = 0, S[10001], q, 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)... | [["-", 0, 14, 8, 9, 0, 37, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 60]] | 0 | 170 | 2 |
#include <stdio.h>
int main() {
int S[10000];
int T[500];
int n, q, i, j, count = 0;
// input
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]);
}
// excution
for (i = 0; i < q; i++) {
for (j = 0; j < n;... | #include <stdio.h>
int main() {
int S[10000];
int T[500];
int n, q, i, j, count = 0;
// input
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]);
}
// excution
for (i = 0; i < q; i++) {
for (j = 0; j < n;... | [["+", 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 | 170 | 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 < n; 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++) {
scanf(... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 171 | 2 |
#include <stdio.h>
int main() {
int n, q, i, j, count = 0;
scanf("%d", &n);
int S[n];
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
int T[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[j] == S[i])... | #include <stdio.h>
int main() {
int n, q, i, j, count = 0;
scanf("%d", &n);
int S[n];
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
int T[q];
for (j = 0; j < q; j++) {
scanf("%d", &T[j]);
}
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
if (S[j] == T[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, 23, 0, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 2... | 0 | 177 | 8 |
#include <stdio.h>
int main() {
int i, j, n, q, c = 0;
int S[10000];
int 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[i] == T... | #include <stdio.h>
int main() {
int i, j, n, q, c = 0;
int S[10000];
int 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... | [["-", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22]] | 0 | 171 | 2 |
#include <stdio.h>
int search(int[], int, int);
int main() {
int i, n, A[10000 + 1], q, judge, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++)
scanf("%d", &judge);
if (search(A, n, judge))
count++;
printf("%d\n", count);
return... | #include <stdio.h>
int search(int[], int, int);
int main() {
int i, n, A[10000 + 1], q, judge, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &judge);
if (search(A, n, judge))
count++;
}
printf("%d\n", count)... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 181 | 2 |
/* Search I */
#include <stdio.h>
int main() {
int n, q; /* n: S, q: T */
int S[10001], T[501]; /* n<=10000, q<=500 */
int i, j, counter = 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]);
}
/* Lin... | /* Search I */
#include <stdio.h>
int main() {
int n, q; /* n: S, q: T */
int S[10001], T[501]; /* n<=10000, q<=500 */
int i, j, counter = 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]);
}
/* Lin... | [["-", 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 | 175 | 4 |
#include <stdio.h>
int main() {
int i, j, n, q, c = 0;
int S[10001], T[501];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 1; i <= q; i++) {
scanf("%d", &T[i]);
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (i != j && S[i] ... | #include <stdio.h>
int main() {
int i, j, n, q, c = 0;
int S[10001], T[501];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 1; i <= q; i++) {
scanf("%d", &T[i]);
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (i != j && S[i] ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 233 | 3 |
#include <stdio.h>
int main() {
int n, q, i, x, j;
int array_n[1000000000];
int array_q[1000000000];
int count = 0;
for (i = 0; i < 100; i++) {
array_n[i] = 0;
array_q[i] = 0;
}
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &array_n[i]);
}
scanf("%d", &q);
for (i = 0; i < ... | #include <stdio.h>
int main() {
int n, q, i, x, j;
int array_n[10000];
int array_q[10000];
int count = 0;
for (i = 0; i < 100; i++) {
array_n[i] = 0;
array_q[i] = 0;
}
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &array_n[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 182 | 4 |
#include <stdio.h>
#define N 10000
#define Q 500
int search(int[], int[], int, int);
int main(void) {
int n, q;
int S[N];
int T[Q];
int i;
int count;
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]);
count = sear... | #include <stdio.h>
#define N 10000
#define Q 500
int search(int[], int[], int, int);
int main(void) {
int n, q;
int S[N];
int T[Q];
int i;
int count;
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]);
count = sear... | [["+", 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 | 231 | 4 |
#include <stdio.h>
main() {
int s[10000];
int t[500];
int n, q;
int count = 0;
int i, j;
int p;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
for (j = 0; j < i; j++) {
if (s[i] == s[j]) {
p = s[i];
i--;
n--;
}
}
}
scanf("%d", &q);
... | #include <stdio.h>
main() {
int s[10000];
int t[500];
int n, q;
int count = 0;
int i, j;
int p;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
for (j = 0; j < i; j++) {
if (s[i] == s[j]) {
p = s[i];
i--;
n--;
}
}
}
scanf("%d", &q);
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 258 | 2 |
#include <stdio.h>
#define S_MAX 10000
#define T_MAX 500
int main(void) {
int n, q, i, j, cnt = 0;
int S[S_MAX] = {0};
int T[T_MAX] = {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... | #include <stdio.h>
#define S_MAX 10000
#define T_MAX 500
int main(void) {
int n, q, i, j, cnt = 0;
int S[S_MAX] = {0};
int T[T_MAX] = {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... | [["-", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22]] | 0 | 186 | 4 |
#include <stdio.h>
void intAryScan(int b[], int size) {
int i;
for (i = 0; i < size; i++) {
scanf("%d", &b[i]);
}
return;
}
int main() {
int s[10000], t[500], n, q;
int c, i, j;
scanf("%d", &n);
intAryScan(s, n);
scanf("%d", &q);
intAryScan(t, q);
c = 0;
for (i = 0; i < n; i++) {
for... | #include <stdio.h>
void intAryScan(int b[], int size) {
int i;
for (i = 0; i < size; i++) {
scanf("%d", &b[i]);
}
return;
}
int main() {
int s[10000], t[500], n, q;
int c, i, j;
scanf("%d", &n);
intAryScan(s, n);
scanf("%d", &q);
intAryScan(t, q);
c = 0;
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, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 2... | 0 | 176 | 10 |
#include <stdio.h>
int main() {
long long n, q, s[10001], t, c = 0, i;
scanf("%lld", &n);
for (i = 0; i < n; ++i)
scanf("%lld", s + i);
scanf("%lld", &q);
while (q--) {
scanf("%lld", &t);
for (i = 0; i < n; ++i)
if (t == s[i])
c++;
}
printf("%lld\n", c);
return 0;
} | #include <stdio.h>
int main() {
long long n, q, s[10001], t, c = 0, i;
scanf("%lld", &n);
for (i = 0; i < n; ++i)
scanf("%lld", s + i);
scanf("%lld", &q);
while (q--) {
scanf("%lld", &t);
for (i = 0; i < n; ++i)
if (t == s[i]) {
c++;
break;
}
}
printf("%lld\n", c... | [["+", 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]] | 0 | 126 | 4 |
#include <stdio.h>
#define N 10000
#define Q 500
int main() {
int S[N], T[Q];
int n, m, i, j, count = 0, flag = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &T[i]);
}
for (i = 0; i < m; i++) {
flag = 0;
fo... | #include <stdio.h>
#define N 10000
#define Q 500
int main() {
int S[N], T[Q];
int n, m, i, j, count = 0, flag = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &T[i]);
}
for (i = 0; i < m; i++) {
flag = 0;
fo... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 106], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 98]] | 0 | 211 | 2 |
#include <stdio.h>
int main() {
int S[10000], T[500], n, q, i, j, cnt = 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++)
if (S[i] == T[j]) {
cnt++;
... | #include <stdio.h>
int main() {
int S[10000], T[500], n, q, i, j, cnt = 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++)
if (T[i] == S[j]) {
cnt++;
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 9, 0, 7, 8, 7, 15, 16, 12, 22], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 12, 22], ["-", 8, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["+", 8, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 8, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 8, 57, 15, 2... | 0 | 161 | 8 |
#include <stdio.h>
#define N 10000
int main() {
int i, j, s, n1, t, n2, teto[N], teto2[N], count = 0;
scanf("%d", &n1);
for (i = 0; i < n1; i++) {
scanf("%d", teto[i]);
}
scanf("%d", &n2);
for (i = 0; i < n2; i++) {
scanf("%d", teto2[i]);
}
for (i = 0; i < n2; i++) {
for (j = 0; j < n1; j++... | #include <stdio.h>
#define N 10000
int main() {
int i, j, s, n1, t, n2, teto[N], teto2[N], count = 0;
scanf("%d", &n1);
for (i = 0; i < n1; i++) {
scanf("%d", &teto[i]);
}
scanf("%d", &n2);
for (i = 0; i < n2; i++) {
scanf("%d", &teto2[i]);
}
for (i = 0; i < n2; i++) {
for (j = 0; j < n1; j... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 173 | 3 |
#include <stdio.h>
#define MAX 10000
int main() {
int S[MAX], T[MAX];
int i, j, cnt = 0, n, q;
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[i] == T[j]) ... | #include <stdio.h>
#define MAX 10000
int main() {
int S[MAX], T[MAX];
int i, j, cnt = 0, n, q;
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 (T[i] == S[j]) ... | [["-", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22]] | 0 | 169 | 4 |
#include <stdio.h>
main() {
int n1, count = 0;
scanf("%d", &n1);
int i, j, array1[n1];
for (i = 0; i < n1; i++) {
scanf("%d", &array1[i]);
}
int n2;
scanf("%d", &n2);
int array2[n2 + 1];
for (i = 0; i < n2; i++) {
scanf("%d", &array2[i]);
}
for (i = 0; i < n2; i++) {
for (j = 0; j <... | #include <stdio.h>
main() {
int n1, count = 0;
scanf("%d", &n1);
int i, j, array1[n1];
for (i = 0; i < n1; i++) {
scanf("%d", &array1[i]);
}
int n2;
scanf("%d", &n2);
int array2[n2 + 1];
for (i = 0; i < n2; i++) {
scanf("%d", &array2[i]);
}
for (i = 0; i < n2; i++) {
for (j = 0; j <... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 0 | 172 | 2 |
#include <stdio.h>
main() {
int i, j, n, q, count = 0, 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 (j = 0; j < n; j++) {
if (T[i] == S[j])
count++;
}
}
printf("%d\n... | #include <stdio.h>
main() {
int i, j, n, q, count = 0, 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 (j = 0; j < n; j++) {
if (T[i] == S[j]) {
count++;
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]] | 0 | 150 | 4 |
#include <stdio.h>
#define MAX1 10000
#define MAX2 500
int main() {
int n, m, i, j;
int count = 0;
int s[MAX1];
int t[MAX2];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &t[i]);
}
for (i = 0; i < n; i++) {
for ... | #include <stdio.h>
#define MAX1 10000
#define MAX2 500
int main() {
int n, m, i, j;
int count = 0;
int s[MAX1];
int t[MAX2];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &t[i]);
}
for (i = 0; i < m; i++) {
f... | [["-", 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 | 179 | 8 |
#include <stdio.h>
#define S 100000
#define T 100000
int main() {
int i, j, n, q, count = 0;
int s[S];
int t[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[i]);
}
for (j = 0; j < n; j++) {
for (i = 0; i < q; ... | #include <stdio.h>
#define S 100000
#define T 100000
int main() {
int i, j, n, q, count = 0;
int s[S];
int t[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[i]);
}
for (j = 0; j < q; j++) {
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], ["-", 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, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 2... | 0 | 192 | 10 |
#include <stdio.h>
#define n 10000
#define q 500
int main() {
int s[n], t[q], c = 0, countn, countq, i, j, flag = 0;
scanf("%d", &countn);
for (i = 0; i < countn; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &countq);
for (i = 0; i < countq; i++) {
scanf("%d", &t[i]);
}
for (j = 0; j < countq; ... | #include <stdio.h>
#define n 10000
#define q 500
int main() {
int s[n], t[q], c = 0, countn, countq, i, j, flag = 0;
scanf("%d", &countn);
for (i = 0; i < countn; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &countq);
for (i = 0; i < countq; i++) {
scanf("%d", &t[i]);
}
for (j = 0; j < countq; ... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 189 | 2 |
#include <stdio.h>
#define N 10000
#define Q 500
main() {
int s, t, i, j, count = 0;
int a[N], b[Q];
scanf("%d", &s);
for (i = 0; i < s; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &t);
for (i = 0; i < t; i++) {
scanf("%d", &b[i]);
}
for (j = 0; j < t; j++) {
for (i = 0; i < s; i++) {
i... | #include <stdio.h>
#define N 10000
#define Q 500
main() {
int s, t, i, j, count = 0;
int a[N], b[Q];
scanf("%d", &s);
for (i = 0; i < s; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &t);
for (i = 0; i < t; i++) {
scanf("%d", &b[i]);
}
for (j = 0; j < t; j++) {
for (i = 0; i < s; i++) {
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]] | 0 | 173 | 4 |
#include <stdio.h>
void scan(int *[], int);
int search(int *[], int *[], int, int);
int main() {
int i, j, n = 0, q = 0, c = 0;
int *s[10000];
int *t[500];
scanf("%d", &n);
scan(s, n);
scanf("%d", &q);
scan(t, q);
c = search(s, t, n, q);
printf("%d\n", c);
return 0;
}
void scan(int *a[], in... | #include <stdio.h>
void scan(int *[], int);
int search(int *[], int *[], int, int);
int main() {
int i, j, n = 0, q = 0, c = 0;
int *s[10000];
int *t[500];
scanf("%d", &n);
scan(s, n);
scanf("%d", &q);
scan(t, q);
c = search(s, t, n, q);
printf("%d\n", c);
return 0;
}
void scan(int *a[], in... | [["-", 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, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 2... | 0 | 257 | 8 |
#include <stdio.h>
#define N 10000
#define Q 500
#define E 1000000000
main() {
int n = 0;
int S[N];
int q = 0;
int T[Q];
int C = 0;
int i = 0, j = 0;
scanf("%d", &n);
if (n < 0 || N < n) {
return 0;
}
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || E < S[i]) {
... | #include <stdio.h>
#define N 10000
#define Q 500
#define E 1000000000
main() {
int n = 0;
int S[N];
int q = 0;
int T[Q];
int C = 0;
int i = 0, j = 0;
scanf("%d", &n);
if (n < 0 || N < n) {
return 0;
}
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || E < S[i]) {
... | [["-", 0, 30, 0, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 30, 0, 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, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 2... | 0 | 261 | 10 |
#include <stdio.h>
#define N 10000
#define Q 500
int main() {
int n, n1[N], q, q1[Q], i, sum = 0, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &n1[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &q1[i]);
}
for (i = 0; i < n; i++) {
for (j = 0; j < q; j++) {
... | #include <stdio.h>
#define N 10000
#define Q 500
int main() {
int n, n1[N], q, q1[Q], i, sum = 0, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &n1[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &q1[i]);
}
for (i = 0; i < q; i++) {
for (j = 0; j < n; 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], ["-", 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 | 175 | 8 |
#include <stdio.h>
int input(int *[]);
int isMatch(int *[], int *[], int, int);
main() {
int n, q;
int *S[10000], *T[500];
n = input(S);
q = input(T);
printf("%d\n", isMatch(S, T, n, q));
return 0;
}
int input(int *array[]) {
int i, e;
scanf("%d", &e);
for (i = 0; i < e; i++) {
scanf("%d", &ar... | #include <stdio.h>
int input(int *[]);
int isMatch(int *[], int *[], int, int);
main() {
int n, q;
int *S[10000], *T[500];
n = input(S);
q = input(T);
printf("%d\n", isMatch(S, T, n, q));
return 0;
}
int input(int *array[]) {
int i, e;
scanf("%d", &e);
for (i = 0; i < e; i++) {
scanf("%d", &ar... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 0 | 228 | 2 |
#include <stdio.h>
#include <string.h>
int main() {
int S[10000];
int T[500];
int n, i, q, j, count = 0, flag = 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... | #include <stdio.h>
#include <string.h>
int main() {
int S[10000];
int T[500];
int n, i, q, j, count = 0, flag = 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... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 0 | 187 | 4 |
#include <stdio.h>
#define N 10000
#define Q 500
main() {
int s, t, c = 0, i, j;
int a[N], b[Q];
scanf("%d", &s);
for (i = 0; i < s; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &t);
for (i = 0; i < t; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < t; i++) {
for (j = 0; j < s; j++) {
if (... | #include <stdio.h>
#define N 10000
#define Q 500
main() {
int s, t, c = 0, i, j;
int a[N], b[Q];
scanf("%d", &s);
for (i = 0; i < s; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &t);
for (i = 0; i < t; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < t; i++) {
for (j = 0; j < s; j++) {
if... | [["+", 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 | 172 | 4 |
/* サーチプログラム */
#include <stdio.h>
// all 1
/* マクロの定義 */
#define N 10000
#define Q 500
// all 2
/* プロトタイプ宣言 */
int Linear_Search(int *, int);
// all 1
/* グローバル変数宣言 */
int n = 0;
int q = 0;
// all 2
main() {
int i = 0;
int S[N];
int T[Q];
int val = 0;
/* n個を決定 */
scanf("%d", &n);
/* Sの要素 */
for (i =... | /* サーチプログラム */
#include <stdio.h>
// all 1
/* マクロの定義 */
#define N 10000
#define Q 500
// all 2
/* プロトタイプ宣言 */
int Linear_Search(int *, int);
// all 1
/* グローバル変数宣言 */
int n = 0;
int q = 0;
// all 2
main() {
int i = 0;
int S[N];
int T[Q];
int val = 0;
/* n個を決定 */
scanf("%d", &n);
/* Sの要素 */
for (i =... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107]] | 0 | 231 | 2 |
#include <stdio.h>
#define MAX 10000
main() {
int i, j, n, q, count = 0;
int S[MAX], T[MAX];
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 (T[i]... | #include <stdio.h>
#define MAX 10000
main() {
int i, j, n, q, count = 0;
int S[MAX], T[MAX];
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 (T[i]... | [["+", 0, 7, 8, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 57, 64, 9, 0, 93, 0, 35]] | 0 | 169 | 2 |
n = STDIN.gets.to_i
s = STDIN.gets.split[0...n].map(&:to_i)
q = STDIN.gets.to_i
t = STDIN.gets.split[0...q].map(&:to_i)
count = 0
t.each do |te|
s[q] = te # 番兵を利用, rubyでは多分意味ない
i = 0
i += 1 until a[i] == te
count += 1 unless i == q
end
p count | n = STDIN.gets.to_i
s = STDIN.gets.split[0...n].map(&:to_i)
q = STDIN.gets.to_i
t = STDIN.gets.split[0...q].map(&:to_i)
count = 0
t.each do |te|
s[n] = te # 番兵を利用, rubyでは多分意味ない
i = 0
i += 1 until s[i] == te
count += 1 unless i == n
end
p count | [["-", 196, 737, 8, 736, 0, 662, 31, 742, 0, 22], ["+", 196, 737, 8, 736, 0, 662, 31, 742, 0, 22], ["-", 8, 736, 0, 770, 15, 738, 31, 742, 500, 22], ["+", 8, 736, 0, 770, 15, 738, 31, 742, 500, 22], ["-", 196, 737, 8, 736, 0, 745, 15, 738, 12, 22], ["+", 196, 737, 8, 736, 0, 745, 15, 738, 12, 22]] | 4 | 90 | 6 |
int_s = gets.to_i
s_arr = gets.split(" ").map(&:to_i)
int_t = gets.to_i
t_arr = gets.split(" ").map(&:to_i)
count1 = s_arr.count
count2 = (s_arr - t_arr).count
ans = count1 - count2
puts ans | int_s = gets.to_i
s_arr = gets.split(" ").map(&:to_i)
int_t = gets.to_i
t_arr = gets.split(" ").map(&:to_i)
count1 = s_arr.uniq.count
count2 = (s_arr.uniq - t_arr.uniq).count
ans = count1 - count2
puts ans | [["+", 0, 493, 0, 662, 12, 652, 486, 652, 735, 22], ["+", 36, 36, 0, 493, 0, 662, 12, 652, 17, 131], ["+", 12, 652, 486, 739, 0, 738, 31, 652, 17, 131], ["+", 12, 652, 486, 739, 0, 738, 31, 652, 735, 22], ["+", 12, 652, 486, 739, 0, 738, 12, 652, 17, 131], ["+", 12, 652, 486, 739, 0, 738, 12, 652, 735, 22]] | 4 | 63 | 6 |
def linearSearch(as, bs)
n = 0
for i in as
for j in bs
if i == j
n = n + 1
end
end
end
puts n
end
a_size = STDIN.gets.to_i
as = STDIN.gets.split(' ')
b_size = STDIN.gets.to_i
bs = STDIN.gets.split(' ')
linearSearch(as, bs) | def linearSearch(as, bs)
n = 0
for i in bs
for j in as
if i == j
n = n + 1
break;
end
end
end
puts n
end
a_size = STDIN.gets.to_i
as = STDIN.gets.split(' ')
b_size = STDIN.gets.to_i
bs = STDIN.gets.split(' ')
linearSearch(as, bs) | [["-", 0, 735, 8, 736, 0, 88, 51, 267, 0, 22], ["+", 0, 735, 8, 736, 0, 88, 51, 267, 0, 22], ["-", 0, 88, 8, 170, 0, 88, 51, 267, 0, 22], ["+", 0, 88, 8, 170, 0, 88, 51, 267, 0, 22], ["+", 8, 170, 0, 121, 64, 749, 0, 94, 0, 94], ["+", 0, 88, 8, 170, 0, 121, 64, 749, 0, 35]] | 4 | 77 | 6 |
n = gets.chomp.to_i
s = gets.chomp.split(" ").map(&:to_i)
q = gets.chomp.to_i
t = gets.chomp.split(" ").map(&:to_i)
c = 0
t.each { |i|
s.each{ |j|
if i == j
c+=1
end
}
}
puts c | n = gets.chomp.to_i
s = gets.chomp.split(" ").map(&:to_i)
q = gets.chomp.to_i
t = gets.chomp.split(" ").map(&:to_i)
c = 0
t.each { |i|
s.each{ |j|
if i == j
c+=1
break
end
}
}
puts c | [["+", 8, 734, 0, 121, 64, 749, 0, 94, 0, 94]] | 4 | 79 | 1 |
def linerSearch(array, key)
i = 0
array.push(key)
while array[i] != key
i += 1
if i == array.length - 1
array.pop
return false
end
end
array.pop
return true
end
n = gets.to_i
s = gets.chomp.split(' ').map(&:to_i)
q = gets.to_i
t = gets.chomp.split(' ').map(&:to_i)
count = 0
n.times... | def linerSearch(array, key)
i = 0
array.push(key)
while array[i] != key
i += 1
if i == array.length - 1
array.pop
return false
end
end
array.pop
return true
end
n = gets.to_i
s = gets.chomp.split(' ').map(&:to_i)
q = gets.to_i
t = gets.chomp.split(' ').map(&:to_i)
count = 0
q.times... | [["-", 36, 36, 36, 36, 0, 493, 0, 652, 486, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 486, 22], ["-", 8, 736, 0, 751, 15, 652, 3, 4, 0, 22], ["-", 8, 736, 0, 751, 15, 652, 3, 4, 0, 21], ["+", 8, 736, 0, 751, 15, 652, 3, 4, 0, 21], ["+", 0, 751, 15, 652, 3, 4, 0, 742, 500, 22]] | 4 | 119 | 6 |
gets
s =gets.split
gets
t =gets.sprit
puts (s&t).size | gets
s=gets.split
gets
t=gets.split
puts (s&t).size | [["-", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22], ["+", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22]] | 4 | 20 | 2 |
n=gets.to_i
s=gets.split.map(&:to_i)
q=gets.to_i
t=gets.split.map(&:to_i)
cnt=0
s.each do |i|
t.each do |j|
if i==j
cnt+=1
end
end
end
puts cnt | n=gets.to_i
s=gets.split.map(&:to_i)
q=gets.to_i
t=gets.split.map(&:to_i)
cnt=0
t.each do |i|
s.each do |j|
if i==j
cnt+=1
break
end
end
end
puts cnt | [["-", 36, 36, 36, 36, 0, 493, 0, 652, 486, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 486, 22], ["-", 0, 652, 196, 737, 8, 736, 0, 652, 486, 22], ["+", 0, 652, 196, 737, 8, 736, 0, 652, 486, 22], ["+", 8, 736, 0, 121, 64, 749, 0, 94, 0, 94]] | 4 | 61 | 5 |
def SearchEqual(s, t)
matched = []
for i in 0..s.length-1
for j in 0..t.length-1
if s[i] == t[j]
matched << t[j]
end
end
end
p matched.length
end
#input sequence of numbers S
n = gets.chomp
n = gets.chomp
n = n.split()
#input of sequence of numbers T
q = gets.chomp
q = gets.chomp
q = q.split()
#outpu... | def SearchEqual(s, t)
matched = []
for i in 0..s.length-1
for j in 0..t.length-1
if s[i] == t[j]
matched << t[j]
end
end
end
matched = matched.uniq
p matched.length
end
#input sequence of numbers S
n = gets.chomp
n = gets.chomp
n = n.split()
#input of sequence of numbers T
q = gets.chomp
q = gets.ch... | [["+", 0, 493, 0, 735, 8, 736, 0, 662, 31, 22], ["+", 0, 493, 0, 735, 8, 736, 0, 662, 0, 32], ["+", 0, 735, 8, 736, 0, 662, 12, 652, 486, 22], ["+", 0, 735, 8, 736, 0, 662, 12, 652, 17, 131], ["+", 0, 735, 8, 736, 0, 662, 12, 652, 735, 22]] | 4 | 99 | 5 |
n = gets.to_i
a = gets.split(' ').map(&:to_i)
m = gets.to_i
b = gets.split(' ').map(&:to_i)
cnt = 0
a.each do |i|
b.each do |ii|
cnt += 1 if i == ii
end
end
puts cnt | n = gets.to_i
a = gets.split(' ').map(&:to_i)
m = gets.to_i
b = gets.split(' ').map(&:to_i)
cnt = 0
a.uniq.each do |i|
b.uniq.each do |ii|
cnt += 1 if i == ii
end
end
puts cnt | [["+", 36, 36, 0, 493, 0, 652, 486, 652, 735, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 17, 131], ["+", 196, 737, 8, 736, 0, 652, 486, 652, 17, 131], ["+", 196, 737, 8, 736, 0, 652, 486, 652, 735, 22]] | 4 | 70 | 4 |
class SearchI
def solve
n = gets.chomp.to_i
s = gets.scan(/\d+/).map(&:to_i)
q = gets.chomp.to_i
t = gets.scan(/\d+/).map(&:to_i)
cnt = 0
s.each do |x|
if is_include(x, t)
cnt += 1
end
end
return cnt.to_s
end
def is_include(e, ls)
ls.each do |x|
if e... | class SearchI
def solve
n = gets.chomp.to_i
s = gets.scan(/\d+/).map(&:to_i)
q = gets.chomp.to_i
t = gets.scan(/\d+/).map(&:to_i)
cnt = 0
t.each do |x|
if is_include(x, s)
cnt += 1
end
end
return cnt.to_s
end
def is_include(e, ls)
ls.each do |x|
if e... | [["-", 8, 736, 0, 735, 8, 736, 0, 652, 486, 22], ["+", 8, 736, 0, 735, 8, 736, 0, 652, 486, 22], ["-", 8, 736, 0, 121, 15, 652, 3, 4, 0, 22], ["+", 8, 736, 0, 121, 15, 652, 3, 4, 0, 22]] | 4 | 116 | 4 |
N = int(input())
S = list(map(int, input().split()))
Q = int(input())
T = list(map(int, input().split()))
cnt = 0
for i in S:
for j in T:
if i == j:
cnt += 1
break
print(cnt) | N = int(input())
S = list(map(int, input().split()))
Q = int(input())
T = list(map(int, input().split()))
cnt = 0
for i in T:
for j in S:
if i == j:
cnt += 1
break
print(cnt) | [["-", 36, 36, 36, 36, 0, 656, 0, 7, 12, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 7, 12, 22], ["-", 0, 656, 0, 7, 8, 196, 0, 7, 12, 22], ["+", 0, 656, 0, 7, 8, 196, 0, 7, 12, 22]] | 5 | 76 | 4 |
input()
n1 = set(input().split())
input()
n2 = set(input().split())
print(len(n1-n2))
| input()
n1 = set(input().split())
input()
n2 = set(input().split())
print(len(n1&n2))
| [["-", 3, 4, 0, 652, 3, 4, 0, 657, 17, 33], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 67]] | 5 | 39 | 2 |
n = int(input())
s = [int(i) for i in input().split()]
q = int(input())
t = [int(i) for i in input().split()]
ans = 0
for si in s:
if si in t:
ans += 1
print(ans)
|
n = int(input())
s = [int(i) for i in input().split()]
q = int(input())
t = [int(i) for i in input().split()]
ans = 0
for si in set(s):
if si in t:
ans += 1
print(ans)
| [["+", 36, 36, 0, 656, 0, 7, 12, 652, 63, 22], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 25]] | 5 | 72 | 3 |
#include <stdio.h>
#define M 10000
#define N 500
#define NOT_FOUND -1
int cnt = 0, n;
int linearsearch(int a[], int key) {
int i = 0;
a[n] = key;
while (a[i] != key)
i++;
if (i == n)
return NOT_FOUND;
return i;
}
int main() {
int a[M], j[N], x, y, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
... | #include <stdio.h>
#define M 10000
#define N 500
#define NOT_FOUND -1
int cnt = 0, n;
int linearsearch(int a[], int key) {
int i = 0;
a[n] = key;
while (a[i] != key)
i++;
if (i == n)
return NOT_FOUND;
return i;
}
int main() {
int a[M], j[N], x, y, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
... | [["-", 0, 2, 3, 4, 0, 66, 28, 69, 71, 22], ["+", 0, 2, 3, 4, 0, 66, 28, 69, 71, 22]] | 0 | 205 | 4 |
#include <stdio.h>
int main() {
int i, j, k, t, q;
int n, cnt;
int A_size[10000];
cnt = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", A_size + i);
scanf("%d", &q);
for (j = 0; j < q; j++) {
scanf("%d", &t);
for (k = 0; k < n; k++) {
if (A_size[k] == t) {
cnt++;
... | #include <stdio.h>
int main() {
int i, j, k, t, q;
int n, cnt;
int A_size[10000];
cnt = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", A_size + i);
scanf("%d", &q);
for (j = 0; j < q; j++) {
scanf("%d", &t);
for (k = 0; k < n; k++)
if (A_size[k] == t) {
cnt++;
... | [["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 147 | 4 |
#include <stdio.h>
int main() {
int i, j, k, t, q;
int n, cnt;
int A_size[10000];
cnt = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", A_size + i);
scanf("%d", &q);
for (j = 0; j < q; j++) {
scanf("%d", &t);
for (k = 0; k < n; k++) {
if (A_size[k] == t) {
cnt++;
... | #include <stdio.h>
int main() {
int i, j, k, t, q;
int n, cnt;
int A_size[10000];
cnt = 0;
// linearsearch function is here
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", A_size + i);
}
scanf("%d", &q);
for (j = 0; j < q; j++) {
scanf("%d", &t);
for (k = 0; k < n; k++) {
... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 147 | 4 |
#include <stdio.h>
int linear(int[], int, int);
int main() {
int i, j, s[10001], t, n, q, sum = 0;
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);
if (linear(s, n, t))
sum++;
}
printf("%d\n", sum);
return 0;
}
int... | #include <stdio.h>
int linear(int[], int, int);
int main() {
int i, j, s[10001], t, n, q, sum = 0;
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);
if (linear(s, n, t))
sum++;
}
printf("%d\n", sum);
return 0;
}
int... | [["-", 49, 53, 54, 55, 0, 56, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 182 | 3 |
#include <stdio.h>
#define MAX_N 10000
int main() {
int N, Q, i, j, S[MAX_N], T, res = 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);
for (j = 0; j < N; j++) {
if (T == S[j]) {
++res;
}
}
... | #include <stdio.h>
#define MAX_N 10000
int main() {
int N, Q, i, j, S[MAX_N], T, res = 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);
for (j = 0; j < N; j++) {
if (T == S[j]) {
++res;
break;
... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 0 | 146 | 2 |
#include <stdio.h>
#define SM 10000
#define TM 500
main() {
int i;
int j;
int c = 0;
int q;
int n;
int s[SM];
int t[TM];
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++) {
... | #include <stdio.h>
#define SM 10000
#define TM 500
main() {
int i;
int j;
int c = 0;
int q;
int n;
int s[SM];
int t[TM];
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++) {
... | [["-", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22]] | 0 | 181 | 4 |
#include <stdio.h>
#define N 10000
#define Q 500
main() {
int n, q, c, i, j;
int s[N], t[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]);
}
c = 0;
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
... | #include <stdio.h>
#define N 10000
#define Q 500
main() {
int n, q, c, i, j;
int s[N], t[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]);
}
c = 0;
for (i = 0; i < q; i++) {
for (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]] | 0 | 174 | 4 |
#include <stdio.h>
#define N 500
main() {
int i, j, ns, nt, S[10000], T[N], c;
scanf("%d", &ns);
for (i = 0; i < ns; i++)
scanf("%d", &S[i]);
scanf("%d", &nt);
for (i = 0; i < nt; i++)
scanf("%d", &T[i]);
for (i = 0, c = 0; i < ns; i++) {
for (j = 0; j < nt; j++) {
if (S[i] == T[j]) {
... | #include <stdio.h>
#define N 500
main() {
int i, j, ns, nt, S[10000], T[N], c;
scanf("%d", &ns);
for (i = 0; i < ns; i++)
scanf("%d", &S[i]);
scanf("%d", &nt);
for (i = 0; i < nt; i++)
scanf("%d", &T[i]);
for (i = 0, c = 0; i < nt; i++) {
for (j = 0; j < ns; j++) {
if (S[j] == T[i]) {
... | [["-", 0, 30, 0, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 30, 0, 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 | 171 | 9 |
#include <stdio.h>
int main() {
int S[1000];
int T[1000];
int Scount;
int Tcount;
int count;
int i, j;
scanf("%d", &Scount);
for (count = 0; count < Scount; count++) {
scanf("%d", &S[count]);
}
scanf("%d", &Tcount);
for (count = 0; count < Tcount; count++) {
scanf("%d", &T[count]);
... | #include <stdio.h>
int main() {
int S[1000000];
int T[1000000];
int Scount;
int Tcount;
int count;
int i, j;
scanf("%d", &Scount);
for (count = 0; count < Scount; count++) {
scanf("%d", &S[count]);
}
scanf("%d", &Tcount);
for (count = 0; count < Tcount; count++) {
scanf("%d", &T[coun... | [["-", 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, 9, 0, 46]] | 0 | 172 | 8 |
#include <stdio.h>
int main() {
int n, s[10000], q, t[500], i, j, 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++) {
s[n] = t[i]; //番兵の配置
j = 0;
while (s[j] != t[i]) {
j+... | #include <stdio.h>
int main() {
int n, s[10000], q, t[500], i, j, 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++) {
s[n] = t[i]; //番兵の配置
j = 0;
while (s[j] != t[i]) {
j+... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22]] | 0 | 172 | 2 |
#include <stdio.h>
main() {
int n, q, i, j, c = 0;
int 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 (j = 0; j < n; j++) {
for (i = 0; i < q; i++) {
if (s[j] == t[i]) {
... | #include <stdio.h>
main() {
int n, q, i, j, c = 0;
int 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 (j = 0; j < q; j++) {
for (i = 0; i < n; i++) {
if (s[i] == t[j]) {
... | [["-", 0, 30, 0, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 30, 0, 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 | 170 | 8 |
#include <stdio.h>
#define N 10000
main() {
int n, m, i, j, a[N], b[N], c = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &m);
for (j = 0; j < m; j++) {
scanf("%d", &b[j]);
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (a[i] == b[j])... | #include <stdio.h>
#define N 10000
main() {
int n, m, i, j, a[N], b[N], c = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &m);
for (j = 0; j < m; j++) {
scanf("%d", &b[j]);
}
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
if (b[i] == a[j])... | [["-", 0, 30, 0, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 30, 0, 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, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 2... | 0 | 172 | 8 |
#include <stdio.h>
#define N 10000
#define Q 500
int main() {
int n, q, i, j, count = 0, a[N], b[Q];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
i... | #include <stdio.h>
#define N 10000
#define Q 500
int main() {
int n, q, i, j, count = 0, a[N], b[Q];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
i... | [["-", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 0 | 175 | 2 |
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
size_t linear_search_find(int32_t data[], size_t data_size, int32_t find[],
size_t find_size) {
if ((data == NULL) || (find == NULL)) {
return 0;
}
size_t found = 0;
int32_t i = 0;
for (i = 0; i < f... | #include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
size_t linear_search_find(int32_t data[], size_t data_size, int32_t find[],
size_t find_size) {
if ((data == NULL) || (find == NULL)) {
return 0;
}
size_t found = 0;
int32_t i = 0;
for (i = 0; i < f... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 0 | 256 | 2 |
#include <stdio.h>
int main() {
int a, b, A[10000], B[10000], count = 0, i, j;
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &b);
for (i = 0; i < b; i++) {
scanf("%d", &B[i]);
}
for (i = 0; i < b; i++) {
for (j = 0; j < a; j++) {
if (A[j] == B[i]) {
... | #include <stdio.h>
int main() {
int a, b, A[10000], B[10000], count = 0, i, j;
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &b);
for (i = 0; i < b; i++) {
scanf("%d", &B[i]);
}
for (i = 0; i < b; i++) {
for (j = 0; j < a; j++) {
if (A[j] == B[i]) {
... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 0 | 167 | 2 |
#include <stdio.h>
int main() {
int n, q, i, j, C;
scanf("%d", &n);
long S[n];
for (i = 0; i < n; i++)
scanf("%ld", S + i);
scanf("%d", &q);
long T;
C = 0;
for (i = 0; i < q; i++) {
scanf("%ld", &T);
for (j = 0; j < n; j++)
if (T == S[j])
C++;
}
printf("%d\n", C);
retu... | #include <stdio.h>
int main() {
int n, q, i, j, C;
scanf("%d", &n);
long S[n];
for (i = 0; i < n; i++)
scanf("%ld", S + i);
scanf("%d", &q);
long T;
C = 0;
for (i = 0; i < q; i++) {
scanf("%ld", &T);
for (j = 0; j < n; j++)
if (T == S[j]) {
C++;
break;
}
}
p... | [["+", 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]] | 0 | 139 | 4 |
#include <stdio.h>
#define N 500
void linearSearch(int);
int count, n, A[N];
int main() {
int i, j, q, r;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
count = 0;
for (i = 0; i < q; i++) {
scanf("%d", &r);
linearSearch(r);
}
printf("%d\n", count);
retu... | #include <stdio.h>
#define N 10000
void linearSearch(int);
int count, n, A[N];
int main() {
int i, j, q, r;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
count = 0;
for (i = 0; i < q; i++) {
scanf("%d", &r);
linearSearch(r);
}
printf("%d\n", count);
re... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38]] | 0 | 171 | 4 |
#include <stdio.h>
#define N 500
int a[N], n1, n2, number, count = 0;
int searchNumber(int);
int searchNumber(int x) {
int i;
for (i = 0; i < n2; i++) {
if (a[i] == x)
return a[i];
}
return -1;
}
int main() {
int i, j;
int b[500];
scanf("%d", &n1);
for (i = 0; i < n1; i++) {
scanf("%d... | #include <stdio.h>
#define N 50000
int a[N], n1, n2, number, count = 0;
int searchNumber(int);
int searchNumber(int x) {
int i;
for (i = 0; i < n1; i++) {
if (a[i] == x)
return a[i];
}
return -1;
}
int main() {
int i, j;
int b[500];
scanf("%d", &n1);
for (i = 0; i < n1; i++) {
scanf("... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 211 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define nmax 10000
#define qmax 500
void linearSearch(int);
int T[qmax], q, count = 0;
int judge[qmax];
int main() {
int n;
int S[nmax], i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scan... | #include <stdio.h>
#include <stdlib.h>
#define nmax 10000
#define qmax 500
void linearSearch(int);
int T[qmax], q, count = 0;
int judge[qmax];
int main() {
int n;
int S[nmax], i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scan... | [["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29], ["+", 64, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46]] | 0 | 248 | 5 |
#include <stdio.h>
#define N 1000000
int main() {
int i, j, num = 0, n, q, key;
int S[N], 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++) {
key = S[i];
for (j = 0; j < q; j... | #include <stdio.h>
#define N 1000000
int main() {
int i, j, num = 0, n, q, key;
int S[N], 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++) {
key = T[i];
for (j = 0; j < n; j... | [["-", 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, 12, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 69, 28, 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, 12, 69, 28, 22], ["+", 0, 57, 15, 23, 0, ... | 0 | 179 | 8 |
#include <stdio.h>
#include <string.h>
#define n 10000
#define q 500
int linearsearch(int);
int s[n], t[q], num1, num2;
int main() {
int i;
int num = 0, judge;
scanf("%d", &num1); //??°????????\???
for (i = 0; i < num1; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &num2);
for (i = 0; i < num2; i++) {... | #include <stdio.h>
#include <string.h>
#define n 10000
#define q 500
int linearsearch(int);
int s[n], t[q], num1, num2;
int main() {
int i;
int num = 0, judge;
scanf("%d", &num1); //数列の入力
for (i = 0; i < num1; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &num2);
for (i = 0; i < num2; i++) {
scanf... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 214 | 4 |
#include <stdio.h>
#define MAX_N 1001
#define MAX_Q 501
int main() {
int i, j, key, sum, s_n, t_n, s[MAX_N], t[MAX_Q];
scanf("%d", &s_n);
for (i = 0; i < s_n; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &t_n);
for (i = 0; i < t_n; i++) {
scanf("%d", &t[i]);
}
sum = 0;
for (i = 0; i < t_n; i... | #include <stdio.h>
#define MAX_N 10000
#define MAX_Q 500
int main() {
int i, j, key, sum, s_n, t_n, s[MAX_N], t[MAX_Q];
scanf("%d", &s_n);
for (i = 0; i < s_n; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &t_n);
for (i = 0; i < t_n; i++) {
scanf("%d", &t[i]);
}
sum = 0;
for (i = 0; i < t_n; ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 0 | 181 | 7 |
#include <stdio.h>
#define MAX_N 1001
#define MAX_Q 501
int main() {
int i, j, key, sum, s_n, t_n, s[MAX_N], t[MAX_Q];
scanf("%d", &s_n);
for (i = 0; i < s_n; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &t_n);
for (i = 0; i < t_n; i++) {
scanf("%d", &t[i]);
}
sum = 0;
for (i = 0; i < t_n; i... | /*
*
* 線形探索
* 番兵
*
*
*/
#include <stdio.h>
#define MAX_N 10000
#define MAX_Q 500
int main(void) {
int i, j, key, sum, s_n, t_n, s[MAX_N], t[MAX_Q];
scanf("%d", &s_n);
for (i = 0; i < s_n; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &t_n);
for (i = 0; i < t_n; i++) {
scanf("%d", &t[i]);
}
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 0 | 181 | 7 |
#include <stdio.h>
#include <stdlib.h>
#define N 10000
int main() {
int i, j;
int n, q;
int nl[N], s;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &nl[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &s);
for (j = 0; j < n; j++) {
if (s == nl[... | #include <stdio.h>
#include <stdlib.h>
#define N 10000
int main() {
int i, j;
int n, q;
int nl[N], s;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &nl[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &s);
for (j = 0; j < n; j++) {
if (s == nl[... | [["+", 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 | 149 | 4 |
#include <stdio.h>
#define N 10000
#define Q 500
int main() {
int i, j;
int s[N], t[Q];
int n, q;
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++) { // S
fo... | #include <stdio.h>
#define N 10000
#define Q 500
int main() {
int i, j;
int s[N], t[Q];
int n, q;
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++){//S
for(j ... | [["-", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22]] | 0 | 180 | 4 |
#include <stdio.h>
int main() {
int data[10000];
int search[500];
int i, j, sumdata, sumsearch, count;
count = 0;
scanf("%d", &sumdata);
for (i = 0; i < sumdata; i++) {
scanf("%d", &data[i]);
}
scanf("%d", &sumsearch);
for (i = 0; i < sumsearch; i++) {
scanf("%d", &search[i]);
}
... | #include <stdio.h>
int main() {
int data[10000];
int search[500];
int i, j, sumdata, sumsearch, count;
count = 0;
scanf("%d", &sumdata);
for (i = 0; i < sumdata; i++) {
scanf("%d", &data[i]);
}
scanf("%d", &sumsearch);
for (i = 0; i < sumsearch; i++) {
scanf("%d", &search[i]);
}
... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 173 | 3 |
#include <stdio.h>
int main() {
int n, S[10000], q, T[10000], i, j, cnt = 0;
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])
cnt++;
prin... | #include <stdio.h>
int main() {
int n, S[10000], q, T[10000], i, j, cnt = 0;
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]) {
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]] | 0 | 157 | 4 |
#include <stdio.h>
int main() {
int i, j = 0;
int s, t;
int count = 0;
int key;
scanf("%d", &s);
int S[s];
for (i = 0; i < s; i++)
scanf("%d", &S[i]);
scanf("%d", &t);
int T[t];
for (i = 0; i < t; i++)
scanf("%d", &T[i]);
for (i = 0; i < t; i++) {
key = T[i];
j = 0;
S[s] =... | #include <stdio.h>
int main() {
int i, j = 0;
int s, t;
int count = 0;
int key;
scanf("%d", &s);
int S[s];
for (i = 0; i < s; i++)
scanf("%d", &S[i]);
scanf("%d", &t);
int T[t];
for (i = 0; i < t; i++)
scanf("%d", &T[i]);
for (i = 0; i < t; i++) {
key = T[i];
j = 0;
S[s] =... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22]] | 0 | 183 | 2 |
#include <stdio.h>
#define N 10000
#define Q 500
int main() {
int n, q, i, j, count = 0, S[N], T[Q];
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++) {
... | #include <stdio.h>
#define N 10000
#define Q 500
int main() {
int n, q, i, j, count = 0, S[N], T[Q];
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++) {
... | [["+", 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 | 171 | 4 |
#include <stdio.h>
int main() {
int n, m, sum = 0, key, T[1001];
int i, j, f = 1;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &T[i]);
}
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &key);
// LinearSearch
j = 0;
while (T[j] != key) {
if (j == n) {
j... | #include <stdio.h>
int main() {
int n, m, sum = 0, key, T[10001];
int i, j, f = 1;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &T[i]);
}
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &key);
// LinearSearch
j = 0;
while (T[j] != key) {
if (j == n) {
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22]] | 0 | 163 | 4 |
#include <stdio.h>
#define x 10000
int main() {
int i, j, n, t, c, Sawa[x], Hira[x];
c = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &Sawa[i]);
}
scanf("%d", &t);
for (i = 0; i < t; i++) {
scanf("%d", &Hira[i]);
}
for (i = 0; i < t; i++) {
for (j = 0; j < n; j++) {
i... | #include <stdio.h>
#define x 10000
int main() {
int i, j, n, t, c, Sawa[x], Hira[x];
c = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &Sawa[i]);
}
scanf("%d", &t);
for (i = 0; i < t; i++) {
scanf("%d", &Hira[i]);
}
for (i = 0; i < t; i++) {
for (j = 0; j < n; j++) {
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]] | 0 | 170 | 4 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int n, q, i, j, count = 0;
int *S, *T;
scanf("%d", &n);
S = malloc(sizeof(int) * n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
scanf("%d", &q);
T = malloc(sizeof(int) * q);
for (i = 0; i < q; i++)
scanf("%d", &T[i]);
for (i = 0; i < ... | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, q, i, j, count = 0;
int *S, *T;
scanf("%d", &n);
S = malloc(sizeof(int) * n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
scanf("%d", &q);
T = malloc(sizeof(int) * q);
for (i = 0; i < q; i++)
scanf("%d", &T[i]);
for (i = 0; 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], ["-", 8, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["+", 8, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["-", 8, 57, 15, 23, 0, 16, 12, 69, 71, 22], ["+", 8, 57, 15, 2... | 0 | 196 | 8 |
#include <stdio.h>
#define N 10000
#define Q 500
int main() {
int s, t, S[N], T[Q], i, j, count = 0;
scanf("%d", &s);
for (i = 0; i < s; i++)
scanf("%d", &S[i]);
scanf("%d", &t);
for (i = 0; i < t; i++)
scanf("%d", &T[i]);
for (i = 0; i < s; i++) {
for (j = 0; j < t; j++) {
if (S[j] ... |
#include <stdio.h>
#define N 10000
#define Q 500
int main() {
int s, t, S[N], T[Q], i, j, count = 0;
scanf("%d", &s);
for (i = 0; i < s; i++)
scanf("%d", &S[i]);
scanf("%d", &t);
for (i = 0; i < t; i++)
scanf("%d", &T[i]);
for (i = 0; i < t; i++) {
for (j = 0; j < s; 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]] | 0 | 171 | 4 |
#include <stdio.h>
#define Max 10000
int main() {
int i, j, h, n, q, S[Max], T[Max];
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]);
h = 0;
for (i = 0; i < q; i++) {
S[n] = T[i];
for (j = 0; j <= n; j++) {
i... | #include <stdio.h>
#define Max 10000
int main() {
int i, j, h, n, q, S[Max], T[Max];
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]);
h = 0;
for (i = 0; i < q; i++) {
S[n] = T[i];
for (j = 0; j <= n; j++) {
i... | [["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 45], ["+", 75, 76, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 75, 76, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 46]] | 0 | 185 | 4 |
#include <stdio.h>
#define N 10000
#define Q 500
int main() {
int S[N], T[Q], C = 0;
int n, q, i, j, key;
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++) {
j = 0;
S[n] = T[i];
while (S[... | #include <stdio.h>
#define N 10000
#define Q 500
int main() {
int S[N], T[Q], C = 0;
int n, q, i, j, key;
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++) {
j = 0;
S[n] = T[i];
while (S[... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22]] | 0 | 180 | 2 |
#include <stdio.h>
int main() {
int n, q, key, i, j, count = 0;
int S[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", &key);
for (j = 0; j < n; j++)
if (S[j] == key)
count++;
}
printf("%d\n", count)... | #include <stdio.h>
int main() {
int n, q, key, i, j, count = 0;
int S[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", &key);
for (j = 0; j < n; j++)
if (S[j] == key) {
count++;
break;
}
}... | [["+", 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]] | 0 | 138 | 4 |
#include <stdio.h>
int S[10000];
int N;
int linearSearch(int);
int main() {
int q, T[500], i, c = 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]);
c += linearSearch(T[i]);
}
printf("%d\n", c);
return 0;
}
int... | #include <stdio.h>
int S[10000];
int N;
int linearSearch(int);
int main() {
int q, T[500], i, c = 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]);
c += linearSearch(T[i]);
}
printf("%d\n", c);
return 0;
}
int... | [["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 8, 9, 0, 52, 8, 9, 0, 37, 0, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 0 | 180 | 4 |
#include <stdio.h>
#define N 10000
#define Q 500
int main() {
int i, j, n, q, count = 0;
int S[N], T[Q];
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 (j = 0; j < n; j++) {
if (T[i] == S[j]) {
... | #include <stdio.h>
#define N 10000
#define Q 500
int main() {
int i, j, n, q, count = 0;
int S[N], T[Q];
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 (j = 0; j < n; j++) {
if (T[i] == S[j]) {
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 161 | 2 |
#include <stdio.h>
#define N 10000
#define Q 500
int main() {
int i, j, n, q;
int S[N], T[Q], count = 0;
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++) {
if (S[i] == T[i]) {
coun... | #include <stdio.h>
#define N 10000
#define Q 500
int main() {
int i, j, n, q;
int S[N], T[Q], count = 0;
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++) {
if (S[i] == T[j]) {
... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 71, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 71, 22]] | 0 | 159 | 4 |
#include <stdio.h>
int main(void) {
int n, S[100000], q, T[100000], i, j, C = 0;
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 (S[i] == T[j])... | #include <stdio.h>
int main(void) {
int n, S[10000], q, T[500], i, j, C = 0;
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]) {
... | [["-", 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], ["-", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 23, 0... | 0 | 170 | 12 |
#include <stdio.h>
int main(void) {
int n, q, i, j, c = 0;
int s[10000], t[500];
scanf("%d", &n); // n?????\???
// s?????\???
for (i = 0; i < n; i = i + 1) {
scanf("%d", &s[i]);
}
scanf("%d", &q); // q?????\???
// t?????\???
for (i = 0; i < q; i = i + 1) {
scanf("%d", &t[i]);
}
//??¢?´... | #include <stdio.h>
int main(void) {
int n, q, i, j, c = 0;
int s[10000], t[500];
scanf("%d", &n); // n?????\???
// s?????\???
for (i = 0; i < n; i = i + 1) {
scanf("%d", &s[i]);
}
scanf("%d", &q); // q?????\???
// t?????\???
for (i = 0; i < q; i = i + 1) {
scanf("%d", &t[i]);
}
//??¢?´... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 0 | 193 | 2 |
#include <stdio.h>
int main(void) {
int i, j, a, c, d, cnt, sum = 0, b[10001];
scanf("%d", &a);
for (i = 0; i < a; i++)
scanf("%d", &b[i]);
scanf("%d", &c);
for (i = 0; i < c; i++) {
cnt = 0;
scanf("%d", &d);
b[a] = d;
for (j = 0; j <= a; j++) {
if (b[j] == d)
cnt++;
}
... | #include <stdio.h>
int main(void) {
int i, j, a, c, d, cnt, sum = 0, b[10001];
scanf("%d", &a);
for (i = 0; i < a; i++)
scanf("%d", &b[i]);
scanf("%d", &c);
for (i = 0; i < c; i++) {
cnt = 0;
scanf("%d", &d);
b[a] = d;
for (j = 0; j <= a; j++) {
if (b[j] == d)
cnt++;
}
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20]] | 0 | 162 | 2 |
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int i, j, n, s, q, t, cnt = 0;
int *s_array;
scanf("%d", &n);
s_array = malloc(sizeof(int) * n);
for (i = 0; i < n; i++) {
scanf("%d", &s);
s_array[i] = s;
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &t);
for (j = 0; ... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int i, j, n, s, q, t, cnt = 0;
int *s_array;
scanf("%d", &n);
s_array = malloc(sizeof(int) * n);
for (i = 0; i < n; i++) {
scanf("%d", &s);
s_array[i] = s;
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &t);
for (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]] | 0 | 161 | 4 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <stdio.h>
void LinearSearch(unsigned int p[], unsigned int key, unsigned int *,
unsigned int);
int main() {
unsigned int n, S[10000] = {0}, T[500] = {0}, q, i, cnt = 0;
unsigned int *p, *key;
p = S;
key = T;
scanf("%d", &n);
... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <stdio.h>
void LinearSearch(unsigned int p[], unsigned int key, unsigned int *,
unsigned int);
int main() {
unsigned int n, S[10000] = {0}, T[500] = {0}, q, i, cnt = 0;
unsigned int *p, *key;
p = S;
key = T;
scanf("%d", &n);
... | [["+", 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]] | 0 | 249 | 4 |
#include <stdio.h>
int main() {
int i, j, n, q, output;
int S[10000], T[500];
output = 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++) {
if (S... | #include <stdio.h>
int main() {
int i, j, n, q, output;
int S[10000], T[500];
output = 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++) {
if (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, 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 | 176 | 10 |
#include <stdio.h>
int main() {
int c, i, j, k, n, q;
c = 0;
scanf("%d", &n);
int a[10000];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
int b[10000];
for (i = 0; i < q; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < n; i++) {
for (j = 0; j < q; j++) {
if (a[i]... | #include <stdio.h>
int main() {
int c, i, j, k, n, q;
c = 0;
scanf("%d", &n);
int a[10000];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
int b[10000];
for (i = 0; i < q; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < q; i++) {
for (j = 0; j < n; 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], ["-", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 2... | 0 | 175 | 8 |
#include <stdio.h>
int main() {
int n, q, S[10000], T[500];
int i, j, 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++) {
if (T[i] == S[j])
coun... | #include <stdio.h>
int main() {
int n, q, S[10000], T[500];
int i, j, 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++) {
if (T[i] == S[j]) {
co... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 164 | 2 |
#include <stdio.h>
int Search(int key, int S[], int n) {
int i;
for (i = 0; i < n; i++) {
if (S[i] == key)
return 1;
}
return 0;
}
int main() {
int n, S[10000], q, key, count = 0;
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0;... | #include <stdio.h>
int Search(int key, int S[], int n) {
int i;
for (i = 0; i < n; i++) {
if (S[i] == key)
return 1;
}
return 0;
}
int main() {
int n, S[10000], q, key, count = 0;
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0;... | [["-", 15, 23, 0, 2, 3, 4, 0, 69, 0, 70], ["-", 15, 23, 0, 2, 3, 4, 0, 69, 71, 22], ["-", 15, 23, 0, 2, 3, 4, 0, 69, 0, 73]] | 0 | 179 | 3 |
#include <stdio.h>
int main() {
int s[10000], t[500];
int n, q, i, j, k = 0;
scanf("%d\n", &n);
for (i = 0; i < n; i++) {
scanf("%d\n", &s[i]);
}
scanf("%d\n", &q);
for (j = 0; j < q; j++) {
scanf("%d\n", &t[j]);
}
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
if (s[j] == t... | #include <stdio.h>
int main() {
int s[10000], t[500];
int n, q, i, j, k = 0;
scanf("%d\n", &n);
for (i = 0; i < n; i++) {
scanf("%d\n", &s[i]);
}
scanf("%d\n", &q);
for (j = 0; j < q; j++) {
scanf("%d\n", &t[j]);
}
for (i = 0; i < q; i++) {
for (j = 0; j < n; j++) {
if (s[j] == t... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 0 | 172 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.