Cody

# Problem 2733. Evil Number

Solution 1996874

Submitted on 30 Oct 2019 by Asif Newaz
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
x = 1; y_correct = false; assert(isequal(isevil(x),y_correct))

a = '1' b = 1

2   Pass
x = 3; y_correct = true; assert(isequal(isevil(x),y_correct))

a = '11' b = 2

3   Pass
x = [18, 20, 23, 24, 27, 45, 46, 48, 96, 99, 123,]; y_correct = true; assert(isequal(all(arrayfun(@isevil,x)),y_correct))

a = '10010' b = 2 a = '10100' b = 2 a = '10111' b = 4 a = '11000' b = 2 a = '11011' b = 4 a = '101101' b = 4 a = '101110' b = 4 a = '110000' b = 2 a = '1100000' b = 2 a = '1100011' b = 4 a = '1111011' b = 6

4   Pass
x = [14, 16, 19, 37, 38, 55, 56, 59, 62, 79, 82, 91, 93, 94, 97, 98, 117, 118, 121]; y_correct = false; assert(isequal(any(arrayfun(@isevil,x)),y_correct))

a = '1110' b = 3 a = '10000' b = 1 a = '10011' b = 3 a = '100101' b = 3 a = '100110' b = 3 a = '110111' b = 5 a = '111000' b = 3 a = '111011' b = 5 a = '111110' b = 5 a = '1001111' b = 5 a = '1010010' b = 3 a = '1011011' b = 5 a = '1011101' b = 5 a = '1011110' b = 5 a = '1100001' b = 3 a = '1100010' b = 3 a = '1110101' b = 5 a = '1110110' b = 5 a = '1111001' b = 5

5   Pass
x = 2^randi([5 10])+1; y_correct = true; assert(isequal(isevil(x),y_correct))

a = '1000000001' b = 2

6   Pass
% more test cases may be introduced

7   Pass
% DISABLED % ________'FAIR'_SCORING_SYSTEM______________ % % This section scores for usage of ans % and strings, which are common methods % to reduce cody size of solution. % Here, strings are threated like vectors. % Please do not hack it, as this problem % is not mentioned to be a hacking problem. % try % disable: assert(false) % size_old = feval(@evalin,'caller','score'); % all_nodes = mtree('isevil.m','-file'); str_nodes = mtfind(all_nodes,'Kind','STRING'); eq_nodes = mtfind(all_nodes,'Kind','EQUALS'); print_nodes = mtfind(all_nodes,'Kind','PRINT'); expr_nodes = mtfind(all_nodes,'Kind','EXPR'); % size = count(all_nodes) ... +sum(str_nodes.nodesize-1) ... +2*(count(expr_nodes) ... +count(print_nodes) ... -count(eq_nodes)); % feval(@assignin,'caller','score',size); % fprintf('Size in standard cody scoring is %i.\n',size_old); fprintf('Here it is %i.\n',size); end % %_________RESULT_____________________________