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]
16130 Solvers
982 Solvers
All your base are belong to us
413 Solvers
197 Solvers
Find Index of maximum Value and maximum Value of a vector
120 Solvers
Tags