Pagini recente » Cod sursa (job #2112475) | Cod sursa (job #1437519) | Cod sursa (job #277633) | Cod sursa (job #2623725) | Cod sursa (job #1502808)
#include <fstream>
#include <cstring>
#include <map>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
char sir[25];
int Q, lg, sol;
long long N;
map<long long, bool> H;
int main()
{
long long x;
for (int i = 1; i <= 276997; ++i)
{
fin.getline(sir + 1, 25);
lg = strlen(sir + 1);
x = 0LL;
for (int j = 1; j <= lg; ++j)
x = x * 10 + (long long)(sir[j] - '0');
if (x & 1)
H.insert(make_pair(x, true));
}
fin.getline(sir + 1, 25);
lg = strlen(sir + 1);
for (int i = 1; i <= lg; ++i)
Q = Q * 10 + (int)(sir[i] - '0');
while (Q--)
{
fin.getline(sir + 1, 25);
lg = strlen(sir + 1);
N = 0LL;
for (int i = 1; i <= lg; ++i)
N = N * 10 + (long long)(sir[i] - '0');
if (N & -N)
N /= (N & -N);
if (H.find(N) != H.end())
++sol;
}
fout << sol << '\n';
fin.close();
fout.close();
return 0;
}