All Questions
1
question
0
votes
2
answers
119
views
Fastest algorithm for splitting an integer
I have a number $n$ in the range $1$ - $255$. What I'm trying to do is split $n$ into the shortest list of numbers $1$ -$16$ that add up to $n$. For example, let's say $n$ is $32$. Then, we could ...
- 4,954