Freaks City

SMU Summer 2024 Contest Round 8 - Problem Solutions Problem 1: Product Approach Observing that the constraint \(\prod_{i=1}^N L_i \le 10^5\) implies that N cannot exceed 16, since \(2^{17} > 10^5\). This allows us to solve the problem using straightforward brute force enumeration of all possible combinations. Implementation #include <bits ...