Pagini recente » Cod sursa (job #1720683) | Cod sursa (job #2388245) | Cod sursa (job #1751174) | Cod sursa (job #2225782) | Cod sursa (job #1038663)
#include <iostream>
#include <fstream>
#include <string.h>
#include <unordered_map>
using namespace std;
int n=276997, x, k;
char s[100000000000];
ifstream f("dtcsu.in");
ofstream g("dtcsu.out");
unordered_map<long long, int> m;
void citire(){
//f>>n; f.get();
while(n--){
f.getline(s, 100000000000); x=0;
long long len=strlen(s);
//if(!s[len-1]&1) return;
for(int i=0; i<len; ++i)
x=10*x+(s[i]-'0');
if(x&1) m[x]=1;// cout<<x<<'\n';
}
}
int main()
{
//n=2;
citire();
f>>n;f.get();
while(n--){
f.getline(s, 100000000000); x=0;
long long len=strlen(s);
for(int i=0; i<len; ++i)
x=10*x+(s[i]-'0');
while(!x&1){
x/=2;
}
if(m.find(x)!=m.end()) ++k;
}
g<<k;
//cout<<k;
return 0;
}