最大公约数与最大公倍数

#include <iostream>  
  
using namespace std;  
  
int gcd(int a, int b)  
{  
    int temp;  
  
    if (a < b) {  
        temp = a;  
        a = b;  
        b = temp;  
    }  
  
    while (b != 0) {  
        temp  = a % b;  
        a = b;  
        b = temp;  
    }  
  
    return a;  
}  
  
int lcm(int a, int b)  
{  
    return a*b / gcd(a,b);  
}  
  
int main(int argc, char **argv)  
{  
    int a = 5;  
  
    int b = 13;  
  
    cout<<"最大公约数: "<<gcd(a,b)<<endl;  
          
    cout<<"最小公倍数: "<<lcm(a,b)<<endl;  
    return 0;  
}