Submission #382381

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
#include <stack>

using namespace std;

int main()
{

	long n;
	cin>>n;

	vector<unsigned long long> a(n);
	set<unsigned long long> s;
	unsigned long long _max=0;
	for(long i=0;i<n;i++){
		cin>>a[i];
		s.insert(a[i]);
		_max=max(_max,a[i]);
	}

	long res=0;
	for(long i=0;i<n;i++){
		long long x=a[i];
		bool ok=true;

		while(ok && x<=_max){
			if(s.find(2LL*x)!=s.end()) ok=false;
			x*=2LL;
		}

		if(ok) res++;
	}

	cout<<res<<endl;

	return 0;
}

Submission Info

Judge Result