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
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
// clang-format off
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r) for(auto i=(l);i<=(r);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define ssize(x) int(x.size())
auto operator<<(ostream&o,auto p)->decltype(p.first,o){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(ostream&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<"}";}
#ifdef DEBUG
#define debug(x...) log_file<<"["#x"]: ",[](auto...$){((log_file<<$<<"; "),...);}(x),log_file<<endl
#else
#define debug(...) {}
#endif
// clang-format on

const int dim            = 10;
using matrix_t           = array<array<bool, 10>, 10>;
const matrix_t mtemplate = {{{0, 0, 0, 0, 1, 0, 1, 0, 1, 0},
                             {0, 0, 0, 0, 0, 1, 1, 0, 0, 1},
                             {0, 0, 0, 0, 0, 0, 0, 1, 1, 1},
                             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
                             {1, 0, 0, 0, 0, 0, 0, 0, 0, 0},
                             {0, 1, 0, 0, 0, 0, 0, 0, 0, 0},
                             {1, 1, 0, 0, 0, 0, 0, 0, 0, 0},
                             {0, 0, 1, 0, 0, 0, 0, 0, 0, 0},
                             {1, 0, 1, 0, 0, 0, 0, 0, 0, 0},
                             {0, 1, 1, 0, 0, 0, 0, 0, 0, 0}}};

const int seed1 = 23498;
const int seed2 = 123498;

LL N;
string name;
matrix_t matrix;
bitset<55> num_xor;
ofstream log_file;

struct Shuffler
{
    array<int, dim> rperm, cperm;
    Shuffler()
    {
        iota(rperm.begin(), rperm.end(), 0);
        iota(cperm.begin(), cperm.end(), 0);
    }
    void shuffle(mt19937 &rng);
    inline auto &get(int r, int c) const { return matrix[rperm[r]][cperm[c]]; }
    inline void swapr(int r1, int r2) { swap(rperm[r1], rperm[r2]); }
    inline void swapc(int c1, int c2) { swap(cperm[c1], cperm[c2]); }
    void sortr();
    void sortc();
};

void encode(const bitset<55> &bits, const int &msg_bits);
bitset<55> extract_data(const Shuffler &shuffler, const int &msg_bits);
bitset<18> extract_crc(const Shuffler &shuffler, const int &msg_bits);
bitset<18> produce_crc(const bitset<55> &data, const int &msg_bits);

LL
try_decode(Shuffler shuffler, const int &msg_bits)
{
    shuffler.sortr();
    shuffler.sortc();

    // Ensure that matrix matches template
    FOR (r, 0, 2) {
        FOR (c, 3, dim - 1) {
            if (shuffler.get(r, c) != mtemplate[r][c]) return -1;
        }
    }
    FOR (r, 3, dim - 1) {
        FOR (c, 0, 2) {
            if (shuffler.get(r, c) != mtemplate[r][c]) return -1;
        }
    }

    auto data         = extract_data(shuffler, msg_bits);
    auto crc          = extract_crc(shuffler, msg_bits);
    auto expected_crc = produce_crc(data, msg_bits);
    if (expected_crc != crc) return -1;
    return data.to_ullong();
}

mt19937 brute_rng(seed1);

vector<LL>
brute(const int &msg_bits)
{
    Shuffler shuffler;
    shuffler.shuffle(brute_rng);
    vector<LL> valid;
    FOR (r0, 0, dim - 1) {
        shuffler.swapr(0, r0);
        FOR (r1, 1, dim - 1) {
            shuffler.swapr(1, r1);
            FOR (r2, 2, dim - 1) {
                shuffler.swapr(2, r2);
                FOR (c0, 0, dim - 1) {
                    shuffler.swapc(0, c0);
                    FOR (c1, 1, dim - 1) {
                        shuffler.swapc(1, c1);
                        FOR (c2, 2, dim - 1) {
                            shuffler.swapc(2, c2);
                            auto res = try_decode(shuffler, msg_bits);
                            if (res != -1) valid.emplace_back(res);
                            shuffler.swapc(2, c2);
                        }
                        shuffler.swapc(1, c1);
                    }
                    shuffler.swapc(0, c0);
                }
                shuffler.swapr(2, r2);
            }
            shuffler.swapr(1, r1);
        }
        shuffler.swapr(0, r0);
    }
    sort(valid.begin(), valid.end());
    valid.erase(unique(valid.begin(), valid.end()), valid.end());
    return valid;
}

void
algosia(const int &msg_bits)
{
    LL nll;
    cin >> nll;
    bitset<55> n(nll);
    debug(n);
    n ^= num_xor;

    encode(n, msg_bits);

    REP (r, dim) {
        debug(r, matrix[r]);
        REP (c, dim) { cout << (matrix[r][c] ? 1 : 0); }
        cout << "\n";
    }
    cout.flush();
}

void
bajtek(const int &msg_bits)
{
    REP (r, dim) {
        REP (c, dim) {
            char ch;
            cin >> ch;
            matrix[r][c] = (ch == '1' ? 1 : 0);
        }
        debug(r, matrix[r]);
    }

    auto vals = brute(msg_bits);
    debug(vals);
    if (vals.empty()) exit(0);  // WA in last, did not get matrix
    bitset<55> n(vals.front());
    debug(n);
    n ^= num_xor;

    FOR (i, msg_bits, ssize(n) - 1) n[i] = 0;
    cout << n.to_ullong() << "\n";
    cout.flush();
}

int
main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin >> name >> N;
    int T;
    cin >> T;
    mt19937 rng(seed2);

    int msg_bits = 47;
    if (N < (1LL << 40)) msg_bits = 40;
    else if (N < (1LL << 44)) msg_bits = 44;

#ifdef DEBUG
    log_file.open(name + ".log");
#endif

    while (T--) {
        REP (i, ssize(num_xor)) { num_xor[i] = rng() & 1; }
        if (name == "Algosia") algosia(msg_bits);
        else bajtek(msg_bits);
    }

#ifdef DEBUG
    log_file.flush();
    log_file.close();
#endif

    return 0;
}

// =========================== Encode & Decode Matrix ==========================

bitset<9> computeCRC9(const bitset<49> &data);
bitset<11> computeCRC11(const bitset<47> &data);
bitset<14> computeCRC14(const bitset<44> &data);
bitset<18> computeCRC18(const bitset<40> &data);

void
encode(const bitset<55> &bits, const int &msg_bits)
{
    auto crc = produce_crc(bits, msg_bits);

    matrix   = mtemplate;
    int bit  = 0;
    FOR (r, 3, dim - 1) {
        FOR (c, 3, dim - 1) {
            matrix[r][c] = bits[bit++];
            if (bit >= msg_bits) break;
        }
        if (bit >= msg_bits) break;
    }

    bit = 0;
    REP (r, 3) {
        REP (c, 3) { matrix[r][c] = crc[bit++]; }
    }
    int crc_bits_left = 55 - msg_bits - 9;
    assert(crc_bits_left <= 7);
    FOR (c, dim - crc_bits_left, dim - 1) { matrix[dim - 1][c] = crc[bit++]; }
}

bitset<18>
extract_crc(const Shuffler &shuffler, const int &msg_bits)
{
    bitset<18> crc;
    int bit = 0;
    REP (r, 3) {
        REP (c, 3) { crc[bit++] = shuffler.get(r, c); }
    }
    int crc_bits_left = 55 - msg_bits - 9;
    assert(crc_bits_left <= 7);
    FOR (c, dim - crc_bits_left, dim - 1) {
        crc[bit++] = shuffler.get(dim - 1, c);
    }
    return crc;
}

bitset<55>
extract_data(const Shuffler &shuffler, const int &msg_bits)
{
    bitset<55> bits;
    int bit = 0;
    FOR (r, 3, dim - 1) {
        FOR (c, 3, dim - 1) {
            bits[bit++] = shuffler.get(r, c);
            if (bit >= msg_bits) break;
        }
        if (bit >= msg_bits) break;
    }
    return bits;
}

bitset<18>
produce_crc(const bitset<55> &bits, const int &msg_bits)
{
    bitset<18> crc;
    switch (msg_bits) {
        case 47: {  // 10^14
            bitset<47> data;
            REP (i, msg_bits) data[i] = bits[i];
            auto res = computeCRC11(data);
            REP (i, 55 - msg_bits) crc[i] = res[i];
            break;
        }
        case 44: {  // 10^13
            bitset<44> data;
            REP (i, msg_bits) data[i] = bits[i];
            auto res = computeCRC14(data);
            REP (i, 55 - msg_bits) crc[i] = res[i];
            break;
        }
        case 40: {  // 10^12
            bitset<40> data;
            REP (i, msg_bits) data[i] = bits[i];
            auto res = computeCRC18(data);
            REP (i, 55 - msg_bits) crc[i] = res[i];
            break;
        }
        default: exit(1);
    }
    return crc;
}

// ================================= CRC Coding ================================

// bitset<9>
// computeCRC9(const bitset<49> &data)
// {
//     // Standard CRC-9 polynomial: x^9 + x^6 + x^4 + x^3 + 1
//     // Binary: 1 0101 1001 (0x159)
//     const uint16_t polynomial = 0x159;
//     uint64_t remainder        = 0;
//     for (int i = 48; i >= 0; --i) {
//         remainder <<= 1;
//         if (data.test(i)) { remainder |= 1; }
//     }
//     remainder <<= 9;
//     for (int i = 57; i >= 9; --i) {
//         if (remainder & (1ULL << i)) {
//             remainder ^= (static_cast<uint64_t>(polynomial) << (i - 9));
//         }
//     }
//     return std::bitset<9>(remainder & 0x1FF);
// }

bitset<11>
computeCRC11(const bitset<47> &data)
{
    // Standard CRC-11 polynomial: x^11 + x^9 + x^8 + x^7 + x^2 + 1
    // Binary: 1011 1010 0001 (0xBA1)
    const uint64_t polynomial = 0xBA1;
    uint64_t remainder        = 0;
    for (int i = 46; i >= 0; --i) {
        remainder <<= 1;
        if (data.test(i)) { remainder |= 1; }
    }
    remainder <<= 11;
    for (int i = 57; i >= 11; --i) {
        if (remainder & (1ULL << i)) { remainder ^= (polynomial << (i - 11)); }
    }
    return bitset<11>(remainder & 0x7FF);
}

bitset<14>
computeCRC14(const bitset<44> &data)
{
    // CRC-14 Polynomial: x^14 + x^13 + x^5 + x^3 + x^2 + 1
    // Hex: 0x602D (The 14th bit is at 0x4000, so 110000000101101)
    const uint64_t polynomial = 0x602D;
    uint64_t remainder        = 0;
    for (int i = 43; i >= 0; --i) {
        remainder <<= 1;
        if (data.test(i)) { remainder |= 1; }
    }
    remainder <<= 14;
    for (int i = 57; i >= 14; --i) {
        if (remainder & (1ULL << i)) { remainder ^= (polynomial << (i - 14)); }
    }
    return bitset<14>(remainder & 0x3FFF);
}

bitset<18>
computeCRC18(const bitset<40> &data)
{
    // CRC-18 Polynomial: x^18 + x^17 + x^10 + x^9 + x^8 + x^4 + x^3 + x^1 + 1
    // Hex: 0x6071B
    const uint64_t polynomial = 0x6071B;
    uint64_t remainder        = 0;
    for (int i = 39; i >= 0; --i) {
        remainder <<= 1;
        if (data.test(i)) { remainder |= 1; }
    }
    remainder <<= 18;
    for (int i = 57; i >= 18; --i) {
        if (remainder & (1ULL << i)) { remainder ^= (polynomial << (i - 18)); }
    }
    return bitset<18>(remainder & 0x3FFFF);
}

// ================================== Shuffler =================================

void
Shuffler::shuffle(mt19937 &rng)
{
    std::shuffle(rperm.begin(), rperm.end(), rng);
    std::shuffle(cperm.begin(), cperm.end(), rng);
}

inline void
Shuffler::sortr()
{
    sort(rperm.begin() + 3,
         rperm.end(),
         [&](int r1, int r2)
         {
             if (matrix[r1][cperm[2]] != matrix[r2][cperm[2]])
                 return matrix[r1][cperm[2]] < matrix[r2][cperm[2]];
             if (matrix[r1][cperm[1]] != matrix[r2][cperm[1]])
                 return matrix[r1][cperm[1]] < matrix[r2][cperm[1]];
             return matrix[r1][cperm[0]] < matrix[r2][cperm[0]];
         });
}


inline void
Shuffler::sortc()
{
    sort(cperm.begin() + 3,
         cperm.end(),
         [&](int c1, int c2)
         {
             if (matrix[rperm[2]][c1] != matrix[rperm[2]][c2])
                 return matrix[rperm[2]][c1] < matrix[rperm[2]][c2];
             if (matrix[rperm[1]][c1] != matrix[rperm[1]][c2])
                 return matrix[rperm[1]][c1] < matrix[rperm[1]][c2];
             return matrix[rperm[0]][c1] < matrix[rperm[0]][c2];
         });
}