Cody

Problem 42831. Integer complexity

Solution 1279089

Submitted on 30 Sep 2017 by HH
  • Size: 68
  • This is the leading solution.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
n = 1; c_correct = 1; assert(isequal(intcomp(n),c_correct))
2   Pass
n = 3; c_correct = 3; assert(isequal(intcomp(n),c_correct))
3   Pass
n = [6 10 11;16 18 41]; c_correct = [5 7 8;8 8 12]; assert(isequal(intcomp(n),c_correct))
4   Pass
n = [60 27 72 1 51 24 46]; c_correct = [12 9 12 1 12 9 12]; assert(isequal(intcomp(n),c_correct))
5   Pass
n = [58;65;47;78;62]; c_correct = [13;13;13;13;13]; assert(isequal(intcomp(n),c_correct))

Suggested Problems

More from this Author34

Community Treasure Hunt

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

Start Hunting!