I was obtaining 34 for 7e4 too, but it's not a problem of the test suite. It just means that your code is not testing all possible combinations (and there are probably other numbers that will fail too). There is no known algorithm to generate the list of integer complexity (https://oeis.org/A005245), which means brute force is the only way to be sure. And brute force finds 32 for 7e4.
It someone doesn't believe 7e4 = (1+1)*(1+1)*(1+1)*(1+1)*(1+ (1+1)*(1+1+1)*(1+1+1)*(1+1+1)*(1+1+1)*(1+1+1)*(1+1+1)*(1+1+1)) (32 ones). Or 2^4*(1 + 2*3^7).
Remove any row in which a NaN appears
6830 Solvers
289 Solvers
348 Solvers
248 Solvers
Count letters occurence in text, specific to words with a given length.
84 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!