@@ -0,0 +1,425 @@
+// PAA Practice 29.09.2016 - dvt32%0A%0A// 1. GCD Implementation - version 1%0A%0Apublic class Solution %7B%0A%09%0A%09static int getGreatestCommonDivisor(int a, int b) %7B%0A%09%09int greatestCommonDivisor;%0A%09%09while (b != 0) %7B%0A%09%09%09int temp = a;%0A%09%09%09a = b;%0A%09%09%09b = temp %25 b;%0A%09%09%7D%0A%09%09greatestCommonDivisor = a;%0A%09%09return greatestCommonDivisor;%0A%09%7D%0A%09%0A%09public static void main(String%5B%5D args) %7B%0A%09%09System.out.println(%0A%09%09%09%09getGreatestCommonDivisor(21, 6)%0A%09%09);%0A%09%7D%0A%7D%0A

Create 29092016-1.java