Creating pull request

C++/2021/9oct_ashutoshmittal26.cpp

@@ -0,0 +1,24 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int fact(int x) {
+    if (x < 2)
+        return 1;
+    int ans = 2;
+    for (int i = 3; i <= x; i++)
+        ans *= i;
+    return ans;
+}
+
+int gcdOfFact(int a, int b) {
+    if(a<b){
+		return fact(a);
+	}
+	return fact(b);
+}
+
+int main() {
+    int a = 5, b = 120;
+    cout << gcdOfFact(a, b);
+    return 0;
+}

C++/2021/9oct_ashutoshmittal26.py

@@ -0,0 +1,10 @@
+import math
+
+def gcdOfFactorial(m, n) :
+
+	return math.factorial(min(m, n))
+
+
+m = int(input("Enter first   no. :"))
+n = int(input("Enter secound no. :"))
+print(gcdOfFactorial(m, n)) 

C++/2021/9oct_dishasharma-dev.cpp

@@ -0,0 +1,26 @@
+// CPP program to find GCD of factorial of two
+#include <bits/stdc++.h>
+using namespace std;
+
+int factorial(int x)
+{
+	if (x <= 1)
+		return 1;
+	int res = 2;
+	for (int i = 3; i <= x; i++)
+		res = res * i;
+	return res;
+}
+
+int gcdOfFactorial(int m, int n)
+{
+	return factorial(min(m, n));
+}
+
+int main()
+{
+	int m = 5, n = 9;
+	cout << gcdOfFactorial(m, n);
+	return 0;
+}
+

C++/2021/9thOct_AnshuPathak-88825.cpp

@@ -0,0 +1,45 @@
+#include <iostream>
+using namespace std;
+int GCD(int num1, int num2)
+{
+    if (num1 == 0)
+    {
+        return num2;
+    }
+
+    if (num2 == 0)
+    {
+        return num1;
+    }
+
+    if (num1 == num2)
+    {
+        return num1;
+    }
+
+    if (num1 > num2)
+    {
+        return GCD(num1 - num2, num2);
+    }
+
+    return GCD(num1, num2 - num1);
+}
+int fact(int n)
+{
+    if (n == 0)
+    {
+        return 1;
+    }
+    return n * fact(n - 1);
+}
+int main()
+{
+    int a, b;
+    cin >> a >> b;
+    int numfact1 = fact(a);
+    int numfact2 = fact(b);
+    int GCDnum = GCD(numfact1, numfact2);
+    cout << GCDnum;
+
+    return 0;
+}

C++/2021/9thOct_Chandana-23.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+using namespace std;
+
+
+int factorial(int x)
+{
+	if (x<=1)
+	{
+		return 1;
+	}
+	return x*factorial(x-1);
+
+}
+int main()
+{
+	int a,b;
+	cin>>a>>b;
+	a = factorial(a);
+	b = factorial(b);
+	int result = a>b?a:b;
+	cout<<result;
+	return 0;
+}

C++/2021/9thOct_Olive-green.cpp

@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+long long int fact(int n){
+
+  if(n==0){
+      return 1;
+  }
+        return n*fact(n-1);
+}
+
+int main(){
+  int a,b;
+  cin>>a>>b;
+  long long int ans=a>b? fact(b) : fact(a);
+  cout<<ans<<endl;
+  return 0;
+}
+

C++/2021/9thOct_nikhilbz.cpp

@@ -0,0 +1,24 @@
+// You are given two number a and b, you have to print the GCD of the factorials of these two numbers.
+
+#include <iostream>
+using namespace std;
+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 = 98, b = 56;
+	cout<<"GCD of "<<a<<" and "<<b<<" is "<<gcd(a, b);
+	return 0;
+}

C++/2021/9thOct_shagun0915.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+using namespace std;
+
+int factorial(int num){
+   int fact = 1, i;
+   for(i=1; i<=num; i++)
+   fact = fact * i;
+   return fact;
+}
+int gcd(int x, int y) {
+   if (y == 0){
+       return x;
+   }
+   return gcd(y, x % y);
+}
+int main() {
+   int a,b;
+   cin>>a>>b;
+   int x=factorial(a);
+   int y=factorial(b);
+   cout<<gcd(x,y);
+   return 0;
+}

C++/2021/9thOct_ssachis.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+#include<iostream>
+using namespace std;
+int factorial(int x){
+      if(x<0){
+        return 0;
+    }
+    if(x==0){
+        return 1;
+    }
+
+    int fact=1;
+for(int i=1;i<=x;i++){
+    fact=fact*i;
+
+}
+return fact;
+
+}
+int gcdoffact(int m,int n){
+    return (min(m,n));
+
+}
+int main(){
+
+cout<<gcdoffact(5,120);
+}

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;
+}

C++/2021/9thOct_zeel88.cpp

@@ -0,0 +1,25 @@
+#include<iostream>
+using namespace std;
+
+int find_factorial(int x)
+{
+    if (x <= 1)
+        return 1;
+    int res = 2;
+    for (int i = 3; i <= x; i++)
+        res = res * i;
+    return res;
+}
+
+int gcd_Of_factorial(int m, int n)
+{
+    return find_factorial(min(m, n));
+}
+
+int main()
+{
+    int i,j;
+    cin>>i>>j;
+    cout << gcd_Of_factorial(i, j);
+    return 0;
+}

C++/2021/9thSep_Pooja-Das.cpp

@@ -0,0 +1,31 @@
+// Euclidean algo to find GCD of two numbers
+#include <iostream>
+using namespace std;
+// Recursive function to return gcd of a and b
+int gcd(int a, int b)
+{
+    // Everything divides 0
+  //Base case 
+    if (a == 0) 
+       return b;
+    if (b == 0)
+       return a;
+
+    // base case
+    if (a == b)
+        return a;
+
+    // a is greater
+    if (a > b)
+        return gcd(a-b, b);
+    return gcd(a, b-a);
+}
+
+// Driver program to test above function
+int main()
+{
+    int  a,b;
+    cin>>a>>b;
+    cout<<"GCD of "<<a<<" and "<<b<<" is "<<gcd(a, b);
+    return 0;
+}