ORSolitaireDiv2.cpp

#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <bitset>
using namespace std;
//{{744207802, 459506930, 96031044, 94305333, 71623564, 401261714, 143654920, 180838023, 426804418, 292454963, 396375937, 783935062, 983980901, 302100998}, 751841480}
class ORSolitaireDiv2
        {
        public:
        int getMinimum(vector <int> numbers, int goal)
            {
            int t = log2(goal)+1;
            cout<<(bitset<32>)goal<<endl;
            vector<int>::iterator it = numbers.begin();
            while(it != numbers.end()){
                if(((*it)|goal) != goal){
                    it = numbers.erase(it);
                    cout<<(bitset<32>)*it<<" "<<*it<<endl;
                }
                else it++;

            }

            int sol[33], n = numbers.size();
            fill(sol, sol+t, 0);
            for(int i = 0; i < t; i++){
                if(goal&(1<<i)){
                    for(int j = 0; j < n; j++)
                        if((1<<i)&numbers[j]){
                            sol[i]++;
//                              cout<<i<<" "<<numbers[j]<<endl;
                        }
                }
                else sol[i] = 10000;
            }
            return *min_element(sol, sol+t);
            }

// BEGIN CUT HERE
	public:
	void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); }
	private:
	template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
	void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
	void test_case_0() { int Arr0[] = {744207802, 459506930, 96031044, 94305333, 71623564, 401261714, 143654920, 180838023, 426804418, 292454963, 396375937, 783935062, 983980901, 302100998}
; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 751841480; int Arg2 = 0; verify_case(0, Arg2, getMinimum(Arg0, Arg1)); }
	void test_case_1() { int Arr0[] = {1, 2, 4, 7, 8}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 7; int Arg2 = 2; verify_case(1, Arg2, getMinimum(Arg0, Arg1)); }
	void test_case_2() { int Arr0[] = {12571295, 2174218, 2015120}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1; int Arg2 = 0; verify_case(2, Arg2, getMinimum(Arg0, Arg1)); }
	void test_case_3() { int Arr0[] = {5, 2, 4, 52, 62, 9, 8, 3, 1, 11, 6}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 11; int Arg2 = 3; verify_case(3, Arg2, getMinimum(Arg0, Arg1)); }
	void test_case_4() { int Arr0[] = {503, 505, 152, 435, 491, 512, 1023, 355, 510, 500, 502, 255, 63, 508, 509, 511, 60, 250, 254, 346}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 510; int Arg2 = 5; verify_case(4, Arg2, getMinimum(Arg0, Arg1)); }

// END CUT HERE

        };

// BEGIN CUT HERE
     int main()
     {
        ORSolitaireDiv2 ___test;
        ___test.run_test(-1);
     }
// END CUT HERE