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
// Wiktor Onik 2021
#include <bits/stdc++.h>

using namespace std;
map<int, int> m;
int l[7];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, k, li = 0, zlicz = 0, wyn = 0, mi = 0, li3 = 0, li4 = 0, li5 = 0, li6 = 0, lin = 0, z = 0;
    string s;
    cin >> n >> s;

    for (int i = 0; i < n * 8; i++)
        if (s[i] == '1')
        {
            li++;
        }

    if (li < 3 * n || li > 6 * n)
    {
        cout << "NIE";
    }
    else
    {
        li = li - (3 * n);
        while (true)
        {
            if (li - (3 - z) >= 0)
            {
                li = li - (3 - z);
                if (3 - z == 3)
                {
                    cout << "w";
                }
                if (3 - z == 2)
                {
                    cout << "y";
                }
                if (3 - z == 1)
                {
                    cout << "l";
                }
                if (3 - z == 0)
                {
                    cout << "a";
                }
                zlicz++;
            }
            else
            {
                z++;
            }
            if (z == 4 || li == 0)
            {
                break;
            }
        }
        for (int i = 0; i < n - zlicz; i++)
        {
            cout << "a";
        }
    }

    return 0;
}