2 for (int c0
= -27 * n
+ 2; c0
<= 1; c0
+= 1)
4 for (int c0
= 2; c0
<= n
+ 29; c0
+= 1) {
6 S4(c0
- c0
/ 2 - 1, c0
/ 2 + 1);
7 if (c0
>= 5 && 2 * n
>= c0
+ 3) {
8 S4(c0
- c0
/ 2 - 2, c0
/ 2 + 2);
9 for (int c2
= 1; c2
< c0
- c0
/ 2 - 1; c2
+= 1)
10 S5(c0
- c0
/ 2 - 1, c0
/ 2 + 1, c2
);
12 for (int c1
= -c0
+ c0
/ 2 + 3; c1
<= min(-1, n
- c0
); c1
+= 1) {
14 S6(-c1
+ 2, c0
+ c1
- 2);
15 for (int c2
= 1; c2
<= -c1
; c2
+= 1)
16 S5(-c1
+ 1, c0
+ c1
- 1, c2
);
18 if (2 * n
>= c0
+ 3 && c0
>= n
+ 2) {
19 S6(-n
+ c0
+ 1, n
- 1);
20 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
26 } else if (c0
+ 2 >= 2 * n
)
27 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
35 } else if (n
+ 1 >= c0
) {
46 for (int c1
= max(1, -n
+ c0
); c1
< (c0
+ 1) / 2; c1
+= 1)
49 for (int c0
= n
+ 30; c0
<= 2 * n
; c0
+= 1) {
50 if (2 * n
>= c0
+ 1) {
51 S4(c0
- c0
/ 2 - 1, c0
/ 2 + 1);
52 if (c0
+ 2 >= 2 * n
) {
53 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
56 S4(c0
- c0
/ 2 - 2, c0
/ 2 + 2);
57 for (int c2
= 1; c2
< c0
- c0
/ 2 - 1; c2
+= 1)
58 S5(c0
- c0
/ 2 - 1, c0
/ 2 + 1, c2
);
60 for (int c1
= -c0
+ c0
/ 2 + 3; c1
<= n
- c0
; c1
+= 1) {
62 S6(-c1
+ 2, c0
+ c1
- 2);
63 for (int c2
= 1; c2
<= -c1
; c2
+= 1)
64 S5(-c1
+ 1, c0
+ c1
- 1, c2
);
66 if (2 * n
>= c0
+ 3) {
67 S6(-n
+ c0
+ 1, n
- 1);
68 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
75 for (int c1
= -n
+ c0
; c1
< (c0
+ 1) / 2; c1
+= 1)