| 1 | for (int c0 = p; c0 <= min(m - 1, q); c0 += 1) |
|---|---|
| 2 | S2(c0); |
| 3 | for (int c0 = m; c0 <= min(n, p - 1); c0 += 1) |
| 4 | S1(c0); |
| 5 | for (int c0 = max(m, p); c0 <= min(n, q); c0 += 1) { |
| 6 | S1(c0); |
| 7 | S2(c0); |
| 8 | } |
| 9 | for (int c0 = max(max(m, n + 1), p); c0 <= q; c0 += 1) |
| 10 | S2(c0); |
| 11 | for (int c0 = max(max(m, p), q + 1); c0 <= n; c0 += 1) |
| 12 | S1(c0); |
| 13 |