Pagini recente » Cod sursa (job #2315938) | Cod sursa (job #236107) | Cod sursa (job #572527) | Cod sursa (job #1741014) | Cod sursa (job #1030654)
#include <cstdio>
#include <cstring>
#include <unordered_set>
using namespace std;
unordered_set<long long> hashtable;
char nr[19];
int main() {
freopen("dtcsu.in", "r", stdin);
for (int i = 0; i < 276997; ++i) {
fgets(nr, 19, stdin);
long long n = 0;
int size = strlen(nr);
for (int j = 0; i < size; ++i) {
n = n*10 + nr[i];
}
hashtable.insert(n);
}
int Q, rez = 0;
scanf("%d", &Q);
fgets(nr, 1, stdin);
for (int i = 0; i < Q; ++i) {
fgets(nr, 19, stdin);
long long n = 0;
int size = strlen(nr);
for (int j = 0; j < size; ++j) {
n = n*10 + nr[i];
}
rez += (hashtable.find(n) != hashtable.end());
}
freopen("dtcsu.out", "w", stdout);
printf("%d", rez);
return 0;
}