topcoder/BinaryIncrementation.cpp at master · cou929/topcoder · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
// BEGIN CUT HERE
// END CUT HERE
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <utility>
#include <set>
#include <cctype>

using namespace std;

class BinaryIncrementation {
public:
  string plusOne(string x)
  {
    string ret = "0";
    ret += x;

    int cur = ret.size() - 1;
    while (cur >= 0)
      {
	if (ret[cur] == '0')
	  {
	    ret[cur] = '1';
	    break;
	  }
	else
	  {
	    ret[cur] = '0';
	    cur--;
	  }
      }

    if (ret[0] == '0')
      ret.erase(0, 1);

    return ret;
  }


  // 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 string &Expected, const string &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() { string Arg0 = "10011"; string Arg1 = "10100"; verify_case(0, Arg1, plusOne(Arg0)); }
  void test_case_1() { string Arg0 = "10000"; string Arg1 = "10001"; verify_case(1, Arg1, plusOne(Arg0)); }
  void test_case_2() { string Arg0 = "1111"; string Arg1 = "10000"; verify_case(2, Arg1, plusOne(Arg0)); }
  void test_case_3() { string Arg0 = "1"; string Arg1 = "10"; verify_case(3, Arg1, plusOne(Arg0)); }
  void test_case_4() { string Arg0 = "101010101010101010101010101010"; string Arg1 = "101010101010101010101010101011"; verify_case(4, Arg1, plusOne(Arg0)); }

  // END CUT HERE

};

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