Concepts involved:
- Matrix Exponentiation
- Prefix-sums
- Dynamic Programming (more difficult problems)
- Graph 1: Representation (Adjacency matrix and list)
- Graph 2: Breadth-first search and depth-first search (+BFS/DFS tree)
- Graph 3: Single-source shortest-paths and all-pairs shortest-paths
- Number theory 1: Divisibility, prime-factors
- Inclusion-exclusion principle
- Problems combining 2 Easy concepts
Problem set 1:
- [RENT] Rent your airplane and make money
- [GREATESC] The Great Escape
- [SHPATH] The Shortest Path
- CodeForces problem 659E (Graph problem)
- Leaf Eaters (ICO online judge)
- [NUMROUTE] Number of Routings
- [WORDHOP] Word Hopping
- [CRITINTS] Critical Intersections
- [3SPLIT] Three-Way Split
- [TASKFORCE] Bickering Task Force
- [TIMBER] Timber Auction
Problem set 2:
- Table Sum (INOI 2012: India)
- Triathlon (INOI 2012: India)
- Sequence Land (INOI 2013: India)
- Calvins Game (INOI 2013: India)
- Highway Bypass (INOI 2014: India)
- Free ticket (INOI 2014: India)
- Special Sums (INOI 2015: India)
- Periodic Strings (INOI 2015: India)
- Brackets (INOI 2016: India)
- Wealth Disparity (INOI 2016: India)
Last updated on: 17th January, 2017