Submission #4018861

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<stack>
#include<queue>
#include<bitset>

#define ipair pair<int,int>
#define rep(i,n) for(i=0;i<n;i++)

using namespace std;

typedef long long int lli;
typedef vector<int> vi;

int main() {
	lli i, j, k, n;
	vector<lli>a;

	cin >> n;
	a.resize(n);
	rep(i, n) {
		cin >> a[i];
	}
	sort(a.begin(), a.end());

	k = n;
	rep(i, n) {
		j = a[i] * 2;
		while (j <= a[n - 1]) {
			if (binary_search(a.begin(), a.end(), j)) {
				k--;
				break;
			}
			j *= 2;
		}
	}
	cout << k << endl;

	return 0;
}

Submission Info

Judge Result