public int Gcd(int a,int b)
{
if(b%a==0)
{
return a;
}
else
{
return Gcd(b%a);
}
}
main()
{
int gcd = 0;
int[] num = new int[]{15,39,45,102};
for(int I =0;i<num.Length;i++)
{
gcd = Gcd(num[i],num[i+1]);
num[I+1] = gcd;
}
}
c#数组求余,辗转相除递归
最新推荐文章于 2024-08-23 15:06:05 发布