Practice

I love challenges or in other words, tough nuts to crack. Here are some of my solutions to exercises from usaco, codeforces, etc. My solutions might not be the most efficient ones, but I did on my own and had a lot of fun.

Programming Contest Problem Types

source from usaco

Have learned:

• Greedy
• Minimum Spanning
• Shortest Path
• Ad Hoc Problem (I don't think there is a good way to learn this)

Have NOT learned:

• Dynamic Programming
• Complete Search
• Flood Fill
• Shortest Path
• Recursive Search Techniques
• Minimum Spanning Tree
• Knapsack
• Computational Geometry
• Network Flow
• Eulerian Path
• Two-Dimensional Convex Hull
• BigNums
• Heuristic Search
• Approximate Search

Updates:

• 02/07/2016 start my journey
• 05/07/2016 (usaco) Section1.1 ride.c gitf1.c
• 07/07/2016 (usaco) Section1.1 friday.c
• 20/02/2017 (cf) Theatre Square
• 24/02/2017 (poj) a+b
• 24/02/2017 (cc) a+b
• 27/02/2017 (usaco) test, ride

TODO:

• improve C++/C skills (pinned)
• understand input/output stream
• understand gcc/g++
• g++ usage
• rewrite usaco PROB greedy, friday, necklace in C++11