this answer contributes also this should be the last time I have to do this

Partition square into squares Given integers \$n\$, \$m\$ and \$k\$, randomly output a list of \$k\$ numbers between \$1\$ and \$m\$ (inclusive) such that the sum of the squares of the numbers in the list is equal to \$n\$ squared. In other words, find a way to randomly split \$n^{2}\$ into \$k\$...