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:

1. [RENT] Rent your airplane and make money
2. [GREATESC] The Great Escape
3. [SHPATH] The Shortest Path
4. CodeForces problem 659E (Graph problem)
5. Leaf Eaters (ICO online judge)
6. [NUMROUTE] Number of Routings
7. [WORDHOP] Word Hopping
8. [CRITINTS] Critical Intersections
9. [3SPLIT] Three-Way Split
10. [TASKFORCE] Bickering Task Force
11. [TIMBER] Timber Auction

Problem set 2:

1. Table Sum (INOI 2012: India)
2. Triathlon (INOI 2012: India)
3. Sequence Land (INOI 2013: India)
4. Calvins Game (INOI 2013: India)
5. Highway Bypass (INOI 2014: India)
6. Free ticket (INOI 2014: India)
7. Special Sums (INOI 2015: India)
8. Periodic Strings (INOI 2015: India)
9. Brackets (INOI 2016: India)
10. Wealth Disparity (INOI 2016: India)

Last updated on: 17th January, 2017