Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
S = input()
gene = ['A','T','C','G']

length = len(S)
ans = 0
tmp = 0

for i in range(length):
  if s[i] in gene:
    tmp += 1
  else:
    tmp = 0
  if tmp >= ans:
    ans = tmp
print(ans)
      

Fixed submission:
S = input()
gene = ['A','T','C','G']

length = len(S)
ans = 0
tmp = 0

for i in range(length):
  if S[i] in gene:
    tmp += 1
  else:
    tmp = 0
  if tmp >= ans:
    ans = tmp
print(ans)
Buggy python submission (verdict: Runtime Error):
A,B,C = map(int,input().split())
print(if(B/A <= C)int(B/A) else(int(C))

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

ans = min(C,B//A)
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b,k = map(int,input().split())
m = min(a,b)
count = 0
for i in range(m,0,-1):
  if i == 0 :
    break:
  if a%i == 0 and b%i == 0:
    count += 1
  if count == k:
    break:
print(i)

Fixed submission:
a,b,k = map(int,input().split())
m = min(a,b)
count = 0
for i in range(m,0,-1):
  if i == 0:
    break
  if a%i == 0 and b%i == 0:
    count += 1
  if count == k:
    break
print(i)
Buggy python submission (verdict: Runtime Error):
S = input()
print("HEISEI" if S <= 2019/4/30 else "TBD")

Fixed submission:
_,m,_ = map(int,input().split("/"))
print("TBD" if m > 4 else "Heisei")

Buggy python submission (verdict: Runtime Error):
S = input()
print("HEISEI" if(S <= 2019/4/30) else "TBD")

Fixed submission:
_,m,_ = map(int,input().split("/"))
print("TBD" if m > 4 else "Heisei")
Buggy python submission (verdict: Runtime Error):
n = int(input())
sum_money = 0
for i in range(n):
  x,u = map(input())
  int_x = float(x)
  
  if u == 'BTC':
    int_x *= 380000.0
  sum_money += int_x
print(sum_money)

Fixed submission:
n = int(input())
sum_money = 0
for i in range(n):
  x,u = input().split()
  int_x = float(x)
  
  if u == 'BTC':
    int_x *= 380000.0
  sum_money += int_x
print(sum_money)
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
if(B%A == 0):
  print(A+B)
else:
  print(B-A)

Fixed submission:
A, B = map(int,input().split())
if(B%A == 0):
  print(A+B)
else:
  print(B-A)
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input())
sum = {}
ans = 0

for i in range(n):
  k = list(map(int,input().split()))
  for j in range(1,k[0] + 1):
    if k[j] not in sum:
      sum[k[j]] = 1
    else:
      sum[k[j]] += 1
for l in sum:
  if sum[l] == n:
    ans += 1
print(ans)

Fixed submission:
n,m = map(int,input().split())
sum = {}
ans = 0

for i in range(0,n):
  K = list(map(int,input().split()))
  for j in range(1,K[0] + 1):
    if K[j] not in sum:
      sum[K[j]] = 1
    else:
      sum[K[j]] += 1
for k in sum:
  if sum[k] == n:
    ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
a = [int(input())]

for i in range(100000):
  if a[i] % 2 == 0:
    a.append(a[i]//2)
    else:
      a.append(3*a[i] + 1)
    
    if a[i+1] in a[:i]:
      print(i+2)
      break
      

Fixed submission:
a = [int(input())]

for i in range(100000):
  if a[i] % 2 == 0:
    a.append(a[i]//2)
  else:
    a.append(3*a[i] + 1)
    
  if a[i+1] in a[:i]:
    print(i+2)
    break

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

for i in range(100000):
  if a[i] % 2 == 0:
    a.append(a[i]//2)
    else:
      a.append(3*a[i] + 1)
    
    if a[i+1] in a[:i]
      print(i+2)
      break
      

Fixed submission:
a = [int(input())]

for i in range(100000):
  if a[i] % 2 == 0:
    a.append(a[i]//2)
  else:
    a.append(3*a[i] + 1)
    
  if a[i+1] in a[:i]:
    print(i+2)
    break
Buggy python submission (verdict: Runtime Error):
D = int(input())
if(D == 25):
  print("Christmas")
else if(D == 24):
  print("Christmas Eve")
else if(D == 23):
  print("Christmas Eve Eve")
else if(D == 22):
  print("Christmas Eve Eve Eve")

Fixed submission:
D = int(input())
if(D == 25):
  print("Christmas")
elif(D == 24):
  print("Christmas Eve")
elif(D == 23):
  print("Christmas Eve Eve")
elif(D == 22):
  print("Christmas Eve Eve Eve")
Buggy python submission (verdict: Runtime Error):
s = input()
imin = 753
for i in range(len(s)-2):
  if(abs(int(s[i] + s[i+1] + s[i+2]) - 753) < imin:
     imin = abs(int(s[i] + s[i+1] + s[i+2])-753)
print(imin)

Fixed submission:
s = input()
imin = 753
for i in range(len(s)-2):
  if(abs(int(s[i] + s[i+1] + s[i+2]) - 753) )< imin:
     imin = abs(int(s[i] + s[i+1] + s[i+2])-753)
print(imin)
Buggy python submission (verdict: Runtime Error):
n = int(input())
t,a = map(int,input().split())
h = list(map(int,input().split()))
tmp = 1000000
ans = 0

for i in range(n):
  c = t - h[i] * 0.006
  d = a - c
  if d < 0:
    d = -d
  if d < tmp:
    tmp = d
    ans = i + 1
print(ans)

Fixed submission:
X,Y = map(int, input().split())
print(int (X + Y/2))

Buggy python submission (verdict: Runtime Error):
n = int(input())
t,a = map(int,input().split())
h = list(map(int,input().split()))
tmp = 1000000
ans = 0
for i in range(n):
  c = t - h[i] * 0.006
  d = a - c
  if d < 0:
    d = -d
  if d < tmp:
    tmp = d
    ans = i + 1
print(ans)

Fixed submission:
X,Y = map(int, input().split())
print(int (X + Y/2))

Buggy python submission (verdict: Runtime Error):
n = int(input())
t,a = map(int,input().split())
h = list(map(int,input().split()))
tmp = 1000000
ans = 0
for i in range(n):
  c = t - h[i] * 0.006
  d = a - c
  if d < 0:
    d = -d
  if d < tmp:
    tmp = d
    ans = i + 1
print(ans)


Fixed submission:
X,Y = map(int, input().split())
print(int (X + Y/2))

Buggy python submission (verdict: Runtime Error):
X,Y = map(int, input().split())
print(int X + Y/2)

Fixed submission:
X,Y = map(int, input().split())
print(int (X + Y/2))

Buggy python submission (verdict: Runtime Error):
X,Y = map(int, input().split())
Y = 2/Y
print(int X + Y/2)

Fixed submission:
X,Y = map(int, input().split())
print(int (X + Y/2))
Buggy python submission (verdict: Runtime Error):
n = int(input())
t, a = map(int,input().split())
h = list(map(int,input().split()))
tem = [ans(a - ( t - i * 0.006)) for i in h]
print(tem.index(min(tem)) + 1)

Fixed submission:
n = int(input())
t,a = map(int,input().split())
h = list(map(int,input().split()))
tem = [abs(a - (t - i * 0.006)) for i in h]
print(tem.index(min(tem)) + 1)

Buggy python submission (verdict: Runtime Error):
N = int(input())
T, A = map(int, (input().split()))
H = list(map(int, (input().split())))
tem_diff = [abs(A - (T - i * 0.006)) for i in H]
print(tem_diff.index(min(tem_diff)) + 1)

n = int(input())
t,a = map(int,input().split())
h = list(map(int,input().split()))
tem = [abs(a - (t - i * 0.006)) for i in h]
print(tem.index(min(tem)) + 1)

Fixed submission:
n = int(input())
t,a = map(int,input().split())
h = list(map(int,input().split()))
tem = [abs(a - (t - i * 0.006)) for i in h]
print(tem.index(min(tem)) + 1)
Buggy python submission (verdict: Runtime Error):
N,T = map(int,input().split())
c,t = [list(map(int,input.split())) for i in N]
min_c = 1000
hantei = 0
ans = 0
for i in N:
  tmp = 0
  if t[i] <= T:
    tmp = 1
    hantei += 1
  if tmp == 1:
    if c[i] < min_c:
      min_c = c[i]
      ans = i+1
print ans if hantei>0 else 'TLE'  

Fixed submission:
N, T = map(int, input().split())
 
c = []
for i in range(N):
    ci, ti = map(int, input().split())
    c.append([ci, ti])
 
c.sort(key=lambda x:x[0])
 
for i in range(len(c)):
    if c[i][1] <= T:
        print(c[i][0])
        exit()
print('TLE')

Buggy python submission (verdict: Runtime Error):
N,T = map(int,input().split())
c,t = [list(map(int,input.split())) for i in N]
min_c = 1000
hantei = 0
ans = 0
for i in N:
  tmp = 0
  if t[i] <= T:
    tmp = 1
    hantei += 1
  if tmp == 1:
    if c[i] < min_c:
      min_c = c[i]
      ans = i+1
print(ans)    

Fixed submission:
N, T = map(int, input().split())
 
c = []
for i in range(N):
    ci, ti = map(int, input().split())
    c.append([ci, ti])
 
c.sort(key=lambda x:x[0])
 
for i in range(len(c)):
    if c[i][1] <= T:
        print(c[i][0])
        exit()
print('TLE')
Buggy python submission (verdict: Runtime Error):
print(1100 - int(input())

Fixed submission:
print(1110 - int(input()))
Buggy python submission (verdict: Runtime Error):
n = int(input())
w = [input().rsprit() for i in range(n)]
use = [w[0]]
for i in range(1,n):
  if w[i][0] == w[i-1][-1] and w[i] not in use:
    use.append(w[i])
  else:
    print('No')
    exit()
print('Yes')

Fixed submission:
n = int(input())
data = [input().rstrip() for _ in range(n)]
used = [data[0]]
 
for i in range(1, n):
    if data[i][0] == data[i - 1][-1] and data[i] not in used:
        used.append(data[i])
    else:
        print("No")
        exit()
print('Yes')
Buggy python submission (verdict: Runtime Error):
K = int(input())
if(K%2 == 0):
  print(int((K/2)**2)
else:
  print(int((K/2)*(K/2+1)))

Fixed submission:
K = int(input())
if(K%2 == 0):
  print(int((K/2)**2))
else:
  print(int(((K-1)/2)*((K+1)/2)))
Buggy python submission (verdict: Runtime Error):
n = int(input())
count_ans = 0
for i in range(n//2 + 1):
  count_y = 0
  for j in range(2*i+2):
    if j > 0:
      if (2 * i + 1)%j == 0:
        count_y += 1
  if count_y == 8:
    count_ans += 1
print(count_ans)

Fixed submission:
A,B = map(int,input().split())
print(int(A*B - (A+B-1)))
Buggy python submission (verdict: Runtime Error):
n = int(input())
count_ans = 0
for i in range(n//2 + 1):
  count_y = 0
  for j in range(i):
    if i%j == 0:
      count_y += 1
  if count_y == 8:
    count_ans += 1
print(count_ans)

Fixed submission:
n = int(input())
count_ans = 0
for i in range(n//2 + 1 if n%2 ==1 else n//2):
  count_y = 0
  for j in range(2*i+2):
    if j > 0:
      if (2 * i + 1)%j == 0:
        count_y += 1
  if count_y == 8:
    count_ans += 1
print(count_ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
count_ans = 0
for i in range(n//2 + 1):
  count_y = 0
  for j in range(i):
    if i%j == 0:
      count_y += 1
  if count_y = 8:
    count_ans += 1
print(count_ans)

Fixed submission:
n = int(input())
count_ans = 0
for i in range(n//2 + 1 if n%2 ==1 else n//2):
  count_y = 0
  for j in range(2*i+2):
    if j > 0:
      if (2 * i + 1)%j == 0:
        count_y += 1
  if count_y == 8:
    count_ans += 1
print(count_ans)
Buggy python submission (verdict: Runtime Error):
d,n = map(int,input())
ans = (100 ** d) * n
print(ans)

Fixed submission:
d,n = map(int,input().split())
if n < 100:
  ans = (100 ** d) * n
  print(ans)
else:
  ans = (100 ** (d+1)) + 100 ** d
  print(ans)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input())
tmp = b - a
count = 0
for i in range(tmp):
  count += i+1
print(count - a)

Fixed submission:
a,b = map(int,input().split())
tmp = b - a
count = 0
for i in range(tmp):
  count += i
print(count - a)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
d,x = map(int,input().split())
count = x
a = [int(input()) for i in range(n)]
for i in range(n):
  j = 0
  while j * a[i] + 1 <= d:
    count += 1
print(count)

Fixed submission:
n = int(input())
d,x = map(int,input().split())
count = x
a = [int(input()) for i in range(n)]
for i in range(n):
  j = 0
  while j * a[i] + 1 <= d:
    count += 1
    j += 1
print(count)

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

Fixed submission:
n = int(input())
d,x = map(int,input().split())
count = x
a = [int(input()) for i in range(n)]
for i in range(n):
  j = 0
  while j * a[i] + 1 <= d:
    count += 1
    j += 1
print(count)

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

Fixed submission:
n = int(input())
d,x = map(int,input().split())
count = x
a = [int(input()) for i in range(n)]
for i in range(n):
  j = 0
  while j * a[i] + 1 <= d:
    count += 1
    j += 1
print(count)

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

Fixed submission:
n = int(input())
d,x = map(int,input().split())
count = x
a = [int(input()) for i in range(n)]
for i in range(n):
  j = 0
  while j * a[i] + 1 <= d:
    count += 1
    j += 1
print(count)
Buggy python submission (verdict: Runtime Error):
A,B,C = list(map(int,input().split()))
if A * C > B:
    print(int(B / A))
else:
    print((C)

Fixed submission:
A,B,C = list(map(int,input().split()))
if A * C > B:
    print(int(B / A))
else:
    print(C)
Buggy python submission (verdict: Runtime Error):
S = input()
2 print('Heisei' if S <= '2019/04/30' else 'TBD')


Fixed submission:
S = input()
print('Heisei' if S <= '2019/04/30' else 'TBD')
Buggy python submission (verdict: Runtime Error):
N = int(input())
if N == 1:
  print("Hello World")
else:
  A, B = list(map(int,input().split()))
  print(A + B)
  

Fixed submission:
N = int(input())
if N == 1:
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A + B)
Buggy python submission (verdict: Runtime Error):
R = int(input())
if R < 1200:
    ptint("ABC")
elif R < 2800:
    print("ARC")
else:
    print("AGC")


Fixed submission:
R = int(input())
if R < 1200:
    print("ABC")
elif R < 2800:
    print("ARC")
else:
    print("AGC")

Buggy python submission (verdict: Runtime Error):
R = int(input())
if R < 1200:
    ptint("ABC")
elif R < 2800:
    print("ARC")
else:
    print("AGC")


Fixed submission:
R = int(input())
if R < 1200:
    print("ABC")
elif R < 2800:
    print("ARC")
else:
    print("AGC")
Buggy python submission (verdict: Runtime Error):
x,y,z,k = [int(num) for num in input().split()]
#入力して降順ソートしてｋ個分にスライス
a_cake,b_cake,c_cake = [sorted([int(num) for num in input().split()],reverse=True)[:k] for _ in range(3)]

#リストの最初の値(max値)との差分をリスト化
diff_list = list()
for cake in [a_cake,b_cake,c_cake]:
        diff_list.extend(list(map(lambda x:cake[0]-x,cake)))

diff_list.sort()
cake_max = a_cake[0]+b_cake[0]+c_cake[0]
for diff in diff_list[:k]:
    print(cake_max-diff)

    


Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e-a<=k:
    print("Yay!")
else:
    print(":(")

Buggy python submission (verdict: Runtime Error):
x,y,z,k = [int(num) for num in input().split()]
a_cake,b_cake,c_cake = [sorted([int(num) for num in input().split()],reverse=True) for _ in range(3)]

sum_cake = sorted([a+b+c for a in a_cake for b in b_cake for c in c_cake],reverse=True)[:k]
print(sum_cake)

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e-a<=k:
    print("Yay!")
else:
    print(":(")

Buggy python submission (verdict: Runtime Error):
a,b,c,d,e,k = [int(input()) for _ in range(6)]
 
result = "Yey!" if e-a<=k else ":("
println(result)

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e-a<=k:
    print("Yay!")
else:
    print(":(")

Buggy python submission (verdict: Runtime Error):
a,b,c,d,e,k = [int(input()) for _ in range(6)]

if e-a > k:
	print(":(")
else
	print("Yey!")

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e-a<=k:
    print("Yay!")
else:
    print(":(")

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

println(e - a <= k ? "Yay!" : ":(")


Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e-a<=k:
    print("Yay!")
else:
    print(":(")
Buggy python submission (verdict: Time Limit Exceeded):
x,y,z,k = [int(num) for num in input().split()]
a_cake,b_cake,c_cake = [sorted([int(num) for num in input().split()],reverse=True)[:k] for _ in range(3)]

sum_cake = sorted([a+b+c for a in a_cake for b in b_cake for c in c_cake],reverse=True)[:k]

for i in sum_cake:
    print(i)




Fixed submission:
x,y,z,k = [int(num) for num in input().split()]
a_cake,b_cake,c_cake = [sorted([int(num) for num in input().split()],reverse=True)[:k] for _ in range(3)]

sum_cake=list()
for i,a in enumerate(a_cake,1):
    for j,b in enumerate(b_cake,1):
        if(i*j>k):
            break
        for n,c in enumerate(c_cake,1):
            if(i*j*n>k):
                break
            sum_cake.append(a+b+c)


sum_cake.sort(reverse=True)

for i in sum_cake[:k]:
    print(i)

Buggy python submission (verdict: Time Limit Exceeded):
x,y,z,k = [int(num) for num in input().split()]
a_cake,b_cake,c_cake = [sorted([int(num) for num in input().split()],reverse=True) for _ in range(3)]

sum_cake = sorted([a+b+c for a in a_cake for b in b_cake for c in c_cake],reverse=True)[:k]

for i in sum_cake:
    print(i)




Fixed submission:
x,y,z,k = [int(num) for num in input().split()]
a_cake,b_cake,c_cake = [sorted([int(num) for num in input().split()],reverse=True)[:k] for _ in range(3)]

sum_cake=list()
for i,a in enumerate(a_cake,1):
    for j,b in enumerate(b_cake,1):
        if(i*j>k):
            break
        for n,c in enumerate(c_cake,1):
            if(i*j*n>k):
                break
            sum_cake.append(a+b+c)


sum_cake.sort(reverse=True)

for i in sum_cake[:k]:
    print(i)

Buggy python submission (verdict: Runtime Error):
x,y,z,k = [int(i) for i in input().split()]

cakes_types = [[int(i) for i in input().split()] for _ in range(3)]


for types in cakes_types:
    types.extend([0 for _ in range(max(x,y,z)-len(types))])
    types.sort(reverse=True)

sum_list = list()

for i in range(k):
    sum_taste = 0;
    for j in range(3):
        sum_taste += cakes_types[j][i]
    sum_list.append(sum_taste)

print(sum_list)

Fixed submission:
x,y,z,k = [int(num) for num in input().split()]
a_cake,b_cake,c_cake = [sorted([int(num) for num in input().split()],reverse=True)[:k] for _ in range(3)]

sum_cake=list()
for i,a in enumerate(a_cake,1):
    for j,b in enumerate(b_cake,1):
        if(i*j>k):
            break
        for n,c in enumerate(c_cake,1):
            if(i*j*n>k):
                break
            sum_cake.append(a+b+c)


sum_cake.sort(reverse=True)

for i in sum_cake[:k]:
    print(i)
Buggy python submission (verdict: Time Limit Exceeded):
def main():
	n = int(input())

	info = []
	for i in range(n):
		l = list(map(int, input().split()))
		info.append(l)

	for k in range(info[0][2], info[0][2] + 201):
		for i in range(101):
			for j in range(101):
				# [i][j]に高さkの頂上があった場合
				flg = 0
				for l in info:
					#print(l)
					deltax = abs(l[0] - i)
					deltay = abs(l[1] - j)
					guessh = max(k - deltax - deltay, 0)
					#print(guessh, k)
					if guessh != l[2]:
						flg = 1
						break
				#print("i,j,k,flg: ", i,j,k,flg)
				if flg == 0:
					print(i, j, k)
					return

if __name__ == '__main__':
	main()


Fixed submission:
def main():
	n = int(input())

	info = []
	for i in range(n):
		l = list(map(int, input().split()))
		info.append(l)

	for k in range(info[0][2], info[0][2] + 201):
		for i in range(101):
			for j in range(101):
				# [i][j]に高さkの頂上があった場合
				flg = 0
				for l in info:
					#print(l)
					deltax = abs(l[0] - i)
					deltay = abs(l[1] - j)
					guessh = max(k - deltax - deltay, 0)
					#print(guessh, k)
					if guessh != l[2]:
						flg = 1
						break
				#print("i,j,k,flg: ", i,j,k,flg)
				if flg == 0:
					print(i, j, k)
					return

if __name__ == '__main__':
	main()
Buggy python submission (verdict: Runtime Error):
# coding: utf-8

nums = input().split(" ")
a = int(nums[0])
b = int(nums[1])
c = int(nums[2])
num_list = [a, b, c]

max_num = max(num_list)
min_num = min(num_list)

if max_num == a:
	max_index = 0
elif max_num == b:
	max_index = 1
else:
	max_index = 2

if min_num == a and max_index != 0:
	min_index = 0
elif min_num == b and max_index != 1:
	min_index = 1
else:
	min_index = 2

index_list = [0, 1, 2]
del index_list[max_index]
del index_list[min_index]
middle_index = index_list[0]

answer = int( str(num_list[max_index]) + str(num_list[middle_index]) ) + num_list[min_index]

print(answer)


Fixed submission:
# coding: utf-8

nums = input().split(" ")
a = int(nums[0])
b = int(nums[1])
c = int(nums[2])
num_list = [a, b, c]

max_num = max(num_list)
min_num = min(num_list)

if max_num == a:
	max_index = 0
elif max_num == b:
	max_index = 1
else:
	max_index = 2

if min_num == a and max_index != 0:
	min_index = 0
elif min_num == b and max_index != 1:
	min_index = 1
else:
	min_index = 2

index_list = [0, 1, 2]
index_list[max_index] = "abc"
index_list[min_index] = "abc"
if index_list[0] == 0:
	middle_index = 0
elif index_list[1] == 1:
	middle_index = 1
else:
	middle_index = 2

answer = int( str(num_list[max_index]) + str(num_list[middle_index]) ) + num_list[min_index]

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

cnt = 0
for c in s:
	if c == "1":
		cnt += 1
print(cmt)

Fixed submission:
s = input()

cnt = 0
for c in s:
	if c == "1":
		cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
s=input()
if s="A":
    print("T")
elif s="T":
    print("A")
elif s="C":
    print("G")
else:
    print("C")

Fixed submission:
s=input()
if s=="A":
    print("T")
elif s=="T":
    print("A")
elif s=="C":
    print("G")
else:
    print("C")
Buggy python submission (verdict: Runtime Error):
N , K = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
print(ceil((N-1)/(K-1)))

Fixed submission:
import math
N , K = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
print(math.ceil((N-1)/(K-1)))
Buggy python submission (verdict: Runtime Error):
s=set(input())
a=set("a","b","c")
print("Yes"if s==a else"No")

Fixed submission:
s=set(input())
a=set(["a","b","c"])
print("Yes"if s==a else"No")
Buggy python submission (verdict: Runtime Error):
s = input()
ans=0
for i in range(len(s)):
  if s[i] == s[i+1]:
    ans += 1
if ans > 0:
  print("no")
else:
  print("yes")

Fixed submission:
s = input()
s1=[]
for i in range(len(s)):
  s1.append(s[i])
s2 = set(s1)
if len(s2) == len(s1):
  print("yes")
else:
  print("no")
Buggy python submission (verdict: Runtime Error):
a=sorted([int(input()) for _ in [0]*int(input())])
if sum(a) % 10 != 0:
    print(sum(a))
else:
    for i in range(len(a)): #リスト中の10の倍数でなく最小の数を探す
        if a[i] % 10 !=0:
            s1=i
            break
    a.pop(s1)
    print(sum(a))

Fixed submission:
a=sorted([int(input()) for _ in [0]*int(input())])
s1=-1
if sum(a) % 10 != 0:
    print(sum(a))
else:
    for i in range(len(a)): #リスト中の10の倍数でなく最小の数を探す
        if a[i] % 10 !=0:
            s1=i
            break
    if s1!=-1:
        a.pop(s1)
        print(sum(a))
    else:
        print(0)
Buggy python submission (verdict: Runtime Error):
o = input()
e = input()
r = ''
for i in range(len(o)):
  r += o[i]
  if i < len(e):
    r += e[i]
print(r)

Fixed submission:
a,b,c = map(int, input().split())
d = b - a
e = c - b
if d == e:
  print("YES")
else:
  print("NO")

Buggy python submission (verdict: Runtime Error):
#すぬけ君は新しくできたプログラミングコンテストに会員登録しました。 登録に使ったパスワードを覚えておく自信が無かったすぬけ君は、 手元の紙にパスワードをメモしておくことにしました。 ただし、そのままメモをすると誰かにパスワードを盗まれてしまうかもしれないので、 文字列の偶数番目の文字と奇数番目の文字をそれぞれ別々の紙にメモしておくことにしました。
#パスワードの奇数番目の文字だけを順番を変えずに取り出した文字列 O と、 偶数番目の文字だけを順番を変えずに取り出した文字列 E が与えられます。 すぬけ君のかわりにパスワードを復元してください。
o = input()
e = input()
r = ''
for i in range(len(o)):
  r += o[i]
  if i < len(e):
    r += e[i]
print(r)

Fixed submission:
a,b,c = map(int, input().split())
d = b - a
e = c - b
if d == e:
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Runtime Error):
a=input()
if a=="A":
    print("T")
else if a=="T":
    print("A")
else if a=="C":
    print("G")
else if a=="G":
    print("C")

Fixed submission:
a=input()
if a=="A":
    print("T")
elif a=="T":
    print("A")
elif a=="C":
    print("G")
elif a=="G":
    print("C")
Buggy python submission (verdict: Runtime Error):
n=int(input())
if(n%2==0)
	print(n)
else
	print(n*2)

Fixed submission:
n=int(input())
if n%2==0:
	print(n)
else:
	print(n*2)
Buggy python submission (verdict: Runtime Error):
a,b=int(input().split())
if a>8|b>8:
  print(":(")
else:
  print("Yay!")

Fixed submission:
a,b=map(int,input().split())
if a>8 or b>8:
  print(":(")
else:
  print("Yay!")