Description: Extended Euclidean algorithm for computing not only (a, b) the common denominator, and to calculate a modulus b and b modulus a multiplicative inverse of. Square and by the complexity of algorithm: the implementation of at least k times the number of modular multiplication, up to 2k times by mode.
File list (Check if you may need any files):
平方和乘模幂算法.cpp
扩展欧几里德算法.c
Download