reverse update

add operation

line form: direction vec [cross] (x, y) = c

p = o + k * d (k is a real parameter)

credit: KokiYmgch

values are distinct find the maximum area triangle, given are lengths

populate and save the correct, wrong and generator files

Given a code it will congest the code but the code will remain compilable. You can use it when you want to save some space in your 25 pages codebook.

Given a tree with n nodes, find the maximum of sum of all pair distances of k nodes

property: g(i) = g(i - 1) ^ (1 << lsb(i))

compute the factorization of (x^N - 1)

number of subsets of an array of n elements having sum equal to k for each k from 1 to m

Find \sum{i = 0}{n - 1}{a^i * i^k}

transition -> for(i = 0; i < k; i++) f[n] += tr[i] * f[n-i-1] here tr[i] is a polynomial. order = k and degree = degree of tr[i] given first few value