192542025-12-02 19:46:01birozsLegtöbb gyümölcs (40 pont)python3Accepted 40/4027ms3272 KiB
N = int(input())
T = input()
dbA = 0
dbK = N // 2
for k in T:
    if k == "A":
        dbA += 1
    else:
        dbK -= 1
    if dbA == dbK:
        print(2*dbA)
        break
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/016ms2868 KiB
2Accepted0/027ms3116 KiB
3Accepted2/216ms2864 KiB
4Accepted2/216ms2868 KiB
5Accepted2/216ms3020 KiB
6Accepted2/216ms2868 KiB
7Accepted2/216ms2984 KiB
8Accepted3/314ms2868 KiB
9Accepted3/317ms2972 KiB
10Accepted3/316ms2936 KiB
11Accepted3/319ms3128 KiB
12Accepted3/319ms3124 KiB
13Accepted3/321ms3192 KiB
14Accepted3/324ms3124 KiB
15Accepted3/326ms3204 KiB
16Accepted3/325ms3272 KiB
17Accepted3/325ms3256 KiB