Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
import sys
n = int(input())
a = list(input().split())
b =list(map(int,a))
aa = list(set(b))
x = []
y = []
c = 1
for i in range(1,n+1):
    x.append(i)
for j in aa:
    if j in x and 1 in aa:
        pass
    else:
        print("-1")
        sys.exit()
for k in a:
    if int(k) == c:
        y.append(k)
        c = c + 1
print(len(a)-len(y))


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

num =  1
ans = 0
if 1 not in a:
    print(-1)
    sys.exit()
for i in a:
    if i == num:
        num += 1
    else:
        ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
import sys
n = int(input())
a = list(input())
b =list(map(int,a))
aa = list(set(b))
x = []
y = []
c = 1
for i in range(1,n+1):
    x.append(i)
for j in aa:
    if j in x and 1 in aa:
        pass
    else:
        print("-1")
        sys.exit()
for k in a:
    if int(k) == c:
        y.append(k)
        c = c + 1
print(len(a)-len(y))

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

num =  1
ans = 0
if 1 not in a:
    print(-1)
    sys.exit()
for i in a:
    if i == num:
        num += 1
    else:
        ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(input())
b =list(map(int,a))
aa = list(set(b))
x = []
y = []
z = []
c = 1
for i in range(1,n+1):
    x.append(i)
for j in aa:
    if j in x and 1 in aa:
        z.append(j)
    else:
        print("-1")
        exit()
for k in a:
    if int(k) == c:
        y.append(k)
        c = c + 1
print(len(a)-len(y))

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

num =  1
ans = 0
if 1 not in a:
    print(-1)
    sys.exit()
for i in a:
    if i == num:
        num += 1
    else:
        ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(input())
b =list(map(int,a))
aa = list(set(b))
x = []
y = []
c = 1
for i in range(1,n+1):
    x.append(i)
for j in aa:
    if j in x and 1 in aa:
        c = 1
        
    else:
        print("-1")
        exit()
for k in a:
    if int(k) == c:
        y.append(k)
        c = c + 1
print(len(a)-len(y))

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

num =  1
ans = 0
if 1 not in a:
    print(-1)
    sys.exit()
for i in a:
    if i == num:
        num += 1
    else:
        ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):

a = list(input())
b = len(a)
c = int(b/2)
result = []
if b%2 == 0:
    A = a[:c]
    B = a[c:]
    BB = B[::-1]
    for v in range(c):
        if A[v] != BB[v]:
            result.append(v)
        else:
            x.append(v)
        
else:
    C = a[:c]
    D = a[c+1:]
    DD = D[::-1]
    for v in range(c):
        if C[v] != DD[v]:
            result.append(v)
        else:
            x.append(v)
print(len(result))

Fixed submission:
a = list(input())
b = len(a)
c = int(b/2)
x = []
result = []
if b%2 == 0:
    A = a[:c]
    B = a[c:]
    BB = B[::-1]
    for v in range(c):
        if A[v] != BB[v]:
            result.append(v)
        else:
            x.append(v)
        
else:
    C = a[:c]
    D = a[c+1:]
    DD = D[::-1]
    for v in range(c):
        if C[v] != DD[v]:
            result.append(v)
        else:
            x.append(v)
print(len(result))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = sorted(list(map(int,input().split())),reverse = True)
ans = 0

for i in range(n-2):
    for j in range(i+1,n-1):
        for k in range(j+1,n):
            if l[i] < l[j] + l[k] and l[j] < l[i] + l[k] and l[k] < l[i] + l[j]:
                ans += 1
            else:
                break
            
print(ans)

Fixed submission:
import bisect
n = int(input())
l = sorted(list(map(int,input().split())))
ans = 0

for i in range(n-2):
    for j in range(i+1, n-1):
        ans += bisect.bisect_left(l,l[i] + l[j]) - j - 1
print(ans)
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.index(i)+1,end=' ')

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

b = []

for i in range(n):
    b.append([a[i],i + 1])
    
b.sort()
for j in b:
    print(j[1],end=' ')
print()
Buggy python submission (verdict: Time Limit Exceeded):
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]

for i in range(n):
    if a.count(i+1) > q-k:
        print("Yes")
    else:
        print("No")

Fixed submission:
n,k,q = map(int,input().split())
p_lis = [k-q] * n

for i in range(q):
    x = int(input())
    p_lis[x-1] += 1
for j in p_lis:
    if j > 0:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Runtime Error):
ans = (ans + v[i])/2

Fixed submission:
n = int(input())
v = sorted(list(map(int,input().split())))
ans = (v[0] + v[1])/2

for i in range(2,n):
    ans = (ans + v[i])/2
print(ans)
Buggy python submission (verdict: Runtime Error):
n,d = map(int,input().split())
x = d*2 + 1
print((n+d*2)//(x)

Fixed submission:
n,d = map(int,input().split())
x = d*2 + 1
print((n+d*2)//x)
Buggy python submission (verdict: Runtime Error):
n,x = map(int,input().split())
l = list(map(int,input().split()))
ans = 0
i = 0

while True:
    ans = ans + l[i]
    if ans > x:
        break

    i += 1
    
print(i+1)

Fixed submission:
n,x = map(int,input().split())
l = list(map(int,input().split()))
ans = 0
i = 0

for _ in range(n):
    ans = ans + l[i]
    if ans <= x:
        i += 1
    
print(i+1)
Buggy python submission (verdict: Time Limit Exceeded):
n,m = map(int,input().split())
a = [int(input()) for _ in range(m)]
dp = [0] * (n + 1)
dp[0] = 1
mod = 10**9+7
for i in range(1,n+1):
    if i in a:
        dp[i] = 0
    elif i == 1:
        dp[i] = 1
    else:
        dp[i] = (dp[i-1] + dp[i-2]) % mod
print(dp[-1])

Fixed submission:
n,m = map(int,input().split())
a = set([int(input()) for _ in range(m)])
dp = [0] * (n + 1)
dp[0] = 1
mod = 10**9+7
for i in range(1,n+1):
    if i in a:
        dp[i] = 0
    elif i == 1:
        dp[i] = 1
    else:
        dp[i] = (dp[i-1] + dp[i-2]) % mod
print(dp[-1])
Buggy python submission (verdict: Runtime Error):
n = int(input())
v = list(map(int, input().split()))
ans = v[0]
for i in range(1, n):
    ans += max(v[i]-v[i-1], 0)
print(cnt)

Fixed submission:
n = int(input())
v = list(map(int, input().split()))
ans = v[0]
for i in range(1, n):
    ans += max(v[i]-v[i-1], 0)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque
n,k = map(int,input().split())
h = sorted([int(input()) for _ in range(n)])
x = deque(h[:k])
mn = max(x) - min(x)

for i in range(k,n):
    x.append(h[i])
    x.popleft()
    mn = min(mn,max(x) - min(x))
print(mn)

Fixed submission:
from collections import deque
n,k = map(int,input().split())
h = sorted([int(input()) for _ in range(n)])
x = deque([])
mn = 10**9
for i in h:
    x.append(i)
    if len(x) >= k:
        mn = min(mn,x[k-1]-x[0])
        x.popleft()
print(mn)
Buggy python submission (verdict: Runtime Error):
n = int(input())
v = list(map(int,input().split()))

e = Counter(v[::2])
o = Counter(v[1::2])

e = sorted([(k,v) for k, v in e.items()],key = lambda z:z[1],reverse = True) + [(0,0)]
o = sorted([(k,v) for k, v in o.items()],key = lambda z:z[1],reverse = True) + [(0,0)]

if e[0][0] != o[0][0]:
    print(n - e[0][1] - o[0][1])
else:
    print(n - max(e[0][1] + o[1][1], e[1][1] + o[0][1]))

Fixed submission:
from collections import Counter
n = int(input())
v = list(map(int,input().split()))

e = Counter(v[::2])
o = Counter(v[1::2])

ev = sorted([(k,i) for k, i in e.items()],key = lambda z:z[1],reverse = True) + [(0,0)]
od = sorted([(k,i) for k, i in o.items()],key = lambda z:z[1],reverse = True) + [(0,0)]

if ev[0][0] != od[0][0]:
    print(n - ev[0][1] - od[0][1])
else:
    print(n - max(ev[0][1] + od[1][1], ev[1][1] + od[0][1]))

Buggy python submission (verdict: Runtime Error):
from collections import deque
n = int(input())
v = list(map(int,input().split()))

e = Counter(v[::2])
o = Counter(v[1::2])

e = sorted([(k,v) for k, v in e.items()],key = lambda z:z[1],reverse = True) + [(0,0)]
o = sorted([(k,v) for k, v in o.items()],key = lambda z:z[1],reverse = True) + [(0,0)]

if e[0][0] != o[0][0]:
    print(n - e[0][1] - o[0][1])
else:
    print(n - max(e[0][1] + o[1][1], e[1][1] + o[0][1]))

Fixed submission:
from collections import Counter
n = int(input())
v = list(map(int,input().split()))

e = Counter(v[::2])
o = Counter(v[1::2])

ev = sorted([(k,i) for k, i in e.items()],key = lambda z:z[1],reverse = True) + [(0,0)]
od = sorted([(k,i) for k, i in o.items()],key = lambda z:z[1],reverse = True) + [(0,0)]

if ev[0][0] != od[0][0]:
    print(n - ev[0][1] - od[0][1])
else:
    print(n - max(ev[0][1] + od[1][1], ev[1][1] + od[0][1]))
Buggy python submission (verdict: Runtime Error):
import sys
n = int(input())
ts=0
xs=0
ys=0
ans = "Yes"
for i in range(n):
    t,x,y = map(int,input().split())
    
    if (t-ts) % (abs(x-xs)+abs(y-ys)) == 0 and t-ts >= (abs(x-xs)+abs(y-ys)):
        xs = x
        ys = y
        ts = t
    else:
        ans = "No"
print(ans)

Fixed submission:
import sys
n = int(input())

for i in range(n):
    t,x,y = map(int,input().split())
    
    if (x+y) > t or (x+y+t) % 2 == 1:
        print("No")
        sys.exit()
        
print("Yes")
Buggy python submission (verdict: Runtime Error):
import sys
lis = list('abcdefghijklmnopqrstuvwxyz')
s = sorted(set(input()))
for i in range(26):
    if s[i] != lis[i]:
        print(lis[i])
        sys.exit()
print("None")

Fixed submission:
import sys
lis = list('abcdefghijklmnopqrstuvwxyz')
s = sorted(set(input()))
for i in lis:
    if i not in s:
        print(i)
        sys.exit()
print("None")
Buggy python submission (verdict: Runtime Error):
import sys
n,m = map(int,input().split())

if abs(n-m) >= 2:
    print(0)
    sys.exit()

if abs(n-m) == 1:
    x = max(a,b)
    for i in range(1,min(n,m)+1):
        x = x*i**2 % (10**9 + 7)

else:
    x = 2
    for i in range(1,n+1):
        x = x*i**2 % (10**9 + 7)
print(x)

Fixed submission:
import sys
n,m = map(int,input().split())

if abs(n-m) >= 2:
    print(0)
    sys.exit()

if abs(n-m) == 1:
    x = max(n,m)
    for i in range(1,min(n,m)+1):
        x = x*i**2 % (10**9 + 7)

else:
    x = 2
    for i in range(1,n+1):
        x = x*i**2 % (10**9 + 7)
print(x)
Buggy python submission (verdict: Time Limit Exceeded):
k,s = map(int,input().split())
ans = 0
for x in range(k+1):
    for y in range(k+1):
        z = s - x - y
        
        if z + x + y == s and 0 <= z <= k:
            ans += 1
print(ans)

Fixed submission:
k, s = map(int, input().split())
x = 0
for i in range(k+1):
    for j in range(k+1):
        z = s - i - j
        if 0 <= z and  z <= k:
            x += 1
print(x)

Buggy python submission (verdict: Time Limit Exceeded):
k, s = map(int, input().split())
x = 0
for i in range(k+1):
    for j in range(k+1):
        for l in range(k+1):
            if i + j + l == s:
                x += 1
print(x)

Fixed submission:
k, s = map(int, input().split())
x = 0
for i in range(k+1):
    for j in range(k+1):
        z = s - i - j
        if 0 <= z and  z <= k:
            x += 1
print(x)
Buggy python submission (verdict: Time Limit Exceeded):
a, b, x = map(int, input().split())
ans = 0
for i in range(a, b+1):
    if i % x == 0:
        ans += 1
print(ans)

Fixed submission:
a, b, x = map(int, input().split())
ans = b//x - (a-1)//x
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b=list(map(int,input().split())
x=(a*b)%2
if x==0:
	print("Even")
else:
  	print("Odd")

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

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
x=a*b
y=x%2
if y==0:
	print("Even")
else:
  	print("Odd")

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

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
x=(a*b)%2
if x==0:
	print("Even")
else:
  	print("Odd")

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

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
x=(a*b)%2
if x==0:
    print("Even")
else:
    print("Odd")

Fixed submission:
a,b=map(int,input().split())
x=(a*b)%2
if x==0:
	print("Even")
else:
  	print("Odd")
Buggy python submission (verdict: Runtime Error):
n,k = map(int,input().split())
h = list(map(int,input().split()))
a = 0

for i in range(n):
  if h[i] >= k:
    a += 1
print(a)

Fixed submission:
n = int(input())
if n % 2 == 0:
  print(0.5)
else:
  a = n // 2
  print((n-a)/n)
Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int,input().split()))
a = 0
b = []

for i in range(n-1):
  if h[i] >= h[i+1]:
    a += 1
    b.append(a)
  else:
    a = 0
    b.append(a)
    
print(max(b))

Fixed submission:
n = int(input())
h = list(map(int,input().split()))
a = 0
b = [0]

for i in range(n-1):
  if h[i] >= h[i+1]:
    a += 1
    b.append(a)
  else:
    a = 0
        
print(max(b))
Buggy python submission (verdict: Time Limit Exceeded):
a,b,c,d = map(int,input().split())
e = 0

for i in range(a,b+1):
  if i % c == 0 or i % d == 0:
    continue
  else:
    e += 1
print(e)

Fixed submission:
import fractions

a,b,c,d = map(int,input().split())
lcm = c * d // fractions.gcd(c,d)

cde = b // c - (a - 1) // c
dde = b // d - (a - 1)  // d
lde = b // lcm - (a - 1)  // lcm

print(b - a + 1 - cde - dde + lde)
Buggy python submission (verdict: Runtime Error):
N,Y = map(int,input().split())

for x in range(N+1):
  for y in range(N+1):
    z = N - x - y
    if z < 0:
      continue
    if 10000 * x + 5000 * y + 1000 * z == Y:
      print(x,y,z)
      exit()

print(-1,-1,-1)


Fixed submission:
a = input().split('/')
print('2018/' + a[1] + '/' + a[2])
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
ans = 0

while all(i % 2 == 0 for i in a):
    a = [i // 2 for i in a]
    ans += 1
print(ans)

Fixed submission:
print(input().count('1'))
Buggy python submission (verdict: Time Limit Exceeded):
k,s = map(int,input().split())
a = 0

for x in range(k+1):
  for y in range(k+1):
    z = s - x - y
    if x + y + z == s and 0 <= z <= k:
      a += 1

print(a)

Fixed submission:
k,s = map(int,input().split())
a = 0

for x in range(k+1):
  for y in range(k+1):
    z = s - x - y
    if 0 <= z <= k:
      a += 1

print(a)

Buggy python submission (verdict: Time Limit Exceeded):
k,s = map(int,input().split())
a = 0

for x in range(k+1):
  for y in range(k+1):
    z = s - x - y
    if x + y + z == s and 0 <= z <= k:
      a += 1

print(a)

Fixed submission:
k,s = map(int,input().split())
a = 0

for x in range(k+1):
  for y in range(k+1):
    z = s - x - y
    if 0 <= z <= k:
      a += 1

print(a)
Buggy python submission (verdict: Runtime Error):
a=input()
list_1=list(a)
length=len(list_1)
count=0
for k in range(0,length,2):
  if list_1[k]=='h' and list_1[k+1]=='i':
    count+=2
    if count==length:
      print("Yes")
      break
    else:
      continue
  else:
    print("No")
    

Fixed submission:
a=input()
list_1=list(a)
length=len(list_1)
count=0
if length%2==1:
  print("No")
else:
  for k in range(0,length,2):
    if list_1[k]=='h' and list_1[k+1]=='i':
      count+=2
      if count==length:
        print("Yes")
        break
    else:
      continue
  else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
a=int(input())
count=0
s=1
while True:
  if a!=1:
    a=a//2
    count+=1
    s+=2**count
  else:
    s+=2**count


Fixed submission:
a=int(input())
count=0
s=0
while True:
  if a>1:
    a//=int(2)
    count+=1
    s+=2**count
  else:
    s+=1
    print(s)
    break

Buggy python submission (verdict: Runtime Error):
a=int,input()
count=0
s=1
while True:
  if a!=1:
    a=a//2
    count+=1
    s+=2**count
  else:
    s+=2**count


Fixed submission:
a=int(input())
count=0
s=0
while True:
  if a>1:
    a//=int(2)
    count+=1
    s+=2**count
  else:
    s+=1
    print(s)
    break
Buggy python submission (verdict: Runtime Error):
a, b, c= map(int, input().split())
if a=b=c:
  print(1)
elif a=b:
  print(2)
elif b=c:
  print(2)
else:
  print(3)

Fixed submission:
a, b, c= map(int, input().split())
if a==b and b==c:
  print(1)
elif a==b or b==c or a==c:
  print(2)
else:
  print(3)
Buggy python submission (verdict: Runtime Error):
a, b, c=int(input(),split())
if a==7 and b==5 and c==5:
  print("YES")
elif a==5 and b==7 and c==5:
  print("YES")
elif a==5 and b==5 and c==7:
  print("YES")
else:
  print("NO")

Fixed submission:
a, b, c=map(int,input().split())
if a==7 and b==5 and c==5:
  print("YES")
elif a==5 and b==7 and c==5:
  print("YES")
elif a==5 and b==5 and c==7:
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Runtime Error):
    main()
import math
n,m=map(int,input().split())
def cc(n,r):
    return int(math.factorial(n)/(math.factorial(n-r)*math.factorial(r)))
if n>=2:
    if m>=2:
        print(cc(n,2)+cc(m,2))
    else:
        print(cc(n,2))
else:
    if m>=2:
        print(cc(m,2))
    else:
        print(0)

Fixed submission:
import math
n,m=map(int,input().split())
def cc(n,r):
    return int(math.factorial(n)/(math.factorial(n-r)*math.factorial(r)))
if n>=2:
    if m>=2:
        print(cc(n,2)+cc(m,2))
    else:
        print(cc(n,2))
else:
    if m>=2:
        print(cc(m,2))
    else:
        print(0)
Buggy python submission (verdict: Runtime Error):
N=int(input())
S=input()
K=int(input())
letter=""

for i in S:
    if i is S[K]:
        letter +=i
    else:
        letter +="*"
print(letter)


Fixed submission:

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

for i in S:
    if i is S[K-1]:
        letter +=i
    else:
        letter +="*"
print(letter)
Buggy python submission (verdict: Runtime Error):
N=[int(input()) for i in range(3)]
N.sort (reverse=True)
ans1=10*N[0]+N[1]
ans2=N[-1]
print(ans1+ans2)

Fixed submission:
a,b,c=map(int,input().split())
N=[a,b,c]
N.sort (reverse=True)
print(10*N[0]+N[1]+N[-1])
Buggy python submission (verdict: Runtime Error):
a=int(input(1))
b=int(input(2))

if (a*b)%2==0:
  print("Even")
else:
  print("Odd")

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

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

if (a*b)%2==0:
  print("Even")
else:
  print("Odd")

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

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


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

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


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

Buggy python submission (verdict: Runtime Error):
a=int(input("a=:"))
b=int(input("b=:"))
x=a*b
if x%2==0:
      print("Even")
else :
      print("Odd")


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

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


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

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

Fixed submission:
a,b=map(int,input().split())
if (a*b)%2==0:
  print("Even")
else :
  print("Odd")
Buggy python submission (verdict: Runtime Error):
N=int(input("N:"))
a,b=map(int,input().split())
Num=0
Num_sum=0

for number in range(1,N+1):
    for num in str(number):
        num=int(num)
        Num+=num

    if Num>=a and Num<=b:
        Num_sum+=number
    Num=0
print(Num_sum)

Fixed submission:
N,a,b=map(int,input().split())
Num=0
Num_sum=0

for number in range(1,N+1):
    for num in str(number):
        num=int(num)
        Num+=num

    if Num>=a and Num<=b:
        Num_sum+=number
    Num=0
print(Num_sum)

Buggy python submission (verdict: Runtime Error):
N=int(input("N:"))
a,b=map(int,input().split())
Num=0
num_new=0
Num_sum=0

for number in range(1,N+1):
    for num in str(number):
        num=int(num)
        Num+=num

    if Num>=a and Num<=b:
        Num_sum+=number
    Num=0
print(Num_sum)


Fixed submission:
N,a,b=map(int,input().split())
Num=0
Num_sum=0

for number in range(1,N+1):
    for num in str(number):
        num=int(num)
        Num+=num

    if Num>=a and Num<=b:
        Num_sum+=number
    Num=0
print(Num_sum)
Buggy python submission (verdict: Runtime Error):
print(input().count(1))

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

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a+b+c)=3:
  print("3")
elif (a+b+c)=2:
  print("2")
elif (a+b+c)=1:
  print("1")
else :
  print("0")


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

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
index=0
if (a+b+c)=3:
  print("3")
elif (a+b+c)=2:
  print("2")
elif (a+b+c)=1:
  print("1")
else :
  print("0")


Fixed submission:
print(input().count("1"))
Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline
n=int(input())
count=0
a=[int(input()) for _ in range(n)]
for x in a:
    if a.count(x)%2==1:
        count+=1
print(count)


Fixed submission:
import collections
n=int(input())
count=0
a=[int(input()) for _ in range(n)]
a=collections.Counter(a)

for key,value in a.items():
    if value%2==1:
        count+=1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline
n=int(input())
ans=[]
for i in range(n):
    a=int(input())
    if ans.count(a)==0:
        ans.append(a)
    else:
        ans.remove(a)
print(len(ans))

Fixed submission:
import collections
n=int(input())
count=0
a=[int(input()) for _ in range(n)]
a=collections.Counter(a)

for key,value in a.items():
    if value%2==1:
        count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
N=int(input())
count=0
for _ in range(n):
    a=[int(input())]
for x in a:
    if a.count(x)%2==1:
        count+=1
print(count)

Fixed submission:
import collections
n=int(input())
count=0
a=[int(input()) for _ in range(n)]
a=collections.Counter(a)

for key,value in a.items():
    if value%2==1:
        count+=1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline
a=[int(input()) for i in range(int(input()))]
count=0
for x in a:
    if a.count(x)%2==1:
        count+=1
print(count)

Fixed submission:
import collections
n=int(input())
count=0
a=[int(input()) for _ in range(n)]
a=collections.Counter(a)

for key,value in a.items():
    if value%2==1:
        count+=1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
a=[int(input()) for i in range(int(input()))]
count=0
for x in a:
    if a.count(x)%2==1:
        count+=1
print(count)

Fixed submission:
import collections
n=int(input())
count=0
a=[int(input()) for _ in range(n)]
a=collections.Counter(a)

for key,value in a.items():
    if value%2==1:
        count+=1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
ans=[]
for i in range(n):
    a=int(input())
    if ans.count(a)==0:
        ans.append(a)
    else:
        ans.remove(a)
print(len(ans))

Fixed submission:
import collections
n=int(input())
count=0
a=[int(input()) for _ in range(n)]
a=collections.Counter(a)

for key,value in a.items():
    if value%2==1:
        count+=1
print(count)