Submission #347550

---

Source Code Expand

#include <iostream>
#include <string>
#include <array>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
 
#define FOR(i, a, b) for(decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
 
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
 
using namespace std;
 
int main()
{
	int n;
	cin >> n;
 
	set<int> s;
 
	REP (i, n)
	{
		int a;
		cin >> a;
		for (int j = 16; j; j /= 2)
			if ((a & ((1 << j) - 1)) == 0)
				a >>= j;
		s.insert(a);
	}
 
	cout << s.size() << endl;
 
	return 0;
}

Submission Info

Judge Result