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 |
x = 100;
y_correct = 73;
assert(isequal(cowboy(x),y_correct))
x = 1000;
y_correct = 977;
assert(isequal(cowboy(x),y_correct))
x = 33;
y_correct = 3;
assert(isequal(cowboy(x),y_correct))
x = 555;
y_correct = 87;
assert(isequal(cowboy(x),y_correct))
x = 2;
y_correct = 1;
assert(isequal(cowboy(x),y_correct))
|
2530 Solvers
Project Euler: Problem 5, Smallest multiple
241 Solvers
Integer Sequence - II : New Fibonacci
141 Solvers
Check that number is whole number
274 Solvers
Van Eck's Sequence's nth member
265 Solvers