[Swift] 백준 14490 백대열 (최대공약수 GCM 문제)

 

📌 풀이

💬 Code

let num = readLine()!.split(separator: ":").map { Int(String($0))! }
let num1 = num[0]
let num2 = num[1]
let gcd = GCD(num1, num2)

print("\(num1/gcd):\(num2/gcd)")

func GCD(_ min:Int, _ max:Int) -> Int {
    let res = min % max
    if res == 0 {
        return max
    }
    return GCD(max, res)
}

 

 

14490번: 백대열