Cody

Problem 42966. find "greatest common divisor" of two integer value

Solution 1981430

Submitted on 18 Oct 2019 by Nikolaos Nikolaou
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

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))

z = 6 z = 2