2 for (int c1
= 0; c1
<= 1; c1
+= 1)
7 for (int c3
= 0; c3
< N
; c3
+= 1)
9 for (int c1
= 0; c1
<= floord(T
- 1, 1000); c1
+= 1)
10 for (int c2
= 1000 * c1
+ 1; c2
<= min(N
+ 1000 * c1
+ 997, N
+ T
- 3); c2
+= 1)
11 for (int c3
= max(-N
- 1000 * c1
+ c2
+ 2, 0); c3
<= min(min(-1000 * c1
+ c2
- 1, 999), T
- 1000 * c1
- 1); c3
+= 1)
12 s1(2, 1000 * c1
+ c3
, 1, -1000 * c1
+ c2
- c3
, 1);