A solution to the practice problem of Google Hash Code 2019.
In few words, our approach is the following: In each iteration, a cell that doesn't belong to any slice is chosen. Then we pick the biggest slice that can cointain this cell, and cut it (save the slice).
Team:
Dimitris Milonopoulos
Eugene Kladis
Nikos Soulounias
Simon Iyamu