Implementing least common multiple and greatest common divisor in C + +

#include <iostream>using namespace STD;intMainvoid){intX, Y, NUM1, num2, temp;printf("Please enter two positive integers: \ n");scanf("%d%d", &AMP;NUM1, &num2);if(Num1 < NUM2)//Exchange{num1^=num2;        NUM2^=NUM1;    num1^=num2;    } x = NUM1; y = num2;//Let the num1,num2 value be the same     while(Y! =0) {temp = x%y; x = y;//cout<< "x=" <<x<<endl;y = temp;//cout<< "x=" <<y<<endl;}printf("Their greatest common divisor are:%d\n", x);printf("Their least common multiple are:%d\n", num1*num2/x);return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Implementing least common multiple and greatest common divisor in C + +