Notes for Competitive Programming 4. A very good book.

Foreword

This post are some notes that I have taken from the book CP4. Do note that it is much better if you read the book by yourself and these are just study notes that I have made. I didn’t make notes for all chapters, and the arrangement of this study note might be different from the ordering of chapters in the book.

Chapter 1

1.3 Algorithm Analysis

Modern Computers can process around problems

Familiarity with these bounds:

, .
, .
32-bit signed integers (int) and 64-bit signed integers (long long) have upper limits of
and
If you need to store integers , use Big Integer.
The largest input size for typical programming contest problems must be .
Beyond that, the Input/Output (I/O) routine will be the bottleneck.
Usually, algorithms are sufficient to solve most contest problems for a simple reason:
and the theoretically better algorithms are hard to differentiate empirically

Useful Libraries

printf("%.*Lf\n", n, pi); prints n decimals of pi. e.g. n=3 would print 3.141

Study Plan

read 30 pages per week + 9 problems + 1 contest

Nov 2025

Week 1

Before 11.3: Read uptill page 30.
11.3: Kattis: r2, timeloop, judgingmoose
11.4: statistics, filip, lineup, 

ToDo:Kattis:  basicprogramming1
UVa: 11172, 11559, 11614