#include<stdio.h>
int gcd(int a, int b)
{
if(b == 0) return a;
else return gcd(b, a % b);
}
int main()
{
int m, n;
scanf("%d %d", &m, &n);
printf("%d", gcd(m, n));
return 0;
}
数学问题——最大公约数(欧几里得算法)
猜你喜欢
转载自blog.csdn.net/tian__si/article/details/113735698
今日推荐
周排行