11827 - Maximum GCD

Difficulty : easy

Solution Description :

Math GCD problem

the euclidian algorithm for the gcd.
int gcd(int a, int b)
{    if (b == 0)
         return a;
     return gcd(b, a%b);
}

Input line to string variable str
and split the line and store to num[] arry

Now find the gcd for all combination at the moment find the maximum gcd

Here is no question about time limit exit because input file are very small