#include <iostream>
using namespace std;
int gcd(int m,int n)
{
while(n!=0)
{
int rem = m % n;
m = n;
n = rem;
}
return m;
}
int gcd1(int num1, int num2)
{
if(num1<num2) return gcd1(num2,num1);
if(num2 == 0) return num1;
else return gcd(num2,num1%num2);
}
int main(){
int n = 252, m = 105;
cout<<gcd1(m,n)<<endl;
}
递归和非递归的辗转相除法
最新推荐文章于 2023-10-21 16:31:49 发布