Pagini recente » Cod sursa (job #2922101) | Cod sursa (job #2144117) | Cod sursa (job #2340569) | Cod sursa (job #3165792) | Cod sursa (job #1784066)
#include <fstream>
#include <vector>
using namespace std;
#define P 8191
vector<long long> L[P+1];
int main()
{
long long x;
int i, M, cnt = 0, ok, r;
unsigned int j;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
for (i=1; i <= 276997; i++)
{
fin >> x;
if (x % 2 == 1)
L[x%P].push_back(x);
}
fin >> M;
for (i=1; i <= M; i++)
{
fin >> x;
if (x > 0) x = x / (x & (-x));
ok =0;
r = x % P;
for (j=0; j<L[r].size() && ok==0; j++)
if (L[r][j] == x) ok = 1;
cnt += ok;
}
fout << cnt << "\n";
fout.close();
return 0;
}