Cod sursa(job #1497875)
Utilizator | Data | 7 octombrie 2015 18:33:52 | |
---|---|---|---|
Problema | Dtcsu | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
#include <unordered_set>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
unordered_set<int64_t> s;
int Q, ans;
int main() {
for (int i = 0; i < 276997; ++i) {
int64_t x;
fin >> x;
if (x & 1) s.insert(x);
}
fin >> Q;
while (Q--) {
int64_t x;
fin >> x;
ans += s.count(x / (x & -x));
}
fout << ans << "\n";
return 0;
}