Need help with Calgary Collegiate Programming Competition 2018 Card Trading Problem

Revision en2, by viggibear, 2021-02-07 23:37:30

From what I know, the problem can be solved by greedy since ceil(n) = 100000 so even O(n^2) might fail but my greedy solution has been failing due to various different reasons. Any insights appreciated!



  Rev. Lang. By When Δ Comment
en2 English viggibear 2021-02-07 23:37:30 0 (published)
en1 English viggibear 2021-02-07 23:37:18 346 Initial revision (saved to drafts)