ACMSolver :: Art of Programming Contest, Tips and Tricks for C, C++, Java

• The Sachertorte Algorithm and Other Antidotes to Computer Anxiety. John Shore.
  Penguin Books, 1985. [See this book at Amazon.com]

• Introductory Computer Science: Bits of Theory and Bytes of Practice.
  A. K. Dewdney.
  Computer Science Press, 1996. [See this book at Amazon.com]

• Algorithmics: The Spirit of Computing.
  David Harel.
  3rd edition, Addison-Wesley, 2004. [See this book at Amazon.com]
• What Computing Is All About.
  Jan L. A. van de Snepscheut.
  Springer Verlag, 1993. (Errata) [See this book at Amazon.com]

• Programming Challenges: The Programming Contest Training Manual.
  Steven Skiena and Miguel Revilla.
  Springer-Verlag, 2003. [See this book at Amazon.com]

• Problems in Programming: Experience through Practice.
  Andrej Vitek, Iztok Tvrdy, Robert Reinhardt, Bojan Mohar, Marc Martinec, Tomi Dolenc and Vladimir Batagelj.
  John Wiley & Sons, 1991.

  The preface of this book explains that ”[these] competitions culminated in the International Computer Science Olympiad, held for the first time in Nova Gorica, Slovenia in 1988, (and since in Münster, Germany, and Varna, Bulgaria).” (Andrej Brodnik provides more details.)

• Problems on Algorithms (2nd Edition). [Available on-line]
  Ian Parberry and William Gasarch.
  Ian Parberry, 2002. [See first edition (1995) of this book at Amazon.com]

• Introduction to Algorithms (2nd Edition).
  Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Clifford Stein.
  The MIT Press / McGraw-Hill, 2001. [See this book at Amazon.com]

• Fundamentals of Algorithmics.
  Gilles Brassard and Paul Bratley.
  Prentice-Hall, 1996. [See this book at Amazon.com]

• The Algorithm Design Manual.
  Steven S. Skiena.
  Springer-Verlag, 1998. [See this book at Amazon.com]
  Errata list

This book explains fundamental algorithm design techniques, illustrated by practical examples (including some enlightening War Stories), and it provides a catalog of algorithmic problems together with efficient solutions. There are numerous challenging exercises that make good preparation material for programming contests. The book includes a CD-ROM with a complete hypertext version of the book (great for following the many cross references), implementations (such as the entire Stony Brook Algorithm Repository), and 30 hours of audio lectures on algorithms.

A concise, to-the-point book that addresses IOI-like programming issues in a way hardly found elsewhere:

The Practice of Programming. —– —– NEW RECOMMENDATION
Brian W. Kernighan, Rob Pike.
Addison-Wesley, 1999.
[See this book at Amazon.com]

• The Design and Analysis of Computer Algorithms.
  Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman.
  Addison-Wesley, 1974. [See this book at Amazon.com]
• Data Structures and Algorithms.
  Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman.
  Addison-Wesley, 1983. [See this book at Amazon.com]
• Fundamentals of Computer Algorithms.
  Ellis Horowitz and Sartaj Sahni.
  Computer Science Press, 1978.
• Algorithms.
  Robert Sedgewick.
  Addison-Wesley, 1988 (2nd edition). [See this book at Amazon.com]
  Also available for C Parts 1-4 (Fundamentals, Data Structures, Sorting, Searching; 3rd edition, 1997), [See this book at Amazon.com]
  Part 5 (Graph Algorithms; 3rd edition, 2002), [See this book at Amazon.com]
  C++ (3rd edition, 1999), [See this book at Amazon.com]
  Modula-3 [See this book at Amazon.com]
  Java [See this book at Amazon.com]
• Algorithms + Data Structures = Programs.
  Niklaus Wirth.
  Prentice-Hall, 1976. [See this book at Amazon.com]

• The Art of Computer Programming.
  Donald E. Knuth.
  Addison-Wesley,
  • Volume 1: Fundamental Algorithms,
    3rd edition, 1997. [See this book at Amazon.com]
  • Volume 2: Semi-Numerical Algorithms,
    2nd edition, 1981, [See this book at Amazon.com]
    3rd edition, 1997, [See this book at Amazon.com]
  • Volume 3: Sorting and Searching,
    1973. [See this book at Amazon.com]
    2nd edition, 1998, [See this book at Amazon.com]
  • Errata

Some more specialized, but easily accessible, programming books are:

• Writing Efficient Programs.
  Jon Louis Bentley.
  Prentice-Hall, 1982. [See this book at Amazon.com]
• Programming Pearls.
  Jon Bentley.
  Addison-Wesley, 1986. [See this book at Amazon.com]
  Second Edition, 1999. [See this book at Amazon.com]
• More Programming Pearls: Confessions of a Coder.
  Jon Bentley.
  Addison-Wesley, 1988. [See this book at Amazon.com]
• Primes and Programming: An Introduction to Number Theory with Computing.
  Peter Giblin.
  Cambridge University Press, 1993. [See this book at Amazon.com]
• Fundamentals of Data Structures in Turbo Pascal: For the IBM PC.
  Ellis Horowitz and Sartaj Sahni.
  Computer Science Press, 1989. [See this book at Amazon.com]
• Programming on Purpose.
  P. J. Plauger.
  Prentice-Hall,
  • Volume I: Essays on Software Design, 1993. [See this book at Amazon.com]
  • Volume II: Essays on Software People, 1993. [See this book at Amazon.com]
  • Volume III: Essays on Software Technology, 1994. [See this book at Amazon.com]

• The Stanford GraphBase: A Platform for Combinatorial Computing.
  Donald E. Knuth.
  ACM Press/Addison-Wesley, 1993. [See this book at Amazon.com]

Collected from : http://olympiads.win.tue.nl/ioi/study/books.html