Pagini recente » Cod sursa (job #596048) | Cod sursa (job #1792483) | Cod sursa (job #297812) | Cod sursa (job #2935714) | Cod sursa (job #1654344)
#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <cmath>
#include <fstream>
#include <cstdlib>
#include <map>
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
#define bit(x) (-x)&x
#define int64 long long
using namespace std;
ifstream in("dtcsu.in");
ofstream out("dtcsu.out");
#define mod 6013
vector< vector<int64> > h(mod);
void ins(int64 x)
{
int c=x%mod;
for(int i=0;i<(int)h[c].size();i++)
if(h[c][i]==x)
return;
h[c].pb(x);
}
int cnt(int64 x)
{
int c=x%mod;
for(int i=0;i<(int)h[c].size();i++)
if(h[c][i]==x)
return 1;
return 0;
}
int main()
{
for(int i=1;i<=276997;i++)
{
int64 x;
in>>x;
if(x%2!=0)
ins(x);
}
int t,sol=0;
for(in>>t;t;t--)
{
int64 x;
in>>x;
while(x%2==0)x/=2;
sol+=cnt(x);
}
out<<sol<<'\n';
return 0;
}