31 lines · c
1for (int c1 = 0; c1 <= min(np1 - i, -i + 1); c1 += 1) {2 S_9(c1);3 S_12(c1);4}5for (int c1 = max(0, -i + 2); c1 <= -((-np1 + i + 4294967295) % 4294967296) + 4294967295; c1 += 1) {6 S_9(c1);7 S_10(c1);8 for (int c3 = 0; c3 <= min(19, i + c1 - 3); c3 += 1) {9 S_15(c1, c3);10 for (int c5 = 0; c5 < c3; c5 += 1) {11 S_16(c1, c3, c5);12 S_17(c1, c3, c5);13 }14 S_16(c1, c3, c3);15 S_18(c1, c3);16 S_24(c1, c3);17 S_19(c1, c3);18 }19 if (i + c1 <= 21) {20 S_15(c1, i + c1 - 2);21 for (int c5 = 0; c5 < i + c1 - 2; c5 += 1) {22 S_16(c1, i + c1 - 2, c5);23 S_17(c1, i + c1 - 2, c5);24 }25 S_16(c1, i + c1 - 2, i + c1 - 2);26 S_18(c1, i + c1 - 2);27 S_24(c1, i + c1 - 2);28 }29 S_12(c1);30}31