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]
20716 Solvers
372 Solvers
134 Solvers
What is the distance from point P(x,y) to the line Ax + By + C = 0?
177 Solvers
How many days does the cat take to climb out of the hole?
53 Solvers
Tags