Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

9thOct_ssachis.cpp #1892

Merged
merged 4 commits into from
Oct 12, 2021
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 27 additions & 0 deletions C++/2021/9thOct_ssachis.cpp
Original file line number Diff line number Diff line change
@@ -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);
}
26 changes: 26 additions & 0 deletions JAVA/9thOct_ssachis.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
public class FactGCD{

static int factorial(int x)
{
if (x <= 1)
return 1;
int res = 2;
for (int i = 3; i <= x; i++)
res = res * i;
return res;
}

static int gcdOfFactorial(int m, int n)
{
int min = m < n ? m : n;
return factorial(min);
}

/* Driver program to test above functions */
public static void main (String[] args)
{
int m = 5, n = 9;

System.out.println(factorial(gcdOfFact(m, n)));
}
}
9 changes: 9 additions & 0 deletions Python/2021/9thoct_ssachis.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
import math

def gcdOfFactorial(m, n) :
return math.factorial(min(m, n))

# Driver code
m = 5
n = 9
print(gcdOfFactorial(m, n))