Submission #1691990

---

Source Code Expand

#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>
#include<list>

#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000

using namespace std;


int main(void) {
	int n;
	int p;
	int a[100001];
	int count = 1;

	cin >> n;
	FOR(i, 1, n) {
		cin >> a[i];
		while (a[i] % 2==0) {
			a[i] /= 2;
		}
	}
	sort(a, a + n + 1);
	p = a[1];
	FOR(i, 2, n) {
		if (p != a[i]) {
			p = a[i];
			count++;
		}
	}
	cout << count << endl;
	return 0;
}

Submission Info

Judge Result