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
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers26
Suggested Problems
-
Find the sum of all the numbers of the input vector
55390 Solvers
-
2253 Solvers
-
Remove the polynomials that have positive real elements of their roots.
1743 Solvers
-
Test if a Number is a Palindrome without using any String Operations
259 Solvers
-
Relative ratio of "1" in binary number
1674 Solvers
More from this Author45
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
