Problem 1018. Array GCD
56.85% Correct | 43.15% Incorrect
Last Solution submitted on Mar 10, 2023
Peng Liu on 1 Sep 2015
Note that all solutions (which passed the limited test suite with small size) involving only pair-wise gcd calculations are indeed incorrect. Those solutions include the following ones: 1) min(gcd(a,min(a))); 2) min(gcd(a(1), a)); 3) min(min(bsxfun(@gcd,a,a.'))); To eliminate these incorrect solutions, please simply add a test case with a = [21 15 35].
Problem Recent Solvers103
Back to basics 17 - white space
How many trades represent all the profit?
Given a window, how many subsets of a vector sum positive
Replace multiples of 5 with NaN
More from this Author100
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!