Freaks City

Contest Overview This round was relatively straightforward, so this editorial will focus on both the technical problem solutions and the interesting sequence of events during the contest. Problem A - Subset Mex Problem Statement: Given a set a with |a| = n, partition it into two sets A and B to maximize mex(A) + mex(B). Multiple test cases. Con ...