[dovelet][For] gcd_lcm

dovelet    3 단계 For

최대공약수, 최소공배수 / gcd_lcm

http://59.23.113.171/30stair/gcd_lcm/gcd_lcm.php?pname=gcd_lcm

#include <stdio.h>
 
int gcd(int n, int m)
{
    int temp;
 
    while (n != m)    {
 
        if (n > m)    {
            temp = n;
            n = m;
            m = temp;
        }
 
        temp = n;
        n = m - n;
        m = temp;
    }
    return n;
}
 
int lcm(int n, int m)
{
    int i = 1, temp = n;
 
    while (temp % m != 0)    {
        temp = n * i++;
    }
    return temp;
}
 
int main(void)
{
    int n, m;
 
    scanf("%d%d", &n, &m);
 
    printf("%d %d\n", gcd(n, m), lcm(n, m));
 
    return 0;
}

#include <stdio.h>
 
int gcd(int first, int second)
{
    if(!second)    return first;
    gcd(second, first % second);
}
 
int main()
{
    int n, m;
 
    scanf("%d %d", &n, &m);
 
    printf("%d %d\n", gcd(n, m), n * m / gcd(n, m));
 
    return 0;
}