Pagini recente » Borderou de evaluare (job #2017395) | Borderou de evaluare (job #1314096) | Cod sursa (job #56811) | Cod sursa (job #2809379) | Cod sursa (job #1268062)
#include <fstream>
#include <unordered_map>
using namespace std;
#define NMax 276997
ifstream f("dtcsu.in");
ofstream g("dtcsu.out");
unordered_map<int, long long> M;
long long q,nr,x;
int main()
{
int i;
for(i=1;i<=NMax;++i)
{
f>>x;
if(x&1) M[x] = i;
}
f>>q;
while(q--)
{
f>>x;
if (x & (-x)) x /= x & (-x);
if(x && M.find(x)!=M.end()) ++nr;
}
g<<nr<<"\n";
f.close();
g.close();
return 0;
}