For heavy-light decomposition -
http://wcipeg.com/wiki/Heavy-light_decomposition
For heavy-light decomposition -
http://wcipeg.com/wiki/Heavy-light_decomposition
I have found a nice implementation of Dijkstra’s algorithm using c++. Please , have a look at the following link:
Matrix exponentiation : Â I, ME AND MYSELF !!!: Matrix Exponentiation
related problem : Long walks from Office to Home Sweet Home | Practice Problems
Really good work.
God Bless you and you will win IOI 
GRUNDY NUMBERS-
Superb initiative !! Keep it up
I hope i will help you
persistent segment tree: Explanation with basic code, tutorial with implementations of spoj and codechef problems by Anudeep Nekkanti
Try this for classical problems of dp(interactive tutorial)
Very useful stuff ![]()
More on Fenwick tree…might help
For Tower of Hanoi, I suggest you link it to Tower of Hanoi - Wikipedia. The link you specified only gives the code for it and does attempt to explain the problem. The Wikipedia link explains it properly.
I will try to help you by solving some of the questions myself.
This is awesome work. Thank you everyone!
and i thought i would suggest this: CS 97SI: Introduction to Programming Contests for some of the main topics. It was Stanford’s course meant specifically for programming competitions. It helped me a lot. Sorry, if is present in the list already ! ![]()
http://www.comp.nus.edu.sg/~stevenha/visualization/index.html
This contains nice illustrations.
Thanks brother, this is a treasure 
Thank you so much.
To understand how algorithms word, link below is very useful,
VisuAlgo - visualising data structures and algorithms through animation