Cod sursa(job #1528069)
Utilizator | Alexandru-Gabriel Ghergut alexandru.ghergut | Data | 18 noiembrie 2015 23:39:36 |
---|---|---|---|
Problema | Dtcsu | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <unordered_set>
#include <fstream>
using namespace std;
int main()
{
long long N;
int i;
const int entries = 276997;
unordered_set<long long> h;
ifstream f("dtcsu.in");
for (i = 0; i < entries; i++)
{
f >> N;
if (N & 1)
h.insert(N);
}
int Q, k = 0;
f >> Q;
for (i = 0; i < Q; i++)
{
f >> N;
while ((N & 1) == 0)
N >>= 1;
if (h.find(N) != h.end())
k++;
}
f.close();
ofstream g("dtcsu.out");
g << k;
g.close();
return 0;
}