Description
Problems solvable using bipartite matching and/or network flow. Read the assignment description on Canvas for some guidance on the problems.
pianolessons - CMPUT 303 only; eastereggs - both CMPUT 303 and 403; piano - both CMPUT 303 and 403; landscaping - CMPUT 403 only
The deadline is Monday, Dec 8 at 11:55pm. This is the course cutoff, no late submissions will be accepted.
Start & End Times
| Start Time | 2025-09-09 12:00 CEST |
| Length | 2180:55:00 |
| End time | 2025-12-09 07:55 CET |
Problems
| Label | Problem |
|---|---|
| A | Piano Lessons |
| B | Easter Eggs |
| C | Moving Pianos |
| D | Landscaping |
Scoring
Pass/Fail — Unranked
Explanation:
Each problem is pass/fail. Participants are not ranked
Results
- Results are shown without limitation.
Languages
Ada Algol 60 Algol 68 APL Bash BCPL BQN C C with GMP C with Memory Check C# C++ C++ with GMP C++ with Memory Check COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Fortran 77 Gerbil Go Haskell Icon Java Java with Algs4 JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP PL/I Prolog Python 2 Python 3 Python 3 with NumPy Racket Ruby Rust Scala Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig