Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()

def listup(s):
    ans = [0 for i in range(10)]
    for i in range(len(s)):
        ans[int(s[i])] += 1
    return ans

ans = [0 for i in range(1000)]
l = '0123456789'
for i in range(1,N):
    b = S[i]
    for a in l:
        A = listup(S[:i])
        if A[int(a)] > 0:
            for c in l:
                C = listup(S[i+1:])
                if C[int(c)] > 0:
                    s = a + b + c
                    ans[int(s)] = 1
print(sum(ans))

Fixed submission:
N = int(input())
S = input()

def judge(A,B,C):
    s = S
    a = s.find(A)
    if a < 0:
        return False

    s = s[a+1:]
    b = s.find(B)
    if b < 0:
        return False

    s = s[b+1:]
    c = s.find(C)
    if c < 0:
        return False
    return True

l = '0123456789'
print(sum([int(bool(judge(a,b,c))) for a in l for b in l for c in l]))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()

ans = [0 for i in range(1000)]
l = '0123456789'
for i in range(1,N):
    b = S[i]
    for a in l:
        if a in S[:i]:
            for c in l:
                if c in S[i+1:]:
                    s = a + b + c
                    ans[int(s)] = 1
print(sum(ans))

Fixed submission:
N = int(input())
S = input()

def judge(A,B,C):
    s = S
    a = s.find(A)
    if a < 0:
        return False

    s = s[a+1:]
    b = s.find(B)
    if b < 0:
        return False

    s = s[b+1:]
    c = s.find(C)
    if c < 0:
        return False
    return True

l = '0123456789'
print(sum([int(bool(judge(a,b,c))) for a in l for b in l for c in l]))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()

ans = [0 for i in range(1000)]
for i in range(N):
    a = S[i]
    for j in range(i+1,N):
        b = S[j]
        for c in '0123456789':
            if c in S[j+1:]:
                s = a + b + c
                ans[int(s)] = 1
print(sum(ans))

Fixed submission:
N = int(input())
S = input()

def judge(A,B,C):
    s = S
    a = s.find(A)
    if a < 0:
        return False

    s = s[a+1:]
    b = s.find(B)
    if b < 0:
        return False

    s = s[b+1:]
    c = s.find(C)
    if c < 0:
        return False
    return True

l = '0123456789'
print(sum([int(bool(judge(a,b,c))) for a in l for b in l for c in l]))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()

ans = [0 for i in range(1000)]
for i in range(N):
    for j in range(i+1,N):
        for k in range(j+1,N):
            s = S[i] + S[j] + S[k]
            ans[int(s)] = 1
print(sum(ans))

Fixed submission:
N = int(input())
S = input()

def judge(A,B,C):
    s = S
    a = s.find(A)
    if a < 0:
        return False

    s = s[a+1:]
    b = s.find(B)
    if b < 0:
        return False

    s = s[b+1:]
    c = s.find(C)
    if c < 0:
        return False
    return True

l = '0123456789'
print(sum([int(bool(judge(a,b,c))) for a in l for b in l for c in l]))
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=(n-1)//2
print a/n

Fixed submission:
n=int(input())
a=(n+1)//2
print(a/n)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
As = list(map(int, input().split()))

for i in range(N):
    print(As.count(i+1))

Fixed submission:
N = int(input())
As = list(map(int, input().split()))
ans = [0] * N

for i in As:
    ans[i-1]+=1

for j in ans:
    print(j)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

for i in range(n):
  print(a.count(int(i)+1))

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

A = [0]*n
for i in range(n-1):
  A[a[i]-1] += 1
for j in range(n):
  print(A[j])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
p = 1
for i in range(1, n+1):
  p *= i
print(p%(10**9+7))

Fixed submission:
import math
n = int(input())
print(math.factorial(n)%(10**9+7))
Buggy python submission (verdict: Runtime Error):
r = input()

print("{}".format(2*3.1415*r))

Fixed submission:
R = int(input())

print(R*3.1415*2)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(x) for x in input().split()]
count = [0]*(N+1)
for i in range(N):
    count[A[i]] += 1

for k in range(N):
    count[A[k]] -= 1
    print(int(sum([x*(x-1)/2 for x in count])))
    count[A[k]] += 1

Fixed submission:
N = int(input())
A = [int(x) for x in input().split()]
count = [0]*(N+1)
for i in range(N):
    count[A[i]] += 1

s = sum([x*(x-1)/2 for x in count])

for k in range(N):
    print(int(s-count[A[k]]+1))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(x) for x in input().split()]

for k in range(N):
    count = [0]*(N+1)
    for i in range(N):
        #print(i)
        if i != k:
            count[A[i]] += 1
    print(int(sum([x*(x-1)/2 for x in count])))

Fixed submission:
N = int(input())
A = [int(x) for x in input().split()]
count = [0]*(N+1)
for i in range(N):
    count[A[i]] += 1

s = sum([x*(x-1)/2 for x in count])

for k in range(N):
    print(int(s-count[A[k]]+1))
Buggy python submission (verdict: Runtime Error):
s = input().split()
if s in 'A' and s in 'B':
  print('Yes')
else:
  print('No')

Fixed submission:
s = input()
if 'A' in s and 'B' in s:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
S, T = input().split()
print([T, S].join())

Fixed submission:
S, T = (input().split())
#print(S, T)
print(''.join([T, S]))
Buggy python submission (verdict: Runtime Error):
N, L = (int(x) for x in input().split())
aji = [L+i for i in range(N)]
left = 0

while (aji[left] < 0):
    left += 1
ans = sum(aji) - aji[left]
print(ans)

Fixed submission:
N, L = (int(x) for x in input().split())
#リンゴiの味はL+i-1で与えられる。（i=1~N）
#作る予定のアップルパイの味の総和はN*(L-1) + 1/2*(N+1)*N
#出力はN-1個からアップルパイを作るとき、元の味との差が最小になる味
#味が0に最も近いものを探して、引けばよい。
aji = [L+i for i in range(N)]
#i=1~Nなので注意
#print(aji)
#0に一番近いものを探索
left = 0
while (aji[left] < 0):
    if left < N-1:
        left += 1
    else:
        break
#print(left)
ans = sum(aji) - aji[left]
print(ans)

Buggy python submission (verdict: Runtime Error):
N, L = (int(x) for x in input().split())
#リンゴiの味はL+i-1で与えられる。（i=1~N）
#作る予定のアップルパイの味の総和はN*(L-1) + 1/2*(N+1)*N
#出力はN-1個からアップルパイを作るとき、元の味との差が最小になる味
#味が0に最も近いものを探して、引けばよい。
aji = [L+i for i in range(N)]
#print(aji)
left = 0

while (aji[left] < 0):
    left += 1
#print(left)
ans = sum(aji) - aji[left]
print(ans)

Fixed submission:
N, L = (int(x) for x in input().split())
#リンゴiの味はL+i-1で与えられる。（i=1~N）
#作る予定のアップルパイの味の総和はN*(L-1) + 1/2*(N+1)*N
#出力はN-1個からアップルパイを作るとき、元の味との差が最小になる味
#味が0に最も近いものを探して、引けばよい。
aji = [L+i for i in range(N)]
#i=1~Nなので注意
#print(aji)
#0に一番近いものを探索
left = 0
while (aji[left] < 0):
    if left < N-1:
        left += 1
    else:
        break
#print(left)
ans = sum(aji) - aji[left]
print(ans)
Buggy python submission (verdict: Runtime Error):
#coding:utf-8

A, B, C = (int(x) for x in input().split())

if A <= C <= B || B <= C <= A:
    print("Yes")
else:
    print("No")

Fixed submission:
#coding:utf-8

A, B, C = (int(x) for x in input().split())

if A <= C <= B or B <= C <= A:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
#coding:utf-8

N = int(input())
S = input()
K = int(input())

base = S[K]
new = []

for i in range(N):
    if S[i] != base:
        new.append('*')
    else:
        new.append(base)

ans = ''.join(new)
print(ans)

Fixed submission:
#coding:utf-8

N = int(input())
S = input()
K = int(input())

base = S[K-1]
new = []

for i in range(N):
    if S[i] != base:
        new.append('*')
    else:
        new.append(base)

ans = ''.join(new)
print(ans)
Buggy python submission (verdict: Runtime Error):
#coding:utf-8

S = input()

N = len(S)
ans = 0
SR = []
if S[0] == '0':
	for i in range(int(N/2)):
		SR.append('0')
		SR.append('1')
else:
	for i in range(int(N/2)):
		SR.append('1')
		SR.append('0')

for i in range(N):
	if S[i] != SR[i]:
		ans += 1
		
print(ans)
			


Fixed submission:
#coding:utf-8

S = input()
N = len(S)
ans = 0
SR = []
if S[0] == '0':
	for i in range(N):
		SR.append('0')
		SR.append('1')
else:
	for i in range(N):
		SR.append('1')
		SR.append('0')

for i in range(N):
	if S[i] != SR[i]:
		ans += 1
		
print(ans)
Buggy python submission (verdict: Runtime Error):
#coding:utf-8

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

for s in [H,W,h,w]:
    s = int(s)
    print(type(s))

ans = (H - h) * (W - w)
print(ans)

Fixed submission:
#coding:utf-8

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

ans = ( int(H)-int(h) ) * ( int(W)-int(w) )
print(ans)

Buggy python submission (verdict: Runtime Error):
#coding:utf-8

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

for s in [H,W,h,w]:
    int(s)

ans = (H - h) * (W - w)
print(ans)

Fixed submission:
#coding:utf-8

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

ans = ( int(H)-int(h) ) * ( int(W)-int(w) )
print(ans)

Buggy python submission (verdict: Runtime Error):
#coding:utf-8

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

ans = (H - h) * (W - w)
print(ans)

Fixed submission:
#coding:utf-8

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

ans = ( int(H)-int(h) ) * ( int(W)-int(w) )
print(ans)
Buggy python submission (verdict: Runtime Error):
#coding:utf-8

N, A, B = input().split()
ans = 0

for i in range(N+1):
	if A <= sum(list([int(x) for x in str(i)])) <= B:
		ans += i
		
print(ans)

Fixed submission:
#coding:utf-8

N, A, B = (int(x) for x in input().split())
ans = 0


for i in range(N+1):
	digit = [int(s) for s in list(str(i))]
	temp = sum(digit)
	if A <= temp <= B:
		ans+= i
		
print(ans)
Buggy python submission (verdict: Runtime Error):
print(6.283*input())

Fixed submission:
print(int(input())*6.3)

Buggy python submission (verdict: Runtime Error):
doubt a =2＊R＊3，14；
print（a）

Fixed submission:
print(int(input())*6.3)
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
    
def main():
    N = int(input())
    S = input()[:N]

    min_count = N
    for i in range(N):
        count = S[:i].count('W') + S[i+1:].count('E')
        if count < min_count:
            min_count = count

    print(min_count)

if __name__ == '__main__':
    main()


Fixed submission:
# coding: utf-8
    
def main():
    N = int(input())
    S = input()[:N]

    min_count = count = S[1:].count('E')
    for i in range(1, N):
        if S[i - 1] == 'W':
            count += 1
        if S[i] == 'E':
            count -= 1
            if count < min_count:
                min_count = count

    print(min_count)

if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
yasumi = 0
syukudai = 1
nissu = list(map(int,input().split()))
syukudaiNissu = list(map(int,input().split()))
if sum(syukudaiNissu) > nissu[yasumi]:
  print(-1)
  exit()
print(nissu[yasumi] - sum(syukudaiNissu))

Fixed submission:
import math
print(int(input())*2*math.pi)
Buggy python submission (verdict: Runtime Error):
yasumi = 0
syukudai = 1
nissu = list(map(int,input().split()))
syukudaiNissu = list(map(int,input().split()))
if sum(syukudaiNissu) > nissu[yasumi]:
  print()-1
print(nissu[yasumi] - sum(syukudaiNissu))

Fixed submission:
yasumi = 0
syukudai = 1
nissu = list(map(int,input().split()))
syukudaiNissu = list(map(int,input().split()))
if sum(syukudaiNissu) > nissu[yasumi]:
  print(-1)
  exit()
print(nissu[yasumi] - sum(syukudaiNissu))
Buggy python submission (verdict: Runtime Error):
a = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(a[int(inpui())-1])

Fixed submission:
a = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(a[int(input())-1])
Buggy python submission (verdict: Runtime Error):
a,b,c = map(input().split())
print("No" if a == b == c else "Yes")

Fixed submission:
M = input()
print('No' if M[0] == M[1] == M[2] else "Yes")
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
print("No" if a==b==c or a!=b!=!c else "Yes")

Fixed submission:
a=set(map(int,input().split()))
print("Yes" if len(a)==2 else "No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
print(if(n%2==0) 1/2 else (n+1)/2/n)

Fixed submission:
N = int(input())
print(1/2 if (N % 2 == 0) else (N + 1) / 2 / N)
Buggy python submission (verdict: Runtime Error):
if a >= 3200:
  print(s)
else:
  print("red")

Fixed submission:
a = int(input())
s = input()
if a>=3200:
  print(s)
else:
  print("red")

Buggy python submission (verdict: Runtime Error):
if a >=3200:
  print(s)
  else:
    print("red")

Fixed submission:
a = int(input())
s = input()
if a>=3200:
  print(s)
else:
  print("red")
Buggy python submission (verdict: Runtime Error):
import.math
x= int(input())
y = 2*math.pi*x
print(y)

Fixed submission:
import math
r = int(input())
s = 2 * r * math.pi
print(s)

Buggy python submission (verdict: Runtime Error):
import.math
x= int(input())
y = 2*math.pi*x
print(y)

Fixed submission:
import math
r = int(input())
s = 2 * r * math.pi
print(s)

Buggy python submission (verdict: Runtime Error):
import.math
x= int(input())
y = 2*math.pi*x
print(y)

Fixed submission:
import math
r = int(input())
s = 2 * r * math.pi
print(s)

Buggy python submission (verdict: Runtime Error):
x=input()
y = 2*PI()*x
print(y)

Fixed submission:
import math
r = int(input())
s = 2 * r * math.pi
print(s)
Buggy python submission (verdict: Runtime Error):
N, M = map(int,input().split())
#M 夏休み期間　M　宿題数
A = list(map(int, input().split()))
A_sum = 0
for i in range(0, n):
    A_sum += A[i]
    # A_sum 宿題全日数
x = N - A_sum
if x < N:
    print("-1")
else:
    print(x)

Fixed submission:
N, M = map(int,input().split())
#M 夏休み期間　M　宿題数
A = list(map(int, input().split()))
A_sum = 0
for i in range(0, M):
    A_sum += A[i]
    # A_sum 宿題全日数
x = N - A_sum
if x < 0:
    print("-1")
else:
    print(x)

Buggy python submission (verdict: Runtime Error):
N, M = map(int,input().split())
#M 夏休み期間　M　宿題数
A = list(map(int, input().split()))
A_sum = 0
for i in range(0, n):
    A_sum += A[i]
    # A_sum 宿題全日数
x = N - A_sum
print(x)

Fixed submission:
N, M = map(int,input().split())
#M 夏休み期間　M　宿題数
A = list(map(int, input().split()))
A_sum = 0
for i in range(0, M):
    A_sum += A[i]
    # A_sum 宿題全日数
x = N - A_sum
if x < 0:
    print("-1")
else:
    print(x)

Buggy python submission (verdict: Runtime Error):
D, n = map(int.input().split())

for i in range(n):
    A[i] = input()
    i += 1
    D_sum += A[i]
    x = D - D_sum
print()

Fixed submission:
N, M = map(int,input().split())
#M 夏休み期間　M　宿題数
A = list(map(int, input().split()))
A_sum = 0
for i in range(0, M):
    A_sum += A[i]
    # A_sum 宿題全日数
x = N - A_sum
if x < 0:
    print("-1")
else:
    print(x)
Buggy python submission (verdict: Runtime Error):
N = input()
if int(N[2])=7:
    print("Yes")
elif int(N[1])=7:
    print("Yes")
elif int(N[0])=7:
    print("Yes")
else:
    print("No")

Fixed submission:
N = input()
if int(N[2])==7:
    print("Yes")
elif int(N[1])==7:
    print("Yes")
elif int(N[0])==7:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
N = input()
if int(N[2])=7:
    print("Yes")
elif int(N[1])=7:
    print("Yes")
elif int(N[0])=7:
    print("Yes")
else:
    print("No")

Fixed submission:
N = input()
if int(N[2])==7:
    print("Yes")
elif int(N[1])==7:
    print("Yes")
elif int(N[0])==7:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
N = input()
if int(x[2])=7:
    print("Yes")
elif int(x[1])=7:
    print("Yes")
elif int(x[0])=7:
    print("Yes")
else:
    print("No")

Fixed submission:
N = input()
if int(N[2])==7:
    print("Yes")
elif int(N[1])==7:
    print("Yes")
elif int(N[0])==7:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
N = int(input())
N = str(input())
if int(x[2])=7:
    print(Yes)
else if int(x[1])=7:
    print(Yes)
else if int(x[0])=7:
    print(Yes)
else:
    print(No)

Fixed submission:
N = input()
if int(N[2])==7:
    print("Yes")
elif int(N[1])==7:
    print("Yes")
elif int(N[0])==7:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
N = input()
if int(x[2])=7:
    print(Yes)
else if int(x[1])=7:
    print(Yes)
else if int(x[0])=7:
    print(Yes)
else:
    print(No)

Fixed submission:
N = input()
if int(N[2])==7:
    print("Yes")
elif int(N[1])==7:
    print("Yes")
elif int(N[0])==7:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
x = input()
if int(x[2])=7:
    print(Yes)
else if int(x[1])=7:
    print(Yes)
else if int(x[0])=7:
    print(Yes)
else:
    print(No)

Fixed submission:
N = input()
if int(N[2])==7:
    print("Yes")
elif int(N[1])==7:
    print("Yes")
elif int(N[0])==7:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
list = int(input().split())
N = list[0]

list_1 = int(input().split())
M = sum(list_1)

if M-N > 0 :
  print(M-N)
else:
  print(-1)


Fixed submission:
n, m = [int(num) for num in input().split()]
assments = sum(int(num) for num in input().split())
if n - assments < 0:
    print(-1)
else:
    print(n - assments)

Buggy python submission (verdict: Runtime Error):
list = input().split()
N = int(list[0])

list_1 = input().split()
M = int(sum(list_1))

if M-N > 0 :
  print(M-N)
else:
  print(-1)

Fixed submission:
n, m = [int(num) for num in input().split()]
assments = sum(int(num) for num in input().split())
if n - assments < 0:
    print(-1)
else:
    print(n - assments)

Buggy python submission (verdict: Runtime Error):
list = input().split()
N = int(list[0])

list_1 = input().split()
M = int(sum(list_1))

print(M-N)


Fixed submission:
n, m = [int(num) for num in input().split()]
assments = sum(int(num) for num in input().split())
if n - assments < 0:
    print(-1)
else:
    print(n - assments)

Buggy python submission (verdict: Runtime Error):
list = input().split()
N = int(list[0])

list_1 = input().split()
M = int(list_1.sum())

print(M)

Fixed submission:
n, m = [int(num) for num in input().split()]
assments = sum(int(num) for num in input().split())
if n - assments < 0:
    print(-1)
else:
    print(n - assments)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
numlist = list(map(int, input().split()))

for i in range(1, n + 1):
	#	print(i)
	print(numlist.count(i))


Fixed submission:
n = int(input())
numlist = list(map(int, input().split()))
# print(numlist)
result = [0] * n
# print(result)

for i in numlist:
	result[i - 1] = result[i - 1] + 1

for j in range(len(result)):
	print(result[j])
# for i in range(1, n + 1):
#	print(numlist.count(i))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
numlist = input().split()

for i in range(1, n + 1):
	#	print(i)
	print(numlist.count(str(i)))


Fixed submission:
n = int(input())
numlist = list(map(int, input().split()))
# print(numlist)
result = [0] * n
# print(result)

for i in numlist:
	result[i - 1] = result[i - 1] + 1

for j in range(len(result)):
	print(result[j])
# for i in range(1, n + 1):
#	print(numlist.count(i))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
numlist = input().split()

for i in range(1,n+1):
	print(numlist.count(str(i)))


Fixed submission:
n = int(input())
numlist = list(map(int, input().split()))
# print(numlist)
result = [0] * n
# print(result)

for i in numlist:
	result[i - 1] = result[i - 1] + 1

for j in range(len(result)):
	print(result[j])
# for i in range(1, n + 1):
#	print(numlist.count(i))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
for i in range(1,N+1):
  print(A.count(i))

Fixed submission:
import collections

N = int(input())
A = list(map(int,input().split()))
x = collections.Counter(A)
for i in range(1,N+1):
  print(x[i])
Buggy python submission (verdict: Runtime Error):
r = input()
print(r*2*3.14)

Fixed submission:
r = input()
print(int(r) * 2 * 3.14)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
l = []
k = []
s = 0
l = list(map(int, input().split(" ")))
for i in range(1, len(l)+2):
    k.append(l.count(i))
for i in range(len(k)):
    print(k[i], end = "\n")

Fixed submission:
N = int(input())
P = [0] * (N+1)
L = list(map(int, input().split(" ")))
for i in L:
    P[i] += 1
for i in range(1, len(P)):
    print(P[i])
Buggy python submission (verdict: Runtime Error):
R = input()
print(2*3.14*R)

Fixed submission:
R = input()
R = int(R)

print(2*3.14*R)

Buggy python submission (verdict: Runtime Error):
pi = 3.14

R = input()
print(2*pi*R)

Fixed submission:
R = input()
R = int(R)

print(2*3.14*R)
Buggy python submission (verdict: Runtime Error):
N = input()
numList = input()


for num in numList:
  if num % 2 == 0:
    judge1 = num % 3 == 0
    judge2 = num % 5 == 0
    approve = judge1 or judge2
    if not approve:
      print('DENIED')
      exit()
print('APPROVED')

Fixed submission:
N = input()
numList = input().split(' ')
for num in numList:
  num = int(num)
  if num % 2 == 0:
    judge1 = num % 3 == 0
    judge2 = num % 5 == 0
    approve = judge1 or judge2
    if not approve:
      print('DENIED')
      exit()
print('APPROVED')
Buggy python submission (verdict: Runtime Error):
N = input()

count = 0
for i in range(1,N+1):
  if len(str(i)) % 2 != 0:
    count += 1

print(count)
  
  

Fixed submission:
n = input()
count =0
for i in range(1,int(n)+1):
    if len(str(i)) % 2 != 0:
        count +=1 
print(count)
Buggy python submission (verdict: Runtime Error):
S = input()

AGCT = ['A','G','C','T']
AGCT_list = []

i = 0
while i < len(S):
    #print('i=',i)
    if S[i] in AGCT:
        k = 1
        agct_tmp = S[i]
        while S[i+k] in AGCT:
            #print('k=', k)
            #print('i+k=',i+k)
            agct_tmp += S[i+k]
            if i+k+1 < len(S):
                k +=1
            else:
                break
    
        AGCT_list.append(agct_tmp)
        i = i + k + 1
    else:
        i += 1
if AGCT_list:
    print(max([len(string) for string in AGCT_list]))
else:
    print('0')

Fixed submission:
S = input()

AGCT = ['A','G','C','T']
AGCT_list = []

i = 0
while i < len(S):
    #print('i=',i)
    if S[i] in AGCT:
        k = 1
        agct_tmp = S[i]
        if i+k < len(S):
            while S[i+k] in AGCT:
                #print('k=', k)
                #print('i+k=',i+k)
                agct_tmp += S[i+k]
                if i+k+1 < len(S):
                    k +=1
                else:
                    break
    
        AGCT_list.append(agct_tmp)
        i = i + k + 1
    else:
        i += 1
if AGCT_list:
    print(max([len(string) for string in AGCT_list]))
else:
    print('0')

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

AGCT = ['A','G','C','T']
AGCT_list = []

i = 0
while i < len(S):
    print('i=',i)
    if S[i] in AGCT:
        k = 1
        agct_tmp = S[i]
        while S[i+k] in AGCT:
            print('k=', k)
            print('i+k=',i+k)
            agct_tmp += S[i+k]
            if i+k+1 < len(S):
                k +=1
            else:
                break
    
        AGCT_list.append(agct_tmp)
        i = i + k + 1
    else:
        i += 1
if AGCT_list:
    print(max([len(string) for string in AGCT_list]))
else:
    print('0')
    

Fixed submission:
S = input()

AGCT = ['A','G','C','T']
AGCT_list = []

i = 0
while i < len(S):
    #print('i=',i)
    if S[i] in AGCT:
        k = 1
        agct_tmp = S[i]
        if i+k < len(S):
            while S[i+k] in AGCT:
                #print('k=', k)
                #print('i+k=',i+k)
                agct_tmp += S[i+k]
                if i+k+1 < len(S):
                    k +=1
                else:
                    break
    
        AGCT_list.append(agct_tmp)
        i = i + k + 1
    else:
        i += 1
if AGCT_list:
    print(max([len(string) for string in AGCT_list]))
else:
    print('0')