Blog
RSSNotes from building and running things, by Yein Yi.
Almost Prime - 1456. Time Complexity
Calculating the time complexity of a solution to BOJ 1456 Almost Prime
BOJ Common Divisors - 2436
Solving BOJ 2436 by finding two numbers from their GCD and LCM, with time complexity
Study I Put Off
Code for Binomial Coefficient 2 and a 2D coin-flip problem saved for later.
Divisibility Rules
Divisibility rules for the numbers 1 through 11.
AtCoder Beginner Contest 278
Notes and C++ solutions for AtCoder ABC 278 problems A through E.
Programmers LEVEL4
A solution to the Programmers Seoul restaurant SQL problem, explaining JOIN and GROUP BY.
DATABASE Study Notes
A list of SQL functions and syntax noted while studying databases.
AtCoder Beginner Contest 281
Solutions and code for AtCoder ABC 281 problems A to E
Shortening Dijkstra Code on Grids
A simpler way to write Dijkstra on grid problems where edge costs into a node are equal.
Reverse Graph
Solving BOJ 1238 Party with just two Dijkstra runs using a reverse graph
G3 Greedy Problems
Solution ideas for Baekjoon Gold 3 greedy problems.
G4 Greedy Problems
Solution ideas for Baekjoon Gold 4 greedy problems
Gold 5 Greedy Problem Patterns
A roundup of Baekjoon Gold 5 greedy problems grouped by the key idea behind each.
Cycles
DP problems with cycles, solved by splitting cases at the cycle boundary.
Bidirectional DP
A link to a bidirectional DP practice problem (BOJ 10942).

