cycle decomposition of the k-th power of p

a^k % x^n

N > k1 + k2

N > k1 + k2

p is prime

g is a primitive root modulo p if and only if for any integer a such that gcd(a, p) = 1, there exists an integer k such that: g^k = a(mod p). primitiv

print current array values serially

Prints the positions of all set (1) bits in binary representation of x

Computes x^s + x^{s+d} + x^{s+2d} + ... + x^{s+(n-1)d}

projection point c onto line through a and b assuming a != b

minimum distance point from point c to segment ab that lies on segment ab

(slope dec+query min), (slope inc+query max) -> x increasing (slope dec+query max), (slope inc+query min) -> x decreasing

maximum sum of linearly independent vectors

layer = LOG - 1 return sum of a[p ^ x] over all i <= p <= j O(LOG)

returns answer for corresponding types of query

range sum query

(x+1)*(x+2)*(x+3)...(x+n) O(n log n) only for ntt friendly primes otherwise use divide and conquer in O(n log^2 n)

starting point as and direction vector ad