NumberGameAgain.cpp

class NumberGameAgain {
    public:
    long long solve(int k, vector<long long> table) {
      const long long int MAX=((long long)2<<(k-1));
      sort(table.begin(), table.end());
      long long int cnt=MAX-2;
      for(int i=0;i<table.size();i++)
	{
	  long long int ii=table[i]/2;
	  int tree=1;
	  bool flag=false;
	  while(ii>1)
	    {
	      if(binary_search(table.begin(), table.end(), ii))
		{
		  flag=true;
		  break;
		}
	      ii=ii/2;
	      tree++;
	    }
	  if(flag)
	    continue;
	  cnt-=((long long)1<<(k-tree))-1;
	}
      return cnt;
    }
};