Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
in_pred = input()
in_real = input()

i = 0
for a in in_pred:
  for b in in_real:
    if a == b:
      i += 1
      
return i


Fixed submission:
a = input()
b = input()

c = 0

for i in range(3):
  if a[i] == b[i]:
    c += 1
      
print(c)
Buggy python submission (verdict: Runtime Error):
in_data = input()
 
data = in_data.split(' ')
A = int(data[0])
B = int(data[1])
if B == 1:
  print("0")
else
  c = (B - 1) // A + 1
  print(c)

Fixed submission:
in_data = input()
 
data = in_data.split(' ')
A = int(data[0])
B = int(data[1])
if B == 1:
  print("0")
else:
  c = (B - 1) // (A - 1)
  d = (B - 1) / (A - 1)
  if c < d:
    c = c + 1
  print(c)

Buggy python submission (verdict: Runtime Error):
in_data = input()
def test_fun(in_data):
    data = in_data.split(' ')
    A = int(data[0])
    B = int(data[1])
    c = (B - 1) // A + 1
 
    print(c)
  
test_func(in_data)

Fixed submission:
in_data = input()
 
data = in_data.split(' ')
A = int(data[0])
B = int(data[1])
if B == 1:
  print("0")
else:
  c = (B - 1) // (A - 1)
  d = (B - 1) / (A - 1)
  if c < d:
    c = c + 1
  print(c)

Buggy python submission (verdict: Runtime Error):
in_data = input()
data = in_data.split(' ')
A = data[0]
B = data[1]
c = (B - 1) // (A - 1)
 
print(c)

Fixed submission:
in_data = input()
 
data = in_data.split(' ')
A = int(data[0])
B = int(data[1])
if B == 1:
  print("0")
else:
  c = (B - 1) // (A - 1)
  d = (B - 1) / (A - 1)
  if c < d:
    c = c + 1
  print(c)

Buggy python submission (verdict: Runtime Error):
in_data = input()
data = in_data.splite(' ')
A = data[0]
B = data[1]
c = (B - 1) // (A - 1)
 
print(c)

Fixed submission:
in_data = input()
 
data = in_data.split(' ')
A = int(data[0])
B = int(data[1])
if B == 1:
  print("0")
else:
  c = (B - 1) // (A - 1)
  d = (B - 1) / (A - 1)
  if c < d:
    c = c + 1
  print(c)

Buggy python submission (verdict: Runtime Error):
input = input()
data = input.splite(' ')
A = data[0]
B = data[1]
c = (B - 1) // (A - 1)
 
print(c)

Fixed submission:
in_data = input()
 
data = in_data.split(' ')
A = int(data[0])
B = int(data[1])
if B == 1:
  print("0")
else:
  c = (B - 1) // (A - 1)
  d = (B - 1) / (A - 1)
  if c < d:
    c = c + 1
  print(c)

Buggy python submission (verdict: Runtime Error):
in = input()
data = in.splite(' ')
A = data[0]
B = data[1]
c = (B - 1) // (A - 1)

print(c)



Fixed submission:
in_data = input()
 
data = in_data.split(' ')
A = int(data[0])
B = int(data[1])
if B == 1:
  print("0")
else:
  c = (B - 1) // (A - 1)
  d = (B - 1) / (A - 1)
  if c < d:
    c = c + 1
  print(c)
Buggy python submission (verdict: Runtime Error):
N = input()
H_raw = input()
H = H_raw.split(' ')
count = 0
max = 0
for i in range(N):
  if i == 0:
    continue
  if int(H[i]) < int(H[i - 1]):
    count = count + 1
  else:
    if count > max:
      max = count
    count = 0
else:
  if count > max:
    max = count
    
print(max)

Fixed submission:
N = int(input())
H_raw = input()
H = H_raw.split(' ')
count = 0
max = 0
for i in range(N):
  if i == 0:
    continue
  if int(H[i]) <= int(H[i - 1]):
    count = count + 1
  else:
    if count > max:
      max = count
    count = 0
    
if count > max:
  max = count
  
print(max)
Buggy python submission (verdict: Runtime Error):
a = int(input())
result = 0
if a mod 2 == 0:
  print(a * a / 2)
else:
  print(a * (a - 1) / 2)


print(result)

Fixed submission:
a = int(input())
print(int(a * (a - 1) // 2))

Buggy python submission (verdict: Time Limit Exceeded):
a = int(input())
result = 0
for i in range(a - 1):
  result = result + i + 1


print(result)

Fixed submission:
a = int(input())
print(int(a * (a - 1) // 2))

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

for i in range(a - 1):
  result = result + i + 1

print(result)

Fixed submission:
a = int(input())
print(int(a * (a - 1) // 2))
Buggy python submission (verdict: Time Limit Exceeded):
#coding: utf-8
n = int(input())

answer = 0

for i in range(1,n):
	answer += i
print(answer) 


Fixed submission:
#coding: utf-8
from decimal import Decimal
n = int(input())
n = n-1
answer = 0

if n % 2 == 0:
	answer = (Decimal(n)+Decimal(1))*(Decimal(n)/2)
else:
	answer = Decimal(n)*((Decimal(n)-Decimal(1))/2) + Decimal(n)

print(int(round(answer,0)))
Buggy python submission (verdict: Runtime Error):
#coding: utf-8
amount = int(input())
strings = list(map(str, [input() for i in range(amount)]))
sum = 0

for i in range(len(strings)):
	# print(strings[i])
	abc = list(strings[i])
	abc.sort()
	strings[i] = ''.join(abc)
	# print(strings[i])

strings.sort()

for j in range(len(strings-1)):
	# print(j)
	if strings[j] == strings[j+1]:
		sum = sum+1

print(sum)


Fixed submission:
#coding: utf-8
amount = int(input())
strings = list(map(str, [input() for i in range(amount)]))
sum = 0
sum2 = 0

for i in range(len(strings)):
	# print(strings[i])
	abc = list(strings[i])
	abc.sort()
	strings[i] = ''.join(abc)
	# print(strings[i])

strings.sort()

for j in range(len(strings)-1):
	# print(j+1)
	# print(strings[j]+strings[j+1])
	if strings[j] == strings[j+1]:
		sum2 = sum2+1
	else:
		sum = sum + sum2 * (sum2+1) / 2
		sum2 = 0

sum = sum + sum2 * (sum2+1) / 2
print(int(sum))

Buggy python submission (verdict: Time Limit Exceeded):
#coding: utf-8
amount = int(input())
strings = list(map(str, [input() for i in range(amount)]))
sum = 0

for i in range(len(strings)):
	# print(strings[i])
	abc = list(strings[i])
	abc.sort()
	strings[i] = ''.join(abc)
	# print(strings[i])

for j in range(len(strings)):
	for k in range(j+1,len(strings)):
		if strings[j] == strings[k]:
			sum = sum+1

print(sum)


Fixed submission:
#coding: utf-8
amount = int(input())
strings = list(map(str, [input() for i in range(amount)]))
sum = 0
sum2 = 0

for i in range(len(strings)):
	# print(strings[i])
	abc = list(strings[i])
	abc.sort()
	strings[i] = ''.join(abc)
	# print(strings[i])

strings.sort()

for j in range(len(strings)-1):
	# print(j+1)
	# print(strings[j]+strings[j+1])
	if strings[j] == strings[j+1]:
		sum2 = sum2+1
	else:
		sum = sum + sum2 * (sum2+1) / 2
		sum2 = 0

sum = sum + sum2 * (sum2+1) / 2
print(int(sum))
Buggy python submission (verdict: Runtime Error):
#coding: utf-8
s = str(input())
child = [1] * len(s)
# for j in range(len(s)):
# 	child[j] = 1

for j in range(2):
	after = [0] * len(s)
	for i in range(len(s)):
		# print(i)
		if child[i] != 0:
			if s[i] == 'R':
				after[i+1] = after[i+1] + child[i]
				# child[i] = 0
			elif s[i] == 'L':
				after[i-1] = after[i-1] + child[i]
				# child[i] = 0
	child = after
	checkFlg = 0
	for k in range(len(child):
		if child[k] != -1:
			checkFlg = 1
	if checkFlg == 0


print(child) 


Fixed submission:
#coding: utf-8
s = str(input())
child = [0] * len(s)
# for j in range(len(s)):
# 	child[j] = 1
r = 0
l = 0
# lIdx = 0
rIdx = 0

for i in range(len(s)):
	# print(str(r)+","+str(l))
	if s[i] == 'R':
		# print(i)
		r = r+1
		if s[i+1] == 'L':
			rIdx = i
	elif s[i] == 'L':
		l = l+1
		if i == len(s)-1 or s[i+1] == 'R':
			#1セットが終了する
			# print('r='+str(r)+" l="+str(l))
			if ((r+l)%2) == 0:
				child[rIdx] = (r+l)//2
				child[rIdx+1] = (r+l)//2
			else:
				if r%2==0:
					child[rIdx+1] = (r+l)//2 + 1
					child[rIdx] = (r+l)//2
				else:
					child[rIdx+1] = (r+l)//2
					child[rIdx] = (r+l)//2 + 1
			r = 0
			l = 0
			# lIdx = i-1
# child[rIdx-1] = l

#roop終わらない解法
# for j in range(10 ** 100):
# 	after = [0] * len(s)
# 	for i in range(len(s)):
# 		# print(i)
# 		if child[i] != 0:
# 			if s[i] == 'R':
# 				after[i+1] = after[i+1] + child[i]
# 				# child[i] = 0
# 			elif s[i] == 'L':
# 				after[i-1] = after[i-1] + child[i]
# 				# child[i] = 0
# 	child = after

print(" ".join(map(str,child)))

Buggy python submission (verdict: Time Limit Exceeded):
#coding: utf-8
s = str(input())
child = [1] * len(s)
# for j in range(len(s)):
# 	child[j] = 1

for j in range(10 ** 100):
	after = [0] * len(s)
	for i in range(len(s)):
		# print(i)
		if child[i] != 0:
			if s[i] == 'R':
				after[i+1] = after[i+1] + child[i]
				# child[i] = 0
			elif s[i] == 'L':
				after[i-1] = after[i-1] + child[i]
				# child[i] = 0
	child = after

print(child) 


Fixed submission:
#coding: utf-8
s = str(input())
child = [0] * len(s)
# for j in range(len(s)):
# 	child[j] = 1
r = 0
l = 0
# lIdx = 0
rIdx = 0

for i in range(len(s)):
	# print(str(r)+","+str(l))
	if s[i] == 'R':
		# print(i)
		r = r+1
		if s[i+1] == 'L':
			rIdx = i
	elif s[i] == 'L':
		l = l+1
		if i == len(s)-1 or s[i+1] == 'R':
			#1セットが終了する
			# print('r='+str(r)+" l="+str(l))
			if ((r+l)%2) == 0:
				child[rIdx] = (r+l)//2
				child[rIdx+1] = (r+l)//2
			else:
				if r%2==0:
					child[rIdx+1] = (r+l)//2 + 1
					child[rIdx] = (r+l)//2
				else:
					child[rIdx+1] = (r+l)//2
					child[rIdx] = (r+l)//2 + 1
			r = 0
			l = 0
			# lIdx = i-1
# child[rIdx-1] = l

#roop終わらない解法
# for j in range(10 ** 100):
# 	after = [0] * len(s)
# 	for i in range(len(s)):
# 		# print(i)
# 		if child[i] != 0:
# 			if s[i] == 'R':
# 				after[i+1] = after[i+1] + child[i]
# 				# child[i] = 0
# 			elif s[i] == 'L':
# 				after[i-1] = after[i-1] + child[i]
# 				# child[i] = 0
# 	child = after

print(" ".join(map(str,child)))
Buggy python submission (verdict: Runtime Error):
import sys


def main(argv):
    a = argv[0]
    b = argv[1]
    _sum = 0
    for i in range(2):
        if a > b:
            sum += a
            a -= 1
        else:
            sum += b
            b -= 1
    print(_sum)


if __name__ == '__main__':
    main(sys.argv[1:])


Fixed submission:
num = input()
num_list = num.split()
a = int(num_list[0])
b = int(num_list[1])
_sum = 0
for i in range(2):
    if a > b:
        _sum += a
        a -= 1
    else:
        _sum += b
        b -= 1
print(_sum)
Buggy python submission (verdict: Runtime Error):
mount_count = input()
mount_heights = input()
mount_heights_list = mount_heights.split()
count = 0
max_height = int(mount_heights_list[0])
for mount_height in mount_heights_list:
    if max_height <= int(mount_height):
        max_height = mount_height
        count += 1
print(count)

Fixed submission:
mount_count = input()
mount_heights = input()
mount_heights_list = mount_heights.split()
count = 0
max_height = int(mount_heights_list[0])
for mount_height in mount_heights_list:
    if max_height <= int(mount_height):
        max_height = int(mount_height)
        count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
a = int(input().split())
print(int(round((a[0]+a[1])/2)))

Fixed submission:
S=((input())).split(' ')
print((int)(((int)(S[0])+(int)(S[1]))/2+0.5))

Buggy python submission (verdict: Runtime Error):
a = int(input().split())
print(round((a[0]+a[1])/2))

Fixed submission:
S=((input())).split(' ')
print((int)(((int)(S[0])+(int)(S[1]))/2+0.5))

Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
 
c = round((a+b)/2)
 
print(int(c))

Fixed submission:
S=((input())).split(' ')
print((int)(((int)(S[0])+(int)(S[1]))/2+0.5))

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

c = (a+b)/2

print(c.round())

Fixed submission:
S=((input())).split(' ')
print((int)(((int)(S[0])+(int)(S[1]))/2+0.5))
Buggy python submission (verdict: Runtime Error):
s = input()

if n % 2 == 0:
    N = int(n / 2)
    a = s[:N]
    b = s[N:]
    if a == b:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Fixed submission:
n = int(input())
s = input()

if n % 2 == 0:
    N = int(n / 2)
    a = s[:N]
    b = s[N:]
    if a == b:
        print('Yes')
    else:
        print('No')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
K,S = map(int, input().split())
cnt=0

for x in range(K+1):
    for y in range(K+1):
         for z in range(K+1):
            if S== x+y+z:
                cnt +=1
            else:
                continue

print(cnt)

Fixed submission:
K,S = map(int, input().split())
cnt=0

for x in range(K+1):
    for y in range(K+1):
            if K>=S-(x+y)>=0:
                cnt +=1
            else:
                continue

print(cnt)
Buggy python submission (verdict: Runtime Error):
d1 = list(map(int ,input().split())
d2 = list(map(int ,input().split())
if d2[0] != d1[0]:
          print(1)
else:
          print(0)
       
        

Fixed submission:
d1 = list(map(int ,input().split()))
d2 = list(map(int ,input().split()))
if d2[0] != d1[0]:
          print(1)
else:
          print(0)
Buggy python submission (verdict: Runtime Error):
s = input()
mapping = {'SUN':, 'MON':1, 'TUE':2, 'WED':3, 'THU':4
           , 'FRI':5, 'SAT':6}
if s == 'SUN':
  print(7)
else:
  print(7-mapping[s])

Fixed submission:
s = input()
mapping = {'SUN': 0, 'MON':1, 'TUE':2, 'WED':3, 'THU':4, 'FRI':5, 'SAT':6}
if s == 'SUN':
  print(7)
else:
  print(7-mapping[s])
Buggy python submission (verdict: Runtime Error):
r = int(inpnut())
print(r*r)

Fixed submission:
r = int(input())
print(r*r)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input.split())
if a <10 and b<10:
  	return a*b
else:
  return -1

Fixed submission:
a, b = map(int, input().split())
if a <10 and b<10:
  print(a*b)
else:
  print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
pre_i = -1
pre_j = -1
for i in range(1,n+1):
  if n%i == 0:
    j = int(n/i)
    if j == pre_i and i == pre_j:
      break
    pre_i = i
    pre_j = j
print (i+j-2)


Fixed submission:
import math
n = int(input())
mini = 1000000000000000
for i in range(1, math.ceil(math.sqrt(n))+1):
  if n % i == 0 and ((n/i + i) - 2) < mini:
    mini = ((n/i + i) - 2)
print(int(mini))
Buggy python submission (verdict: Time Limit Exceeded):
import math
def yn(a, f, k, x):
  k_yt = 0
  for i in range(len(a)):
    ki = max(0, a[i]-math.floor(x/f[i]))
    k_yt += ki
  if k_yt <= k:
    return True
  else:
    return False

n, k = map(int, input().split())
a = list((map(int, input().split())))
f = list((map(int, input().split())))
a.sort()
f.sort(reverse = True)
xo = max([a[i]*f[i] for i in range(len(a))])
# binary search
if xo == 0:
  print(0)
else:
  l = 0
  r = xo
  m = xo
  while l <= r:
    piv = int((r+l)/2)
    if yn(a, f, k, piv):
      r = piv - 1 
      m = piv
    else:
      l = piv +1
  print(m)
   
    



Fixed submission:
import math
import numpy as np
def yn(a, f, k, x):
  k_yt = np.maximum(np.zeros(a.shape),a - np.floor(np.divide(x, f)))
  k_yt = np.sum(k_yt)
  if k_yt <= k:
    return True
  else:
    return False

n, k = map(int, input().split())
a = list((map(int, input().split())))
f = list((map(int, input().split())))
a.sort()
f.sort(reverse = True)
xo = max([a[i]*f[i] for i in range(n)])
a = np.array(a)
f = np.array(f)
# binary search
if xo == 0:
  print(0)
else:
  l = 0
  r = xo
  m = xo
  while l <= r:
    piv = int((r+l)/2)
    if yn(a, f, k, piv):
      r = piv - 1 
      m = piv
    else:
      l = piv +1
  print(m)

Buggy python submission (verdict: Time Limit Exceeded):
# input 
def findmax(al, fl):
  max_n = -1
  max_id = -1
  for i in range(len(al)):
    if al[i]*fl[i] > max_n:
      max_n = al[i]*fl[i]
      max_id = i
  return max_n, max_id
n, k = map(int, input().split())
al = list(map(int, input().split()))
fl = list(map(int, input().split()))
al.sort()
fl.sort(reverse=True)
ans = max([al[i]*fl[i] for i in range(n)])
while k > 0 and sum(al) > 0:
    max_n, idx = findmax(al, fl)
    al[idx] -= 1
    k -= 1
ans = max([al[i]*fl[i] for i in range(n)])
print(ans)

Fixed submission:
import math
import numpy as np
def yn(a, f, k, x):
  k_yt = np.maximum(np.zeros(a.shape),a - np.floor(np.divide(x, f)))
  k_yt = np.sum(k_yt)
  if k_yt <= k:
    return True
  else:
    return False

n, k = map(int, input().split())
a = list((map(int, input().split())))
f = list((map(int, input().split())))
a.sort()
f.sort(reverse = True)
xo = max([a[i]*f[i] for i in range(n)])
a = np.array(a)
f = np.array(f)
# binary search
if xo == 0:
  print(0)
else:
  l = 0
  r = xo
  m = xo
  while l <= r:
    piv = int((r+l)/2)
    if yn(a, f, k, piv):
      r = piv - 1 
      m = piv
    else:
      l = piv +1
  print(m)
Buggy python submission (verdict: Time Limit Exceeded):
s = input()
t = input()
s_len = len(s)
t_len = len(t)
s_list = [s[i] for i in range(s_len)]
num = 0
str_num = 0
for i in range(t_len):
  try:
    num = s_list.index(t[i])
    str_num += num+1
    s_list = s_list[num+1:] + s_list[:num+1]
  except:
    str_num = -1
    break
print(str_num) 

Fixed submission:
from collections import defaultdict
from bisect import bisect_left
 
s = input()
t = input()
s_len = len(s)
t_len = len(t)
if not set(t) <= set(s):
  print(-1)
else: 
  idx = defaultdict(list)
  for i in range(s_len):
    idx[s[i]].append(i)
  
  loop_num = 0
  current_position = -1
  for i in range(t_len):
    char = t[i]
    tmp_idx = idx[char]
    n = bisect_left(tmp_idx, current_position+1)
    if n < len(tmp_idx):
      current_position = tmp_idx[n]
    else:
      current_position = tmp_idx[0]
      loop_num += 1
  print(s_len * loop_num + current_position + 1)
Buggy python submission (verdict: Runtime Error):
N, M = list(map(int, input().split()))
A = set(int(input()) for i in range(M))
x = [0] * (n+1)
x[0] = 1

for i in range(1, n+1): 
  if x[i] in A:
    x[i] = 0
  else:
    x[i] = (x[i-1] + x[i-2])%(10**9+7)
return x[n]

Fixed submission:
N, M = map(int, input().split())
A = set(int(input()) for i in range(M))
x = [0] * (N+1)
x[0] = 1
 
for i in range(1, N+1): 
  if i in A: x[i] = 0
  else:
    x[i] = (x[i-1] + x[i-2])%(10**9+7)
    
print(x[N])
Buggy python submission (verdict: Runtime Error):
dic = {
  1: 2,
  2: 5,
  3: 5,
  4: 4,
  5: 5,
  6: 6,
  7: 3,
  8: 7,
  9: 6
}

N, M = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A, reverse=True)
dic2 = {}
for i in A:
    try:
      dic2[dic[i]]
    except:
      dic2[dic[i]] = i 
result_list = []
items = sorted(dic2.items())
while True:
  if len(items) == 0:
    break
  else:
    if N >= items[0]:
      result_list.append(items[1])
      N = N - items[0]
    else:
      items.pop(0)
return sorted(result_list, reverse=True)
  

Fixed submission:
N,M = map(int,input().split())
A = list(map(int,input().split()))
 
dp = [-1 for i in range(N+10)]
l = [0,2,5,5,4,5,6,3,7,6]
dp[0] = 0
for i in range(N-1):
    for s in A:
        if dp[i] == -1 and i!=0:
            continue
        if dp[i + l[s]] < dp[i]*10+s:
            dp[i + l[s]] = dp[i]*10+s
print(dp[N])
Buggy python submission (verdict: Runtime Error):
N = list(map(int, input()))
x = 0
for i in range(N // 2):
  if N[i] != N[-i]:
    print('No')
    x = 1
    break
if x == 0:
  print('Yes')

Fixed submission:
N = list(map(int, input()))
x = 0
for i in range(len(N) // 2):
  if N[i] != N[-i-1]:
    print('No')
    x = 1
    break
if x == 0:
  print('Yes')

Buggy python submission (verdict: Runtime Error):
N = list(map(int, input()))
x = 0
for i in range(N // 2):
  if N[i] != N[-i]:
    print('No')
    x = 1
    break
if x == 0:
  prin('Yes')


Fixed submission:
N = list(map(int, input()))
x = 0
for i in range(len(N) // 2):
  if N[i] != N[-i-1]:
    print('No')
    x = 1
    break
if x == 0:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
N = int(input())
n = int(N/1.08)
if (N // 1.08) == ((N+1) //1.08) or int(n * 1.08) < N and N < int((n+1) * 1.08):
    print(':(')
else:
    print((N//1.08))

Fixed submission:
M1, D1 = map(int,input().split())
M2, D2 = map(int,input().split())
if M1 in [1,3,5,7,8,10] and M1+1 == M2 and D1 ==31 and D2 == 1:
    ans =1
elif M1 ==2 and M2 ==3 and D1==28 and D2 ==1:
    ans = 1
elif M1 == 12 and M2 == 1 and D1 == 31 and D2 ==1:
    ans =1
elif M1 in [4,6,9,11] and M1 +1 == M2 and D1==30 and D2 == 1:
    ans =1
else:
    ans=0
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
if (N // 1.08) == ((N+1) //1.08) or int(n * 1.08) != N and N!=int( (n+1) * 1.08):
    print(':(')
else:
    print((N//1.08))

Fixed submission:
N = int(input())
n = int(N/1.08)
if (int(n * 1.08) < N and N < int((n+1) * 1.08)):
    print(':(')
else:
    print(int(N//1.08)+1)

Buggy python submission (verdict: Runtime Error):
N = int(input())
if N // 1.08 == (N+1) //1.08:
    print(':(')
else:
    print(n+1)

Fixed submission:
N = int(input())
n = int(N/1.08)
if (int(n * 1.08) < N and N < int((n+1) * 1.08)):
    print(':(')
else:
    print(int(N//1.08)+1)
Buggy python submission (verdict: Runtime Error):
import sys
    
sys.setrecursionlimit(200000)

n = int(input())
s = [int(x) for x in input().split()]
sum_s = sum(s)
middle_s = sum_s / 2
w = 0
for i in range(len(s)):
    w += s[i]
    if w == middle_s:
        print(0)
        break
    elif w > middle_s:
        if i == 0:
            ans = s[0] - sum(s[1:])
            print(ans)
        elif s[i] == s[-1]:
            ans = s[-1] - sum(s[:-1])
            print(ans)
        else:
            left = sum(s[0:(i+1)]) - sum(s[(i+1):])
            right = sum(s[i:]) - sum(s[0:i])
            ans = min(abs(left),abs(right))
            print(ans)
            break

Fixed submission:
W = [int(x) for x in input().split()]
if W[0] ==1:
    if W[1] ==1:
        print(1000000)
    elif W[1] ==2:
        print(500000)
    elif W[1] ==3:
        print(400000)
    else:
        print(300000)
elif W[0] ==2:
    if W[1] ==1:
        print(500000)
    elif W[1] ==2:
        print(400000)
    elif W[1] ==3:
        print(300000)
    else:
        print(200000)
elif W[0] ==3:
    if W[1] ==1:
        print(400000)
    elif W[1] ==2:
        print(300000)
    elif W[1] ==3:
        print(200000)
    else:
        print(100000)
else:
    if W[1] ==1:
        print(300000)
    elif W[1] ==2:
        print(200000)
    elif W[1] ==3:
        print(100000)
    else:
        print(0)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = [str(x) for x in input()]
if n % 2 == 1:
    print('No')
else:
    if s[:((n/2)+1)] == s[((n/2)+1)]:
        print('Yes')
    else:
        print('No')

Fixed submission:
n = int(input())
s = [str(x) for x in input()]
if n % 2 == 1:
    print('No')
else:
    a = int(n/2)
    if s[0:a] == s[a:]:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
a, b, c = (int(x) for x in input().split())

if a - b >= c:
    print(0)
else:
    print(c - (a - b)

Fixed submission:

a, b, c = (int(x) for x in input().split())

if a == b:
    print(c)
elif a - b >= c:
    print(0)
else:
    print(c - (a - b))
Buggy python submission (verdict: Runtime Error):
a, b = (int(x) for x in input().split())

if a % 2 == b % 2:
    print((a + b) / 2)
else:
    print("impossible"

Fixed submission:
a, b = (int(x) for x in input().split())

if a % 2 == b % 2:
    print(int((a + b) / 2))
else:
    print("IMPOSSIBLE")