An algorithm for finding the greatest common divisor of two integers, m and n. If m > n divide m by n and let r be the remainder. If r = 0 then n is the answer; otherwise apply the same algorithm to the integers n and r.
科学参考收录了60776条科技类词条，基本涵盖了常见科技类参考文献及英语词汇的翻译，是科学学习和研究的有利工具。