551B - ZgukistringZ - CodeForces Solution

#include <iostream>
#include <climits>

using namespace std;

int main() {
    int rec[3][26] = {0};
    int dup[26] = {0};
    string a, b, c;
    cin >> a >> b >> c;

    for (auto &n: a) {
        rec[0][n - 'a']++;
    }
    for (auto &n: b) {
        rec[1][n - 'a']++;
    }
    for (auto &n: c) {
        rec[2][n - 'a']++;
    }

    int l = 0, r = 0;

    int ans = 0;
    bool flag = true;
    for (int i = 0; flag; ++i) {
        int cur = INT_MAX;
        for (int j = 0; j < 26; ++j) {
            if (rec[2][j] != 0) {
                cur = min(cur, rec[0][j] / rec[2][j]);
            }
        }

        if (cur + i > ans) {
            ans = cur + i;
            l = i, r = cur;
            for (int j = 0; j < 26; ++j) {
                dup[j] = rec[0][j];
                dup[j] -= cur * rec[2][j];
            }
        }
        // cout << "for: " << cur << ", " << i << endl;


        for (int j = 0; j < 26; ++j) {
            rec[0][j] -= rec[1][j];
            if (rec[0][j] < 0) {
                flag = false;
                break;
                // goto L1;
            }
        }
    }
L1:  
    for (int i = 0; i < l; ++i) {
        // cout << b;
        printf("%s", b.c_str());
    }
    for (int i = 0; i < r; ++i) {
        // cout << c;
        printf("%s", c.c_str());
    }
    if (l + r == 0) {
        printf("%s", a.c_str());
    } else {
        for (int i = 0; i < 26; ++i) {
            for (int j = 0; j < dup[i]; ++j) {
                printf("%c", i + 'a');
                // cout << (char)(i + 'a');
            }
        }
    }
}