关于“除数和余数的最大公约数就是被除数和除数的最大公约数”
今天看了下《算法》开头,里面提到一个欧几里德的算法,即
Compute the greatest common divisor of
two nonnegative integers p and q as follows:
If q is 0, the answer is p. If not, divide p by q
and take the remainder r. The answer
转载
2015-11-24 22:50:21 ·
1436 阅读 ·
0 评论