Submission #4015146

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 1002
#define i197 1000000007

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<int,int> Pi;
typedef pair<double,Pi> Pdi;
typedef pair<ll,int>Pli;
typedef pair<P1,ll> P2;
const ll INF=1000000000000000001;
struct edge{int to,cost;};
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
struct Road{double cost;int a,b;};

ll a[100001];
ll x[1000001]={};
int main() {

	int n;
	int total=0;

	cin>>n;

	rep(i,n){
		cin>>a[i];
		if(a[i]%2==0)x[a[i]/2]=1;
	}
	rep(i,n){
		if(x[a[i]]==0){
			total++;
		}
	}
	cout<<total<<endl;

	return 0;
}

Submission Info

Judge Result