Pagini recente » Cod sursa (job #3174217) | Cod sursa (job #1235973) | Cod sursa (job #2430197) | Cod sursa (job #1634948) | Cod sursa (job #2921469)
#include <iostream>
#include <stdio.h>
#include <unordered_set>
#include <string>
#include <vector>
using namespace std;
#define MAX_N 100
char s[MAX_N];
unordered_set <int> 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);
int 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);
int 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;
}