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]
124 Solvers
Split a string into chunks of specified length
124 Solvers
77 Solvers
Possible Outcomes of American Roulette
58 Solvers
192 Solvers
Tags