2 for (int c0
= -27 * n
+ 2; c0
<= 1; c0
+= 1)
4 for (int c0
= 2; c0
<= min(2 * n
, n
+ 29); c0
+= 1) {
5 if (2 * n
>= c0
+ 1 && c0
>= 3)
6 S4(c0
- c0
/ 2 - 1, c0
/ 2 + 1);
7 if (c0
+ 2 >= 2 * n
&& 2 * n
>= c0
+ 1) {
8 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
10 } else if (2 * n
>= c0
+ 3 && c0
>= 5) {
11 S4(c0
- c0
/ 2 - 2, c0
/ 2 + 2);
12 for (int c2
= 1; c2
< c0
- c0
/ 2 - 1; c2
+= 1)
13 S5(c0
- c0
/ 2 - 1, c0
/ 2 + 1, c2
);
15 for (int c1
= -c0
+ c0
/ 2 + 3; c1
<= min(-1, n
- c0
); c1
+= 1) {
17 S6(-c1
+ 2, c0
+ c1
- 2);
18 for (int c2
= 1; c2
<= -c1
; c2
+= 1)
19 S5(-c1
+ 1, c0
+ c1
- 1, c2
);
21 if (2 * n
>= c0
+ 3 && c0
>= n
+ 2) {
22 S6(-n
+ c0
+ 1, n
- 1);
23 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
26 if (2 * n
>= c0
+ 1 && c0
>= n
+ 3) {
29 if (n
+ 1 >= c0
&& c0
>= 5) {
32 } else if (c0
<= 4 && c0
>= 3 && n
+ 1 >= c0
)
34 if (n
+ 1 >= c0
&& c0
>= 3) {
36 } else if (c0
== n
+ 2 && n
>= 3) {
45 } else if (c0
== 4 && n
== 2)
49 for (int c1
= max(1, -n
+ c0
); c1
< (c0
+ 1) / 2; c1
+= 1)
52 for (int c0
= max(2 * n
+ 1, -27 * n
+ 2); c0
<= n
+ 29; c0
+= 1)
54 for (int c0
= n
+ 30; c0
<= 2 * n
; c0
+= 1) {
55 if (2 * n
>= c0
+ 1) {
56 S4(c0
- c0
/ 2 - 1, c0
/ 2 + 1);
57 if (c0
+ 2 >= 2 * n
) {
58 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
61 S4(c0
- c0
/ 2 - 2, c0
/ 2 + 2);
62 for (int c2
= 1; c2
< c0
- c0
/ 2 - 1; c2
+= 1)
63 S5(c0
- c0
/ 2 - 1, c0
/ 2 + 1, c2
);
65 for (int c1
= -c0
+ c0
/ 2 + 3; c1
<= n
- c0
; c1
+= 1) {
67 S6(-c1
+ 2, c0
+ c1
- 2);
68 for (int c2
= 1; c2
<= -c1
; c2
+= 1)
69 S5(-c1
+ 1, c0
+ c1
- 1, c2
);
71 if (2 * n
>= c0
+ 3) {
72 S6(-n
+ c0
+ 1, n
- 1);
73 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
80 for (int c1
= -n
+ c0
; c1
< (c0
+ 1) / 2; c1
+= 1)