Submission #7891286

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;
typedef pair<int,int> P;

#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define all(x) x.begin(),x.end()

const ll mod = 1e9+7;
const ll INF = 1e9;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

int main()
{
	int n;
	cin>>n;
	set<int> s;
	rep(i,n){
		int x;
		cin>>x;
		s.insert(x);
	}
	for(auto x:s){
		int res=x;
		while(res%2==0){
			res/=2;
			s.erase(res);
		}
	}
	cout<<s.size()<<endl;

	return 0;
}

Submission Info

Judge Result