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 Solvers9
Suggested Problems
-
Select every other element of a vector
14304 Solvers
-
1688 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
170 Solvers
-
Getting the absolute index from a matrix
170 Solvers
-
Beads on a Necklace (Convex Hulls)
30 Solvers
More from this Author34
Discover what MATLAB® can do for your career.
Opportunities for recent engineering grads.
Apply Today
Tags