sum of occurrences of all patterns in this string

returns the continued fraction of p / q [a[0]; a[1], ..., a[n]] = a[0] + 1 / (a[1] + 1 / (a[2] + ...) + 1 / (a[n - 1] + 1 / a[n])))) a[0] is integer n

h(p^k) = -p^k / (k * (k - 1))

returns index of node curr

get the ith value of the rth array

get the ith value of the rth array

all nodes are from 1 to n returns edges of the gomory hu tree

consider half-plane of counter-clockwise side of each line if lines are not bounded add infinity rectangle returns a convex polygon, a point can occur

consider half-plane of counter-clockwise side of each line if lines are not bounded add infinity rectangle returns a convex polygon, a point can occur

insert val in position a[pos] so all previous values from pos to last will be right shifted

integrate in range [l, r]

intersecting AP of two APs: (a1 + d1x) and (a2 + d2x)

permanent after inverting mat[i][j] = mat[i][j] ^ inv[j][i]

Checks if x is even or odd

0 if not parallel, 1 if parallel, 2 if collinear

-1 if strictly inside, 0 if on the polygon, 1 if strictly outside

-1 if strictly inside, 0 if on the polygon, 1 if strictly outside

returns true if point p is on line segment ab

Beware!! p[i] = k won't change the value of p.a[i]

Beware!! p[i] = k won't change the value of p.a[i]

Beware!! p[i] = k won't change the value of p.a[i]

Beware!! p[i] = k won't change the value of p.a[i]

returns matches in vector ans in 0-indexed

kth smallest subset xor, 1st is 0

kth smallest element in [l, r] for array [1,2,1,3,5] 2nd smallest is 1 and 3rd smallest is 2

assuming this number is >= 0, find the kth digit in the base b

number of integer solutions to ax + by <= c s.t. x, y >= 0 number of nonnegative integer lattice points under or on the line ax + by = c

intersection point between ab and cd assuming unique intersection exists

returns nCr modulo mod where mod is a prime Complexity: log(n)