Problem 2053. Strange Number Algorithms

Solution 370842

Submitted on 16 Dec 2013 by James

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test	Status	Code Input and Output
1	Pass	%% n = [1 10 100]; a(1)=(((n(1)3)+6)/3)-n(1); a(2)=(((n(2)2)+9)-3)/2-n(2); a(3)=(((n(3)+7)*2)-4)/2-n(3); y_correct = a; assert(isequal(strange(n),y_correct)) ans = 2 3 5
2	Pass	%% n = [0 499 999]; a(1)=(((n(1)3)+6)/3)-n(1); a(2)=(((n(2)2)+9)-3)/2-n(2); a(3)=(((n(3)+7)*2)-4)/2-n(3); y_correct = a; assert(isequal(strange(n),y_correct)) ans = 2 3 5
3	Pass	%% n = [999 666 333]; a(1)=(((n(1)3)+6)/3)-n(1); a(2)=(((n(2)2)+9)-3)/2-n(2); a(3)=(((n(3)+7)*2)-4)/2-n(3); y_correct = a; assert(isequal(strange(n),y_correct)) ans = 2 3 5
4	Pass	%% n = [7 63 347]; a(1)=(((n(1)3)+6)/3)-n(1); a(2)=(((n(2)2)+9)-3)/2-n(2); a(3)=(((n(3)+7)*2)-4)/2-n(3); y_correct = a; assert(isequal(strange(n),y_correct)) ans = 2 3 5