Pagini recente » Borderou de evaluare (job #587434) | Borderou de evaluare (job #3029831) | Cod sursa (job #108439) | Diferente pentru utilizator/stargold2 intre reviziile 275 si 180 | Cod sursa (job #1195037)
#include <cstdio>
#include <unordered_set>
using namespace std;
unordered_set<long long int>h;
int main()
{
freopen("dtcsu.in","r",stdin);
freopen("dtcsu.out","w",stdout);
long long int x,cnt=0,n;
for(register int i=1;i<=276997;i++){
scanf("%lld",&x);
if(x&1)h.insert(x);
}
scanf("%d",&n);
for(register int i=1;i<=n;i++){
if(x&1)x/=x&(-x);
if(h.find(x)!=h.end())cnt++;
}
printf("%lld",cnt);
return 0;
}