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