1 for (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 for (int c5 = 0; c5 <= min(31, length - c2 - 1); c5 += 1) { 6 for (int c6 = max(0, -c3 + 1); c6 <= min(min(31, length - c3), 2 * c2 - c3 + 2 * c5 - 1); c6 += 1) 7 S_0(c0, c2 + c5, c3 + c6 - 1); 8 if (c2 + c5 >= 1 && 2 * c2 + 2 * c5 >= c3 && c3 + 30 >= 2 * c2 + 2 * c5) { 9 S_3(c0, 0, c2 + c5); 10 if (length >= 2 * c2 + 2 * c5) 11 S_0(c0, c2 + c5, 2 * c2 + 2 * c5 - 1); 12 } 13 for (int c6 = max(0, 2 * c2 - c3 + 2 * c5 + 1); c6 <= min(31, length - c3); c6 += 1) 14 S_0(c0, c2 + c5, c3 + c6 - 1); 15 } 16 if (length <= 15 && c2 == 0 && c3 == 0) 17 S_4(c0); 18 if (c3 >= 2 * c2 && 2 * c2 + 32 >= c3) 19 for (int c4 = 1; c4 <= min(min(31, length - 2), (c3 / 2) + 14); c4 += 1) 20 for (int c5 = max((c3 / 2) - c2, -c2 + c4 + 1); c5 <= min(length - c2 - 1, (c3 / 2) - c2 + 15); c5 += 1) 21 S_3(c0, c4, c2 + c5); 22 } 23 for (int c3 = max(2 * c2, -(length % 32) + length + 32); c3 <= min(2 * length - 2, 2 * c2 + 62); c3 += 32) 24 for (int c4 = 0; c4 <= min(31, length - 2); c4 += 1) { 25 for (int c5 = max((c3 / 2) - c2, -c2 + c4 + 1); c5 <= min(length - c2 - 1, (c3 / 2) - c2 + 15); c5 += 1) 26 S_3(c0, c4, c2 + c5); 27 if (c3 + 30 >= 2 * length && c4 == 0) 28 S_4(c0); 29 } 30 if (c2 + 16 == length) 31 S_4(c0); 32 } else if (length >= 32) { 33 S_4(c0); 34 } else { 35 S_4(c0); 36 } 37 } 38 for (int c1 = 32; c1 < length - 1; c1 += 32) 39 for (int c2 = c1; c2 < length; c2 += 32) 40 for (int c3 = c2; c3 <= min(length - 1, c2 + 31); c3 += 16) 41 for (int c4 = 0; c4 <= min(min(31, length - c1 - 2), -c1 + c3 + 14); c4 += 1) 42 for (int c5 = max(-c2 + c3, c1 - c2 + c4 + 1); c5 <= min(length - c2 - 1, -c2 + c3 + 15); c5 += 1) 43 S_3(c0, c1 + c4, c2 + c5); 44 } 45