185862025-10-28 11:21:42WellLeopardUsuallyLegtöbb gyümölcs (40 pont)python3Accepted 40/4025ms3240 KiB
n = int(input())
crates = input()
output = 0
for i in range(0, n//2):
    if crates[i] == 'A':
        output += 2
print(output)
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/014ms2868 KiB
2Accepted0/025ms3116 KiB
3Accepted2/216ms2868 KiB
4Accepted2/214ms2868 KiB
5Accepted2/214ms3056 KiB
6Accepted2/216ms3032 KiB
7Accepted2/216ms2980 KiB
8Accepted3/317ms2876 KiB
9Accepted3/316ms2868 KiB
10Accepted3/316ms3048 KiB
11Accepted3/319ms3000 KiB
12Accepted3/319ms2964 KiB
13Accepted3/319ms3176 KiB
14Accepted3/321ms3160 KiB
15Accepted3/324ms3152 KiB
16Accepted3/323ms3204 KiB
17Accepted3/324ms3240 KiB