Cod sursa(job #1048809)
Utilizator | Data | 6 decembrie 2013 14:22:33 | |
---|---|---|---|
Problema | Dtcsu | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#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 << ' ';
}