欧几里德算法

定理：两个整数的最大公约数等于其中较小的那个数和两个书相除余数的最大公约数。最大公约数（Greatest Common Divisor）缩写为GCD

Gcd（a，b） = Gcd（b，a mod b）其中（a > b 且 r = a mod b, r不为零）

C语言版

#include<stdio.h>

unsigned int Gcd(unsigned int m, unsigned int n)

{

    unsigned int x;

    while (n > 0)

    {

         x
= m % n;

         printf("%d",x);

         m = n;

         n = x;

    }

    return m;

}

int main()

{

    int a, b;

    scanf_s("%d %d",&a,&b);

    printf("The greastest common factor of %d and %d is ",a,b);

    printf("%d\n",Gcd(a,b));

    return 0;

}

Python版

def gcd(a, b):

   
while a != 0:

       
a, b = b % a, a

 

return b