Make-Ups (on demand, each task = 1 other task)

Welcome to Make-Ups (on demand, each task = 1 other task)

13
Problems

150
Students

33
Languages

490
Submissions

Missing some mandatories? This session is for you!

Each task on this list makes up for 1 task from another mandatory session. (So if you’re missing 2 tasks from another session, make up 2 tasks here.)

Start Time	2023-09-04 11:00 CEST
End time	2023-11-30 23:59 CET

Label	Problem
A	Open-Pit Mining
B	Canonical Coin Systems
C	Yet Satisfiability Again!
D	Equal Sums (Easy)
E	Single source shortest path, negative weights
F	Single source shortest path, time table
G	Arbitrage?
H	Knapsack
I	Robots on a Grid
J	RA Duty Scheduler
K	Longest Increasing Subsequence
L	Moving Pianos
M	Halloween Loot

Pass/Fail — Unranked

Explanation:
Each problem is pass/fail. Participants are not ranked