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))
ans =
5
ans =
4
ans =
3
ans =
2
ans =
1
|
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))
ans =
3
ans =
2
ans =
1
ans =
0
ans =
-1
|
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))
ans =
46
ans =
45
ans =
44
ans =
43
ans =
42
|
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))
ans =
4.0000 + 1.0000i
ans =
3.0000 + 1.0000i
ans =
2.0000 + 1.0000i
ans =
1.0000 + 1.0000i
ans =
0.0000 + 1.0000i
|
1400 Solvers
3651 Solvers
Increment a number, given its digits
505 Solvers
Put two time series onto the same time basis
136 Solvers
Predicting life and death of a memory-less light bulb
244 Solvers