Task 3

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

int main()
{
    string s;
    vector<string> words(16);
    for (int i = 0; i < 16; ++i)
        cin >> words[i];
    cin >> s;
    string letters = "ABCDEFGHIJ";
    do
    {
        map<char, int> m;
        for (int i = 0; i < 10; ++i)
            m[letters[i]] = i;
        vector<int> numbers(16);
        for (int i = 0; i < 16; ++i)
        {
            int cur_num = 0;
            for (auto &c: words[i])
                cur_num = cur_num * 10 + m[c];
            numbers[i] = cur_num;
        }
        bool correct = true;
        for (int i = 1; correct && i < 16; ++i)
            if (numbers[i] <= numbers[i - 1])
                correct = false;
        if (correct)
        {
            int cur_num = 0;
            for (auto &c: s)
                cur_num = cur_num * 10 + m[c];
            cout << cur_num;
            return 0;
        }
    } while (next_permutation(letters.begin(), letters.end()));
    return 0;
}