Cody

Problem 42831. Integer complexity

Created by HH in Community

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]

Solution Stats

88.89% Correct | 11.11% Incorrect
Last solution submitted on Dec 16, 2018

Recent Solvers7

Suggested Problems

More from this Author32

Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

MATLAB Academy

New to MATLAB?

Learn MATLAB today!