Przejdź do treści

Rozwiązania

Zadanie 1

 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
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

int exercise1()
{
    vector<string> tab;
    string line;
    ifstream file("../../../../assets/parentheses.txt");
    while (file >> line && !file.eof())
    {
        tab.push_back(line);
    }

    file.close();

    int count = 0;
    for (auto &par : tab)
    {
        stack<char> st;
        bool ok = true;
        char top;
        for (auto &c : par)
        {
            if (c == '(' || c == '[' || c == '{')
            {
                st.push(c);
                continue;
            }

            if (st.empty())
            {
                ok = false;
                break;
            }

            top = st.top();
            if ((c == ')' && top != '(') || (c == ']' && top != '[') || (c == '}' && top != '{'))
            {
                ok = false;
                break;
            }

            st.pop();
        }

        if (ok && st.empty())
        {
            count++;
        }
    }

    return count;
}

Zadanie 2

 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
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

bool compare(const string &a, const string &b)
{
    int round1 = 0, round2 = 0, square1 = 0, square2 = 0, curly1 = 0, curly2 = 0;
    for (auto &el : a)
    {
        if (el == '(' || el == ')')
        {
            round1++;
        }
        else if (el == '[' || el == ']')
        {
            square1++;
        }
        else
        {
            curly1++;
        }
    }

    for (auto &el : b)
    {
        if (el == '(' || el == ')')
        {
            round2++;
        }
        else if (el == '[' || el == ']')
        {
            square2++;
        }
        else
        {
            curly2++;
        }
    }

    if (round1 < round2)
    {
        return true;
    }
    else if (round1 > round2)
    {
        return false;
    }
    else if (square1 < square2)
    {
        return true;
    }
    else if (square1 > square2)
    {
        return false;
    }
    else
    {
        return curly1 < curly2;
    }
}

vector<string> exercise2()
{
    vector<string> tab;
    string line;
    ifstream file("../../../../assets/parentheses.txt");
    while (file >> line && !file.eof())
    {
        tab.push_back(line);
    }

    file.close();

    sort(tab.begin(), tab.end(), compare);

    return tab;
}

Zadanie 3

 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
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

void exercise3()
{
    vector<string> tab;
    string line;
    ifstream file("../../../../assets/parentheses.txt");
    while (file >> line && !file.eof())
    {
        tab.push_back(line);
    }

    file.close();

    for (auto &par : tab)
    {
        int max_opening_length = 0,
            max_closing_length = 0,
            current_opening_length = 0,
            current_closing_length = 0;
        for (auto &c : par)
        {
            if (c == '(' || c == '[' || c == '{')
            {
                current_closing_length = 0;
                current_opening_length++;
                max_opening_length = max(max_opening_length, current_opening_length);
            }
            else
            {
                current_opening_length = 0;
                current_closing_length++;
                max_closing_length = max(max_closing_length, current_closing_length);
            }
        }

        cout << max_opening_length << " " << max_closing_length << endl;
    }
}