Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = 1;
y_correct = 2;
assert(isequal(binary_neighbour(x),y_correct))
|
2 | Pass |
%%
x = 2;
y_correct = 1;
assert(isequal(binary_neighbour(x),y_correct))
|
3 | Pass |
%%
x = 5;
y_correct = 6;
assert(isequal(binary_neighbour(x),y_correct))
|
4 | Pass |
%%
x = 3;
y_correct = 5;
assert(isequal(binary_neighbour(x),y_correct))
|
5 | Pass |
%%
x = 4;
y_correct = 2;
assert(isequal(binary_neighbour(x),y_correct))
|
6 | Pass |
%%
x = 16;
y_correct = 8;
assert(isequal(binary_neighbour(x),y_correct))
|
7 | Pass |
%%
x = 17;
y_correct = 18;
assert(isequal(binary_neighbour(x),y_correct))
|
8 | Pass |
%%
x = 11;
y_correct = 13;
assert(isequal(binary_neighbour(x),y_correct))
|
9 | Pass |
%%
x = 15;
y_correct = 23;
assert(isequal(binary_neighbour(x),y_correct))
|
10 | Pass |
%%
x = 92;
y_correct = 90;
assert(isequal(binary_neighbour(x),y_correct))
|
11 | 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
%
size_old = feval(@evalin,'caller','score');
%
all_nodes = mtree('binary_neighbour_disabled.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_____________________________
|
7267 Solvers
Project Euler: Problem 1, Multiples of 3 and 5
1063 Solvers
367 Solvers
223 Solvers
296 Solvers