Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = -18;
y=96;
z_correct = 6;
assert(isequal(your_GCD(x,y),z_correct))
x = -118;
y=66;
z_correct = 2;
assert(isequal(your_GCD(x,y),z_correct))
|
Find all elements less than 0 or greater than 10 and replace them with NaN
13048 Solvers
Project Euler: Problem 1, Multiples of 3 and 5
1491 Solvers
Back to basics 4 - Search Path
321 Solvers
Back to basics 9 - Indexed References
392 Solvers
Find out sum of prime number till given number
125 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!