Merge pull request #329 from yamini236/master

lcmreturnrecursion

Contributors.html

@@ -539,9 +539,11 @@
 	<a class="box-item" href="https://github.com/Prakhar-creator"><span>Prakhar Mishra</span></a>
 	<a class="box-item" href="https://github.com/Whitedevilfury"><span>Kingshuk Roy</span></a>	
     <a class="box-item" href="https://github.com/Shyam-2001"><span>Shyam Gupta</span></a>
+     <a class="box-item" href="https://github.com/yamini236"><span>Yamini Bansal</span></a>
 
 
 
+
         <!-- Please maintain the alignment... -->
 
 

Program's_Contributed_By_Contributors/C++_Programs/factoralrecursion.cpp

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

Program's_Contributed_By_Contributors/C++_Programs/lcmreturnrecursion.cpp

@@ -0,0 +1,41 @@
+#include<iostream>
+using namespace std;
+
+int lcm(int a,int b,int i){
+	int p=0;
+	if(i<=a || i<=b){
+		if(a%i==0 && b%i==0){
+			p=lcm(a/i,b/i,i);
+			return p*i;
+
+		}
+		else if(a%i==0){
+			p=lcm(a/i,b,i);
+			return p*i;
+
+
+		}
+		else if(b%i==0){
+			p=lcm(a,b/i,i);
+			return p*i;
+
+
+		}
+		else{
+			p=lcm(a,b,i+1);
+			return p;
+
+		}
+
+	}
+	else{
+		return 1;
+	}	
+}
+int main(){
+	int a,b,x;
+	cin>>a>>b;
+	x=lcm(a,b,2);
+	cout<<x;
+	return 0;
+}