1 int m = 754974721, N, t[1 << 22], a, *p, i, e = 1 << 22, j, s, b, c, U;
4 for (s = 1 << 23; s; s /= 2, d = d * 1L * d % m)
6 for (p = t; p < t + N; p += s)
7 for (i = s, c = 1; i; i--)
8 b = *p + p[s], p[s] = (m + *p - p[s]) *
9 1L * c % m, *p++ = b % m, c = c * 1L * d % m;
10 for (j = 0; i < N - 1;)
12 for (s = N / 2; !((j ^= s) & s); s /= 2);
14 a = t[i], t[i] = t[j], t[j] = a;
25 U = U * 1L * (m + 1) / 2 % m;
27 for (p = t; p < t + N;)
28 *p++ = (*p * 1L ** p % m) * U % m;
30 for (a = 0, p = t; p < t + N;)
31 a += (6972593 & e ? 2 : 1) ** p, *p++ = a % 10, a /= 10;
39 printf ("Checksumme = %d\n", qs);