1267B - Balls of Buma - CodeForces Solution


*900

Please click on ads to support us..

Python Code:

string = input()
label = [[string[0],0]]
actual_index = 0
for i in string:
    if i == label[actual_index][0]:
        label[actual_index][1] += 1
    else:
        actual_index += 1
        label.append([i,1])
dlugosc = len(label)
mozna = False
srodek = (1 + dlugosc) // 2 - 1
if dlugosc % 2 == 1:
        mozna = True
    if label[srodek][1] < 2:
        mozna = False
    else:   
        n = 1
        while n <= srodek:
            if label[srodek-n][1] + label[srodek+n][1] > 2 and label[srodek+n][0] == label[srodek-n][0]:
                n+=1
            else:
                mozna = False
                break
if not mozna:
    print(0)
else:
    print(label[srodek][1]+1)


Comments

Submit
0 Comments
More Questions

96A - Football
702B - Powers of Two
1036A - Function Height
443A - Anton and Letters
1478B - Nezzar and Lucky Number
228A - Is your horseshoe on the other hoof
122A - Lucky Division
1611C - Polycarp Recovers the Permutation
432A - Choosing Teams
758A - Holiday Of Equality
1650C - Weight of the System of Nested Segments
1097A - Gennady and a Card Game
248A - Cupboards
1641A - Great Sequence
1537A - Arithmetic Array
1370A - Maximum GCD
149A - Business trip
34A - Reconnaissance 2
59A - Word
462B - Appleman and Card Game
1560C - Infinity Table
1605C - Dominant Character
1399A - Remove Smallest
208A - Dubstep
1581A - CQXYM Count Permutations
337A - Puzzles
495A - Digital Counter
796A - Buying A House
67A - Partial Teacher
116A - Tram