Merge pull request #1901 from ujjwalhans/master

gcd of two factorials

C++/2021/9thOct_ujjwalhans.py

@@ -0,0 +1,27 @@
+#include <stdio.h>
+int factorial(int n)
+{
+    int f = 1;
+    int i;
+    for (i = 2; i <= n; i++)
+        f *= i;
+    return f;
+}
+int gcd(int a, int b)
+{    if (a == 0)
+       return b;
+    if (b == 0)
+       return a;
+    if (a == b)
+        return a;
+    if (a > b)
+        return gcd(a-b, b);
+    return gcd(a, b-a);
+}
+
+int main()
+{
+    int a = 5, b = 120;
+    printf("%d",factorial(gcd(a, b)));
+    return 0;
+}

Python/2021/9thOct_ujjwalhans.py

@@ -0,0 +1,13 @@
+import math
+def gcd(a,b):
+    if (b == 0):
+        return a
+    if (a == 0):
+        return b
+    if (a == b):
+        return a
+    if (a > b):
+        return gcd(a-b, b)
+    return gcd(a, b-a)
+ans=gcd(5,10)
+print(math.factorial(ans))