编辑代码

def max_seg(s, k):
    length = len(s)
    cnt = 0
    i = 0
    while i <= length - k:
        if s[i:i+k] == s[i] * k:
            cnt += 1
            i += k  # 子串不重叠
        else:
            i += 1
    return cnt

# 示例调用
s = input()
k = int(input())
result = max_seg(s, k)
print("最多的子串个数:", result)