Tag
Editorial
10 posts tagged Editorial, newest first.
Editorial | CF930 / Codeforces Round 468 (Div. 1)
Editorial for a virtual-contest run of Codeforces Round 468 (Div. 1): statements, approach, and takeaways for problems A through E.
Editorial | CF986 / Codeforces Round 485 (Div. 1)
Editorial for a virtual-contest run of Codeforces Round 485 (Div. 1), covering the approach and solution for problems A through F.
Editorial: 2013 Asia Chengdu Regional Contest
Editorial for a virtual run of the 2013 ICPC Asia Chengdu Regional Contest, covering graph construction, string processing, dynamic programming, Aho-Corasick automata, and convolution.
Editorial: 2015 ACM-ICPC World Finals - Marrakech
Editorial for a virtual run of the 2015 ACM-ICPC World Finals in Marrakech, covering min-cost flow, binary search, subsequence matching, pruned BFS, and Huffman coding.
Editorial | CF297 / Codeforces Round 180 (Div. 1)
Editorial for a virtual-contest run of Codeforces Round 180 (Div. 1), covering the approach and solution for problems A through E.
Editorial | CF521 / Codeforces Round 295 (Div. 1)
Editorial for a virtual-contest run of Codeforces Round 295 (Div. 1), covering the approach and solution for problems A through E.
Editorial |「Codeforces Gym 101173B」Bipartite Blanket | Hall's Theorem / Stable Marriage Problem
Editorial for Codeforces Gym 101173B (counting perfect matching subsets in a vertex-weighted bipartite graph), with background on Hall's theorem and the stable marriage problem (Gale-Shapley algorithm).
Editorial | CF1295 / Educational Codeforces Round 81 (Div. 2)
Editorial for Educational Codeforces Round 81 (Div. 2) problems A through F, covering contest-time approach, notes on the official tutorial, and reference code.
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.