```cpp #include using namespace std; int main() { int T; cin >> T; if (T == 1) { cout << R"(+ y x < y 4 < x 12 - x y ! x)"; } else if (T == 2) { cout << R"(+ y x < x 7 + y x < x 8 + y x < x 8 + y x < x 8 + y x > y 43 ! y)"; } else if (T == 3) { cout << R"(- y x > x 63 > y 63 + x y - a x > a 52 + b a > a 8 - b a ! b)"; } else if (T == 4) { for (int i = 0; i < 64; i++) { if (i == 63) { cout << "^ b b" << endl; } cout << "+ b x" << endl; if (i < 63) { cout << " b 63" << endl; // b = bool(x & (1 << i)) if (i == 0) { cout << "- x b" << endl; } if (i) { cout << "^ a a" << endl; cout << "^ c c" << endl; } if (i == 0) { cout << R"(- a b > a 1 + c a + c y ^ a y - c a > c 1 + d c > a 63 + b a > b 1 y 1 )"; } else { cout << R"(- a b + c a + c y ^ a y - c a + d c < y 1 )"; } } cout << "! d"; } else if (T == 5) { cout << R"(+ b y - c y > b 63 > c 63 - a b - a c > a 63 )"; // 造 1 的代码，a = 1 for (int i = 31; i >= 0; i--) { cout << "^ b b" << endl; cout << "^ c c" << endl; cout << "+ b x" << endl; if (i != 0) cout << "> b " < b 63" << endl; // b = 0 if x >> i >= y else 1 cout << "^ b a" << endl; // b = 1 if x >> i >= y else 0 // 然后 d += b < b " <> i >= y else 0 // cout << "> c 1" << endl; // c = 0x7fff if x >> i >= y else 0 cout << "- x c" << endl; if (i == 1) { cout << "- x y" << endl; cout << "^ c y" << endl; } else { cout << "^ b b" << endl; cout << "+ b y" << endl; cout << " a 63 > b 63 - c a - c b > c 63 ^ a a ^ b b )"; // 造 1 的代码，c = 1 for (int i = 31; i >= 0; i--) { /* if (i == 31) { // 作者想对 31 再卡卡，但是 WA 了，懒得调，反正 30 处理对了，31 和 30 一个逻辑一起处理了就多几条指令 cout << "^ d d" << endl; cout << "+ d x" << endl; cout << "> d 62" << endl; cout << "^ a a" << endl; cout << "- a d" << endl; cout << "> a 63" << endl; cout << "+ b a" << endl; cout << "< b 31" << endl; cout << "< a 62" << endl; continue; } */ if (i < 31) cout << "^ d d" << endl; cout << "+ d a" << endl; if (i < 30) cout << "< d " << i + 1 << endl; else cout << "< d " < c " < c " <= 30) cout << "> y 2" << endl; cout << "+ y d" << endl; cout << "- y c" << endl; if (i >= 30) { // 空间不够，覆盖已经据算掉的 d cout << "^ d d" << endl; cout << "+ d x" << endl; cout << "> d 2" << endl; cout << "- y d" << endl; // 然后才计算真实的 d cout << "^ d d" << endl; cout << "+ d a" << endl; cout << "< d " < c " < y 63" << endl; // 上面计算好了 d 和分支参数 y // cout << "print add square size=" << endl; // cout << "! d" << endl; // cout << "print if y == 1, can add" << endl; // cout << "! y" << endl; if (i) cout << "< y " < y " << i << endl; // 后续如果 y = 1，那么 b += d，否则 b += 0 // 但是寄存器被用完了 // y 的计算需要 d，但是 d 只需要计算原先的 a，原先的 a 需要 y // 发现先让 -y 覆盖当前的 d，然后把 -y 倒腾会 y 寄存器 cout << "^ d d" << endl; cout << "- d y" << endl; cout << "^ y y" << endl; cout << "+ y d" << endl; // 用 d 寄存器计算 2 ^ i * -y ，再加一下当前的 a 可以还原上一步结束的 a if (i) cout << "< d " << i << endl; // cout << "! d" << endl; cout << "+ d a" << endl; cout << "< d " < c " <0 才处理，d 和 y 都提前右移是可以的 cout << "> d 1" << endl; cout << "> y 1" << endl; // cout << "! d" << endl; // cout << "! y" << endl; cout << "+ b d" << endl; cout << "+ b y" << endl; cout << "^ y d" << endl; cout << "- b y" << endl; // cout << "! a" << endl; // cout << "! b" << endl; } cout << "! a"; } else if (T == 7) { cout << R"(+ b x - c x > b 63 > c 63 - a b - a c > a 63 - x a )"; for (int i : {1, 2, 4, 8, 16, 32}) { cout << "^ b b" << endl; cout << "^ c c" << endl; if (i != 1) { cout << "^ d d" << endl; } cout << "+ b x" << endl; cout << "> b " < c 1" << endl; // c = x & b cout << "+ x b" << endl; // x' = x + b cout << "- x c" << endl; // x' = (x + b) - (x & b) = x | b } cout << "+ x a" << endl; cout << "! x"; } return 0; } ```

U570552 P12601 旷野小计算 答案

题目背景

题目描述

输入格式

输出格式

U570552 P12601 旷野小计算答案