Pagini recente » Cod sursa (job #1637089) | Cod sursa (job #1512034) | Cod sursa (job #2319512) | Cod sursa (job #433872) | Cod sursa (job #1601228)
#include <fstream>
//#include<cstdio>
#include<vector>
//#include<algorithm>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
//FILE *fin=fopen("dtcsu.in","r");
//FILE *fout=fopen("dtcsu.out","w");
vector<long long int> v[9013];
vector<long long int> ::iterator it;
int mod=9013;
int n,i,sol;
long long x;
bool Find()
{
int xx=x%mod;
for(it=v[xx].begin();it!=v[xx].end();++it)
{
if((*it)==x)
return true;
}
return false;
}
int main()
{
for(i=1;i<=276997;++i)
{
fin>>x;
// getline(fin,s);
if(x&1) v[x%mod].push_back(x);
}
fin>>n;
for(i=1;i<=n;++i)
{
fin>>x;
while(!(x&1)) x>>=1;
sol+=Find();
}
fout<<sol;
return 0;
}