1for (
int c0 = 0;
c0 <= 2;
c0 += 1)
2 for (
int c1 = max(max(0, -4 * b0 - 4 *
c0 + 1), -2 *
c0 + b0 / 2);
c1 <= 1;
c1 += 1) {
3 if (b0 >= 1 && 4 *
c0 +
c1 >= 1)
4 for (
int c2 = 1;
c2 <= 2;
c2 += 1)
5 for (
int c3 = 1; c3 <= 14; c3 += 1)
6 write(
c0,
c1, 8 * b0 +
c2 - 5, c3);
8 for (
int c2 = max(max(3, -8 * b0 + 6), 8 *
c0 - 2 *
c1 - 10);
c2 <= min(min(7, 8 *
c0 + 6), -8 *
c0 + 2 *
c1 + 22);
c2 += 1)
9 if (4 *
c0 +
c1 + 1 >= 2 * ((2 *
c1 +
c2 - 1) / 4) && (2 *
c1 +
c2 - 1) % 4 >= 1 && ((2 *
c1 +
c2 - 1) % 4) + 11 >= 2 *
c2)
10 for (
int c3 = 1; c3 <= 14; c3 += 1)
11 write(
c0,
c1, 8 * b0 +
c2 - 5, c3);