Submission #345490

---

Source Code Expand

#include<iostream>
#include<set>
#include<algorithm>
using namespace std;
const int VAL = 100005;


int nVal;
int val[VAL];

void read() {
    cin >> nVal;
    for (int i = 0; i < nVal; ++i)
        cin >> val[i];
}


void work() {
    set<int> isOk;
    int maxV = 0;

    for (int i = 0; i < nVal; ++i) {
        isOk.insert(val[i]);
        maxV = max(maxV, val[i]);
    }

    int ans = 0;
    
    for (set<int>::iterator it = isOk.begin(); it != isOk.end(); ++it) {
        int curV = *it;
        while (2LL * curV <= maxV) {
            curV *= 2;
            isOk.erase(curV);
        }
        ++ans;
    }

    cout << ans << endl;
}


int main() {
    read();
    work();
    return 0;
}

Submission Info

Judge Result