2
2
for (int c1 = 0; c1 < N; c1 += 1)
4
4
for (int c1 = 0; c1 <= floord(T - 1, 500); c1 += 1)
6
for (int c3 = max(0, -((N + c2) % 2) - N - 1000 * c1 + c2 + 2); c3 <= min(min(2 * T - 1000 * c1 - 2, 998), -1000 * c1 + c2 - 2); c3 += 2) {
6
for (int c3 = max(-((N + c2) % 2) - N - 1000 * c1 + c2 + 2, 0); c3 <= min(min(998, 2 * T - 1000 * c1 - 2), -1000 * c1 + c2 - 2); c3 += 2) {
7
7
s1(2, 1000 * c1 + c3, 0, -1000 * c1 + c2 - c3, 1);
8
8
s2(2, 1000 * c1 + c3 + 1, 0, -1000 * c1 + c2 - c3 - 1, 1);
11
11
s1(2, -(c2 % 2) + c2, 0, c2 % 2, 1);