LCM and HCF

Find LCM and HCF using C++

========================================================================

#include <iostream>

using namespace std;

main() 

{

  int a, b, x, y, t, gcd, lcm;

 

  cout<<"Enter two integers\n";

  cin>>x>>y;

  a = x;

  b = y;

 

  while (b != 0) {

    t = b;

    b = a % b;

    a = t;

  }

 

  gcd = a;

  lcm = (x*y)/gcd;

 

  cout<<"Greatest common divisor of  "<<x<<"  and   "<<y<<"   is  "<<gcd;

  cout<<endl;

  cout<<"Least common multiple of    "<<x<<"   and "<<y<<"   is   "<<lcm;

} 

========================================================================

OutPut:

SHARE