Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
b = input()
 
if  "A"==b
    print("T")
elif "C"==b
    print("G")
elif "T"==b
    print("A")
else:
    print("C")

Fixed submission:
S = input()
count = 0
num = 0


for i in S:
    if i=="A" or i=="C" or i=="G" or i=="T":
         count = count + 1
         if count >= num:
             num = count
    else:
        count = 0

print(num)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
"""
Created on Sat Mar  9 21:40:34 2019

@author: iwata
"""

N,M = map(int, input().split())
numlist =[]
money = 0
count = 0
count1 = 0
count2 = 0

for i in range(N):
    AB = list(map(int, input().split()))
    numlist.append(AB)

numlist.sort()

while count < M:
    while numlist[count1][1] > count2:
        money = money + numlist[count1][0]
        count = count + 1
        count2 = count2 + 1
        if count == M:
            break
    count1 = count1 + 1
    count2 = 0
    
print(money)


Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Sat Mar  9 21:07:57 2019

@author: iwata
"""

H,W = map(int, input().split())
h,w = map(int, input().split())

num = H*W - (h*W+(H-h)*w)
print(num)

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
"""
Created on Sat Mar  9 21:40:34 2019

@author: iwata
"""

N,M = map(int, input().split())
numlist =[]
money = 0
count = 0
count1 = 0
count2 = 0

for i in range(N):
    AB = list(map(int, input().split()))
    numlist.append(AB)

numlist.sort()

while count <= M:
    while numlist[count1][1] >= count2:
        money = money + numlist[count1][0]
        count = count + 1
        count2 = count2 + 1
        if count == M:
            break
    count1 = count1 + 1
    count2 = 0
    
print(money)


Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Sat Mar  9 21:07:57 2019

@author: iwata
"""

H,W = map(int, input().split())
h,w = map(int, input().split())

num = H*W - (h*W+(H-h)*w)
print(num)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
"""
Created on Sat Mar  9 21:40:34 2019

@author: iwata
"""

N,M = map(int, input().split())
numlist =[]
money = 0
count = 0
count1 = 0
count2 = 0

for i in range(N):
    AB = list(map(int, input().split()))
    numlist.append(AB)

numlist.sort()

while count <= M:
    while numlist[count1][1] <= count2:
        money = money + numlist[count1][0]
        count = count + 1
        count2 = count2 + 1
        if count == M:
            break
    count1 = count1 + 1
    count2 = 0
    
print(money)


Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Sat Mar  9 21:40:34 2019

@author: iwata
"""

N,M = map(int, input().split())
numlist =[]
money = 0
count = 0
count1 = 0
count2 = 0

for i in range(N):
    AB = list(map(int, input().split()))
    numlist.append(AB)

numlist.sort()

while count < M:
    while numlist[count1][1] > count2:
        money = money + numlist[count1][0]
        count = count + 1
        count2 = count2 + 1
        if count == M:
            break
    count1 = count1 + 1
    count2 = 0
    
print(money)

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
"""
Created on Sat Mar  9 21:40:34 2019

@author: iwata
"""

N,M = map(int, input().split())
numlist =[]
num = 0

for i in range(N):
    A,B = map(int, input().split())
    for j in range(B):
        numlist.append(A)

numlist.sort()


for k in range(M):
    num += numlist[k]
    
print(num)
    

Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Sat Mar  9 21:40:34 2019

@author: iwata
"""

N,M = map(int, input().split())
numlist =[]
money = 0
count = 0
count1 = 0
count2 = 0

for i in range(N):
    AB = list(map(int, input().split()))
    numlist.append(AB)

numlist.sort()

while count < M:
    while numlist[count1][1] > count2:
        money = money + numlist[count1][0]
        count = count + 1
        count2 = count2 + 1
        if count == M:
            break
    count1 = count1 + 1
    count2 = 0
    
print(money)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
"""
Created on Wed Mar  6 16:28:37 2019

@author: iwata
"""

A,B,K = map(int,input().split())
count = 0

if A >= B:
    for i in reversed(range(B)):
        rema1 = A%i
        remb1 = B%i
        if rema1==0 & remb1==0:
            count = count +1
        if K == count:
            print(i)
            break
else:
    for j in reversed(range(A)):
        rema = A%j
        remb = B%j
        if rema==0 & remb==0:
            count = count +1
        if K == count:
            print(j)
            break

Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Wed Mar  6 16:28:37 2019

@author: iwata
"""

A,B,K = map(int,input().split())
count = 0

if A >= B:
    for i in reversed(range(B+1)):
        rema1 = A%i
        remb1 = B%i
        if rema1==0 and remb1==0:
            count = count +1
        if K == count:
            print(i)
            break
else:
    for j in reversed(range(A+1)):
        rema = A%j
        remb = B%j
        if rema==0 and remb==0:
            count = count +1
        if K == count:
            print(j)
            break
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
"""
Created on Sat Feb 16 21:09:45 2019

@author: iwata
"""

N, M = map(int, input().split())
anew = []         

a = list(map(int, input().split()))
for i in range(1,len(a)):
    anew.append(a[i])

for j in range(1,N):
    a = list(map(int, input().split()))
    for k in range(1, len(a)):
        anew.append(a[k])
    anew_duplicate = [x for x in set(anew) if anew.count(x) > 1]
    anew = anew_duplicate 
print(len(anew_duplicate))

Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Sat Feb 16 21:09:45 2019

@author: iwata
"""

N, M = map(int, input().split())
anew = []         

a = list(map(int, input().split()))
for i in range(1,len(a)):
    anew.append(a[i])

if N==1:
    print(len(anew))
else:
    for j in range(1,N):
        a = list(map(int, input().split()))
        for k in range(1, len(a)):
            anew.append(a[k])
        anew_duplicate = [x for x in set(anew) if anew.count(x) > 1]
        anew = anew_duplicate 
    print(len(anew_duplicate))
Buggy python submission (verdict: Runtime Error):
D = input()
if D=="25":
    print("Christmas")
elif D =="24":
    print("Christmas Eve")
elif D =="23":
    print("Christmas Eve Eve")
elif D == "22"
    print("Christmas Eve Eve Eve")

Fixed submission:
D = input()
if D=="25":
    print("Christmas")
elif D =="24":
    print("Christmas Eve")
elif D =="23":
    print("Christmas Eve Eve")
elif D == "22":
    print("Christmas Eve Eve Eve")
Buggy python submission (verdict: Runtime Error):
x = input()
if x == "7"or"5"or"3"
    print("YES")
else:
    print("NO")

Fixed submission:
x = input()
if x == "7"or x=="5"or x=="3":
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
n = list(input())
count = 0

for i in n:
    if i == "1":
        n[count] = "9"
    elif i == "9":
        n[count] = "1"
    count += 1

print("".job(n))

Fixed submission:
n = list(input())
count = 0

for i in n:
    if i == "1":
        n[count] = "9"
    elif i == "9":
        n[count] = "1"
    count += 1

print("".join(n))
Buggy python submission (verdict: Runtime Error):

S = list(input())
num = 700


for i in S:
    if i == "o"
        num += 100
print(num)

Fixed submission:

S = input()
num = 700


for i in S:
    if i == "o":
        num += 100
print(num)
Buggy python submission (verdict: Runtime Error):
A, B, X = input(int, input().split())

if A <= X <= A+B:
    print("YES")
else:
    print("No")

Fixed submission:
A, B, X = map(int, input().split())

if A <= X <= A+B:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):

S = input()

A = set["a","b","c"]

if set(S) == A:
    print("Yes")
else:
    print("No")

Fixed submission:
S = input()

if "a" in S and "b" in S and "c" in S:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
S = list(input())

A = set["a","b","c"]

if set(S) == A:
    print("Yes")
else:
    print("No")


Fixed submission:
S = input()

if "a" in S and "b" in S and "c" in S:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())

if a+b >= c
    print("Yes")
else:
    print("No")

Fixed submission:
a, b, c = map(int, input().split())

if a+b >= c:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())

if a+b >= c
    print("Yes")
else:
    print("No")

Fixed submission:
a, b, c = map(int, input().split())

if a+b >= c:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())

if a+b >= c
    print("Yes")
else:
    print("No")

Fixed submission:
c1 = input()
c2 = input()
c3 = input()

print(c1[0]+c2[1]+c3[2])
Buggy python submission (verdict: Runtime Error):
S = input()
Snew = "2018"
for i in range(4):
    S[i] = Snew[i] 
    
print(S)

Fixed submission:
S = list(input())
S[3] = "8"
print("".join(S))

Buggy python submission (verdict: Runtime Error):

S = input()
S[0:3]="2018"
print(S)

Fixed submission:
S = list(input())
S[3] = "8"
print("".join(S))

Buggy python submission (verdict: Runtime Error):

S = input()
S[0:3]="2017"
print(S)

Fixed submission:
S = list(input())
S[3] = "8"
print("".join(S))
Buggy python submission (verdict: Runtime Error):
X, Y = map(int, input().split())
X1 = int(X, 16)
X2 = int(Y, 16)

if X>Y:
    print(">")
elif X==Y:
	print("=")
else:
    print("<")

Fixed submission:
X, Y = input().split()

if X>Y:
    print(">")
elif X==Y:
	print("=")
else:
    print("<")

Buggy python submission (verdict: Runtime Error):
X, Y = map(int, input().split())
X1 = int(X, 16)
X2 = int(Y, 16)

if X>Y:
    print(">")
else:
    print("<")

Fixed submission:
X, Y = input().split()

if X>Y:
    print(">")
elif X==Y:
	print("=")
else:
    print("<")
Buggy python submission (verdict: Runtime Error):

R = int(input())
G = int(input())

print(2*G/R)

Fixed submission:


R = int(input())
G = int(input())

print(2*G-R)
Buggy python submission (verdict: Runtime Error):
N = input()
count = N.count(9)
if count >= 1:
    print("Yes")
else:
    print("No")
    

Fixed submission:
N = input()
count = N.count("9")
if count >= 1:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
x, a, b = map(int, input().split())

if abs(a-x) < abs(b-x):
    print(B)
else:
    print(A)
    

Fixed submission:
x, a, b = map(int, input().split())

if abs(a-x) < abs(b-x):
    print("A")
else:
    print("B")
Buggy python submission (verdict: Runtime Error):
N = input().split
N1 = list(reversed(N))
if N == N1:
    print("Yes")
else:
    print("No")

Fixed submission:
N = input()

N1 = N[2]+N[1]+N[0]
if N == N1:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
N = input().split
 
if N == list(reversed(N)):
    print("Yes")
else:
    print("No")

Fixed submission:
N = input()

N1 = N[2]+N[1]+N[0]
if N == N1:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
N = input().split
 
if N == list(reversed(N)):
    print("Yes")

Fixed submission:
N = input()

N1 = N[2]+N[1]+N[0]
if N == N1:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):

list1 = list(map(int, input().split()))
list1.sort()
print(list[0]+list[1])

Fixed submission:

list1 = list(map(int, input().split()))
list1.sort()
print(list1[0]+list1[1])
Buggy python submission (verdict: Runtime Error):


s1, s2, s3 = input().split())

print(str.upper(s1[0]+" "+s2[0]+" "+s3[0]))

Fixed submission:
s1, s2, s3 = input().split()

print(str.upper(s1[0]+s2[0]+s3[0]))

Buggy python submission (verdict: Runtime Error):


s1, s2, s3 = map(int, input().split())

print(str.upper(s1[0]+" "+s2[0]+" "+s3[0]))

Fixed submission:
s1, s2, s3 = input().split()

print(str.upper(s1[0]+s2[0]+s3[0]))

Buggy python submission (verdict: Runtime Error):
s1, s2, s3 = map(int, input().split())

str.upper(s1[0]+" "+s2[1]+" "+s3[2])


Fixed submission:
s1, s2, s3 = input().split()

print(str.upper(s1[0]+s2[0]+s3[0]))
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
 
if A+B>=24:
    print(A+B-24)
else:
    print(A+B)


Fixed submission:
A, B = map(int, input().split())
 
if A+B>=24:
    print(A+B-24)
else:
    print(A+B)

Buggy python submission (verdict: Runtime Error):

a, b = map(int, input().split())

if A+B=>24:
    print(A+B-24)
else:
    print(A+B)

Fixed submission:
A, B = map(int, input().split())
 
if A+B>=24:
    print(A+B-24)
else:
    print(A+B)
Buggy python submission (verdict: Runtime Error):
a, b = input.split()

if (a=="H"and b=="H")or(a=="D" and b=="D"):
    print("H")
else:
    print("D")

Fixed submission:
a, b = input().split()

if (a=="H"and b=="H")or(a=="D" and b=="D"):
    print("H")
else:
    print("D")
Buggy python submission (verdict: Runtime Error):
A,op,B = input().split
A = int(A)
B = int(B)
if op=="+":
    print(A+B)
else:
    print(A-B)


Fixed submission:
A,op,B = input().split()
A = int(A)
B = int(B)
if op=="+":
    print(A+B)
else:
    print(A-B)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
h = int(input())  

print(int((a+b)*h/2)

Fixed submission:
a = int(input())
b = int(input())
h = int(input())  

print(int((a+b)*h/2))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
q = list(map(lambda x:int(x),input().split()))
a = max(q)
b = min(q)
cnt = 0
for d in range(b,a+1):
    ARC = 0
    ABC = 0
    for qq in q:
        if qq >= d : ARC += 1
        else: ABC += 1
    if ARC == ABC:
        cnt += 1
print(cnt)

Fixed submission:
n = int(input())
q = list(map(lambda x:int(x),input().split()))
q.sort()
cnt = q[int(n/2)] - q[int(n/2)-1]
print(cnt)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
n = int(input())
arr = [int(i) for i in input().split(" ")]
l = len(arr)
count = 1
for i in range(0, l-3):
    if arr[i] < arr[i+1] and arr[i*1] < arr[i*2]:
        count += 1
    elif arr[i+2] < arr[i+1] and arr[i*1] < arr[i2]:
        count += 1
print(count)


Fixed submission:
# -*- coding: utf-8 -*-
n = int(input())
arr = [int(i) for i in input().split(" ")]
l = len(arr)
count = 0
for i in range(0, l-2):
    m = arr[i+1]
    tmp = [arr[i], arr[i+1], arr[i+2]]
    tmp.sort()
    if m == tmp[1]:
        count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
n = int(input())
arr = [int(i) for i in input().split(" ")]
l = len(arr)
count = 1
for i in range(0, l-3):
    if arr[i] < arr[i+1] and arr[i*1] < arr[i*2]:
        count += 1

print(count)


Fixed submission:
# -*- coding: utf-8 -*-
n = int(input())
arr = [int(i) for i in input().split(" ")]
l = len(arr)
count = 0
for i in range(0, l-2):
    m = arr[i+1]
    tmp = [arr[i], arr[i+1], arr[i+2]]
    tmp.sort()
    if m == tmp[1]:
        count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N = int(input())
counter = 0
arr = [int(i) for i in input().split(" ")]
flag = True
while 0 < len(arr):
    counter = counter + 1
    for i in arr:
        arr[i] = arr[i] << 1
        if arr[i] == 1:
            pass
        else:
            ret.append(arr[i])
    arr = ret

print(counter)


Fixed submission:
# -*- coding: utf-8 -*-
N = int(input())
counter = 0
arr = [int(i) for i in input().split(" ")]
flag = True
while flag:
    ret = []
    for i in range(len(arr)):
        if arr[i] % 2 == 1:
            flag = False
            break
        arr[i] = arr[i] >> 1
        if arr[i] % 2 == 1:
            counter = counter + 1
            flag = False
            break
    if flag:
        counter = counter + 1

print(counter)
Buggy python submission (verdict: Runtime Error):
n, b, c = map(int, input().split(""))
ans = 0
for i in range(n + 1):
    if b <= sum(list(map(int, list(str(i))))) <= c:
        ans += i
print(ans)


Fixed submission:
n, b, c = map(int, input().split())
ans = 0
for i in range(n + 1):
    if b <= sum(list(map(int, list(str(i))))) <= c:
        ans += i
print(ans)
Buggy python submission (verdict: Runtime Error):
s = list(input())
t = list(input())
s.sort()
t.sort()

r = len(s) if len(s) < len(t) else len(t)
for i in range(0, r):
    if (not s or not t):
        break
    if s.pop(i) == t.pop(i):
        continue
    elif s.pop(i) < t.pop(i):
        print("Yes")
        exit()
    else:
        print("No")
        exit()
print("Yes") if len(s) < len(t) else print("No")


Fixed submission:
s = list(input())
t = list(input())
s.sort()
t.sort()
t.reverse()
print("Yes") if s < t else print("No")

Buggy python submission (verdict: Runtime Error):
s = list(input())
t = list(input())
s.sort()
t.sort()

r = len(s) if len(s) < len(t) else len(t)
for i in range(0, r):
    if s.pop(i) == t.pop(i):
        continue
    elif s.pop(i) < t.pop(i):
        print("Yes")
        exit()
    else:
        print("No")
        exit()
print("Yes") if len(s) < len(t) else print("No")


Fixed submission:
s = list(input())
t = list(input())
s.sort()
t.sort()
t.reverse()
print("Yes") if s < t else print("No")

Buggy python submission (verdict: Runtime Error):
s = list(input())
t = list(input())
s.sort()
t.sort()

r = len(s) if len(s) < len(t) else len(t)
for i in range(0, r-1):
    if s.pop(i) == t.pop(i):
        continue
    elif s.pop(i) < t.pop(i):
        print("Yes")
        exit()
    else:
        print("No")
        exit()
print("Yes") if len(s) < len(t) else print("No")


Fixed submission:
s = list(input())
t = list(input())
s.sort()
t.sort()
t.reverse()
print("Yes") if s < t else print("No")
Buggy python submission (verdict: Runtime Error):
K, S = map(int, input().split())
ct = 0
for i in range(K + 1):
    for j in range(K + 1):
        a = S - i - j
        if 0 <= a <= k:
            ct += 1

print(ct)


Fixed submission:
K, S = map(int, input().split())
ct = 0
for i in range(K + 1):
    for j in range(K + 1):
        a = S - i - j
        if 0 <= a <= K:
            ct += 1

print(ct)

Buggy python submission (verdict: Time Limit Exceeded):
K, S = map(int, input().split())
ct = 0
for i in range(K+1):
    for j in range(K+1):
        for k in range(K+1):
            if (S == (i + j + k)):
                ct += 1

print(ct)


Fixed submission:
K, S = map(int, input().split())
ct = 0
for i in range(K + 1):
    for j in range(K + 1):
        a = S - i - j
        if 0 <= a <= K:
            ct += 1

print(ct)
Buggy python submission (verdict: Runtime Error):
N = int(input())
card_num = list(map(int, input().split()) )
card_num.sort(reverse=True)

alice = 0
bob = 0

for i in range(0,N):
  if i %2 == 0:
    alice += card_num[i]
  else:
    bob   += card_num[i+1] 
ans = int(alice - bob)

print(ans)

Fixed submission:
N = int(input())
card_num = list(map(int, input().split()) )
card_num.sort(reverse=True)

alice = 0
bob = 0

for i in range(0,N):
  if i %2 == 0:
    alice += card_num[i]
  else:
    bob   += card_num[i] 
ans = int(alice - bob)

print(ans)
Buggy python submission (verdict: Runtime Error):
n, m = map(int,input().split())
dangerList = [int(input()) for i in range(m)]
answerList = [0] * (n+2)
answerList[0] = 1
nextDanger = dangerList.pop(0)
for i in range(n):
  if i == nextDanger:
    if len(dangerList) > 0:
    	nextDanger = dangerList.pop(0)
  else:
    answerList[i+1] = (answerList[i+1] + answerList[i]) % 1000000007
    answerList[i+2] = (answerList[i+2] + answerList[i]) % 1000000007
print(answerList[n])

Fixed submission:
n, m = map(int,input().split())
dangerList = [int(input()) for i in range(m)]
answerList = [0] * (n+2)
answerList[0] = 1
nextDanger = n + 2
if len(dangerList) > 0:
  nextDanger = dangerList.pop(0)
for i in range(n):
  if i == nextDanger:
    if len(dangerList) > 0:
    	nextDanger = dangerList.pop(0)
  else:
    answerList[i+1] = (answerList[i+1] + answerList[i]) % 1000000007
    answerList[i+2] = (answerList[i+2] + answerList[i]) % 1000000007
print(answerList[n])
Buggy python submission (verdict: Runtime Error):
n = int(input())
edgeList0 = [list(map(int, input().split())) for i in range(n-1)]
cList = list(map(int,input().split()))
cList.sort(reverse=True)
print(sum(cList[1:]))
edgeList = []
for _ in range(n):
  edgeList.append([])
for i in edgeList0:
  edgeList[i[0]-1].append(i[1]-1)
  edgeList[i[1]-1].append(i[0]-1)

def edgefunc(j):
  numList.append((j,cList.pop(0)))
  if len(edgeList[j]) != 0:
    for k in edgeList[j]:
      edgeList[k].remove(j)
      edgefunc(k)

numList = []
edgefunc(0)
numList.sort()
answer2 = ""
for l in numList:
  answer2 += str(l[1]) + " "
print(answer2[:-1])

Fixed submission:
import sys

sys.setrecursionlimit(100000)

n = int(input())
edgeList0 = [list(map(int, input().split())) for i in range(n-1)]
cList = list(map(int,input().split()))
cList.sort(reverse=True)
print(sum(cList[1:]))
edgeList = []
for _ in range(n):
  edgeList.append([])
for i in edgeList0:
  edgeList[i[0]-1].append(i[1]-1)
  edgeList[i[1]-1].append(i[0]-1)

def edgefunc(j):
  numList.append((j,cList.pop(0)))
  if len(edgeList[j]) != 0:
    for k in edgeList[j]:
      edgeList[k].remove(j)
      edgefunc(k)

numList = []
edgefunc(0)
numList.sort()
answer2 = ""
for l in numList:
  answer2 += str(l[1]) + " "
print(answer2[:-1])
Buggy python submission (verdict: Runtime Error):
from fractions import gcd
from functools import reduce
import copy

n = int(input())
a = list(map(int,input().split()))

fValueList = []
lValueList = []
maxList = []

if n == 2:
  print(gcd(a[0], a[1]))
else:
  fValueList.append(a[0])
  lValueList.append(a[n-1])
  for i in range(1,n-1):
    g = fValueList[i-1]
    fValueList.append(gcd(g, a[i]))

  for i in range(1,n-1):
    g = lValueList[i-1]
    lValueList.append(gcd(g, a[n-1-i]))
  
  maxList.append(fValueList[n-1])
  maxList.append(lValueList[n-1])
  for k in range(n-2):
    g = gcd(fValueList[k], lValueList[n-2-k])
    maxList.append(g)
    
  print(max(maxList))


Fixed submission:
a, b, t = map(int,input().split())
print(t // a * b)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = input()
min = s.count('#')
if s.count('.')  < min:
  min = s.count('.') 
for i in range(len(s)-1):
  if s[:i].count('#') + s[i+1:].count('.')  < min:
    min = s[:i].count('#') + s[i+1:].count('.')
print(min)

Fixed submission:
n = int(input())
s = input()
cost = s.count('.')
min = cost
for i in range(len(s)):
  if s[i]  == '.':
  	cost -= 1
  else:
    cost += 1
  if cost < min:
    min = cost
print(min)