import Foundation func solution(_ n:Int, _ t:Int) -> Int { var n = n for _ in (1...t) { n *= 2 } return n }

import Foundation func solution(_ sides:[Int]) -> Int { let sides = sides.sorted() let min = sides[0] let max = sides[1] let sum = sides.reduce(0, +) var count = 0 // sides의 max가 가장 긴변일때 // 나머지 한변 max for i in 1...max { if i + min > max { count += 1 } } // 나머지 한변이 가장 긴변일때 // max < 나머지 한변 < sum for _ in (max+1)..

import Foundation func solution(_ sides:[Int]) -> Int { let sides = sides.sorted() return sides[0] + sides[1] > sides[2] ? 1 : 2 }

import Foundation func gcd(_ a: Int, _ b: Int) -> Int { if b == 0 { return a } else { return gcd (b, a % b) } } func solution(_ denum1:Int, _ num1:Int, _ denum2:Int, _ num2:Int) -> [Int] { let d = denum1 * num2 + denum2 * num1 let n = num1 * num2 let g = gcd(d, n) return [d/g, n/g] }

import Foundation func solution(_ numbers:[Int]) -> Double { return Double(numbers.reduce(0, +)) / Double(numbers.count) }

import Foundation func solution(_ s1:[String], _ s2:[String]) -> Int { return s1.filter { s2.contains($0) }.count }

import Foundation func solution(_ numbers:[Int], _ direction:String) -> [Int] { var numbers = numbers if direction == "right" { let element = numbers.removeLast() numbers.insert(element, at: 0) } else { let element = numbers.removeFirst() numbers.append(element) } return numbers }

import Foundation func solution(_ numbers:[Int], _ num1:Int, _ num2:Int) -> [Int] { return Array(numbers[num1...num2]) }