Pagini recente » Cod sursa (job #1533303) | Cod sursa (job #2931798) | Cod sursa (job #2644248) | Cod sursa (job #2934169) | Cod sursa (job #1032254)
#include<stdio.h>
#include<set>
#define MOD1 10007
#define MOD2 666013
using namespace std;
int div[]={2,3,5,7,11};
set<int> check[MOD1];
int r=0,q,n;
int main()
{
freopen("dtcsu.in","r",stdin);
freopen("dtcsu.out","w",stdout);
for(int i=0;i<27699;++i){scanf("%d\n",&q);check[q%MOD1].insert(q%MOD2);}
scanf("%d",&q);
set<int>::iterator it;
for(int i=0;i<q;++i)
{
scanf("%d",&n);
// for(int j=0;j<5;++j)
// while(n%div[j]==0)n/=div[j];
it=check[n%MOD1].find(n%MOD2);
if(it!=check[n%MOD1].end())r++;
}
printf("%d\n",r);
return 0;
}