1for (
int c0 = 0;
c0 <= 1;
c0 += 1) {
2 for (
int c2 = 0;
c2 <= length;
c2 += 32) {
3 if (length >=
c2 + 1) {
4 for (
int c3 = 0; c3 <= length; c3 += 32) {
5 if (c3 >= 2 *
c2 + 64) {
6 for (
int c5 = 0; c5 <= 31; c5 += 1)
7 for (
int c6 = 0; c6 <= min(31, length - c3); c6 += 1)
8 S_0(
c0,
c2 + c5, c3 + c6 - 1);
9 }
else if (2 *
c2 >= c3 + 32) {
10 for (
int c5 = 0; c5 <= min(31, length -
c2 - 1); c5 += 1)
11 for (
int c6 = max(0, -c3 + 1); c6 <= min(31, length - c3); c6 += 1)
12 S_0(
c0,
c2 + c5, c3 + c6 - 1);
14 for (
int c4 = 0; c4 <= min(min(31, length - 2), (c3 / 2) + 14); c4 += 1) {
15 if (
c2 == 0 && c4 == 0)
16 for (
int c6 = max(0, -c3 + 1); c6 <= min(31, length - c3); c6 += 1)
17 S_0(
c0, 0, c3 + c6 - 1);
18 if (c3 == 2 *
c2 + 32 && c4 == 0)
19 for (
int c5 = max(0, -
c2 + 1); c5 <= 15; c5 += 1)
20 for (
int c6 = 0; c6 <= min(31, length - 2 *
c2 - 32); c6 += 1)
21 S_0(
c0,
c2 + c5, 2 *
c2 + c6 + 31);
22 for (
int c5 = max((c3 / 2) -
c2, -
c2 + c4 + 1); c5 <= min(length -
c2 - 1, (c3 / 2) -
c2 + 15); c5 += 1) {
24 for (
int c6 = max(0, -c3 + 1); c6 <= min(length - c3, 2 *
c2 - c3 + 2 * c5 - 1); c6 += 1)
25 S_0(
c0,
c2 + c5, c3 + c6 - 1);
27 if (c4 == 0 && length >= 2 *
c2 + 2 * c5)
28 S_0(
c0,
c2 + c5, 2 *
c2 + 2 * c5 - 1);
30 for (
int c6 = 2 *
c2 - c3 + 2 * c5 + 1; c6 <= min(31, length - c3); c6 += 1)
31 S_0(
c0,
c2 + c5, c3 + c6 - 1);
33 if (c3 == 2 *
c2 && c4 == 0) {
34 for (
int c5 = 16; c5 <= min(31, length -
c2 - 1); c5 += 1)
35 for (
int c6 = max(0, -2 *
c2 + 1); c6 <= min(31, length - 2 *
c2); c6 += 1)
36 S_0(
c0,
c2 + c5, 2 *
c2 + c6 - 1);
37 if (length <= 15 &&
c2 == 0)
41 if (length == 1 &&
c2 == 0 && c3 == 0) {
47 if (length >=
c2 + 16 &&
c2 + 31 >= length && 2 *
c2 >= length + 1)
48 for (
int c4 = 0; c4 <= 31; c4 += 1)
49 for (
int c5 = 0; c5 <= 15; c5 += 1)
52 if (length >= 1 &&
c2 + 31 >= length) {
53 if (
c2 + 16 == length) {
55 }
else if (
c2 == length) {
57 }
else if ((length -
c2 + 15) % 16 <= 14 && length >= 2 * ((length -
c2 + 15) % 16) + 3 && length % 16 == ((length -
c2 + 15) % 16) + 1) {
58 for (
int c4 = 0; c4 <= min(31, length - 2); c4 += 1) {
59 for (
int c5 = max(-
c2 + c4 + 1, -((length -
c2 + 15) % 16) + length -
c2 - 1); c5 < length -
c2; c5 += 1)
65 }
else if (length >=
c2 + 32) {
66 for (
int c3 = max(2 *
c2, ((-length + 1055) % 32) + length + 1); c3 <= 2 *
c2 + 62; c3 += 32)
67 for (
int c4 = 0; c4 <= 31; c4 += 1)
68 for (
int c5 = (c3 / 2) -
c2; c5 <= (c3 / 2) -
c2 + 15; c5 += 1)
71 if (length == 0 &&
c2 == 0)
74 for (
int c1 = 32;
c1 < length - 1;
c1 += 32)
75 for (
int c2 =
c1;
c2 < length;
c2 += 32)
76 for (
int c3 =
c2; c3 <= min(length - 1,
c2 + 31); c3 += 16)
77 for (
int c4 = 0; c4 <= min(min(31, length -
c1 - 2), -
c1 + c3 + 14); c4 += 1)
78 for (
int c5 = max(-
c2 + c3,
c1 -
c2 + c4 + 1); c5 <= min(length -
c2 - 1, -
c2 + c3 + 15); c5 += 1)