Tags → #cp
-
Week 6 Day 5: The Grand Finale - Hard Problems
Combining everything we learned. 3 classic problems that require Number Theory, Probability, and Geometry.
-
Week 6 Day 4: Bit Manipulation - The Binary Magic
XOR tricks, subset iteration, and low-level optimizations that save the day.
-
Week 6 Day 3: Convex Hull - Fencing the Points
Finding the smallest convex polygon containing all points. The Graham Scan and Monotone Chain algorithms.
-
Week 6 Day 2: Cross Product - Orientation and Area
How to tell if a turn is Left or Right? Calculating Polygon Areas.
-
Week 6 Day 1: Computational Geometry - Vectors and Dot Product
Geometry doesn’t have to be scary. Learn the basics of Vectors and how the Dot Product finds angles and projections.
-
Week 5 Day 5: Primality Testing - The Probabilistic Approach
How to check if a 18-digit number is prime in milliseconds. The Miller-Rabin test.
-
Week 5 Day 4: Linear Diophantine Equations - Integer Only Solutions
How to find all integer solutions to Ax + By = C. Solving word problems involving coins, weights, and measures.
-
Week 5 Day 3: Extended Euclidean Algorithm - Beyond GCD
Standard GCD finds the divisor. Extended GCD finds how to combine numbers to get that divisor.
-
Week 5 Day 2: Euler’s Totient Function - The Heart of Cryptography
Counting coprime numbers. Unlocking the power of a^phi(n) = 1 (mod n) and its role in RSA.
-
Week 5 Day 1: Chinese Remainder Theorem (CRT) - Unlocking the Universe
How to solve a system of simultaneous congruences. Find a number that leaves specific remainders.