gcd and lcm in c++

Xixika answered on April 29, 2022 Popularity 10/10 Helpfulness 5/10

answer gcd and lcm in c++

related find lcm with gcd

related Program to Compute LCM Using GCD

related gcd and lcm of an array

gcd and lcm in c++

Comment

long long gcd(long long int a, long long int b)
{
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
long long lcm(ll int a, ll int b)
{
    return (a / gcd(a, b)) * b;
}
// there is a math formula used in this code which you can search up about,
// but you can just use it as it is.

Popularity 10/10 Helpfulness 5/10 Language cpp

Source: Grepper

Tags: c++ lcm

Link to this answer
Share Copy Link

Contributed on Apr 29 2022

Xixika

0 Answers Avg Quality 2/10

Closely Related Answers

find lcm with gcd

Comment

import java.util.*;

public class LCM {
  
  public static long lcm(int a, int b) {

    long x = (a/euclidGcd(a, b));

    return x * b;

  }

  public static int euclidGcd(int a, int b) {

    if (b == 0)
      return a;

    int aprime = a%b;
    
    return euclidGcd(b, aprime);
  }
  
  public static void main(String args[]) {
    Scanner scanner = new Scanner(System.in);
    int a = scanner.nextInt();
    int b = scanner.nextInt();

    System.out.println(lcm(a, b));
  }
}

Popularity 10/10 Helpfulness 4/10 Language java

Source: Grepper

Tags: find

Link to this answer
Share Copy Link

Contributed on May 15 2022

Dale Applegate

0 Answers Avg Quality 2/10

Program to Compute LCM Using GCD

Comment

# Python program to find the L.C.M. of two input number

# This function computes GCD 
def compute_gcd(x, y):

   while(y):
       x, y = y, x % y
   return x

# This function computes LCM
def compute_lcm(x, y):
   lcm = (x*y)//compute_gcd(x,y)
   return lcm

num1 = 54
num2 = 24 

print("The L.C.M. is", compute_lcm(num1, num2))

Popularity 9/10 Helpfulness 1/10 Language python

Source: www.programiz.com

Tags: lcm

Link to this answer
Share Copy Link

Contributed on Jul 26 2022

Jinn world

0 Answers Avg Quality 2/10

gcd and lcm of an array

Comment

//We write the function to find the GCD of two numbers.

//We consider the first element of the array to be the gcd of itself and iterate through 
//each element of the array and update gcd with GCD of current element and previous gcd.

//We then find the LCM using the identity 
//           LCM*GCD = Multiplication of each number in the array
using System;
					
public class Program
{
	public static void Main()
	{
		string[] input = Console.ReadLine().Split(' ');
		int[] arr = Array.ConvertAll(input, int.Parse);
		int[] res = GCDandLCM(arr);
		Console.WriteLine("GCD is: {0}", res[0]);
		Console.WriteLine("LCM is: {0}", res[1]);
	}
	//GCD and LCM of numbers given in an array
	public static int[] GCDandLCM(int[] arr)
	{
		int gcd = arr[0];
		for(int i=1; i<arr.Length; i++)
		{
			gcd = GCD(gcd, arr[i]);
		}
		int lcm = Multiply(arr)/gcd;
		return new int[] {gcd, lcm};
	}
    //GCD using repetitive subtraction method
	public static int GCD(int a, int b)
	{
		while(a!=b)
		{
			if(a>b) a=a-b;
			else b=b-a;
		}
		return a;
	}
	public static int Multiply(int[] arr)
	{
		int mult = 1;
		for(int i=0; i<arr.Length; i++)
		{
			mult*=arr[i];
		}
		return mult;
	}
}

Popularity 9/10 Helpfulness 1/10 Language csharp

Source: Grepper

Tags: c# lcm lc

Link to this answer
Share Copy Link

Contributed on Oct 15 2022

Md Yasir

0 Answers Avg Quality 2/10

gcd and lcm in c++

Contents

More Related Answers

gcd and lcm in c++

Closely Related Answers

find lcm with gcd

Program to Compute LCM Using GCD

gcd and lcm of an array

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.