Pagini recente » Clasament dupa rating | Istoria paginii propuneri/1-hackaton | Istoria paginii utilizator/madalincnng | Cod sursa (job #1355464) | Cod sursa (job #1032479)
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,i,j,p,q,m,x;
long long nr,k;
int w[276998];
char s[20];
int main()
{
freopen("dtcsu.in","r",stdin);
freopen("dtcsu.out","w",stdout);
x=276997;
for (i=1;i<=x;i++)
{
gets(s+1); nr=0; m=strlen(s+1);
for (j=1;j<=m;j++) nr=nr*10+(s[j]-48);
w[++n]=nr;
}
scanf("%lld",&q); m=0;
for (i=1;i<=q;i++)
{
scanf("%d",&k);
if (binary_search(w+1,w+n+1,k)==1) m++;
}
printf("%lld",m);
return 0;
}