2775번 '부녀회장이 될테야'

func solve(start: Int, end: Int, count: inout Int) -> Int{
    if(start == 0){
        return count + end
    }
    else{
        for i in 1...end{
            count = solve(start: start - 1, end: i, count: &count)
        }
        return count
    }
}
 
 
let input = Int(readLine()!)!
var k = [Int]()
var n = [Int]()
for _ in 1...input{
    k.append(Int(readLine()!)!)
    n.append(Int(readLine()!)!)
}
for i in 0..<k.count{
    var count = 0
    print(solve(start: k[i], end: n[i], count: &count))
}
 
 

재귀함수를 활용하여 푼다.