iOYES iOYES

아래 문제는 코딜리티에서 제공하는 CountDiv의 문제입니다🧑🏻‍💻 문제 제시 Write a function: public func solution(_ A : Int, _ B : Int, _ K : Int) -> Int that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.: { i : A ≤ i ≤ B, i mod K = 0 } For example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three numbers divisible by ..