Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=list(input() for _ in range(n))

t=['']*n

for i in range(n):
	t[i]=sorted(s[i])

u=sorted(t)

cnt=0

for i in range(n-1):    
	for j in range(i+1,n):
		if u[i]!=u[j]:
			break
		else:
			cnt+=1

print(cnt)

Fixed submission:
n=int(input())
s=list(input() for _ in range(n))

t=['']*n

for i in range(n):
	t[i]=sorted(s[i])

u=sorted(t)

cnt=0

#for i in range(n-1):    
#	for j in range(i+1,n):
#		if u[i]!=u[j]:
#			break
#		else:
#			cnt+=1

cnt_a=0
cnt_b=0

u.append(['0'])

#print(u)


for i in range(n):
	if u[i+1]==u[i]:
		cnt_a+=1
		#print(cnt_a)
	else:
		if cnt_a>0:
			cnt_b+=(cnt_a+1)*cnt_a//2
			#print(cnt_b)
			cnt_a=0

print(cnt_b)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=list(input() for _ in range(n))

t=['']*n

for i in range(n):
	t[i]=sorted(s[i])

u=sorted(t)

cnt=0

for i in range(n-1):    
	seq=0
	for j in range(i+1,n):
		if u[i]==u[j]:
			cnt+=1
			seq=1
		else:
			if seq==1:
				break

print(cnt)

Fixed submission:
n=int(input())
s=list(input() for _ in range(n))

t=['']*n

for i in range(n):
	t[i]=sorted(s[i])

u=sorted(t)

cnt=0

#for i in range(n-1):    
#	for j in range(i+1,n):
#		if u[i]!=u[j]:
#			break
#		else:
#			cnt+=1

cnt_a=0
cnt_b=0

u.append(['0'])

#print(u)


for i in range(n):
	if u[i+1]==u[i]:
		cnt_a+=1
		#print(cnt_a)
	else:
		if cnt_a>0:
			cnt_b+=(cnt_a+1)*cnt_a//2
			#print(cnt_b)
			cnt_a=0

print(cnt_b)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=list(input() for _ in range(n))

t=['']*n

for i in range(n):
	t[i]=sorted(s[i])

u=sorted(t)

cnt=0

for i in range(n-1):    
	seq=0
	for j in range(i+1,n):
		if u[i]==u[j]:
			cnt+=1
			seq=1
		else:
			if seq==1:
				break

print(cnt)

Fixed submission:
n=int(input())
s=list(input() for _ in range(n))

t=['']*n

for i in range(n):
	t[i]=sorted(s[i])

u=sorted(t)

cnt=0

#for i in range(n-1):    
#	for j in range(i+1,n):
#		if u[i]!=u[j]:
#			break
#		else:
#			cnt+=1

cnt_a=0
cnt_b=0

u.append(['0'])

#print(u)


for i in range(n):
	if u[i+1]==u[i]:
		cnt_a+=1
		#print(cnt_a)
	else:
		if cnt_a>0:
			cnt_b+=(cnt_a+1)*cnt_a//2
			#print(cnt_b)
			cnt_a=0

print(cnt_b)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=list(input() for _ in range(n))

t=['']*n

for i in range(n):
	t[i]=sorted(s[i])

cnt=0

for i in range(n-1):    
	for j in range(i+1,n):    
		if t[i]==t[j]:
			cnt+=1

print(cnt)

Fixed submission:
n=int(input())
s=list(input() for _ in range(n))

t=['']*n

for i in range(n):
	t[i]=sorted(s[i])

u=sorted(t)

cnt=0

#for i in range(n-1):    
#	for j in range(i+1,n):
#		if u[i]!=u[j]:
#			break
#		else:
#			cnt+=1

cnt_a=0
cnt_b=0

u.append(['0'])

#print(u)


for i in range(n):
	if u[i+1]==u[i]:
		cnt_a+=1
		#print(cnt_a)
	else:
		if cnt_a>0:
			cnt_b+=(cnt_a+1)*cnt_a//2
			#print(cnt_b)
			cnt_a=0

print(cnt_b)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
x=list(int(input()) for _ in range(n))

import numpy as np

y=np.array(x)
z=np.ones(n)

for i in range(n):
	z=np.ones(n)
	z[i]=0
	print(int(max(y*z)))

Fixed submission:
n=int(input())
x=list(int(input()) for _ in range(n))

import numpy as np

mi=np.argmax(x)

y=np.array(x)

for i in range(n):
	if i!=mi:
		print(x[mi])
	else:
		z=np.ones(n)
		z[i]=0
		print(int(max(y*z)))

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
x=list(int(input()) for _ in range(n))

from copy import deepcopy

for i in range(n):
	y=deepcopy(x)
	del y[i]
	print(max(y))

Fixed submission:
n=int(input())
x=list(int(input()) for _ in range(n))

import numpy as np

mi=np.argmax(x)

y=np.array(x)

for i in range(n):
	if i!=mi:
		print(x[mi])
	else:
		z=np.ones(n)
		z[i]=0
		print(int(max(y*z)))
Buggy python submission (verdict: Runtime Error):
n=int(input())
x=list(map(int, input().split()))
import numpy as np

y=np.repeat([1,-1]*(n-1))
y.append([1])
print(y)

for i in range(n):
	if i%2!=0:
		y[i]=-1

x2=np.array(x).T

for i in range(n):
	y2=np.roll(y,i)
	res=np.dot(y2,x2)
	print(res)

Fixed submission:
n, a, b=map(int, input().split())
res=min(n*a,b)
print(res)

Buggy python submission (verdict: Runtime Error):
n, a, b=list(input().sprit())
res=min(n*a,b)
print(res)

Fixed submission:
n, a, b=map(int, input().split())
res=min(n*a,b)
print(res)
Buggy python submission (verdict: Time Limit Exceeded):
x, y=map(int, input().split())

res=2019

for i in range(x, y):
	for j in range(i+1,y+1):
		res=min(res,(i*j)%2019)

print(res)

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

res=2019

x_q=x//2019
#x_mod=x%2019
#y_q=y//2019
#y_mod=y%2019

#if x_mod>0 or y_mod>0:
#	res=0
#else:

y_mod=min(y,2019*(x_q+1))

for i in range(x, y_mod):
	for j in range(i+1,y_mod+1):
		res=min(res,(i*j)%2019)

print(res)
Buggy python submission (verdict: Runtime Error):
pass=input()

x1=pass[0]
x2=pass[1]
x3=pass[2]
x4=pass[3]

res='Good'
if x1=x2: res='Bad'
if x2=x3: res='Bad'
if x3=x4: res='Bad'

print(res)

Fixed submission:
pas=input()

x1=pas[0]
x2=pas[1]
x3=pas[2]
x4=pas[3]

res='Good'
if x1==x2: res='Bad'
if x2==x3: res='Bad'
if x3==x4: res='Bad'

print(res)
Buggy python submission (verdict: Runtime Error):
n, l = (int(i) for i in input().split())
ap=[]

for i in range(n):
	ap.append(l+i)

idx=ap.index(min(map(abs,ap)))

res=(l-1)*n+(1+n)*n/2-ap[idx]
print(res)

Fixed submission:
n, l = (int(i) for i in input().split())
ap=[]
 
for i in range(n):
	ap.append(l+i)
 
mn=min(map(abs,ap))
 
if mn not in ap:
	mn=-mn
 
res=int((l-1)*n+(1+n)*n/2-mn)
print(res)

Buggy python submission (verdict: Runtime Error):
n, l = (int(i) for i in input().split())

ap=[]

for i in range(n):
	ap[i]=l+i

idx=ap.index(min(abs(ap))

res=(l-1)*n+(1+n)*n/2-ap[idx]

print(res)

Fixed submission:
n, l = (int(i) for i in input().split())
ap=[]
 
for i in range(n):
	ap.append(l+i)
 
mn=min(map(abs,ap))
 
if mn not in ap:
	mn=-mn
 
res=int((l-1)*n+(1+n)*n/2-mn)
print(res)
Buggy python submission (verdict: Runtime Error):
n, x = (int(i) for i in input().split())
l = [[int(i) for i in input().split()] for i in range(n)]

dis = 0

for i in range(n):
  dis += l[i]
  if dis > x:
    print(i + 1)
    break
    

Fixed submission:
n, x = (int(i) for i in input().split())

l = [int(i) for i in input().split()]

dis = 0
cnt = 1

for i in range(n):
	dis += l[i]
	cnt += 1
	if dis > x:
		cnt += -1
		break
        
print(cnt)
Buggy python submission (verdict: Runtime Error):
#n:balls 

n, k = (int(i) for i in input().split()) 

if k==1:
	dif=0

if k>1:
	dif=n-k:

print(dif)  	

Fixed submission:
n, k = (int(i) for i in input().split())

if k==1:
  dif=0
  
if k>1:
  dif=n-k
  
print(dif)
Buggy python submission (verdict: Runtime Error):
s,n=map(int,input().split())
x=list(int(input()) for _ in range(n))

w0=int(1)
b0=int(0)
cnt=0

for i in range(1,s):
	if i==x[cnt]:
		w1=int(0)
		b1=w0
		w0=w1
		b0=b1
		if cnt<n-1: 
			cnt+=1
	else:
		w1=b0+w0
		b1=w0
		w0=w1
		b0=b1

print((w0+b0)%1000000007) 
#print(w0+b0) 

Fixed submission:
s,n=map(int,input().split())
if n>0:
	x=list(int(input()) for _ in range(n))

w0=int(1)
b0=int(0)
cnt=0

for i in range(1,s):
	if n>0 and i==x[cnt]:
		w1=int(0)
		b1=w0
		w0=w1
		b0=b1
		if cnt<n-1: 
			cnt+=1
	else:
		w1=b0+w0
		b1=w0
		w0=w1
		b0=b1

print((w0+b0)%1000000007)

Buggy python submission (verdict: Runtime Error):
s,n=map(int,input().split())
x=list(int(input()) for _ in range(n))

w0=1
b0=0
cnt=0

for i in range(1,s):
	if i==x[cnt]:
		w1=0
		b1=w0
		w0=w1
		b0=b1
		if cnt<len(x)-1: 
			cnt+=1
	else:
		w1=b0+w0
		b1=w0
		w0=w1
		b0=b1

print((w0+b0)%1000000007) 

Fixed submission:
s,n=map(int,input().split())
if n>0:
	x=list(int(input()) for _ in range(n))

w0=int(1)
b0=int(0)
cnt=0

for i in range(1,s):
	if n>0 and i==x[cnt]:
		w1=int(0)
		b1=w0
		w0=w1
		b0=b1
		if cnt<n-1: 
			cnt+=1
	else:
		w1=b0+w0
		b1=w0
		w0=w1
		b0=b1

print((w0+b0)%1000000007)
Buggy python submission (verdict: Time Limit Exceeded):
c,g=map(int,input().split())

import numpy as np

cd=np.array([1]*c)

for i in range(g):
	cd2=np.array([0]*c)
	st,ed=map(int,input().split())
	cd2[st-1:ed]=[1]*(ed-st+1) 
	cd=cd*cd2
    
print(sum(cd)) 

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

st=[]
en=[]

for i in range(g):
	s,e=map(int,input().split())
	st.append(s) 
	en.append(e)

res=min(en)-max(st)+1
print(max(res,0))
Buggy python submission (verdict: Time Limit Exceeded):
sn,qn=map(int,input().split())
s=input()
x=list(list(map(int,input().split())) for _ in range(qn))

import math

s2=[0]*(sn+1)

for i in range(sn-1):
	if s[i]=='A' and s[i+1]=='C':
		s2[i]=0.5
		s2[i+1]=0.5

al=sum(s2)

for i in range(qn):
	res=al-math.ceil(sum(s2[:x[i][0]-1]))-math.ceil(sum(s2[x[i][1]:]))
	print(int(res))

Fixed submission:
sn,qn=map(int,input().split())
s=input()
x=list(list(map(int,input().split())) for _ in range(qn))

s2=[0]*sn

for i in range(sn-1):
	if s[i]=='A' and s[i+1]=='C':
		s2[i+1]=s2[i]+1
	else:
		s2[i+1]=s2[i]

for i in range(qn):
	res=s2[x[i][1]-1]-s2[x[i][0]-1]
	print(res)

Buggy python submission (verdict: Runtime Error):
sn,qn=map(int,input().split())
s=input()
x=list(list(map(int,input().split())) for _ in range(qn))

import math

s2=[0]*(sn+1)

for i in range(sn):
	if s[i]=='A' and s[i+1]=='C':
		s2[i]=0.5
		s2[i+1]=0.5

al=sum(s2)

for i in range(qn):
	res=al-math.ceil(sum(s2[:x[i][0]-1]))-math.ceil(sum(s2[x[i][1]:]))
	print(int(res))

Fixed submission:
sn,qn=map(int,input().split())
s=input()
x=list(list(map(int,input().split())) for _ in range(qn))

s2=[0]*sn

for i in range(sn-1):
	if s[i]=='A' and s[i+1]=='C':
		s2[i+1]=s2[i]+1
	else:
		s2[i+1]=s2[i]

for i in range(qn):
	res=s2[x[i][1]-1]-s2[x[i][0]-1]
	print(res)

Buggy python submission (verdict: Time Limit Exceeded):
sn,qn=map(int,input().split())
s=input()
x=list(list(map(int,input().split())) for _ in range(qn))

for i in range(qn):
	s2=s[x[i][0]-1:x[i][1]]
	print(s2.count('AC'))

Fixed submission:
sn,qn=map(int,input().split())
s=input()
x=list(list(map(int,input().split())) for _ in range(qn))

s2=[0]*sn

for i in range(sn-1):
	if s[i]=='A' and s[i+1]=='C':
		s2[i+1]=s2[i]+1
	else:
		s2[i+1]=s2[i]

for i in range(qn):
	res=s2[x[i][1]-1]-s2[x[i][0]-1]
	print(res)
Buggy python submission (verdict: Runtime Error):
k,n=map(int,input().split())
x=list(map(int,input().split()))

if n==1:
	res=0
else:
	y=sorted(x)
	z=[0]*(n-1)
	for i in range(n-1):
		z[i]=y[i+1]-y[i]
	v=sorted(z,reverse=True)
	w=0
	if k>1:
		for i in range(k-1):
			w+=v[i]
		res=y[n-1]-y[0]-w
	else:
		res=y[n-1]-y[0] 

print(res)

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

if k>=n or n==1:
	res=0
else:
	y=sorted(x)
	z=[0]*(n-1)
	for i in range(n-1):
		z[i]=y[i+1]-y[i]
	v=sorted(z,reverse=True)
	w=0
	if k>1:
		for i in range(k-1):
			w+=v[i]
		res=y[n-1]-y[0]-w
	else:
		res=y[n-1]-y[0] 

print(res)

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

if n==1:
	res=0
else:
	y=sorted(x)
	z=[0]*(n-1)
	for i in range(n-1):
		z[i]=y[i+1]-y[i]
	v=sorted(z,reverse=True)
	w=0
	for i in range(k-1):
		w+=v[i]
	res=y[n-1]-y[0]-w

print(res)

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

if k>=n or n==1:
	res=0
else:
	y=sorted(x)
	z=[0]*(n-1)
	for i in range(n-1):
		z[i]=y[i+1]-y[i]
	v=sorted(z,reverse=True)
	w=0
	if k>1:
		for i in range(k-1):
			w+=v[i]
		res=y[n-1]-y[0]-w
	else:
		res=y[n-1]-y[0] 

print(res)
Buggy python submission (verdict: Runtime Error):
n=int(input())

x=[list(map(int,input().split())) for _ in range(n)]

for i in range(101):
	for j in range(101):
		for k in range(n):
			if x[k][2]>0:
				h=x[k][2]+abs(i-x[k][0])+abs(j-x[k][1])
			break
		chk=0
		for k in range(n): 
			if x[k][2]!=max(h-abs(i-x[k][0])-abs(j-x[k][1]),0):
				chk=1
				break
		if chk==0:
			res=[i,j,h]
			break
	if chk==0:
		break

print(*res)


Fixed submission:
n=int(input())

x=[list(map(int,input().split())) for _ in range(n)]

for i in range(101):
	for j in range(101):
		for k in range(n):
			if x[k][2]>0:
				h=x[k][2]+abs(i-x[k][0])+abs(j-x[k][1])
				break
		chk=0
		for k in range(n): 
			if x[k][2]!=max(h-abs(i-x[k][0])-abs(j-x[k][1]),0):
				chk=1
				break
		if chk==0:
			res=[i,j,h]
			break
	if chk==0:
		break

print(*res)
Buggy python submission (verdict: Runtime Error):
n=int(input())
x=list(map(int,input().split()))

import collections as col

x_e=[]
x_o=[]

for i in range(n):
	if i%2==0:
		x_e.append(x[i])
	else:
		x_o.append(x[i])

x_e_c=col.Counter(x_e).most_common()    
x_o_c=col.Counter(x_o).most_common()

if x_e_c[0][1]>x_o_c[0][1]:
	fst=x_e_c
	snd=x_o_c
else:
	if x_e_c[0][1]<x_o_c[0][1]:	
		fst=x_o_c
		snd=x_e_c
	else:
		if x_e_c[1][1]<=x_o_c[1][1]:	
			fst=x_e_c
			snd=x_o_c
		else:
			fst=x_o_c
			snd=x_e_c

res=0

res+=n//2-fst[0][1]
if fst[0][0]!=snd[0][0]:
	res+=n//2-snd[0][1]
else:
	if len(snd)>1:
		res+=n//2-snd[1][1]
	else:
		res+=n//2

print(res)

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

import collections as col

x_e=[]
x_o=[]

for i in range(n):
	if i%2==0:
		x_e.append(x[i])
	else:
		x_o.append(x[i])

x_e_c=col.Counter(x_e).most_common()    
x_o_c=col.Counter(x_o).most_common()

if x_e_c[0][1]>x_o_c[0][1]:
	fst=x_e_c
	snd=x_o_c
else:
	if x_e_c[0][1]<x_o_c[0][1]:	
		fst=x_o_c
		snd=x_e_c
	else:
		if len(x_e_c)>1 and len(x_o_c)>1:
			if x_e_c[1][1]<=x_o_c[1][1]:	
				fst=x_e_c
				snd=x_o_c
			else:
				fst=x_o_c
				snd=x_e_c
		else:
			fst=x_o_c
			snd=x_e_c

res=0

res+=n//2-fst[0][1]
if fst[0][0]!=snd[0][0]:
	res+=n//2-snd[0][1]
else:
	if len(snd)>1:
		res+=n//2-snd[1][1]
	else:
		res+=n//2

print(res)

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

import collections as col

x_e=[]
x_o=[]

for i in range(n):
	if i%2==0:
		x_e.append(x[i])
	else:
		x_o.append(x[i])

x_e_c=col.Counter(x_e).most_common()    
x_o_c=col.Counter(x_o).most_common()

if x_e_c[0][1]>x_o_c[0][1]:
	fst=x_e_c
	snd=x_o_c
else:
	if x_e_c[0][1]<x_o_c[0][1]:	
		fst=x_o_c
		snd=x_e_c
	else:
		if x_e_c[1][1]<=x_o_c[1][1]:	
			fst=x_e_c
			snd=x_o_c

res=0

res+=n//2-fst[0][1]
if fst[0][0]!=snd[0][0]:
	res+=n//2-snd[0][1]
else:
	if len(snd)>1:
		res+=n//2-snd[1][1]
	else:
		res+=n//2

print(res)

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

import collections as col

x_e=[]
x_o=[]

for i in range(n):
	if i%2==0:
		x_e.append(x[i])
	else:
		x_o.append(x[i])

x_e_c=col.Counter(x_e).most_common()    
x_o_c=col.Counter(x_o).most_common()

if x_e_c[0][1]>x_o_c[0][1]:
	fst=x_e_c
	snd=x_o_c
else:
	if x_e_c[0][1]<x_o_c[0][1]:	
		fst=x_o_c
		snd=x_e_c
	else:
		if len(x_e_c)>1 and len(x_o_c)>1:
			if x_e_c[1][1]<=x_o_c[1][1]:	
				fst=x_e_c
				snd=x_o_c
			else:
				fst=x_o_c
				snd=x_e_c
		else:
			fst=x_o_c
			snd=x_e_c

res=0

res+=n//2-fst[0][1]
if fst[0][0]!=snd[0][0]:
	res+=n//2-snd[0][1]
else:
	if len(snd)>1:
		res+=n//2-snd[1][1]
	else:
		res+=n//2

print(res)
Buggy python submission (verdict: Runtime Error):
s=str(input())
k=int(input())

res=''

if len(s)>=k:
	for i in range(k):
		if s[i]!=1:
			res=s[i]			
			break
		if i==k-1:
			res='1'
else:
	for i in range(len(s)):
		if s[i]!='1':
			res=s[i]
			break

print(res)

Fixed submission:
r,c=map(int,input().split())
res=(r-1)*(c-1)
print(res)
Buggy python submission (verdict: Runtime Error):
t=int(input())

res='No'

if t>3 and (t%4==0 or t%7==0 or t%4==3 or t%7==4):
	res='Yes'

print(res)

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

res=1

if n%k==0:
	res=0

print(res)
Buggy python submission (verdict: Runtime Error):
s=input()

cnt=0

for i in range(4):
	if s[i]=='+':
	cnt+=1

res=2*i-4

print(res)

Fixed submission:
s=input()
 
cnt=0
 
for i in range(4):
	if s[i]=='+':
		cnt+=1

res=cnt*2-4
 
print(res)
Buggy python submission (verdict: Runtime Error):
n=input()

sm=0

fot i in range(10):
	sm+=n[i]

res='No'

if n%sm==0:
	res='Yes'

print(res)    

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

res='No'
 
if int(n)%sm==0:
	res='Yes'

print(res)
Buggy python submission (verdict: Runtime Error):
x, y=map(int, input().split())

res=100**x*y

if y=100:
	res=100**x*(y+1)

print(res)

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

res=100**x*y

if y==100:
	res=100**x*(y+1)

print(res)
Buggy python submission (verdict: Runtime Error):
print(char(ord(input()) + 1))

Fixed submission:
print(chr(ord(input()) + 1))

Buggy python submission (verdict: Runtime Error):
char(ord(input()) + 1)

Fixed submission:
print(chr(ord(input()) + 1))
Buggy python submission (verdict: Runtime Error):
print(''.join(sorted(input() for _ in range(int(input())))))

Fixed submission:
n, m = map(int, input().split())
print(''.join(sorted(input() for _ in range(n))))
Buggy python submission (verdict: Runtime Error):
A, B, C = [int(x) for x in stdin.readline().rstrip().split()]
ans = C-(A-B)
if ans > 0:
  print(ans)
else:
  print(0)

Fixed submission:
A, B, C = map(int, input().split())
ans = C-(A-B)
if ans > 0:
  print(ans)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
A, B, C = stdin.readline().rstrip().split()
ans = C-(A-B)
if ans > 0:
  print(ans)
else:
  print(0)

Fixed submission:
A, B, C = map(int, input().split())
ans = C-(A-B)
if ans > 0:
  print(ans)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
n = int(input())
count = 0
for i in range(n):
  if len(i+1)%2 == 1:
    count += 1

print(count)

Fixed submission:
n = int(input())
count = 0
for i in range(n):
  if len(str(i+1))%2 == 1:
    count += 1
 
print(count)
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 12 22:19:09 2020

@author: nanasakiwataru
"""


ans = chr(ord(C) + 1)
st = C + 'の次は' + ans + 'です。'
print(st)


Fixed submission:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 12 22:19:09 2020

@author: nanasakiwataru
"""

C = input()
ans = chr(ord(C) + 1)
print(ans)

Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 12 22:19:09 2020

@author: nanasakiwataru
"""

def alphabet(C):
    ans = chr(ord(C) + 1)
    st = C + 'の次は'+ n + 'です。'
    return  st

n = alphabet('a')
print(n)



Fixed submission:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 12 22:19:09 2020

@author: nanasakiwataru
"""

C = input()
ans = chr(ord(C) + 1)
print(ans)

Buggy python submission (verdict: Runtime Error):
x = input()
z = [a,b,c,d,e,f,g,h,i,j,k,l,n,m,o,p,q,r,s,t,u,v,w,x,y,z]
xi = z.index(x)
print(z[xi+a1])

Fixed submission:
x = input()
z = ord(x)
xi = chr(z+1)
print(xi)

Buggy python submission (verdict: Runtime Error):
alpha = 'abcdefghijklmnopqrstuvwxyz'
C = input().split()
print(alpha[alpha.index(C)+1])

Fixed submission:
alpha = 'abcdefghijklmnopqrstuvwxyz'
C = input()
print(alpha[alpha.index(C)+1])

Buggy python submission (verdict: Runtime Error):
import sys
import string
input = sys.stdin.readline

C = input()
print(string.ascii_lowercase[string.ascii_lowercase.index(C)+1])


Fixed submission:
alpha = 'abcdefghijklmnopqrstuvwxyz'
C = input()
print(alpha[alpha.index(C)+1])

Buggy python submission (verdict: Runtime Error):
import sys
import string
input = sys.stdin.readline

C = input()
if C == 'z': print('a')
else: print(string.ascii_lowercase[string.ascii_lowercase.index(C)+1])

Fixed submission:
alpha = 'abcdefghijklmnopqrstuvwxyz'
C = input()
print(alpha[alpha.index(C)+1])

Buggy python submission (verdict: Runtime Error):
import sys

str = sys.stdin.readline()
alp = "abcdefghijklmnopqrstuvwxyz"
print(alp[ord(str)-96])

Fixed submission:
str = input()
alp = "abcdefghijklmnopqrstuvwxyz"
print(alp[ord(str)-96])

Buggy python submission (verdict: Runtime Error):
import sys

str = sys.stdin.readlines()[0]
alp = "abcdefghijklmnopqrstuvwxyz"
print(alp[ord(str)-96])

Fixed submission:
str = input()
alp = "abcdefghijklmnopqrstuvwxyz"
print(alp[ord(str)-96])
Buggy python submission (verdict: Runtime Error):
import sys
import math

str = sys.stdin.readline()

a = int(str.split()[0])
b = int(str.split()[1])

print((a * b) // math.gcd(a,b))

Fixed submission:
import sys
import fractions

str = sys.stdin.readline()

a = int(str.split()[0])
b = int(str.split()[1])

print((a * b) // fractions.gcd(a,b))

Buggy python submission (verdict: Runtime Error):
import sys
import math

str = sys.stdin.readline()

a = int(str.split()[0])
b = int(str.split()[1])

print(int(a * b / math.gcd(a,b)))


Fixed submission:
import sys
import fractions

str = sys.stdin.readline()

a = int(str.split()[0])
b = int(str.split()[1])

print((a * b) // fractions.gcd(a,b))

Buggy python submission (verdict: Runtime Error):
import sys
import math

str = sys.stdin.readlines()

a = int(str[0].split()[0])
b = int(str[0].split()[1])

print(int(a * b / math.gcd(a,b)))



Fixed submission:
import sys
import fractions

str = sys.stdin.readline()

a = int(str.split()[0])
b = int(str.split()[1])

print((a * b) // fractions.gcd(a,b))
Buggy python submission (verdict: Runtime Error):
str = input().split("\r\n")
count = 0
for i in range(3):
    if str[0][i]==str[1][i]:
        count += 1

print(count)


Fixed submission:
s = input()
t = input()
count = 0
for i in range(3):
    if s[i]==t[i]:
        count += 1

print(count)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
p = sorted(list(map(int, input().split())))
mid = n // 2
ans = 0
for i in range(p[mid-1], p[mid]):
  if len([j for j in p if j > i]) == mid:
    ans += 1
print(ans)

Fixed submission:
n = int(input())
p = sorted(list(map(int, input().split())))
mid = n // 2
print(p[mid] - p[mid-1])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
p = sorted(list(map(int, input().split())))
mid = n // 2
ans = 0
for i in range(p[mid-1], p[mid]):
  if len([j for j in p if j > i]) == (n//2):
    ans += 1
print(ans)

Fixed submission:
n = int(input())
p = sorted(list(map(int, input().split())))
mid = n // 2
print(p[mid] - p[mid-1])

Buggy python submission (verdict: Runtime Error):
n = int(input())
p = sorted(list(map(int, input().split())))
mid = n // 2
ans = 0
for i in range(p[mid-1], p[mid+1]):
  if len([j for j in p if j > i]) == (n//2):
    ans += 1
print(ans)

Fixed submission:
n = int(input())
p = sorted(list(map(int, input().split())))
mid = n // 2
print(p[mid] - p[mid-1])

Buggy python submission (verdict: Runtime Error):
n = int(input())
p = sorted(list(map(int, input().split())))
mid = n // 2
ans = 0
for i in range(p[mid-1], p[mid+1]):
  if len([j for j in p if j > i]) == (n//2):
    ans += 1
print(ans)

Fixed submission:
n = int(input())
p = sorted(list(map(int, input().split())))
mid = n // 2
print(p[mid] - p[mid-1])