Greatest Common Divisor (Euclidean algorithm)

euclid.go

package main

import "fmt"

func euc(m, n uint32) uint32 {
    var res uint32

    r := m % n

    if r == 0 {
        res = n
    } else {
        res = euc(n, r)
    }
    
    return res
}

func main() {
    var (
        m uint32
        n uint32
    )

    fmt.Print("Enter m: ")
    fmt.Scanln(&m)

    fmt.Print("Enter n: ")
    fmt.Scanln(&n)

    z := euc(m, n)

    fmt.Println("Result: ", z)
}