Python用擴展歐幾里德算法求乘法逆元

擴展歐幾里得算法求最大公約數gcd def EX_GCD(a,b,arr): #擴展歐幾里得 if b == 0: arr[0] = 1 arr[1] = 0 return a g = EX_GCD(b, a % b, arr) t = arr[0] arr[0] = arr[1] arr[1] = t - i

>>阅读原文<<