package main
import (
"fmt"
)
// FindGCD 函数接受两个不等于0的整数M和N,并返回它们的最大公约数。
func FindGCD(M, N int) int {
a := M
b := N
for b != 0 {
r := a % b
a = b
b = r
}
return a
}
func main() {
M := 48
N := 18
gcd := FindGCD(M, N)
fmt.Printf("最大公约数为:%d\n", gcd)
M = 60
N = 48
gcd = FindGCD(M, N)
fmt.Printf("最大公约数为:%d\n", gcd)
M = 17
N = 8
gcd = FindGCD(M, N)
fmt.Printf("最大公约数为:%d\n", gcd)
}