competitive-programming/solved-topcoder/Solved/FoxAndWord.cpp at master · the-redback/competitive-programming · 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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */
#include <bits/stdc++.h>
using namespace std;

#define inf HUGE_VAL

int check(string s, string ss) {
    int i = 0, j;
    string p = "";
    string q = "";
    if (s.size() != ss.size()) return 0;
    for (i = 0; i < s.size(); i++) {
        p.push_back(s[i]);
        if (i < s.size() - 1) {
            q = "";
            for (j = i + 1; j < s.size(); j++) q.push_back(s[j]);
            q += p;
            if (ss == q) return 1;
        }
    }
    return 0;
}

class FoxAndWord {
public:
    int howManyPairs(vector<string> v) {
        int ret = 0;
        for (int i = 0; i < v.size(); i++) {
            for (int j = i + 1; j < v.size(); j++)
                if (check(v[i], v[j])) ret++;
        }
        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();
        if ((Case == -1) || (Case == 5)) test_case_5();
    }

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() {
        string Arr0[] = {"tokyo", "kyoto"};
        vector<string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = 1;
        verify_case(0, Arg1, howManyPairs(Arg0));
    }
    void test_case_1() {
        string Arr0[] = {"aaaaa", "bbbbb"};
        vector<string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = 0;
        verify_case(1, Arg1, howManyPairs(Arg0));
    }
    void test_case_2() {
        string Arr0[] = {"ababab", "bababa", "aaabbb"};
        vector<string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = 1;
        verify_case(2, Arg1, howManyPairs(Arg0));
    }
    void test_case_3() {
        string Arr0[] = {"eel", "ele", "lee"};
        vector<string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = 3;
        verify_case(3, Arg1, howManyPairs(Arg0));
    }
    void test_case_4() {
        string Arr0[] = {"aaa", "aab", "aba", "abb", "baa", "bab", "bba", "bbb"};
        vector<string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = 6;
        verify_case(4, Arg1, howManyPairs(Arg0));
    }
    void test_case_5() {
        string Arr0[] = {"top", "coder"};
        vector<string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
        int Arg1 = 0;
        verify_case(5, Arg1, howManyPairs(Arg0));
    }

    // END CUT HERE
};

// BEGIN CUT HERE
int main() {
    FoxAndWord ___test;
    ___test.run_test(-1);
    int gbase;
    cin >> gbase;  // erase this line if you are not using dev-cpp! :)
    return 0;
}
// END CUT HERE