Submission #345559

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;


int main(){
  int N, a;
  vector<int> v;
  cin >> N;
  rep(i,N){
    cin >> a;
    v.push_back(a);
  }
  sort(ALLOF(v));

  int ret = 0;
  map<int,int> memo;
  rep(i,v.size()){
    int a = v[i];
    bool flg = false;
    while(true){
      if(memo.count(a)>0){
        flg = true;
        break;
      }
      
      if(a%2==1 || a==0) break;
      a/=2;
    }
    if(!flg){
      memo[v[i]] = 1;
      ret++;
    }
  }
  cout << ret << endl;
  
  return 0;
}

Submission Info

Judge Result