Cody Problem 58971 involves the maximal product of numbers that concatenate to a number n. For example, if
, then the products are
,
, and
, and the maximal product is 492. For
, the maximal product is zero.
This problem seeks the smallest number leading to a given maximal product. If the product is 492, the smallest number is 682. Some products have no solution. For example, 13 is a product of both 113 and 131, but the maximal products are 33 and 31, respectively.
Write a function that takes a maximal product and returns the smallest number leading to that product. If the product has no corresponding number, return the empty set.
Solution Stats
Problem Comments
3 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers5
Suggested Problems
-
It dseon't mettar waht oedrr the lrettes in a wrod are.
2079 Solvers
-
Back to basics 8 - Matrix Diagonals
963 Solvers
-
1498 Solvers
-
Remove the two elements next to NaN value
702 Solvers
-
Return the names and values of the input arguments of a function
31 Solvers
More from this Author321
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
For test 17, the answer is 25*84902258=2122556450, but not 303222350*7=2122556450
@CXD but 2584902258 can be split as 2584*902258 = 2331434672, so it doesn't yield the desired maximal product.
Thanks @Christian Schröder