Pagini recente » Cod sursa (job #2721073) | Cod sursa (job #57591) | Cod sursa (job #2130839) | Cod sursa (job #2700534) | Cod sursa (job #1191424)
#include <cstdio>
#include <cstring>
#include <set>
using namespace std;
#define NMAX 276997
long long N;
int Q,nr;
set <long long> S;
char cmd[22];
int main()
{
freopen("dtcsu.in","r",stdin);
freopen("dtcsu.out","w",stdout);
for (register int i=1;i<=NMAX;i++)
{
gets(cmd); N=0;
char *p=cmd;
while (*p>='0' && *p<='9') N=N*10+*p-48,++p;
S.insert(N);
}
scanf("%d",&Q);
for (register int i=1;i<=Q;i++)
{
gets(cmd); N=0;
char *p=cmd;
while (*p>='0' && *p<='9') N=N*10+*p-48,++p;
if (N!=0)
{
N/=(N&-N);
if (S.find(N)!=S.end()) ++nr;
}
}
printf("%d",nr);
return 0;
}