Pagini recente » Cod sursa (job #1846153) | Cod sursa (job #2322951) | Monitorul de evaluare | Cod sursa (job #2721918) | Cod sursa (job #1788798)
#include <fstream>
#include <vector>
using namespace std;
ifstream in ("dtcsu.in");
ofstream out ("dtcsu.out");
vector <int> H[9015];
int main()
{
for (int x, i = 1; i <= 276997; i++)
{
in >> x;
if (x & 1) H[x % 9013].push_back(x);
}
int n, nr = 0; in >> n;
for (int x, k = 1; k <= n; k++)
{
in >> x;
while (x % 2 == 0) x /= 2;
for (vector <int> :: iterator i = H[x % 9013].begin(), j = H[x % 9013].end(); i != j; )
if (*i == x) { nr++; break; }
}
out << nr << '\n'; out.close(); return 0;
}