8dbd63fd0fb058ac4a4d5ca0aa0ede902da4c8a0
1 for (int c0
= 0; c0
<= 5 * n
; c0
+= 1)
2 for (int c1
= max(-((n
+ c0
+ 1) % 2) - n
+ c0
+ 1, 2 * floord(c0
- 1, 3) + 2); c1
<= min(n
+ c0
- (n
+ c0
+ 2) / 3, c0
); c1
+= 2)
3 S1((-2 * c0
+ 3 * c1
) / 2, c0
- c1
);