OyaCode - Greatest Common Divisor 的评论
type: channel
link: https://code.nfblogs.com/archives/algo_gcd.html
description: TheoryConsider gcd(a, b), let's say a > b, then we have:gcd(a, b) == gcd(a - b, b)ProofConside...