Pagini recente » Cod sursa (job #627448) | Cod sursa (job #1448691) | Cod sursa (job #684223) | Cod sursa (job #3200036) | Cod sursa (job #2367596)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
set <ll>s;
ll x;
int n,total;
int main()
{
freopen("dtcsu.in","r",stdin);
freopen("dtcsu.out","w",stdout);
for (int i=1;i<=276997;i++){
scanf("%lld",&x);
s.insert(x/(x&-x));
}
scanf("%d",&n);
while (n){
n--;
scanf("%lld",&x);
if (x==0) continue;
if (s.find(x/(x&-x))!=s.end()){
total++;
}
}
printf("%d",total);
return 0;
}