This user (mohamed elbesealy) appears to have gamed the system, with fraudulent "likes" of this unremarkable solution submitted by 'sock-puppet' accounts. —DIV
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 1;
tf_correct = true;
assert(isequal(woodall(x),tf_correct))
|
2 | Pass |
x = 2;
tf_correct = false;
assert(isequal(woodall(x),tf_correct))
|
3 | Pass |
x = 3;
tf_correct = false;
assert(isequal(woodall(x),tf_correct))
|
4 | Pass |
x = 7;
tf_correct = true;
assert(isequal(woodall(x),tf_correct))
|
5 | Pass |
x = 23;
tf_correct = true;
assert(isequal(woodall(x),tf_correct))
|
6 | Pass |
x = 63;
tf_correct = true;
assert(isequal(woodall(x),tf_correct))
|
7 | Pass |
x = 159;
tf_correct = true;
assert(isequal(woodall(x),tf_correct))
|
8 | Pass |
x = 383;
tf_correct = true;
assert(isequal(woodall(x),tf_correct))
|
9 | Pass |
x = 895;
tf_correct = true;
assert(isequal(woodall(x),tf_correct))
|
10 | Pass |
x = 1000;
tf_correct = false;
assert(isequal(woodall(x),tf_correct))
|
11 | Pass |
x = 2000;
tf_correct = false;
assert(isequal(woodall(x),tf_correct))
|
12 | Pass |
x = 2047;
tf_correct = true;
assert(isequal(woodall(x),tf_correct))
|
13 | Pass |
x = 3000;
tf_correct = false;
assert(isequal(woodall(x),tf_correct))
|
14 | Pass |
x = 3001;
tf_correct = false;
assert(isequal(woodall(x),tf_correct))
|
15 | Pass |
x = 4607;
tf_correct = true;
assert(isequal(woodall(x),tf_correct))
|
16 | Pass |
x = 10239;
tf_correct = true;
assert(isequal(woodall(x),tf_correct))
|
17 | Pass |
x = 22527;
tf_correct = true;
assert(isequal(woodall(x),tf_correct))
|
18 | Pass |
x = 7516192767;
tf_correct = true;
assert(isequal(woodall(x),tf_correct))
|
19 | Pass |
x = 7516192766;
tf_correct = false;
assert(isequal(woodall(x),tf_correct))
|
Sort a list of complex numbers based on far they are from the origin.
4327 Solvers
The Goldbach Conjecture, Part 2
1284 Solvers
Generate a vector like 1,2,2,3,3,3,4,4,4,4
3613 Solvers
228 Solvers
Deleting an element in a matrix
325 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!