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 = 1;
y1 = fifth_times_a_charm(x);
assert(~isequal(y1,x))
y2 = fifth_times_a_charm(x);
assert(~isequal(y2,x))
assert(abs(x-y2)<abs(x-y1))
y3 = fifth_times_a_charm(x);
assert(~isequal(y3,x))
assert(abs(x-y3)<abs(x-y2))
y4 = fifth_times_a_charm(x);
assert(~isequal(y4,x))
assert(abs(x-y4)<abs(x-y3))
y5 = fifth_times_a_charm(x);
assert(isequal(y5,x))
|
2 | Pass |
x = -1;
y1 = fifth_times_a_charm(x);
assert(~isequal(y1,x))
y2 = fifth_times_a_charm(x);
assert(~isequal(y2,x))
assert(abs(x-y2)<abs(x-y1))
y3 = fifth_times_a_charm(x);
assert(~isequal(y3,x))
assert(abs(x-y3)<abs(x-y2))
y4 = fifth_times_a_charm(x);
assert(~isequal(y4,x))
assert(abs(x-y4)<abs(x-y3))
y5 = fifth_times_a_charm(x);
assert(isequal(y5,x))
|
3 | Pass |
x = 42;
y1 = fifth_times_a_charm(x);
assert(~isequal(y1,x))
y2 = fifth_times_a_charm(x);
assert(~isequal(y2,x))
assert(abs(x-y2)<abs(x-y1))
y3 = fifth_times_a_charm(x);
assert(~isequal(y3,x))
assert(abs(x-y3)<abs(x-y2))
y4 = fifth_times_a_charm(x);
assert(~isequal(y4,x))
assert(abs(x-y4)<abs(x-y3))
y5 = fifth_times_a_charm(x);
assert(isequal(y5,x))
|
4 | Pass |
x = i;
y1 = fifth_times_a_charm(x);
assert(~isequal(y1,x))
y2 = fifth_times_a_charm(x);
assert(~isequal(y2,x))
assert(abs(x-y2)<abs(x-y1))
y3 = fifth_times_a_charm(x);
assert(~isequal(y3,x))
assert(abs(x-y3)<abs(x-y2))
y4 = fifth_times_a_charm(x);
assert(~isequal(y4,x))
assert(abs(x-y4)<abs(x-y3))
y5 = fifth_times_a_charm(x);
assert(isequal(y5,x))
|
3310 Solvers
333 Solvers
551 Solvers
Create an index-powered vector
233 Solvers
1078 Solvers