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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

typedef long long ll;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    string kto;
    cin >> kto;
    bool czyAlgosia = false;
    if (kto == "Algosia") {
        czyAlgosia = true;
    }
    ll n,t;
    cin >> n >> t;
    if (czyAlgosia)
    {
        for (int k = 0; k < t; k++)
        {
            ll x;
            cin >> x;
            vector<ll> a(10);
            vector<vector<int>> macierz(10, vector<int>(10));
            for (int i = 0; i < 10; i++)
            {
                a[i] = x % 11;
                x /= 11;
            }
            for (int i = 0; i < 10; i++)
                for (int j = 0; j < a[i]; j++)
                    macierz[i][j] = 1;
            for (int i = 0; i < 10; i++)
            {
                for (int j = 0; j < 10; j++)
                    cout << macierz[i][j];
                cout << "\n";
            }
            cout.flush();
        }
    }
    else
    {
        ll x,wyn;
        for (int k = 0; k < t; k++)
        {
            vector<string> macierz(10);
            vector<int> ile(10);
            for (int i = 0; i < 10; i++) cin >> macierz[i];
            for (int i = 0; i < 10; i++)
                for (int j = 0; j < 10; j++)
                    if (macierz[i][j] == '1')
                        ile[i]++;
            x = 0, wyn = 1;
            for (int i = 0; i < 10; i++)
            {
                x += ile[i] * wyn;
                wyn *= 11;
            }
            cout << x << "\n";
            cout.flush();
        }
    }
}