Pagini recente » Cod sursa (job #3239376) | Cod sursa (job #2080677) | Cod sursa (job #2788196) | Cod sursa (job #412514) | Cod sursa (job #2304857)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
int x, n;
unordered_set<int>H;
int main()
{
for(int i=1; i<=276997; ++i)
{
fin>>x;
if(x%2==1) H.insert(x);
}
/*for(int i=1; i<=10; ++i)
{
fin>>x;
H.insert(x);
}*/
//for(unordered_set<int>::iterator it=H.begin(); it!=H.end(); ++it) fout<<*it<<" ";
//fout<<"\n";
int sol=0;
fin>>n;
//int val=n&(-n);
//fout<<val;
//fout<<n<<"\n";
for(int i=1; i<=n; ++i)
{
fin>>x;
//fout<<x<<"\n";
int val=x/(x&(-x));
if(H.find(val)!=H.end()) ++sol;
}
fout<<sol<<"\n";
return 0;
}