create a segment tree with only node i

b = 0, e = 2^LOG - 1 O(LOG 2^LOG)

returns the longest proper prefix array of pattern p where lps[i]=longest proper prefix which is also suffix of p[0...i]

given specific nodes, construct a compressed directed tree with these vertices(if needed some other nodes included) returns the nodes of the tree node

check if solution exists for some (p, q)

O(n) returns root of the tree has max heap property

Checks if x is a power of 2

O(n*2^n)

closest point from line l2 to line l1

ax = b (mod m)

ans[k] = [a[0]; a[1], ..., a[k]]

number of solutions to ax + by + cz = n s.t. x, y, z >= 0 a, b, c >= 1, a, b and c are pairwise coprime O(log(max(a, b, c)));

count of numbers in [l, r] equal to k

number of length n sequences with elements in [0, 2^k) such that no subset has xor 0 = number of length n independent subsets of elements in [0, 2^k)

number of length n sequences with elements in [0, 2^k) such that no subset has xor 1

number of length n sequences with elements in [0, 2^k) such that no subset has xor 1 and its basis has size r not sure for general q, maybe also multi

cut the left part of the line from point a to point b

degrees, precalc it m.sqrt(m)

m.sqrt(m)

ans[k] = sum(a[i] * b[j]) over 0 <= i < n and j - i = k

https://en.wikipedia.org/wiki/Negative_base

Decomposes sequence S = { (a*k + b) % m | 0 <= k < n } into O(sqrt(m)) disjoint arithmetic progressions (non-wrapping). Preconditions: gcd(a, m) = 1

Deleting a node

number of edges