题解-NOI2016 旷野大计算

记录一下我做这道毒瘤题的代码。

Part 1

int t = Plus(In(), In());
t = Left(t, 1);
t = Neq(t);
Out(t);

Part 2

int t = In();
int r = Left(t, 4);
r = Plus(r, t);
r = Neq(r);
Out(r = S(r));

Part 3

int t = In();
t = Left(t, 1000);
t = S(t);
t = Left(t, 1);
t = Shift(t, -1);
Out(t);

Part 4

Part 5

for (int i = 0; i < 32; i++) a[i] = In();
int t = a[31];
for (int i = 30; i >= 0; i--) {
	t = Plus(t, Left(a[i], 31 - i));
}
Out(t);