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).
Maximum running product for a string of numbers
Project Euler: Problem 10, Sum of Primes
Calculate Euler's phi function
Calculate the height of an object dropped from the sky
sum of non-primes
Combine the first and last names
Apply Function to Each Field of a Structure Array: Part 2
Moving Product (Easy)
Group-wise Euclidean distance
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office