29470ed2452ecf3b208bb84e1e7d04c2baa88750
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 (2 * n
>= c0
+ 1 && c0
+ 2 >= 2 * n
) {
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
+ 1) / 2 - 1; c2
+= 1)
13 S5(c0
- c0
/ 2 - 1, c0
/ 2 + 1, c2
);
15 for (int c1
= -c0
+ c0
/ 2 + 3; c1
<= min(n
- c0
, -1); c1
+= 1) {
16 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 (c0
>= n
+ 2 && 2 * n
>= c0
+ 3) {
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)
30 } else if (c0
== n
+ 2 && n
>= 3) {
34 if (c0
>= 5 && n
+ 1 >= c0
) {
37 } else if (n
+ 1 >= c0
&& c0
>= 3)
39 if (c0
>= 3 && n
+ 1 >= c0
)
44 } else if (c0
== 4 && n
== 2)
48 for (int c1
= max(-n
+ c0
, 1); c1
< (c0
+ 1) / 2; c1
+= 1)
51 for (int c0
= max(-27 * n
+ 2, 2 * n
+ 1); c0
<= n
+ 29; c0
+= 1)
53 for (int c0
= n
+ 30; c0
<= 2 * n
; c0
+= 1) {
54 if (2 * n
>= c0
+ 1) {
55 S4(c0
- c0
/ 2 - 1, c0
/ 2 + 1);
56 if (c0
+ 2 >= 2 * n
) {
57 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
60 S4(c0
- c0
/ 2 - 2, c0
/ 2 + 2);
61 for (int c2
= 1; c2
< (c0
+ 1) / 2 - 1; c2
+= 1)
62 S5(c0
- c0
/ 2 - 1, c0
/ 2 + 1, c2
);
64 for (int c1
= -c0
+ c0
/ 2 + 3; c1
<= n
- c0
; c1
+= 1) {
65 S6(-c1
+ 2, c0
+ c1
- 2);
67 for (int c2
= 1; c2
<= -c1
; c2
+= 1)
68 S5(-c1
+ 1, c0
+ c1
- 1, c2
);
70 if (2 * n
>= c0
+ 3) {
71 S6(-n
+ c0
+ 1, n
- 1);
72 for (int c2
= 1; c2
< -n
+ c0
; c2
+= 1)
79 for (int c1
= -n
+ c0
; c1
< (c0
+ 1) / 2; c1
+= 1)