b39b943f6258c8b63f554b40d52c9fa51d1c07cb
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);
8 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
11 S4(c0
- c0
/ 2 - 2, c0
/ 2 + 2);
12 for (int c2
= 1; c2
< (c0
+ 1) / 2 - 1; c2
+= 1)
13 S5(c0
- c0
/ 2 - 1, c0
/ 2 + 1, c2
);
16 for (int c1
= -c0
+ c0
/ 2 + 3; c1
<= min(n
- c0
, -1); c1
+= 1) {
18 S6(-c1
+ 2, c0
+ c1
- 2);
19 for (int c2
= 1; c2
<= -c1
; c2
+= 1)
20 S5(-c1
+ 1, c0
+ c1
- 1, c2
);
22 if (2 * n
>= c0
+ 3 && c0
>= n
+ 2) {
23 S6(-n
+ c0
+ 1, n
- 1);
24 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
31 if (c0
>= 5 && n
+ 1 >= c0
) {
34 } else if (c0
>= 3 && c0
<= 4)
36 if (c0
>= 3 && n
+ 1 >= c0
)
47 for (int c1
= max(-n
+ c0
, 1); c1
< (c0
+ 1) / 2; c1
+= 1)
50 for (int c0
= n
+ 30; c0
<= 2 * n
; c0
+= 1) {
51 if (2 * n
>= c0
+ 1) {
52 S4(c0
- c0
/ 2 - 1, c0
/ 2 + 1);
53 if (c0
+ 2 >= 2 * n
) {
54 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
57 S4(c0
- c0
/ 2 - 2, c0
/ 2 + 2);
58 for (int c2
= 1; c2
< (c0
+ 1) / 2 - 1; c2
+= 1)
59 S5(c0
- c0
/ 2 - 1, c0
/ 2 + 1, c2
);
61 for (int c1
= -c0
+ c0
/ 2 + 3; c1
<= n
- c0
; c1
+= 1) {
63 S6(-c1
+ 2, c0
+ c1
- 2);
64 for (int c2
= 1; c2
<= -c1
; c2
+= 1)
65 S5(-c1
+ 1, c0
+ c1
- 1, c2
);
67 if (2 * n
>= c0
+ 3) {
68 S6(-n
+ c0
+ 1, n
- 1);
69 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
76 for (int c1
= -n
+ c0
; c1
< (c0
+ 1) / 2; c1
+= 1)