@@ -0,0 +1,564 @@
+package coding4fun;%0A%0A/**%0A * Implement a greatest common divisor.%0A *%0A * %3Cpre%3E%0A * Input : 32 24%0A * Output: 8%0A *%0A * Input : 3 5%0A * Output: 1%0A *%0A * Input : 4 16%0A * Output: 4%0A * %3C/pre%3E%0A */%0Apublic class Problem30 %7B%0A    private static int gcd(int a, int b) %7B%0A        // Euclid's algorithm%0A        if (b == 0) %7B%0A            return a;%0A        %7D%0A        int c = a %25 b;%0A        return gcd(b, c);%0A    %7D%0A    public static void main(String%5B%5D args) %7B%0A        System.out.println(gcd(32, 24));%0A        System.out.println(gcd(3, 5));%0A        System.out.println(gcd(4, 16));%0A    %7D%0A%7D%0A

Add problem 30