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
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

typedef unsigned long long ull;

const int GRID_N = 10;
const int SUB_H = 5;
const int TARGET_SUM = 15;
const int MASK_LIMIT = 1024;
const ull COMB_VAL = 142506ULL;      
const ull CHK_MASK = 255ULL;       
const int SHFT = 8;
const ull HASH_VAL = 2654435761ULL; 
const ull SALT_RANGE = 20ULL;
const int MAX_SALT = 50;
const int BIT_LIMIT = 30;

int NIEZMIENNIK[SUB_H][SUB_H] = {
    {1,1,1,1,1}, 
    {1,1,1,1,0}, 
    {1,1,0,1,0}, 
    {1,1,0,0,0}, 
    {1,0,0,0,0}  
};

vector<unsigned int> maski;
ull POM = COMB_VAL; 

void pre(){
    for(int i=1; (BIT_LIMIT-4)>=i; i++) for(int j=i+1; (BIT_LIMIT-3)>=j; j++) for(int k=j+1; (BIT_LIMIT-2)>=k; k++) for(int l=k+1; (BIT_LIMIT-1)>=l; l++)for(int m=l+1; BIT_LIMIT>=m; m++) maski.push_back((1u<<i) | (1u<<j) | (1u<<k) | (1u<<l) | (1u<<m));
    sort(maski.begin(), maski.end());
}

int que(unsigned int mask){
    auto it = lower_bound(maski.begin(), maski.end(), mask);
    if(it != maski.end() and *it == mask) return distance(maski.begin(), it);
    return -1;
}

bool czy(const vector<string>& g, int rm, int cm, ull& zbedne){
    int R[SUB_H], C[SUB_H];
    int r_cnt = 0, c_cnt = 0;
    for(int i=0; GRID_N>i; i++){
        if(rm & (1<<i)) R[r_cnt++] = i;
        if(cm & (1<<i)) C[c_cnt++] = i;
    }

    int sum = 0;
    for(int i=0; SUB_H>i; i++) 
        for(int j=0; SUB_H>j; j++) 
            sum += g[R[i]][C[j]] - '0';
    if(sum != TARGET_SUM) return false;

    int Rord[SUB_H] = {-1,-1,-1,-1,-1};
    int Cord[SUB_H] = {-1,-1,-1,-1,-1};

    for(int i=0; SUB_H>i; i++){
        int r_sum = 0; 
        for(int j=0; SUB_H>j; j++) r_sum += g[R[i]][C[j]]-'0';
        if(r_sum >= 1 and r_sum <= SUB_H) Rord[SUB_H - r_sum] = R[i];
        else return false;
    }
    for(int j=0; SUB_H>j; j++){
        int c_sum = 0; 
        for(int i=0; SUB_H>i; i++) c_sum += g[R[i]][C[j]]-'0';
        if(c_sum == 5) Cord[0] = C[j];
        else if(c_sum == 4) Cord[1] = C[j];
        else if(c_sum == 2) Cord[2] = C[j];
        else if(c_sum == 3) Cord[3] = C[j];
        else if(c_sum == 1) Cord[4] = C[j];
        else return false;
    }

    for(int i=0; SUB_H>i; i++) if(Rord[i] == -1 or Cord[i] == -1) return false;

    for(int i=0; SUB_H>i; i++)
        for(int j=0; SUB_H>j; j++)
            if(g[Rord[i]][Cord[j]]-'0' != NIEZMIENNIK[i][j]) return false;

    pair<int, int> pR_pairs[SUB_H], pC_pairs[SUB_H];
    int pr_cnt = 0, pc_cnt = 0;

    for(int i=0; GRID_N>i; i++){
        if((rm & (1<<i))) continue;
        int code = 0; for(int j=0; SUB_H>j; j++) code |= ((g[i][Cord[j]]-'0')<<j);
        pR_pairs[pr_cnt++] = {code, i};
    }
    for(int j=0; GRID_N>j; j++){
        if((cm & (1<<j))) continue;
        int code = 0; for(int i=0; SUB_H>i; i++) code |= ((g[Rord[i]][j]-'0')<<i);
        pC_pairs[pc_cnt++] = {code, j};
    }

    sort(pR_pairs, pR_pairs + SUB_H);
    sort(pC_pairs, pC_pairs + SUB_H);

    unsigned int rMask = 0, cMask = 0;
    int pR[SUB_H], pC[SUB_H];
    for(int i=0; SUB_H>i; i++){
        rMask |= (1 << pR_pairs[i].first);
        pR[i] = pR_pairs[i].second;
        cMask |= (1 << pC_pairs[i].first);
        pC[i] = pC_pairs[i].second;
    }

    int rR = que(rMask), cR = que(cMask);
    if(rR == -1 or cR == -1) return false;

    ull core = 0;
    for(int i=0; SUB_H>i; i++) for(int j=0; SUB_H>j; j++)
        if(g[pR[i]][pC[j]] == '1') core |= (1ULL << (i*SUB_H+j));

    zbedne = core * POM * POM + (ull)cR * POM + (ull)rR;
    return true;
}

void solveAlgosia(){
    ull n; int tt;
    cin>>n>>tt;
    while(tt-->0){
        ull x; cin >> x;
        ull v = x - 1;
        vector<string> best_g(GRID_N, string(GRID_N, '0'));
        
        for(ull xd = 0; (ull)MAX_SALT > xd; xd++){
            ull val_base = v * SALT_RANGE + xd;
            ull chk = (val_base * HASH_VAL) & CHK_MASK; 
            ull load = (val_base << SHFT) | chk;

            ull rRank = load % POM; load /= POM;
            ull cRank = load % POM; load /= POM;
            ull core = load;

            unsigned int rMask = maski[rRank];
            unsigned int cMask = maski[cRank];
            
            int rCodes[SUB_H], cCodes[SUB_H];
            int r_idx = 0, c_idx = 0;
            for(int i=1; BIT_LIMIT>=i; i++){
                if(rMask & (1 << i)) rCodes[r_idx++] = i;
                if(cMask & (1 << i)) cCodes[c_idx++] = i;
            }

            vector<string> g(GRID_N, string(GRID_N, '0'));
            for(int i=0; SUB_H>i; i++) for(int j=0; SUB_H>j; j++) g[i][j] = NIEZMIENNIK[i][j] + '0';
            for(int j=0; SUB_H>j; j++) for(int i=0; SUB_H>i; i++) g[i][SUB_H+j] = ((cCodes[j] >> i) & 1) + '0';
            for(int i=0; SUB_H>i; i++) for(int j=0; SUB_H>j; j++) g[SUB_H+i][j] = ((rCodes[i] >> j) & 1) + '0';
            for(int i=0; SUB_H>i; i++) for(int j=0; SUB_H>j; j++) g[SUB_H+i][SUB_H+j] = ((core >> (i*SUB_H+j)) & 1) + '0';

            int valid_count = 0;
            for(int i=0; MASK_LIMIT>i; i++){
                if(__builtin_popcount(i) != SUB_H) continue;
                for(int j=0; MASK_LIMIT>j; j++){
                    if(__builtin_popcount(j) != SUB_H) continue;
                    ull dod;
                    if(czy(g, i, j, dod)){
                        ull dec_chk = dod & CHK_MASK;
                        ull dec_val_base = dod >> SHFT;
                        if(dec_chk == ((dec_val_base * HASH_VAL) & CHK_MASK)){
                            valid_count++;
                        }
                    }
                }
            }
            
            if(valid_count == 1){
                best_g = g;
                break;
            }
        }
        
        for(int i = 0; GRID_N>i; i++) cout << best_g[i] << '\n';
        cout.flush();
    }
}

void solveBajtek(){
    ull n; int tt;
    cin>>n>>tt;

    while(tt-->0){
        bool ok = 0;
        vector<string>g(GRID_N);
        for(int i=0; GRID_N>i; i++) cin>>g[i];
        for(int i = 0; MASK_LIMIT>i; i++){
            if(__builtin_popcount(i) != SUB_H) continue;
            for(int j=0; MASK_LIMIT>j; j++){
                if(__builtin_popcount(j) != SUB_H) continue;
                ull dod;
                if(czy(g, i, j, dod)){
                    ull dec_chk = dod & CHK_MASK;
                    ull dec_val_base = dod >> SHFT;
                    if(dec_chk == ((dec_val_base * HASH_VAL) & CHK_MASK)){
                        ull v = dec_val_base / SALT_RANGE;
                        cout << v + 1 << '\n';
                        cout.flush();
                        ok = 1;
                        break;
                    }
                }
            }
            if(ok) break;
        }
    }
}

signed main(){
    ios::sync_with_stdio(0); 
    cin.tie(0);
    cout.tie(0);
    pre();
    string s; cin>>s;
    if(s == "Algosia") solveAlgosia(); 
    else solveBajtek();
}