- for (s = 1 << 23; s; s /= 2, d = d * 1L * d % m)
- if (s < N)
- for (p = t; p < t + N; p += s)
- for (i = s, c = 1; i; i--)
- b = *p + p[s], p[s] = (m + *p - p[s]) *
- 1L * c % m, *p++ = b % m, c = c * 1L * d % m;
- for (j = 0; i < N - 1;)
- {
- for (s = N / 2; !((j ^= s) & s); s /= 2);
- if (++i < j)
- a = t[i], t[i] = t[j], t[j] = a;
- }
+ for (s = 1 << 23; s; s /= 2, d = d * 1L * d % m)
+ if (s < N)
+ for (p = t; p < t + N; p += s)
+ for (i = s, c = 1; i; i--)
+ b = *p + p[s], p[s] = (m + *p - p[s]) *
+ 1L * c % m, *p++ = b % m, c = c * 1L * d % m;
+
+ for (j = 0; i < N - 1;)
+ {
+ for (s = N / 2; !((j ^= s) & s); s /= 2)
+ ;
+
+ if (++i < j)
+ a = t[i], t[i] = t[j], t[j] = a;
+ }