1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
{
for (int c0 = -27 * n + 2; c0 <= 1; c0 += 1)
S1(c0 - 1);
for (int c0 = 2; c0 <= min(n + 29, 2 * n); c0 += 1) {
if (2 * n >= c0 + 1 && c0 >= 3)
S4(c0 - c0 / 2 - 1, c0 / 2 + 1);
if (2 * n >= c0 + 1 && c0 + 2 >= 2 * n) {
for (int c2 = 1; c2 < -n + c0; c2 += 1)
S5(-n + c0, n, c2);
} else if (2 * n >= c0 + 3 && c0 >= 5) {
S4(c0 - c0 / 2 - 2, c0 / 2 + 2);
for (int c2 = 1; c2 < (c0 + 1) / 2 - 1; c2 += 1)
S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2);
}
for (int c1 = -c0 + c0 / 2 + 3; c1 <= min(n - c0, -1); c1 += 1) {
S4(-c1, c0 + c1);
S6(-c1 + 2, c0 + c1 - 2);
for (int c2 = 1; c2 <= -c1; c2 += 1)
S5(-c1 + 1, c0 + c1 - 1, c2);
}
if (2 * n >= c0 + 3 && c0 >= n + 2) {
S6(-n + c0 + 1, n - 1);
for (int c2 = 1; c2 < -n + c0; c2 += 1)
S5(-n + c0, n, c2);
}
if (2 * n >= c0 + 1 && c0 >= n + 3) {
S6(-n + c0, n);
} else {
if (n + 1 >= c0 && c0 >= 5) {
S6(2, c0 - 2);
S1(c0 - 1);
} else if (c0 <= 4 && c0 >= 3 && n + 1 >= c0)
S1(c0 - 1);
if (n + 1 >= c0 && c0 >= 3)
S6(1, c0 - 1);
}
if (c0 >= n + 3) {
S1(c0 - 1);
} else if (c0 == n + 2 && n >= 3) {
S6(2, n);
S1(n + 1);
}
if (c0 == 2) {
S1(1);
} else if (c0 == 4 && n == 2)
S1(3);
if (c0 % 2 == 0)
S3(c0 / 2);
for (int c1 = max(-n + c0, 1); c1 < (c0 + 1) / 2; c1 += 1)
S2(c0 - c1, c1);
}
for (int c0 = n + 30; c0 <= 2 * n; c0 += 1) {
if (2 * n >= c0 + 1) {
S4(c0 - c0 / 2 - 1, c0 / 2 + 1);
if (c0 + 2 >= 2 * n) {
for (int c2 = 1; c2 < -n + c0; c2 += 1)
S5(-n + c0, n, c2);
} else {
S4(c0 - c0 / 2 - 2, c0 / 2 + 2);
for (int c2 = 1; c2 < (c0 + 1) / 2 - 1; c2 += 1)
S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2);
}
for (int c1 = -c0 + c0 / 2 + 3; c1 <= n - c0; c1 += 1) {
S4(-c1, c0 + c1);
S6(-c1 + 2, c0 + c1 - 2);
for (int c2 = 1; c2 <= -c1; c2 += 1)
S5(-c1 + 1, c0 + c1 - 1, c2);
}
if (2 * n >= c0 + 3) {
S6(-n + c0 + 1, n - 1);
for (int c2 = 1; c2 < -n + c0; c2 += 1)
S5(-n + c0, n, c2);
}
S6(-n + c0, n);
}
if (c0 % 2 == 0)
S3(c0 / 2);
for (int c1 = -n + c0; c1 < (c0 + 1) / 2; c1 += 1)
S2(c0 - c1, c1);
}
for (int c0 = max(2 * n + 1, -27 * n + 2); c0 <= n + 29; c0 += 1)
S1(c0 - 1);
}
|
