继续xxx定律

#include <iostream>
#include <set>
using namespace std;

int n;
int data[1001];
set<int> s;
int tmp;

int main()
{
    while(cin>>n){
        if(n == 0){
            break;
        }
        s.clear();
        for(int i = 0 ; i < n ; i++){
            cin>>data[i];
            tmp = data[i];
            while(tmp != 1){
                if(tmp % 2 == 1){
                    tmp = (tmp*3+1)/2;
                }else{
                    tmp /= 2;
                }
                s.insert(tmp); 
            }
        }
        int first = 1;
        for(int i = n-1 ; i >= 0 ; i--){
            if(s.count(data[i]) <= 0){
                if(first){
                    first = 0;
                }else{
                    cout<<" "; 
                }
                cout<<data[i];
            }
        }
        cout<<endl;
    }

    return 0;
 }