Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
def m():
    n, x = map(int, input().split())
    a = list(map(int, input().split()))
    ans = 0
    for i in range(1, n-1, 2):
        if a[i+1] > a[i-1]:
            if a[i+1] + a[i] < x:
                continue
            ans += (a[i+1] + a[i]) -x
            if a[i+1] > x:
                a[i+1] = x
        else:
            if a[i-1] + a[i] < x:
                continue
            ans += (a[i-1] + a[i]) -x
    if len(a) % 2 == 0:
        if a[-1] + a[-2] < x:
            return ans
        ans += (a[-1] + a[-2]) -x
        return ans
    else:
        return ans

print(m())

Fixed submission:
def m():
    s = str(input())
    cnt = 0
    tmp = s[0]
    for i in s:
        if tmp != i:
            tmp = i
            cnt += 1
    return cnt
    pass

print(m())
Buggy python submission (verdict: Runtime Error):
a, b = input()
c = a*b
if c%2==0:
  r = 'Even'
else:
  r = 'Odd'
  
print(r)

Fixed submission:
a, b = map(int, input().split())
if (a*b) % 2:
    print("Odd")
else:
    print("Even")

Buggy python submission (verdict: Runtime Error):
a, b = input()
if (a*b)%2==0:
  r = 'Even'
else:
  r = 'Odd'
print(r)

Fixed submission:
a, b = map(int, input().split())
if (a*b) % 2:
    print("Odd")
else:
    print("Even")
Buggy python submission (verdict: Runtime Error):
def how_many_times_divisible(n):
	ans = 0
	while n % 2 == 0:
		n /= 2
		ans += 1
	return ans

n = int(raw_input())
a = map(int, raw_input().split())
ans = min(map(how_many_times_divisible, a))

print ans


Fixed submission:
print(input().count("1"))

Buggy python submission (verdict: Runtime Error):
def how_many_times_divisible(n):
    	ans = 0
	while n % 2 == 0:
		n /= 2
		ans += 1
	return ans

n = int(raw_input())
a = map(int, raw_input().split())
ans = min(map(how_many_times_divisible, a))

print ans


Fixed submission:
print(input().count("1"))

Buggy python submission (verdict: Runtime Error):
import math
n = input()
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1") - 1)
print(round(ans))

Fixed submission:
print(input().count("1"))

Buggy python submission (verdict: Runtime Error):
import math
n = input()
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1") - 1)
print(round(ans))

Fixed submission:
print(input().count("1"))

Buggy python submission (verdict: Runtime Error):
n = input()
a = list(map(int, input().split()))
for i in range(n):
    count = 0
    while True:
        a[i] *= 1/2
        count++
        if a[i]%2==1 || a[i] = 0:
            a[i] = count
            break

print(min(a))


Fixed submission:
print(input().count("1"))

Buggy python submission (verdict: Runtime Error):
n = input()
a = list(map(int, input().split()))
for i in range(n):
    while True:
        a[i] *= 1/2
        if a[i]%2!=0 || a[i] = 0:
            break

print(min(a))


Fixed submission:
print(input().count("1"))

Buggy python submission (verdict: Runtime Error):
n = input()
a = list(map(int, input().split()))
for i in range(n):
    while True:
        a[i] *= 1/2
        if a[i]%2!=0 && a[i] < 0:
            break

print(min(a))


Fixed submission:
print(input().count("1"))

Buggy python submission (verdict: Runtime Error):
n = input()
a = list(map(int, input().split()))
for i in range(n):
    while True:
        a[i] *= 1/2
        if a[i]%2!=0 && a[i] > 0:
            break

print(min(a))


Fixed submission:
print(input().count("1"))

Buggy python submission (verdict: Runtime Error):
n = input()
a = list(map(int, input().split()))
for i in range(n):
    while True:
        a[i] = a[i]/2
        if a[i]%2!=0:
            break

print(min(a))


Fixed submission:
print(input().count("1"))

Buggy python submission (verdict: Runtime Error):
n = input()
a = list(map(int, input().split()))
for i in range(n):
    while True:
        a[i] = a[i]/2
        if a[i]%2==1:
            break

print(min(a))


Fixed submission:
print(input().count("1"))
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-

def main():
    input_num = int(input())
    flag = True
    sum_num = 0

    while flag:
        chushutsu = input_num % 10
        sum_num += chushutsu
        input_num = input_num // 10
        if input_num == 0:
            flag = False

    if sum_num % 9 == 0:
        print('Yes')

    else:
        print('No')

if __name__ == '__main__':
    main()

Fixed submission:
# -*- coding: utf-8 -*-

def main():
    input_num = input()
    sum_num = 0

    for i in range(len(input_num)):
        chushutsu = int(input_num[i])
        sum_num += chushutsu
    
    if sum_num % 9 == 0:
        print('Yes')

    else:
        print('No')

if __name__ == '__main__':
    main()

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

def main():
    input_num = int(input())
    flag = True
    sum_num = 0

    while flag:
        chushutsu = input_num % 10
        sum_num += chushutsu
        input_num = int((input_num - chushutsu) / 10)
        if input_num == 0:
            flag = False

    if sum_num % 9 == 0:
        print('Yes')

    else:
        print('No')

if __name__ == '__main__':
    main()

Fixed submission:
# -*- coding: utf-8 -*-

def main():
    input_num = input()
    sum_num = 0

    for i in range(len(input_num)):
        chushutsu = int(input_num[i])
        sum_num += chushutsu
    
    if sum_num % 9 == 0:
        print('Yes')

    else:
        print('No')

if __name__ == '__main__':
    main()

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

def main():
    input_num = int(input())
    flag = True
    sum_num = 0

    while flag:
        chushutsu = input_num % 10
        sum_num += chushutsu
        input_num = (input_num - chushutsu) / 10
        if input_num == 0:
            flag = False

    if sum_num % 9 == 0:
        print('Yes')

    else:
        print('No')

if __name__ == '__main__':
    main()

Fixed submission:
# -*- coding: utf-8 -*-

def main():
    input_num = input()
    sum_num = 0

    for i in range(len(input_num)):
        chushutsu = int(input_num[i])
        sum_num += chushutsu
    
    if sum_num % 9 == 0:
        print('Yes')

    else:
        print('No')

if __name__ == '__main__':
    main()

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

def main():
    flag = True
    input_num = int(input())
    pre_ans = []
    sum_num = 0

    while flag:
        chushutsu = input_num % 10
        sum_num += chushutsu
        input_num = (input_num - chushutsu) / 10
        if input_num == 0:
            flag = False

    if sum_num % 9 == 0:
        print('Yes')

    else:
        print('No')

if __name__ == '__main__':
    main()

Fixed submission:
# -*- coding: utf-8 -*-

def main():
    input_num = input()
    sum_num = 0

    for i in range(len(input_num)):
        chushutsu = int(input_num[i])
        sum_num += chushutsu
    
    if sum_num % 9 == 0:
        print('Yes')

    else:
        print('No')

if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
n, k, d = map(int, input().split())
n = abs(n)
ok = n // d
left = k - (ok)
if left % 2:
  print(d - (n%d))
  else:
    print(n%d)

Fixed submission:
n, k, d = map(int, input().split())
n = abs(n)
ok = n // d
if k < ok:
  print(n - (k*d))
else:
  left = k - (ok)
  if left % 2:
  	print(d - (n%d))
  else:
    print(n%d)

Buggy python submission (verdict: Runtime Error):
t = int(input())

for i in range(t):
    n, k, d = map(int, input().split())
    n = abs(n)
    ok = n // d
    left = k - (ok)
    if left % 2:
        print(d - (n%d))
    else:
        print(n%d)

Fixed submission:
n, k, d = map(int, input().split())
n = abs(n)
ok = n // d
if k < ok:
  print(n - (k*d))
else:
  left = k - (ok)
  if left % 2:
  	print(d - (n%d))
  else:
    print(n%d)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
bro = [x for x in range(1, n+1)]
number = 3
while number <= n:
  try:
    bro.remove(number)
  except ValueError:
    pass
  number += 3
number = 5
while number <= n:
  try:
    bro.remove(number)
  except ValueError:
    pass
  number += 5
print(sum(bro))

Fixed submission:
n = int(input())
sumi = 0
for i in range(1, n+1):
    if i % 3 != 0 and i % 5 != 0:
        sumi += i
print(sumi)
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
votes = list(map(int, input().split()))
total = sum(votes)
satisfied = [x for x in votes if x >= votes * (1/(4*m))]
if len(satisfied) > m:
  print("Yes")
else:
  print("No")

Fixed submission:
n, m = map(int, input().split())
votes = list(map(int, input().split()))
total = sum(votes)
satisfied = [x for x in votes if x >= total * (1/(4*m))]
if len(satisfied) >= m:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
def digits_of (n): # nの桁の数字のリストを出力する関数｡ nは自然数
    digits = [] # nの桁の数字を入れるリスト
    while n != 0:
        r = n % 10 # 10で割った余り
        digits.append(r) # リストに加える
        n = n // 10 # nを10で割った整数に置き換える
    return digits
def is_multiple_of_9 (n): # nは自然数
    sum = 0 # 各桁の数字の合計をもとめる
    for i in digits_of (n):
        sum += i
    return sum % 9 == 0 

n=int(input())

if (is_multiple_of_9(n)):
    print("Yes")
else:
    print("No")


Fixed submission:
n=int(input())
n=str(n)
c=0
for i in range (len(n)):
    c+=int(n[i])

if c%9==0:
    print("Yes")
else :
    print("No")
Buggy python submission (verdict: Runtime Error):
x = list(map(int, input().split()))

for i in x:
    if x[i]==0:
        print(i)


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

for i in range(len(x)):
    if x[i]==0:
        print(i+1)
Buggy python submission (verdict: Runtime Error):
N=int(input())
A= list(map(int,input().split()))
s=0

for i in A:
    S+=1/i

print(1/S)


Fixed submission:
N=int(input())
A= list(map(int,input().split()))
S=0

for i in A:
    S+=1/i

print(1/S)

Buggy python submission (verdict: Runtime Error):
N=int(input())
A= list(map(int,input().split()))

for i in A:
    S+=1/A

print(1/S)


Fixed submission:
N=int(input())
A= list(map(int,input().split()))
S=0

for i in A:
    S+=1/i

print(1/S)

Buggy python submission (verdict: Runtime Error):
N=int(input())
A= list(map(int,input().split()))

for i in range(N):
    S+=1/A[i]

print(1/S)


Fixed submission:
N=int(input())
A= list(map(int,input().split()))
S=0

for i in A:
    S+=1/i

print(1/S)

Buggy python submission (verdict: Runtime Error):
N=int(input())
A= list(map(int,input().split()))

for i in A:
    S+=1/A[i]

print(1/S)

Fixed submission:
N=int(input())
A= list(map(int,input().split()))
S=0

for i in A:
    S+=1/i

print(1/S)
Buggy python submission (verdict: Runtime Error):
import collections
N = int(input())
counter = 0
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

def cc(n):
    ans = 0
    i = 1
    while True:
        n = n - i
        ans += 1
        i += 1
        if n < i:
            break
    return ans

s_list = prime_factorize(N)
c = collections.Counter(s_list)
values,counts = zip(*c.most_common())
j = 0
for i in range(len(counts)):
    counter += cc(counts[i])
print(counter)

Fixed submission:
import collections
N = int(input())
counter = 0
if N == 1:
  print(0)
  exit()
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

def cc(n):
    ans = 0
    i = 1
    while True:
        n = n - i
        ans += 1
        i += 1
        if n < i:
            break
    return ans

s_list = prime_factorize(N)
c = collections.Counter(s_list)
values,counts = zip(*c.most_common())
j = 0
for i in range(len(counts)):
    counter += cc(counts[i])
print(counter)
Buggy python submission (verdict: Time Limit Exceeded):
import math
A,B,N = map(int,input().split())
ans = list()
x = 1
while x <= N:
    ans.append(math.floor(A*x/B)-A*math.floor(x/B))
    if x+1 <= N and ans[x-1] > (math.floor(A*(x+1)/B)-A*math.floor((x+1)/B)):
        break
    else:
      x += 1
print(max(ans))

Fixed submission:
import math
A,B,N = map(int,input().split())
x = min(B-1,N)
print(math.floor(A*x/B)-A*math.floor(x/B))

Buggy python submission (verdict: Time Limit Exceeded):
import math
A,B,N = map(int,input().split())
ans = list()
for x in range(1,N+1):
    ans.append(math.floor(A*x/B)-A*math.floor(x/B))
print(max(ans))

Fixed submission:
import math
A,B,N = map(int,input().split())
x = min(B-1,N)
print(math.floor(A*x/B)-A*math.floor(x/B))
Buggy python submission (verdict: Runtime Error):
import math
A,B = map(int,input().split())
a = A / 0.08
b = B / 0.1
if math.floor(a * 0.1) == B:
    ans = int(a)
elif math.floor(b * 0.08) == A:
    ans = int(b)
else:
    print(-1)
    exit()
if (math.floor((ans-1)*0.08) == A) and (math.floor((ans-1)*0.1) == B):
    ans = ans - 1
else:
    print(ans)

Fixed submission:
N,A,B = map(int,input().split())
if A == 0:
    print(A)
    exit()
n = N // (A + B)
nn = N % (A + B)
if n != 0 and nn <= A:
    print(int(A*n + nn))
elif n != 0 and nn > A:
    print(int(A*(n+1)))
elif n == 0 and N >= A:
    print(A)
elif n == 0 and N < A:
    print(N)

Buggy python submission (verdict: Time Limit Exceeded):
N,A,B = map(int,input().split())
ans = list()
a = "a"
b = "b"
while N > 0:
    for _ in range(A):
        ans.append(a)
        N = N - 1
        if N == 0:
            print(ans.count(a))
            exit()
    for _ in range(B):
        ans.append(b)
        N = N - 1
        if N == 0:
            print(ans.count(a))
            exit()

Fixed submission:
N,A,B = map(int,input().split())
if A == 0:
    print(A)
    exit()
n = N // (A + B)
nn = N % (A + B)
if n != 0 and nn <= A:
    print(int(A*n + nn))
elif n != 0 and nn > A:
    print(int(A*(n+1)))
elif n == 0 and N >= A:
    print(A)
elif n == 0 and N < A:
    print(N)
Buggy python submission (verdict: Runtime Error):
H = int(input())

g = int(H / 2)
ans = 0
if g == 0:
    print(1)
else:
    n = 0
    while True:
        if 2 ** (n + 1) < H:
            n += 1
        elif 2 ** (n + 1) >= H:
            n += 1
            break
    for i in range(n + 1):
        ans = ans + (2 ** i)
print(ans)

Fixed submission:

H, A = map(int, input().split())

count = 0
while H > 0:
    H = H - A
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
S = str(input())
T = str(input())

print(T+S)

Fixed submission:
String= list(map(str, input().split()))
print(String[1] + String[0])
Buggy python submission (verdict: Runtime Error):
X = int(input())
X = X + 1
while True:
    for i in range(0, X):
        if X % i == 0:
            prime = X
            break
        else:
            X += 1
print(X)

Fixed submission:
X = int(input())
prime = None
while True:
    for i in range(2, X):
        if X % i == 0:
            break
    else:
        prime = X
    if prime != None:
        break
    else:
        X += 1

print(prime)
Buggy python submission (verdict: Runtime Error):
n = input()
m = input()
m = list(m)
m = [int(i) for i in m]
mx = max(m)
ind = m.index(mx)

c = 0
j = len(m)
for i in reversed(m[ind:]):
    if i < mx:
        d = mx - i
        c += d
ind_i = 0
for i in m[1:ind]:
    if m[ind_i] > i:
        num = m[ind_i] - i
        c+= num
    ind_i += 1
    
print(c)

Fixed submission:
n = input()
m = input().split()
m = [int(i) for i in m]
mx = max(m)
ind = m.index(mx)
 
c = 0
j = len(m)
for i in reversed(m[ind:]):
    if i < mx:
        d = mx - i
        c += d
        
ind_i = 0
for i in m[1:ind]:
    #print(i)
    if m[ind_i] > i:
        num = m[ind_i] - i
        m[ind_i+1] += num
        c+= num
    
    ind_i += 1
    
print(c)
Buggy python submission (verdict: Runtime Error):
n = int(input)

if n >= 30:
  print("Yes")
else:
  print("No")

Fixed submission:
n = int(input())
 
if n >= 30:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n = int(inpiut())

if n >= 30:
  print("Yes")
else:
  print("No")
  

Fixed submission:
n = int(input())
 
if n >= 30:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
n = input()
m = input()
wcount = 0
rcount = 0
for i in m:
    if i == "W":
        wcount += 1
    else:
        rcount += 1
new_m = "R"*rcount + "W"*wcount
r_l = []
w_l = []
for i in range(len(m)):
    if m[i] == "W":
        w_l.append(i)
    else:
        r_l.append(i)
m = list(m)
new_m = list(new_m)
count = 0
while m != new_m:
    m[w_l[0]],m[r_l[-1]] = m[r_l[-1]],m[w_l[0]]
    w_l.pop(0)
    r_l.pop(-1)
    count += 1

print(count)

Fixed submission:
n = input()
m = input()
maxr = m.count("R")
maxw = m.count("W")

min_move = len(m)
max_r = m.count("R")
max_w = m.count("W")
right = 0
left = 0
for i in range(len(m)):
    if m[i] == "W":
        left += 1
    else:
        max_r -= 1
    if max(left,max_r) < min_move:
        min_move = max(left,max_r)
if maxw == 0 or maxr == 0:
    print(0)
else:
    print(min_move)
Buggy python submission (verdict: Runtime Error):
import collections

n = int(input())
m = [input() for i in range(n)]

ans = [0,0,0,0]

for i in m:
    if i == "AC":
        ans[0] += 1
    elif i == "WA":
        ans[1] += 1
    elif i == "TLE":
        ans[2] += 1
    elif i == "RE":
        nas[3] += 1
    
    
    
print("AC x "+str(ans[0])) 
print("WA x "+str(ans[1]))
print("TLE x "+str(ans[2]))
print("RE x"+str(ans[3]))

Fixed submission:
n = int(input())
m = [input() for i in range(n)]
 
ans = [0,0,0,0]
 
for i in m:
    if i == "AC":
        ans[0] += 1
    elif i == "WA":
        ans[1] += 1
    elif i == "TLE":
        ans[2] += 1
    elif i == "RE":
        ans[3] += 1
    
    
    
print("AC x "+str(ans[0])) 
print("WA x "+str(ans[1]))
print("TLE x "+str(ans[2]))
print("RE x "+str(ans[3]))
Buggy python submission (verdict: Runtime Error):
n = input().split()
n = [int(i) for i in n]
m = input().split()
m = [int(i) for i in m]
 
ans_1 = n[0]
ans_2 = n[0]
 
ans = []
while True:
  	if n[1] == 0:
      ans.append(0)
      
    ans_1 += 1
    ans_2 -= 1
    if not ans_1 in m:
        ans.append(ans_1)
        
    elif not ans_2 in m:
        ans.append(ans_2)
    
    if len(ans) > 0:
        break
        
print(min(ans))

Fixed submission:
n = input().split()
n = [int(i) for i in n]
if not n[1] == 0:
	m = input().split()
	m = [int(i) for i in m]
else:
  	m =[0]

ans_1 = n[0]
ans_2 = n[0]
ans = []
while True:
    if n[1] == 0:
        ans.append(n[0])
    if not n[0] in m:
      ans.append(n[0])
    if len(ans) > 0:
        break    
        
    ans_1 += 1
    ans_2 -= 1
    if not ans_1 in m:
        ans.append(ans_1)
    if not ans_2 in m:
        ans.append(ans_2)
    
    
        
print(min(ans))

Buggy python submission (verdict: Runtime Error):
n = input().split()
n = [int(i) for i in n]
m = input().split()
m = [int(i) for i in m]


ans_1 = n[0]
ans_2 = n[0]

ans = []
while True:
  	if n[1] == 0:
      ans.append(0)
      
    ans_1 += 1
    ans_2 -= 1
    if not ans_1 in m:
        ans.append(ans_1)
        
    elif not ans_2 in m:
        ans.append(ans_2)
    
    if len(ans) > 0:
        break
        
print(min(ans))

Fixed submission:
n = input().split()
n = [int(i) for i in n]
if not n[1] == 0:
	m = input().split()
	m = [int(i) for i in m]
else:
  	m =[0]

ans_1 = n[0]
ans_2 = n[0]
ans = []
while True:
    if n[1] == 0:
        ans.append(n[0])
    if not n[0] in m:
      ans.append(n[0])
    if len(ans) > 0:
        break    
        
    ans_1 += 1
    ans_2 -= 1
    if not ans_1 in m:
        ans.append(ans_1)
    if not ans_2 in m:
        ans.append(ans_2)
    
    
        
print(min(ans))
Buggy python submission (verdict: Runtime Error):

n = input().split()

ans = int(n[0])*int(n[1])

print(math.floor(ans))

Fixed submission:
from decimal import Decimal, getcontext
import math
n = input().split()

def cal(a,b):
  if '.' in list(a):
    c = Decimal(a)
  else:
    c = int(a)
  
  if '.' in list(b):
    d = Decimal(b)
  else:
    d = int(b)
    
  return c*d


print(math.floor(cal(n[0],n[1])))
Buggy python submission (verdict: Runtime Error):
n = input()
n = dict(n)

l = [0,1,6,8]
if n[-1] == "3":
  print("bon")
elif str(n[-1]) in l:
  print("pon")
else:
  print("hon")

Fixed submission:
n = input()
n = list(n)
l = [0,1,6,8]
if n[-1] == "3":
  print("bon")
elif int(n[-1]) in l:
  print("pon")
else:
  print("hon")
Buggy python submission (verdict: Runtime Error):
n = input()
m = input()
if m[0:len(n)] == n:
  print("Yes")
else:
  print("No)
  

Fixed submission:
n = list(input())
m = list(input())
m.pop()

if n == m:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
n = input().split()
n = [int(i) for i in n]
num = n[-1]
count = 0
for i in range(num):
  num -= 1
  if n[0] is not 0:
    count+=1
    n[0] -= 1
  elif n[0] is 0 and n[1] is not 0:
    n[1] -= 1
  else:
    count-=1
    n[-2] -= 1

print(count)

Fixed submission:
n = input().split()
n = [int(i) for i in n]
count = 0

a = n[0]*1
b = n[1] 
c = n[2]*-1
while n[-1] > 0:
    if n[0] >= n[-1] and n[0] != 0:
        count = n[-1]*1
        n[-1] = 0
    elif n[0] < n[-1] and n[0] != 0:
        count += n[0]
        tmp = n[0]+n[1]
        n[-1] -= tmp
        n[0] = 0
    elif n[2] >= n[-1]:
        count += n[-1]*-1
        n[-1] = 0
    elif n[2] < n[-1]:
        count += c
        n[-1] = 0

print(count)
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = [input() for i in range(n)]

l = set(l)
l = list(l)
print(sum(l))

Fixed submission:
n = int(input())
l = [input() for i in range(n)]
 
l = set(l)
l = list(l)
print(len(l))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = [input() for i in range(n)]

new_l = []

for i in l:
  if not i in new_l:
    new_l.append(i)

print(len(new_l))

Fixed submission:
n = int(input())
l = [input() for i in range(n)]
 
l = set(l)
l = list(l)
print(len(l))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = [input() for i in range(n)]
new_l = []

for i in l:
  if not i in new_l:
    new_l.append(i)
    
a = len(new_l)
print(a)

Fixed submission:
n = int(input())
l = [input() for i in range(n)]
 
l = set(l)
l = list(l)
print(len(l))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = [input() for i in range(n)]
new_l = []

for i in l:
  if not i in new_l:
    new_l.append(i)

print(len(new_l))

Fixed submission:
n = int(input())
l = [input() for i in range(n)]
 
l = set(l)
l = list(l)
print(len(l))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = [input() for i in range(n)]
new_l = []

for i in l:
  if not i in new_l:
    new_l.append(i)

print(len(new_l))

Fixed submission:
n = int(input())
l = [input() for i in range(n)]
 
l = set(l)
l = list(l)
print(len(l))
Buggy python submission (verdict: Runtime Error):
n = int(input())
m = input().split()
m = [int(i) for i in m]
 
for i in range(n):
  l.append(0)
for i in m:
  ind = i-1
  l[ind] += 1
for i in l:
  print(i)

Fixed submission:
n = int(input())
m = input().split()
m = [int(i) for i in m]
 
l =[]
for i in range(n):
  l.append(0)
for i in m:
  ind = i-1
  l[ind] += 1
for i in l:
  print(i)

Buggy python submission (verdict: Runtime Error):
n = int(input())
m = input().split()
m = [int(i) for i in m]
 
for i in range(n):
  l.append(0)
for i in m:
  ind = i-1
  l[ind] += 1
for i in l:
  print(i)
  

Fixed submission:
n = int(input())
m = input().split()
m = [int(i) for i in m]
 
l =[]
for i in range(n):
  l.append(0)
for i in m:
  ind = i-1
  l[ind] += 1
for i in l:
  print(i)

Buggy python submission (verdict: Runtime Error):
n = int(input())
m = input().split()
m = [int(i) for i in m]

for i in range(n):
  l.append(0)

for i in m:
  ind = i-1
  l[ind] += 1

for i in l:
    print(i)
  
  

Fixed submission:
n = int(input())
m = input().split()
m = [int(i) for i in m]
 
l =[]
for i in range(n):
  l.append(0)
for i in m:
  ind = i-1
  l[ind] += 1
for i in l:
  print(i)