Competitive Programming Book

If you are new to programming contest, you may feel that the discussions I write in this writeup is too short and you hardly understand it. For example:

How to find the shortest path in a graph?
How to check whether a node is reachable from other node in a graph?
What are other popular graphs problems occuring in programming contest?
What is Dynamic Programming? What are the common examples of it?
And so on...

These things have become mandatory things that any contestants should know. Often, in discussions forums people discuss the key to solve a problem in one paragraph and you are expected to know the rest.

Recently, my brother and I wrote a book to help new computer science students to quickly learn the types of problems that are popular and frequently occurs in programming contests like ACM ICPC and IOI. The book discusses the important algorithms and points out a set of problems for the exercises.

For more information about this book, click a link on the right figure.