LCM code
#include<iostream>
using namespace std;
int gcd(int a,int b)
{
if(a%b==0)
return b;
else
gcd(b,a%b);
}
int main()
{
int a,b;
cin>>a>>b;
int res = gcd(a,b);
cout<<"HCF : "<<res<<endl;
cout<<"LCM :"<<(a*b)/res;
return 0;
}LCM code
#include<iostream>
using namespace std;
int gcd(int a,int b)
{
if(a%b==0)
return b;
else
gcd(b,a%b);
}
int main()
{
int a,b;
cin>>a>>b;
int res = gcd(a,b);
cout<<"HCF : "<<res<<endl;
cout<<"LCM :"<<(a*b)/res;
return 0;
}lcm of an array
import java.util.*;
class Main {
public static void main(String[] args) {
int array[] = {8, 4, 2, 16};
//initialize LCM and GCD with the first element
int lcm = array[0];
int gcd = array[0];
//loop through the array to find GCD
//use GCD to find the LCM
for(int i=1; i<array.length; i++){
gcd = findGCD(array[i], lcm);
lcm = (lcm*array[i])/gcd;
}
//output the LCM
System.out.println("LCM: "+lcm);
}
//recursive function to find GCD of two numbers
public static int findGCD(int a, int b){
//base condition
if(b == 0)
return a;
return findGCD(b, a%b);
}
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
