Cod sursa(job #2150239)
Utilizator | Rodica Vasilescu Rodik_Rody | Data | 3 martie 2018 12:59:58 |
---|---|---|---|
Problema | Dtcsu | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
#include <unordered_set>
using namespace std;
ifstream in("dtcsu.in");
ofstream out("dtcsu.out");
unordered_set <long long> mySet;
long long nr;
int main()
{
for(int i = 1; i <= 276997; i++)
{
long long x;
in>>x;
if(x&1ll)
mySet.insert(x);
}
long long m;
in>>m;
while(m--){
long long n;
in>>n;
if(n&&mySet.find(n/(n&(-n))) != mySet.end())
nr++;
}
out<<nr;
return 0;
}