Workshop Videos

Lecture German English Task to solve after video
SOI VSCode Tutorial   SOI VSCode Tutorial Addition
Scanline Scanline DE (incomplete) Scanline EN
Fishing
Servertest
Priority Queues for Scanline   Priority Queues for Scanline EN
Fakeships
Spaceships
Graph Intro Graph Intro DE Graph Intro EN
Greprcpp
Alone
Chopsticks
Starclassify
DFS Intro DFS Intro DE DFS Intro EN
Components
Roadspill
Clawcrane
Passports
DFS on Trees   DFS on Trees EN
halloweenparty, stefconsp, xmasparty
Big O Notation Big O Notation DE Big O Notation EN
Snippets C++
Proof by Contradiction   Proof by Contradiction EN
Theoretical Tasks
Tasks DE
Tasks EN
Proofs
Proofs I DE
Proofs II DE
Greedy Swap (Proofs III) DE
Proofs I EN
Proofs II EN
Greedy Swap (Proofs III) EN
Theoretical Tasks
Tasks DE
Tasks EN
Binary Search Intro Binary Search DE Binary Search EN postcards, firewood, sandwiches, guessnum, chocolatebars
Advanced Binary Search   Advanced Binary Search EN lawfirm
Binary Search Bonus   Binary Search Bonus EN USACO 2014 March Contest, Gold Problem 2. Sabotage
A Brief C++ Tour   A Brief C++ Tour EN  

Dynamic Programming

  1. Watch this video which introduces the task staircase: DP 1
  2. Take 10 minutes to solve staircase on paper (if you don’t manage to solve it don’t worry, the important part is thinking about the problem)
  3. Watch this video which solves the solution to staircase and introduces the topic of Dynamic Programming DP 2
  4. Solve Staircase on the grader
  5. Watch this video which introduces the problem coins: DP 3
  6. Take 10 minutes to try to solve coins on paper
  7. Watch the solution to coins: DP 4
  8. Spend 30 minutes solving Tasks in the Dynamic Programming Category on the grader
  9. Take 10 minutes to get familiar with the task Lis on the grader
  10. Watch Reducible Video 1:05 - 06:50
  11. Watch our video about the implementation (or continue watching the reducible video above if you prefer the python implementation.): DP 5
  12. Solve Lis on the grader
  13. Watch Reducible Video 9:14 - 10:10
  14. Solve the example from the video
  15. Watch Reducible Video 10:10 - 15:24
  16. Watch Reducible Video 19:16 - 21:26
  17. Solve the task Gridpathmin (or if you don’t manage to solve it in 30 mins, skip ahead)
  18. Take 10 mins to get familiar with the task Lcs in (2-dimensional dynamic programming)
  19. Watch this video: DP 6
  20. Solve Lcs on the Grader
  21. Try to solve Trisum and Trisumpath
  22. Watch DP 7
  23. Solve Trisum / Trisumpath if you haven’t solved it yet (dont spend more than 20 mins on Trisumpath)
  24. Get familiar with the task Mensacheck on the grader
  25. Watch the final lecture: DP 8
  26. Solve Mensacheck
  27. Solve more tasks in the Dynamic Programming and 2-Dimensional Dynamic Programming Categories