ITMO N9

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    //cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}

bool s(bool a, bool b) {
    return a && !b;
}

vector <int> to(int x, int bs) {
    vector <int> r;
    while (x > 0) {
        r.pb(x % bs);
        x /= bs;
    }
    while (r.size() < 5) {
        r.pb(0);
    }
    return r;
}

bool impl(bool a, bool b) {
    return !a || b;
}

bool f(bool s1, bool s2, bool s3, bool s4) {
    bool r;
    r = impl(s1, s2);
    r = impl(r, s3);
    r = impl(r, s4);
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    string s = "10111111000000001011111110111011";
    reverse(s.begin(), s.end());
    vector <pii> abc = {{0, 1}, {1, 2}, {2, 3}, {3, 4}};
    vector <int> id = {0, 1, 2, 3};
    string ch = "";
    do {
        ch = "";
        for (int i = 0; i < 32; ++i) {
            auto v = to(i, 2);

        }
    } while (next_permutation(id.begin(), id.end()));
}