#include <stdio.h>
//欧几里得算法
unsigned int gcd(unsigned int m, unsigned int n)
{
int t;
while (n != 0)
{
t = m % n;
m = n;
n = t;
}
return m;
}
int main()
{
int a = gcd(15, 20); //5
int b = gcd(32, 34); //2
int c = gcd(42, 12); //6
printf("a = %d b = %d c = %d\n", a, b, c);
return 0;
}