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))
|
Find the longest sequence of 1's in a binary sequence.
3370 Solvers
2183 Solvers
Pernicious Anniversary Problem
735 Solvers
217 Solvers
226 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!