Tag
Competitive Programming
3 posts tagged Competitive Programming, newest first.
A Few Notes on Digit DP
Notes on the digit DP technique, with code for five example problems from LightOJ, HDU, and SPOJ.
Editorial | "HDU 3501" Calculation 2
Editorial for HDU 3501, using Euler's totient function to prove that the sum of numbers less than n and coprime to n equals n×φ(n)/2.
Editorial | "LightOJ 1289" LCM from 1 to n
Editorial for LightOJ 1289, computing lcm(1,2,...,n) in O(n) with a linear sieve plus a recurrence relation.