Первый веб 24

f = open('test.txt').readline()

print(max([len(i) for i in f.replace('a', ' ').replace('s', ' ').replace('d',' ').split()]))
# asdf -> s f -> 1,1 -> 1

#1...9abcdef
f = open('24_9791.txt').readline()

s = 'QWRTYUIOPSGHJKLZXVNM'
for i in s:
    f = f.replace(i,' ')

print(max( [len(i) for i in f.split()] )) #21

# combination 'st' is forbidden
# st -> __ wrong
# st -> s_t ok

# combination 'kege' is forbidden
'''
--------------
asdfasdfasdKEGEaasdhsdasda
            --------------
KEGE -> keg_ege
'''
s = open('test.txt').readline()
s = s.replace('KEGE', 'KEG EGE')

# combinations may intersect 'ffffff'
# replace cannot deal with this
# sol: multiple replaces

while 'fff' in s:
    s = s.replace('fff', 'ff ff')
print(max(len(i) for i in s.split()))


# pairs of symbols ( without intersects )

f = open('24_223.txt').readline()

f = f.replace('TIK', '*').replace('TOK', '*')
# for i in 'IKOT':
#     f.replace(i,' ')
print(f.count('*'))

#letter + digit + digit without intersects
s = '14234234sdafsasdf123asdf132f'
s = s.replace('all digits', 'unified digit').replace('all letters', 'unified letter')
s = s.replace('A11', '*').replace('A', ' ').replace('1', ' ')
print(max(len(i) for i in s.split()))

f = open('24_9845.txt').readline()

f = f.replace('B','A').replace('C','A').replace('9','8')
while 'AA' in f or '88' in f:
    f = f.replace('AA', 'A A').replace('88', '8 8')

print(max(len(i) for i in f.split()))


f = open('24_17641.txt').readline()

while '++' in f or '+*' in f or '*+' in f or '**' in f:
    f = f.replace('++', ' ').replace('+*', ' ').replace('*+', ' ').replace('**', ' ')

while '+ ' in f or '* ' in f or ' +' in f or ' *' in f:
    f = f.replace(' +', ' ').replace('+ ', ' ').replace('* ', ' ').replace(' *', ' ')

print(max( [len(i) for i in f.split() if eval(i) == 0] ))


# symbol number limit
# split() != split(' ') because you can face multiple spaces, so 'SS__SS' -> 'SS', '', 'SS'

s = 'BBBACCCCAAGGGTTAD'
s = s.split('A')
m = -1
for i in range(3, len(s)):
    #c = s[i]+'A'+s[i-1]+'A'+s[i-2]+'A'+s[i-3]
    c = 'A'.join(s[i-3:i+1])
    m = max(m,len(c))
print(m)

# split by symbol min len
s = 'BBBACCCCAAGGGTTAD'
s = s.split('A')
m = 1000
for i in range(len(s)-3):
    #c = 'A'+s[i-1]+'A'+s[i-2]+'A'
    c = 'A'.join(s[i+1:i+3])
    m = min(m,len(c) + 2)
print(m)