Алгоритм сжатия RLE

def rle_compress(sequence, k):
    result = []
    count = 1
    for i in range(1, len(sequence)):
        if sequence[i] == sequence[i - 1] and count < k:
            count += 1
        else:
            result.append(count)
            if count == k:
                result.append(0)
            count = 1
    result.append(count)
    return result
 
 
K = int(input().strip())
binary_sequence = list(map(int, input().strip().split()))[:-1]
if binary_sequence[0] == 1:
    binary_sequence.insert(0, 0)
compressed_sequence = rle_compress(binary_sequence, K)
print(*compressed_sequence)

def rle_compress(sequence, k):
    result = []
    count = 1
    for i in range(1, len(sequence)):
        if sequence[i] == sequence[i - 1]:
            if count == k:
                result.append(k)
                result.append(0)
                count = 1
            else:
                count += 1
        else:
            result.append(count)
            count = 1
 
    result.append(count)
 
    return result
 
compressed_sequence = rle_compress(binary_sequence, K)
 
K = int(input().strip())
binary_sequence = list(map(int, input().strip().split()))[:-1]
 
 
if binary_sequence and binary_sequence[0] == 1:
    compressed_sequence.insert(0, 0)
 
 
print(*compressed_sequence)

k = int(input('k = '))
arr = input('->').split()
arr.pop()
res = [] if arr[0] == '0' else [0]
i = 0
while i < len(arr):
    for symb in ('0', '1'):
        count_symb = 0
        while i < len(arr) and arr[i] == symb:
            count_symb += 1
            i += 1
        k_count, rem = divmod(count_symb, k)
        buffer = [k,0] * k_count
        if rem:
            buffer.append(rem)
        else:
            buffer.pop()
        res.extend(buffer)
        if i == len(arr):
            break
print(' '.join(list(map(str, res))))