#include "abc.h"
#include<bits/stdc++.h>
using namespace std;
// you may find the definitions useful
const int OP_ZERO = 0; // f(OP_ZERO, x0, x1) = 0
const int OP_NOR = 1; // f(OP_NOR, x0, x1) = !(x0 || x1)
const int OP_GREATER = 2; // f(OP_GREATER, x0, x1) = (x0 > x1)
const int OP_NOT_X1 = 3; // f(OP_NOT_X1, x0, x1) = !x1
const int OP_LESS = 4; // f(OP_LESS, x0, x1) = (x0 < x1)
const int OP_NOT_X0 = 5; // f(OP_NOT_X0, x0, x1) = !x0
const int OP_XOR = 6; // f(OP_XOR, x0, x1) = (x0 ^ x1)
const int OP_NAND = 7; // f(OP_NAND, x0, x1) = !(x0 && x1)
const int OP_AND = 8; // f(OP_AND, x0, x1) = (x0 && x1)
const int OP_EQUAL = 9; // f(OP_EQUAL, x0, x1) = (x0 == x1)
const int OP_X0 = 10; // f(OP_X0, x0, x1) = x0
const int OP_GEQ = 11; // f(OP_GEQ, x0, x1) = (x0 >= x1)
const int OP_X1 = 12; // f(OP_X1, x0, x1) = x1
const int OP_LEQ = 13; // f(OP_LEQ, x0, x1) = (x0 <= x1)
const int OP_OR = 14; // f(OP_OR, x0, x1) = (x0 || x1)
const int OP_ONE = 15; // f(OP_ONE, x0, x1) = 1
// Alice
int // returns la
alice(
/* in */ const int n,
/* in */ const char names[][5],
/* in */ const unsigned short numbers[],
/* out */ bool outputs_alice[]
) {
if (n == 1) {
for(int i = 0; i < 16; i++) outputs_alice[i] = numbers[0] >> i & 1;
for(int i = 16; i < 32; i++) outputs_alice[i] = 0;
return 32;
}
return 2;
}
// Bob
int // returns lb
bob(
/* in */ const int m,
/* in */ const char senders[][5],
/* in */ const char recipients[][5],
/* out */ bool outputs_bob[]
) {
return m;
}
// Circuit
int // returns l
circuit(
/* in */ const int la,
/* in */ const int lb,
/* out */ int operations[],
/* out */ int operands[][2],
/* out */ int outputs_circuit[][16]
) {
int cnt = la + lb;
if (la == 32) {
auto calc = [&] (vector<int> a, vector<int> b) {
vector<int> ret;
assert(a.size() == 16 && b.size() == 16);
int c = 0;
for(int i = 0; i < 16; i++) {
operations[cnt] = 6;
operands[cnt][0] = a[i];
operands[cnt][1] = b[i];
int sum1 = cnt++;
operations[cnt] = 8;
operands[cnt][0] = a[i];
operands[cnt][1] = b[i];
int rem1 = cnt++;
if (i == 0) {
c = rem1;
ret.push_back(sum1);
continue;
}
operations[cnt] = 6;
operands[cnt][0] = sum1;
operands[cnt][1] = c;
int sum2 = cnt++;
ret.push_back(sum2);
if (i == 15) return ret;
operations[cnt] = 8;
operands[cnt][0] = sum1;
operands[cnt][1] = c;
int rem2 = cnt++;
operations[cnt] = 14;
operands[cnt][0] = rem1;
operands[cnt][1] = rem2;
c = cnt++;
}
return ret;
};
vector<int> init;
for(int i = 0; i < 16; i++) init.push_back(i);
vector<int> cur;
for(int i = 16; i < 32; i++) cur.push_back(i);
for(int loop = 0; loop < lb; loop++) {
cur = calc(cur, init);
}
for(int j = 0; j < 16; j++) outputs_circuit[0][j] = cur[j];
return cnt;
}
// operations[5] = 8;
operations[6] = 14;
// operands[5][0] = 0; operands[5][1] = 4;
operands[6][0] = 2; operands[6][1] = 5;
int final_results[] = {20000, 0, 24464};
for(int i = 0; i < 3; ++i)
for(int j = 0; j < 16; ++j)
outputs_circuit[i][j] = 5 + (final_results[i] >> j & 1);
return 7;
}
