The complexity is actually O(2^2n)) (you only need log(n) bits to represent row and col). However, you still cannot do better than O(row * col) (which is what I assume you meant), as that's also the size of the output.

Nice

Will this still be a O(n^2) complexity?

I must have learnt fake Python...this is beautiful.

lel

This is a suggestion not and issue.

Le copié a wikipedia.

para de copiarme jorgenial

lel

Para de copiarme qwerty.

ohh la hicimos igual jajajaja

Oh okay, my apologies. Thanks for the suggestion!

They're better now. The ones with only 1's made me think you wanted squares with only 1's at first instead of the number as a square.

Gonna give me a little more than that or what?

Test cases are broken. Scale breaks with two weighings... I solved it with that restriction and then just copied and pasted the solution in the harder versions!