Submission #345768

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#define rep(x, to) for (int x = 0; x < to; x++)
#define REP(x, a, to) for (int x = (a); x < to; x++)
#define foreach(itr, x) for (typeof((x).begin()) itr = (x).begin(); itr != (x).end(); itr++)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;

int N;
set<int> S;

int check(int x) {
	while (x % 2 == 0) {
		x /= 2;
	}
	return x;
}

int main() {
	cin >> N;
	rep(i, N) {
		int a;
		cin >> a;
		S.insert(check(a));
	}
	cout << S.size() << endl;
	return 0;
}

Submission Info

Judge Result