Tutorials

Tutorial problems and code

Note that not all problems are implemented in each tutorial (due to time constraints), so some of these C++ files are empty.

The code provided here is not written to the standard of an official solution (as it was written live during a tutorial), nor is it designed for legibility above all else. It is the tutor’s best attempt to solve the problem as they would in a contest environment, with some explanation. Students should watch the tutorial recording for a more complete explanation, and to fully appreciate the iterative process used to compose each program.

1. Introduction
   • Complete The Word (W13A, W13B, F10A)
   • Substring Removal Game (W13A, W13B, F10A)
   • Quality of Living (W13A, W13B, F10A)
2. Data Structures I
   • Restructuring Company (W13A, W13B, F10A)
   • Ghost Encounters (W13A, W13B, F10A)
3. Dynamic Programming I
   • Boredom (W13A, W13B, F10A)
   • Pebbles (W13A, W13B, F10A)
4. Graph Algorithms
   • Ehab’s Last Corollary (W13A, W13B, F10A)
   • Shichikuji and Power Grid (W13A, W13B, F10A)
5. Data Structures II
   • Water Tree (W13A, W13B, F10A)
6. No tutorials
7. Shortest Paths
   • Weights Distributing (W13A, W13B, F10A)
   • Roads in Berland (W13A, W13B, F10A)
8. Network Flow
   • Soldier and Traveling (W13A, W13B, F10A)
   • Exploration Plan (W13A, W13B, F10A)
9. Mathematics
   • Division (W13A, W13B, F10A)
   • The Race (W13A, W13B, F10A)
10. Revision
    • NCPC 2017