def solution(K, A):
    # write your code in Python 3.6
    l = len(A)
    rope_count = 0
    i = 0
    while i < l:
        v = A[i]
        if v >= K:
            rope_count += 1
            i += 1
        else:
            sub_length = v
            if i + 1 < l:
                for j in range(i+1, l):
                    sub_length += A[j]
                    if sub_length >= K:
                        rope_count += 1
                        i = j + 1
                        break
                i  = j  + 1
            else:
                i += 1
    return rope_count