Pagini recente » Cod sursa (job #251181) | Cod sursa (job #1309917) | Cod sursa (job #169461) | Cod sursa (job #2975128) | Cod sursa (job #1389430)
#include <iostream>
#include <cstdio>
#include <bitset>
using namespace std;
#define cntRead 276997
#define mod 4000000
long n,i,cnt;
long long x;
bitset<mod+11> B;
long h1(long long x){
x=(x*173)/9+1;
while(x<0) x+=mod;
return x%mod;
}
long h2(long long x){
x=(x*312344)/1231+33;
while(x<0) x+=mod;
return x%mod;
}
long h3(long long x){
x=(x*99313)^(x*231412);
while(x<0) x+=mod;
return x%mod;
}
int main()
{
freopen("dtcsu.in","r",stdin);
freopen("dtcsu.out","w",stdout);
for(i=1;i<=cntRead;i++){
scanf("%lld",&x);
B[h1(x)]=1;B[h2(x)]=1;B[h3(x)]=1;
}
scanf("%ld",&n);
for(i=1;i<=n;i++){
scanf("%lld",&x);
if(B[h1(x)]==1 && B[h2(x)]==1 && B[h3(x)]==1) cnt++;
}
printf("%ld",cnt);
return 0;
}