Pagini recente » Cod sursa (job #922699) | Cod sursa (job #267609) | Cod sursa (job #2117898) | Cod sursa (job #2642294) | Cod sursa (job #2437442)
#include<cstdio>
#include<vector>
#include<algorithm>
#define DIM 10005
#define MOD 10003
using namespace std;
int Q,sol;
long long x;
vector<long long> H[10003];
int poz=DIM-1;
char buffer[10005];
FILE *cin=fopen("dtcsu.in","r");
FILE *cout=fopen("dtcsu.out","w");
long long read_number(){
long long number=0;
while(buffer[poz]<'0' || buffer[poz]>'9'){
++poz;
if(poz==DIM){
fread(buffer,1,DIM,cin);
poz=0;
}
}
while(buffer[poz]>='0' && buffer[poz]<='9'){
number=number*10+(buffer[poz]-'0');
++poz;
if(poz==DIM){
fread(buffer,1,DIM,cin);
poz=0;
}
}
return number;
}
int main (){
for(int i=1;i<=276997;i++){
x=read_number();
H[x%MOD].push_back(x);
}
Q=read_number();
while(Q--){
x=read_number();
if(find(H[x%MOD].begin(),H[x%MOD].end(),x)!=H[x%MOD].end())
++sol;
}
fprintf(cout,"%d",sol);
}