18 lines
469 B
C
18 lines
469 B
C
{
|
|
for (int c3 = 1; c3 <= n; c3 += 1)
|
|
s2(c3);
|
|
for (int c0 = 0; c0 < n - 1; c0 += 1) {
|
|
for (int c3 = 0; c3 < n - c0 - 1; c3 += 1)
|
|
s0(c0 + 1, n - c3);
|
|
for (int c3 = 0; c3 < n - c0 - 1; c3 += 1)
|
|
for (int c6 = c0 + 2; c6 <= n; c6 += 1)
|
|
s1(c0 + 1, n - c3, c6);
|
|
}
|
|
for (int c0 = n - 1; c0 < 2 * n - 1; c0 += 1) {
|
|
if (c0 >= n)
|
|
for (int c2 = -n + c0 + 2; c2 <= n; c2 += 1)
|
|
s3(c2, -n + c0 + 1);
|
|
s4(-n + c0 + 2);
|
|
}
|
|
}
|