最大公约数之欧几里得算法

/*
 ================================================
 Name: 输入两个正整数m,n, 打印二者最大公约数GCD
 Desc: gcd(m, n) = gcd(n, m % n) (m > 0, n >= 0)
 ================================================
 */
#include <stdio.h>
int main(void)
{
    int m, n, tmp;
    printf("Please enter two integers: ");
    scanf("%d%d", &m, &n);
    while(n > 0) {
        tmp = m % n;
        m   = n;
        n   = tmp;
    }
    printf("GCD is %d\n", m);
    return 0;
}
Tags: gcd 最大公约数 c语言
Time: 1370457245401