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
calculating nCr
also RMQ is more clearly described here
For edit Distance:-
Dynamic Programming Algorithm, Edit Distance and for introduction:
Wagner–Fischer algorithm - Wikipedia
please post some links of tutorials on voronoi diagrams,online construction of 3D convex hull,deunay triangulation and other computational geometry algorithms which are commonly used.Thanks in advance.
Can someone add more links to DP optimization techniques?