Create gcd and lcm

Gives greatest common divisor and least common multiple of 2 numbers.

Author: harshita-jpg

gcd and lcm

@@ -0,0 +1,19 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+long long gcd(int a, int b)
+{
+	 if (a == 0) 
+        return b;  
+    return gcd(b % a, a);
+}
+
+int main()
+{
+	long long a, b;
+	cin>>a>>b;
+	long long g = gcd(a, b);
+	cout<<"GCD = "<<g<<endl;
+	cout<<"LCM = "<<(a*b)/g;
+	return 0;
+}