Pagini recente » Cod sursa (job #2221404) | Cod sursa (job #512658) | Cod sursa (job #3268384) | Cod sursa (job #635441) | Cod sursa (job #2304654)
#include <bits/stdc++.h>
using namespace std;
const int MOD=666013;
vector<long long> v[666015];
long long nr,x,q;
void insert(long long n)
{
int h=n%MOD;
v[h].push_back(n);
}
void find(long long n)
{
int h=n%MOD;
for(auto it:v[h])
if(it==n)
{
nr++;
return;
}
}
int main()
{
freopen("dtcsu.in","r",stdin);
freopen("dtcsu.out","w",stdout);
for(int i=1;i<=276997;i++)
{
scanf("%lld",&x);
insert(x);
}
cin>>q;
for(int i=1;i<=q;i++)
{
cin>>x;
find(x);
}
printf("%lld",nr);
}