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]
1311 Solvers
Compress strings (not springs)
80 Solvers
Find the maximum number of decimal places in a set of numbers
85 Solvers
125 Solvers
Given a 4x4 matrix, swap the two middle columns
282 Solvers
Tags