Cod sursa(job #3327372)
| Utilizator | Data | 3 decembrie 2025 17:14:48 | |
|---|---|---|---|
| Problema | Dtcsu | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
unordered_map <long long, bool> M;
int q;
int main()
{
int i, cnt;
long long x;
for(i = 1; i <= 276997; i++)
{
fin >> x;
x /= (x & -x);
M[x] = 1;
}
cnt = 0;
fin >> q;
for(i = 1; i <= q; i++)
{
fin >> x;
if(x > 0)
{
x /= (x & -x);
if(M[x] == 1) cnt++;
}
}
fout << cnt << '\n';
return 0;
}
