Pagini recente » Cod sursa (job #674071) | Cod sursa (job #1550264) | Cod sursa (job #930368) | Cod sursa (job #37337) | Cod sursa (job #1048809)
#include <fstream>
#include <tr1/unordered_set>
int main() {
std :: ifstream cin("dtcsu.in");
std :: ofstream cout("dtcsu.out");
int N, Ans = 0;
long long X;
std :: tr1 :: unordered_set <long long> S;
for(N = 276997 ; N -- ; ) {
cin >> X;
if(X & 1) S.insert(X);
}
for(cin >> N ; N -- ; ) {
cin >> X;
if(X == 0) continue;
if(! X&1 ) X /= X & (-X);
if(S.count(X)) ++ Ans;
}
cout << Ans << ' ';
}