辗转相除法，也叫欧几里得算法，是计算整数最大公因数的有效方法。本实验使用辗转相除法，通过编写一个C程序，让计算机来计算两个整数的最大公因数和最小公倍数，以及相应的参数s和t。-Euclidean algorithm, also called the Euclidean algorithm to calculate the greatest common divisor of integers effective way. Euclidean algorithm used in this experiment, by writing a C program that allows a computer to calculate the greatest common divisor of two integers and least common multiple, and the corresponding parameters s and t.