Submission #1248568

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
bool a[500000010];
int main() {
	int n; cin >> n;
	long maxk = 0;
	for (int i = 0; i < n; i++){
		long k; cin >> k;
		while (k % 2 == 0)k /= 2;
		k = (k + 1) / 2;
		maxk = max(maxk, k);
		a[k] = true;
	}
	long sum = 0;
	for (int i = 1; i <= maxk; i += 2)
		if (a[i])sum++;
	cout << sum << endl;
}

Submission Info

Judge Result