820bd57f18a5966ec1f7aeae5efdfa26bc54b0df
1 for (int c0
= 1; c0
<= min(2 * b
- 1, n
); c0
+= 1)
2 for (int c1
= max(-n
+ 1, -b
+ 1); c1
<= min(b
- c0
, n
- c0
); c1
+= 1)
3 for (int c2
= max(c0
+ c1
, 1); c2
<= min(n
+ c1
, n
); c2
+= 1)
4 s0(-c0
- c1
+ c2
+ 1, -c1
+ c2
, c2
);