Given an array, n, of positive integers, return an array, c, of the same size, in which each element is the complexity of the corresponding element in n.
Integer complexity is defined in number theory as the least number of ones required to represent an integer using only addition, multiplication and parentheses.
Example 1:
n = 3
c = 3
Example 2:
n = [6 10 11;16 18 41]
c = [5 7 8;8 8 12]
Solution Stats
Recent Solvers7
Suggested Problems
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
222 Solvers
-
Number of 1s in a binary string
431 Solvers
-
114 Solvers
-
104 Solvers
-
501 Solvers
More from this Author32
Discover what MATLAB® can do for your career.
Opportunities for recent engineering grads.
Apply Today
Tags