[Python] 멀리 뛰기

https://school.programmers.co.kr/learn/courses/30/lessons/12914

프로그래머스

def solution(n):
    import math as m
    
    if n == 1:
        return 1
    
    else:
        answer = 1
        max_l = n//2
        i = 1
        
        while n >= max_l:
            n -= 1
            a = m.comb(n,i)
            answer += a
            i += 1
        return answer % 1234567