#include<iostream >
using namespace std;
int gcd(int m, int n);
int main()
{
int a, b;
cin >> a >> b;
cout << gcd(a, b) << endl;
return 0;
}
int gcd(int m, int n)
{
int r;
while (n != 0)
{
r = m%n;
m = n;
n = r;
}
return m;
}
求俩个数的最大公约数(欧几里德算法)
最新推荐文章于 2021-05-22 17:51:06 发布