Submission #346147

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;

int flag[100005] = {};
int a[100005];
int n;

int main(void){
	cin >> n;
	for(int i = 0;i < n;++i)cin >> a[i];
	sort(a,a+n);
	int left,right,start;
	for(int i = 0;i < n;++i){
		if(flag[i] != 0)continue;
		else{
			int search = a[i]*2;
			start = i+1;
			left = start;right = n-1;
			while(search <= a[n-1]){
				while(1){
					if(left <= right){
						int middle = (left + right)/2;
						if(a[middle] == search){
							flag[middle] = 1;
							search *= 2;
							start = middle + 1;
							left = start;right = n-1;
							break;
						}
						else if(search < a[middle])right = middle - 1;
						else if(search > a[middle])left = middle + 1;
					}
					else{
						search *= 2;
						left = start;right = n-1;
						break;
					}
				}
			}
		}
	}
	int result = 0;
	for(int i = 0;i < n;++i)
	if(flag[i] == 0)++result;
	cout << result << endl;
	return 0;
}

Submission Info

Judge Result