Cod sursa(job #2389063)
Utilizator | Mara Agha maradarin2000 | Data | 26 martie 2019 19:36:16 |
---|---|---|---|
Problema | Dtcsu | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
long long x, n;
unordered_set <long long> H;
int main()
{
for(int i=1; i<=276997; ++i)
{
fin>>x;
if(x&1) H.insert(x);
}
int sol=0;
fin>>n;
for(int i=1; i<=n; ++i)
{
fin>>x;
if(x!=0)
{
long long val=x/(x&(-x));
if(x!=0 && H.find(val)!=H.end()) ++sol;
}
}
fout<<sol<<"\n";
return 0;
}