Login/RegisterProgram Discussion :: Basics
76 / 279
Write a program to find the LCM and GCD.
Answer:
#include
#include
using namespace std;
void main()
{
int num1, num2, gcd, lcm, remainder, numerator, denominator;
cout num1>>num2;
if (num1 > num2)
{
numerator = num1;
denominator = num2;
}
else
{
numerator = num2;
denominator = num1;
}
remainder = numerator % denominator;
while (remainder != 0)
{
numerator = denominator;
denominator = remainder;
remainder = numerator % denominator;
}
gcd = denominator;
lcm = num1 * num2 / gcd;
cout
Asked In ::
Language:
Mayank
24 Jun, 2017 5:35 PM
<!DOCTYPE html>
<html>
<body>
<?php
function LCM_GCD()
{
$num1 = 12;
$num2 = 68;
$gcd;
$lcm;
$remainder;
$numerator;
$denominator;
echo "Enter two numbers<br/>";
if ($num1 > $num2) {
$numerator = $num1;
$denominator = $num2;
} else {
$numerator = $num2;
$denominator = $num1;
}
$remainder = $numerator % $denominator;
while ($remainder != 0) {
$numerator = $denominator;
$denominator = $remainder;
$remainder = $numerator % $denominator;
}
$gcd = $denominator;
$lcm = $num1 * $num2 / $gcd;
echo "GCD of " . $num1 . " and " . $num2 . " is : " . $gcd;
echo "<br/>LCM of " . $num1 . " and " . $num2 . " is : " . $lcm;
}
LCM_GCD(); //function calling
?>
</body>
</html>
Language:
Ajay
7 Jul, 2017 9:30 AM
#include<stdio.h>
#define bool int
/* Function to check if x is power of 2*/
bool isPowerOfTwo (int x)
{
/* First x in the below expression is for the case when x is 0 */
return x && (!(x&(x-1)));
}
/*Driver program to test above function*/
int main()
{
isPowerOfTwo(31)? printf("Yes\n"): printf("No\n");
isPowerOfTwo(17)? printf("Yes\n"): printf("No\n");
isPowerOfTwo(16)? printf("Yes\n"): printf("No\n");
isPowerOfTwo(2)? printf("Yes\n"): printf("No\n");
isPowerOfTwo(18)? printf("Yes\n"): printf("No\n");
isPowerOfTwo(1)? printf("Yes\n"): printf("No\n");
return 0;
}
Language:
Varuna Rai
7 Jul, 2017 9:30 AM
#include <stdio.h>
#include <iostream>
using namespace std;
void main()
{
int num1, num2, gcd, lcm, remainder, numerator, denominator;
cout<<"Enter two numbers\n";
cin>> num1>>num2;
if (num1 > num2)
{
numerator = num1;
denominator = num2;
}
else
{
numerator = num2;
denominator = num1;
}
remainder = numerator % denominator;
while (remainder != 0)
{
numerator = denominator;
denominator = remainder;
remainder = numerator % denominator;
}
gcd = denominator;
lcm = num1 * num2 / gcd;
cout<<"GCD of "<< num1<<" and "<< num2<<" is "<< gcd;
cout<<"LCM of "<< num1<<" and "<< num2<<" is "<< lcm;
}
Language:
Siddhartha Paul
19 Jun, 2019 2:16 PM
import java.util.*;
public class LCM_GCD
{
public int lcm(int x,int y)
{
int a=(x>y)?x:y;
while(true)
{
if(a%x==0 && a%y==0)
return a;
else
++a;
}
}
public int gcd(int x,int y)
{
int r=0;
int a=(x>y)?x:y;
int b=(x<y)?x:y;
r=b;
while(a%b!=0)
{
r=a%b;
a=b;
b=r;
}
return r;
}
public static void main(String args[])
{
LCM_GCD lg=new LCM_GCD();
Scanner sc=new Scanner(System.in);
System.out.println("Enter 2 numbers: ");
int x=sc.nextInt();
int y=sc.nextInt();
System.out.println("LCM of "+x+" and "+y+" is: "+lg.lcm(x,y));
System.out.println("GCD of "+x+" and "+y+" is: "+lg.gcd(x,y));
}
}
