Pagini recente » Cod sursa (job #2042574) | Cod sursa (job #1601890) | Cod sursa (job #1537567) | Rating nume complet am zis (abcdefg12345) | Cod sursa (job #1034409)
#include <fstream>
#include <iostream>
#include <unordered_set>
using namespace std;
const int NMAX = 276997;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
const int DIM = 10000;
int poz = DIM - 1;
char buff[DIM];
int debug;
void citeste(long long &numar) {
numar = 0;
while (buff[poz] < '0' || buff[poz] > '9')
if (++poz == DIM)
fin.read(buff, DIM), poz = 0;
while ('0' <= buff[poz] && buff[poz] <= '9') {
numar = numar * 10 + buff[poz] - '0';
if (++poz == DIM)
fin.read(buff, DIM), poz = 0;
}
}
unordered_set<long long> mySet;
int ret;
int main() {
for (int i = 0; i < NMAX; ++i) {
long long x; citeste(x);
if (x & 1)
mySet.insert(x);
}
long long Q; citeste(Q);
for(int i = 1; i <= Q; ++i) {
long long x; citeste(x);
if(x) {
x /= x & (-x);
if(mySet.find(x) != mySet.end())
++ret;
}
}
fout << ret;
return 0;
}