Cody

Problem 42831. Integer complexity

  • Created by HH
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]
Solve

Solution Stats

43.14% Correct | 56.86% Incorrect
Last Solution submitted on Jun 14, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers19

Suggested Problems

More from this Author45

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!