Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 1;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
|
2 | Pass |
n = 2;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
|
3 | Pass |
n = 28;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
|
4 | Pass |
n = 453;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
|
5 | Pass |
n = 17;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
|
6 | Pass |
n = 16;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
|
649 Solvers
Back to basics 22 - Rotate a matrix
682 Solvers
Sum of first n terms of a harmonic progression
188 Solvers
204 Solvers
Predicting life and death of a memory-less light bulb
244 Solvers