Consider a non-empty binary matrix M and a natural number n. For the purposes of this challenge, M is said to have blockiness n if it can be built using adjacent square blocks of size n, where each block has equal entries; and it cannot be formed using square blocks of any larger size. Intuitivel...
00:00 - 13:0013:00 - 00:00
00:00 - 13:0013:00 - 00:00