Find a simple partition P[n]. E.g. P[10] = 4 + 3 + 2 + 1.
Bonus points if you solve the general problem of producing all unique partitions of [n].
Count from 0 to N^M in base N.
200 Solvers
193 Solvers
Back to basics 6 - Column Vector
809 Solvers
Flip the main diagonal of a matrix
426 Solvers
Flag largest magnitude swings as they occur
524 Solvers
Problem Tags