Pagini recente » Cod sursa (job #141894) | Cod sursa (job #465742) | Cod sursa (job #2570754) | Cod sursa (job #2830562) | Cod sursa (job #2921470)
#include <iostream>
#include <stdio.h>
#include <unordered_set>
using namespace std;
#define MAX_N 20
char s[MAX_N];
unordered_set <long long> v;
int main(){
FILE *fin,*fout;
fin=fopen("dtcsu.in","r");
fout=fopen("dtcsu.out","w");
for(int i=0;i<276997;i++){
fgets(s, MAX_N, fin);
long long a=0,f=0;
while(s[f]!='\n'){
a=a*10+s[f]-'0';
f++;
}
v.insert(a);
}
int n=0,m;
fscanf(fin,"%d",&m);
fgetc(fin);
for(int i=0;i<m;i++){
fgets(s, MAX_N, fin);
long long a=0,f=0;
while(s[f]!='\n'){
a=a*10+s[f]-'0';
f++;
}
if(v.find(a)!=v.end()){
n++;
}
}
fprintf(fout,"%d\n",n);
fclose(fout);
return 0;
}