Different order of Binary tree: Recursion
Read Source Code

Recent Posts
Archives
Categories
Meta
Different order of Binary tree: Recursion
Read Source Code
Pick’s theorem
Read Source Code
Breadth First + Brute Force Search.
Read Source Code
Eulerian Tours
Read Source Code
Find all [all1 square] in a matrix.
Classic Dynamic Programming.
range.cpp
Read Source Code
5dimensional dynamic programming.
Sounds hard, but actually it’s not.
First, I though it was a FloydWarshall. But complexity is O(800^3) = TLE
I have two methods.
1. SPFA(shortest path faster algorithm, actually it’s a BellmanFord with queue)
2. Dijkstra + Heap
Read Source Code
use, string, set, queue. Just a sample dfs.
Read Source Code