Pagini recente » Istoria paginii runda/iufat | Cod sursa (job #2450583) | Cod sursa (job #1862744) | Cod sursa (job #1765318) | Cod sursa (job #1068990)
#include <fstream>
#include <unordered_set>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
unordered_set <long long> h;
int main()
{
int t=276997;
long long sol=0, n;
while(t--)
{
fin>>n;
if(n&1LL) h.insert(n);
}
fin>>t;
while(t--)
{
fin>>n;
if(n&&h.find(n/(n&(-n)))!=h.end()) sol++;
}
fout<<sol;
fin.close();
fout.close();
}