maximum distance from any point on the perimeter to another point on the perimeter

<independant splay tree code>

returns any or all numbers x such that x ^ k = a (mod m) existence: a = 0 is trivial, and if a > 0: a ^ (phi(m) / gcd(k, phi(m))) == 1 mod m if soluti

minimum distance from convex polygon p to line ab returns 0 is it intersects with the polygon top - upper right vertex

minimum distance from a convex polygon to another convex polygon the polygon doesnot overlap or touch tested in https://toph.co/p/the-wall

minimum distance from segment ab to segment cd

triangles are solid

n=n/(1<<x)

erase the i-th element

reachability tree

returns representative of the 2-edge-connected component u is in

returns representative of the bridge tree u is in

occurrences of s[p, ..., p + len - 1]

\sum{k=1}^{n}{floor(n/k)} count of numbers such that n/i = k -> n/k - n/(k+1)

fast mobius transform. turns or convolution into point-wise multiplication

3^BIT, it must be a power of 3