To contact JJ Vie, click the mail at the bottom of the page.
See slides (soon)
- Introduction to Reinforcement Learning
- If there is still time, solve the jumping problem ($k$ students, $n$ floors)
Please read these problems for next time. You can attempt a submission for the first two; for the third one only on the testcase given in example.
- See resource: Complexities of matching & flows algorithms
- Maximum Flow
- Hard: It Can Be Arranged
Identify what is the dynamic programming objective in Bellman-Ford and Floyd-Warshall shortest path algorithms.
- Roads in Berland
- Negative Cycles
- By groups of 2 or 3