Problem 42831. Integer complexity
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 commentsProblem Recent Solvers20
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
48167 Solvers
-
Find the alphabetic word product
3297 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
1791 Solvers
-
Set the array elements whose value is 13 to 0
1351 Solvers
-
283 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!