Pagini recente » Cod sursa (job #1912091) | Cod sursa (job #794797) | Cod sursa (job #1869325) | Cod sursa (job #237911) | Cod sursa (job #2315369)
#include <fstream>
#include <set>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
int Q, sol;
set <long long> S;
int main()
{
long long x;
for(int i = 1; i <= 276997; i++)
{
fin >> x;
if(x & 1)
S.insert(x);
}
fin >> Q;
for(int i = 1; i <= Q; i++)
{
fin >> x;
int lastBit = x & (-x);
if(S.find(x / lastBit) != S.end())
sol++;
}
fout << sol;
return 0;
}