function ans = arraygcd(a)
% a=[45 15 200 300];
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].
Number of 1s in the Binary Representation of a Number
letter yes yes & letter no no
Flag largest magnitude swings as they occur
We love vectorized solutions. Problem 1 : remove the row average.
What number has this problem?
given 3 sides, find area of this triangle
Distance walked 1D
Minimum possible M of the maximum side of a triangle of given area A.
Given n, create n random numbers such that their standard deviation is also n.
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office