Hi Luke, Thanks for your solution,
can you please elaborate "Essentially it recursively goes through all ways of separating these into at most k sets, finds the minimum square size needed for each way and then outputs the best one it has found." -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/cebf6fd0-9f3e-4baa-bc2f-0df027205207%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
