CF Intel Code Challenge Elimination Round D set

题目传送门：http://codeforces.com/contest/722/problem/D

题意：给一个集合Y，问是否存在集合X，让X中的每个元素经过零次，一次或多次操作q或p与Y中的元素对应，两集合都是无序且互异的

操作q：x = 2*x, 操作p：x = 2*x +1

思路：这题主要就是stl的使用，之前没用过set，这次就当学习set的用法了，用set存Y（按从大到小的顺序），然后每次取出一个数不断除2，直到集合Y不存在这个数为止，然后剔除原Y，加入新Y。当从Y中取出某元素被2一直除到0时，结束，输出

代码如下：

#include <iostream>
#include <algorithm>
#include <cstring>
#include <stdio.h>
#include <string>
#include <cmath>
#include <queue>
#include <set>

using namespace std;
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   ll            long long
#define   ull           unsigned long long
#define   mem(n,v)      memset(n,v,sizeof(n))
#define   MAX           50005
#define   MAXN          2000005
#define   PI            3.1415926
#define   E             2.718281828459
#define   opnin         freopen("text.in.txt","r",stdin)
#define   opnout        freopen("text.out.txt","w",stdout)
#define   clsin         fclose(stdin)
#define   clsout        fclose(stdout)
#define   haha1          cout << "haha1"<< endl
#define   haha2          cout << "haha2"<< endl
#define   haha3          cout << "haha3"<< endl

const int    INF    =   0x3f3f3f3f;
const ll     INFF   =   0x3f3f3f3f3f3f3f3f;
const double pi     =   3.141592653589793;
const double inf    =   1e18;
const double eps    =   1e-8;
const ll     mod    =   1e9+7;
const ull    mx     =   133333331;
struct cmp
{
    bool operator ()(const int &a, const int &b)
    {
        return a>b;
    }
};
set<int,cmp>s;
int main()
{
    s.clear();
    int n;
    cin >> n;
    for(int i=0;i<n;i++){
        int x;
        scanf("%d",&x);
        s.insert(x);
    }
    for(;;){
        int val = *s.begin();
        int temp = val >> 1;
        while(temp){
            if(s.find(temp) == s.end()){
                s.insert(temp);
                break;
            }
            temp = temp >> 1;
        }
        if(!temp){
            for(set<int>::iterator it = s.begin();it!=s.end();it++)
                printf("%d ",*it);
            break;
        }
        s.erase(val);
    }

    return 0;
}