Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
suspects = [431 543 211 911 436];
code = 211;
jokers = 1;
assert(isequal(mytest(suspects,code),jokers))
|
2 | Pass |
suspects = [431 543 211 911 436];
code = 217;
jokers = 0;
assert(isequal(mytest(suspects,code),jokers))
|
3 | Pass |
suspects = 100:200;
code = 160;
jokers = 1;
assert(isequal(mytest(suspects,code),jokers))
|
4 | Pass |
suspects = [100 200 300 350 200];
code = 200;
jokers = 2;
assert(isequal(mytest(suspects,code),jokers))
|
Least common multiple of many numbers
159 Solvers
Project Euler: Problem 5, Smallest multiple
241 Solvers
Project Euler: Problem 7, Nth prime
339 Solvers
Generate a random matrix A of (1,-1)
161 Solvers
327 Solvers