Concepts4
⚙️AlgorithmIntermediate
Overflow Prevention Techniques
Integer overflow happens when a computed value exceeds the range of its type; in C++ this silently wraps for unsigned and is undefined for signed, so prevention is crucial.
#overflow prevention#long long#__int128+11
∑MathIntermediate
Fast Exponentiation
Fast exponentiation (binary exponentiation) computes a^n using repeated squaring in O(log n) multiplications.
#binary exponentiation#fast power#modular exponentiation+11
∑MathIntermediate
Chinese Remainder Theorem
The Chinese Remainder Theorem (CRT) reconstructs an integer from its remainders modulo pairwise coprime moduli and guarantees a unique answer modulo the product.
#chinese remainder theorem#crt#modular arithmetic+12
⚙️AlgorithmIntermediate
Polygon Area and Centroid
The signed area of a simple polygon can be computed in O(n) using the shoelace formula, which sums cross products of consecutive vertices.
#shoelace formula#polygon area#centroid+12