Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
S = int(input())
N = len(S) - 1
ans = 0

for i in range(2 ** N):
    k = 0
    for j in range(N):
        if (i >> j) & 1:
            ans += int(S[k:j + 1])
            k = j + 1
    ans += int(S[k:])
print(ans)


Fixed submission:
S = input()
N = len(S) - 1
ans = 0

for i in range(2 ** N):
    k = 0
    for j in range(N):
        if (i >> j) & 1:
            ans += int(S[k:j + 1])
            k = j + 1
    ans += int(S[k:])
print(ans)

Buggy python submission (verdict: Runtime Error):
S = int(input())
N = len(S) - 1
ans = 0

for i in range(2 ** N):
    k = 0
    for j in range(N):
        # 復元
        if (i >> j) & 1:
            ans += int(S[k:j + 1])
            k = j + 1
    ans += int(S[k:])
print(ans)


Fixed submission:
S = input()
N = len(S) - 1
ans = 0

for i in range(2 ** N):
    k = 0
    for j in range(N):
        if (i >> j) & 1:
            ans += int(S[k:j + 1])
            k = j + 1
    ans += int(S[k:])
print(ans)

Buggy python submission (verdict: Runtime Error):
S = int(input())
N = len(S) - 1
ans = 0

for i in range(2 ** N):
    k = 0
    for j in range(N):
        # 復元
        if (i >> j) & 1:
            ans += int(S[k:j + 1])
            k = j + 1
    ans += int(S[k:])
print(ans)


Fixed submission:
S = input()
N = len(S) - 1
ans = 0

for i in range(2 ** N):
    k = 0
    for j in range(N):
        if (i >> j) & 1:
            ans += int(S[k:j + 1])
            k = j + 1
    ans += int(S[k:])
print(ans)
Buggy python submission (verdict: Runtime Error):
import pandas as pd
N = int(input())
hoge = list(input())
"df = pd.DataFrame([], columns=["words"])
print(hoge)

Fixed submission:
from collections import Counter
N = int(input())
lis = ["".join(sorted(list(input()))) for _ in range(N)]
keys, values = zip(*Counter(lis).most_common())
values = list(filter(lambda x: x >= 2, values))

sums = 0
for k in values:
  sums += ((k - 1) * (k)) / 2
  
print(int(sums))
Buggy python submission (verdict: Runtime Error):
import numpy as np
NM = input()
N, M = NM.split(" ")
del NM
N, M = int(N), int(M)
broken_steps = [int(input()) for num in range(M)]
#all_steps = [num for num in range(N+1)]
all_steps = np.ones(N+1, dtype=np.int64)  ##np.int32だと足りない
all_steps[broken_steps] = 0
ok_steps = list(all_steps)
#ok_steps = [0 if num in broken_steps else 1 for num in range(len(all_steps))]
#for num in range(len(all_steps)):
#  if num in broken_steps:
#    ok_steps.append(0)
#  else:
#  	ok_steps.append(1)
#del all_steps, broken_steps
#print(ok_steps)
for num in range(0, len(ok_steps)):
  i = - (num + 1)
  
  if (i==-1 or i==-2):
    pass
  else:
    if ok_steps[i]==0:
      pass
    else:
      ok_steps[i] = ok_steps[i+1] + ok_steps[i+2]
      

#for num in range(0, len(ok_steps)):
#  i = - (num + 1)
#  
#  if (i==-1 or i==-2):
#    pass
#  else:
#    if ok_steps[i]==0:
#      pass
#    else:
#      print(i)
#      ok_steps[i] = ok_steps[i+1] + ok_steps[i+2]
#print(ok_steps[-3])        
print(ok_steps[0]%1000000007)

Fixed submission:
tmp0 = input()
P, Q, R = tmp0.split(" ")
del tmp0
P, Q, R = int(P), int(Q), int(R)
print(min(P+Q, Q+R, R+P))
Buggy python submission (verdict: Runtime Error):
the_string = input()
a, b = the_string.split()
a = int(a)
b = int(b)
if a%%b = 0:
    ans = a/b
else:
    ans = a/b +1
print(ans)

Fixed submission:
the_string = input()
a, b = the_string.split()
a = int(a)
b = int(b)
if a%b == 0:
    ans = a//b
else:
    ans = a//b +1
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
bricks = raw_input().split()
bricks = [int(i) for i in bricks]
smash = 0
result = []
pos = 1
if 1 not in bricks:
  smash = -1
else:
  for i in range(1,n+1):
    if i >= len(bricks): break
    while bricks[i-1] != i:
      bricks.pop(i-1)
      smash = smash+1
print(smash)

Fixed submission:
n = int(raw_input())
bricks = raw_input().split()
bricks = [int(i) for i in bricks]
smash = 0
result = []
pos = 1
if 1 not in bricks:
  smash = -1
else:
  for i in bricks:
    if i == pos:
      pos = pos+1
    else:
      smash = smash + 1
print smash
Buggy python submission (verdict: Runtime Error):
str1, str2 = [s for s in input().split()]
a = str1*int(str2)
b = str2*int(str1)
int(a)
int(b)
list = [a, b]
list.sort();
print(list[0])

Fixed submission:
str1, str2 = [s for s in input().split()]
if str1 == str2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
str1, str2 = [s for s in input().split()]
a = str(str1)*str2
b = str(str2)*str2
if a > b:
    print(a)
elif a < b:
    print(b)
else:
    print(a)

Fixed submission:
str1, str2 = [s for s in input().split()]
if str1 == str2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
str1, str2 = [s for s in input().split()]
a = str1*str2
b = str2*str2
if a > b:
    print(a)
elif a < b:
    print(b)
else:
    print(a)

Fixed submission:
str1, str2 = [s for s in input().split()]
if str1 == str2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
x,y = map(int,input().split());
if x = y:
	print('Yes');
else x > y:
  	print('No');

Fixed submission:
str1, str2 = [s for s in input().split()]
if str1 == str2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
def acwa():
x,y = map(int,input().split())
if x = y:
	print('Yes');
else x < y:
  	print('No');

Fixed submission:
str1, str2 = [s for s in input().split()]
if str1 == str2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
a = list(map(int,input().split()));
if a[0] == a[1]:
	print('Yes');
else a[0] > a[1]:
	printf('No');

Fixed submission:
str1, str2 = [s for s in input().split()]
if str1 == str2:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
from itertools import permutations, combinations

nums = input().split()
As = input().split()
H = nums[0]
N = nums[1]
A = []

sum = 0

for B in As:
    sum = sum + int(B)

if sum >=  int(H):
    print("Yes")
else:
    print("No")
    



Fixed submission:
from itertools import permutations, combinations

nums = input().split()
As = input().split()
H = nums[0]
N = nums[1]
A = []

sum = 0

for B in As:
    sum = sum + int(B)

if sum >=  int(H):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
H = int(input(""))
A = int(input(""))

i = 0
while H > 0:
    H -= A
    i += 1

print(i)

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

i = 0
while H > 0:
    H -= A
    i += 1

print(i)
Buggy python submission (verdict: Runtime Error):
N=int(input())
M=int(input())
if N==M:
  print("Yes")
else:
  print("No")

Fixed submission:
N, M = input().split()
if N == M:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
from sys import stdin
from math import gcd
n = int(stdin.readline())
a = list(map(int,stdin.readline().split()))
lcm = a[0]
for i in range(1,n):lcm = (lcm*a[i])//gcd(lcm,a[i])
b = [lcm // i for i in a]
print(sum(b)%1000000007)

Fixed submission:
from sys import stdin
def gcd(x, y):
	while(y):x, y = y, x % y 
	return x
n = int(stdin.readline())
a = list(map(int,stdin.readline().split()))
lcm = a[0]
for i in range(1,n):lcm = (lcm*a[i])//gcd(lcm,a[i])
b = [lcm // i for i in a]
print(sum(b)%1000000007)
Buggy python submission (verdict: Time Limit Exceeded):
from sys import stdin as I
from sys import stdout as O
N,K = map(int,I.readline().split())
H = [None] + list(map(int,I.readline().split()))
DP = [1000000000000 for i in range(N+1)]
DP[1] = 0
for i in range(2,N+1): 
	for j in range(1,min(i-1,K)+1):DP[i] = min(DP[i],DP[i-j]+abs(H[i]-H[i-j]))
print(DP[N])

Fixed submission:
from sys import stdin as I
from sys import stdout as O
N,K = map(int,I.readline().split())
H = [None] + list(map(int,I.readline().split()))
DP = [1000000000000 for i in range(N+1)]
DP[1] = 0
for i in range(2,N+1): 
	for j in range(1,min(i-1,K)+1):DP[i] = min(DP[i],DP[i-j]+abs(H[i]-H[i-j]))
print(DP[N])
Buggy python submission (verdict: Runtime Error):
NNN = input()

S = str(input())
T = str(input())

S_list =list(S)
T_list =list(T)

N = len(S_list)
outstr = []

for n in range(N*2):
    if n%2 == 0:
        outstr.append(S_list[int(n / 2)])
    else:
        outstr.append(T_list[int(n / 2)])

STR = ','.join(outstr)
STR2 = STR.replace(",", "")
print(STR2)


Fixed submission:

NNN = input()

S,T = map(str, input().split())

S_list =list(S)
T_list =list(T)

N = len(S_list)
outstr = []

for n in range(N*2):
    if n%2 == 0:
        outstr.append(S_list[int(n / 2)])
    else:
        outstr.append(T_list[int(n / 2)])

STR = ','.join(outstr)
STR2 = STR.replace(",", "")
print(STR2)
Buggy python submission (verdict: Runtime Error):
H = input()
A = input()
print(H/A//1)

Fixed submission:
H,A = map(int,input().split())
if A == 0:
    print(0)
b = H/A//1
if H/A > b:
    print(int(b+1))
else:
    print(int(b))
Buggy python submission (verdict: Runtime Error):
N,K = map(int,input().split())
H = [int(x) for x in input().split()]
H.sort()
Ans = 0
for x in (0,K):
    H.pop()
for x in range(0,N):
    Ans = H[x]+Ans
print(Ans)

Fixed submission:
N,K = map(int,input().split())
H = [int(x) for x in input().split()]
#print(H)
H.sort()
#print(H)
Ans = 0
for x in range(0,min(K,N)):
#    print(x)
    H.pop()
#print(H)
for x in H:
    Ans = x+Ans
print(Ans)
Buggy python submission (verdict: Runtime Error):
A = input()
B = input()
if A < 10 and B < 10:
    print(A * B)
else:
    print(-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: Runtime Error):
A,B = map(input,int.split())
if A < 10 and B < 10:
    print(A * B)
else:
    print(-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: Runtime Error):
N,K,Q = map(int,input().split())
A = []
P = []
for x in range(0,N):
    P.append(K)
for a in range(0,Q):
    A.append(input())
    
for a in range(0,Q):
    for x in range(0,N):
        P[x] = P[x] - 1
    P[int(A[a])-1]=P[int(A[a])-1]+1
for x in range(0,N):
    if P[x] <= 0:
        P[x] = 'No'
    else:
        P[x] = 'Yes'
for x in range(0,N):
    print(P[x])

Fixed submission:
x = input()
if x == 'Cloudy':
    S = 'Rainy'
elif x == 'Sunny':
    S = 'Cloudy'
elif x == 'Rainy':
    S = 'Sunny'
print(S)
Buggy python submission (verdict: Time Limit Exceeded):
while True:
  print('Hello')

Fixed submission:
N = int(input())
ans = 0
for x in range(1,10):
    if N >= x:
        ans = ans + 1
for g in range(100,1000):
    if N >= g:
        ans = ans + 1
for m in range(10000,100000):
    if N >= m:
        ans = ans + 1
print(ans)
Buggy python submission (verdict: Runtime Error):

"""
Created on Sun May 19 14:10:21 2019

@author: taikinaka
"""
#print('put key')
K = int(input())
#print('Put numbers')
prob = 0
N = int(input())
for a in range(1,N+1):
    p = 0
    num = a
    while(K >num):
        num=num*2
        #print('num=',num)
        p = p + 1
    #print("p=",p)
    prob = prob + 0.5**p
prob = prob/N
print(prob)

Fixed submission:
N,K = map(int,input().split())
prob = 0
for a in range(1,N+1):
    p = 0
    num = a
    while(K >num):
        num=num*2
        p = p + 1
    prob = prob + 0.5**p
prob = prob/N
print(prob)
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
bodies_count = list(map(int,input().split()))
enemy_life = list(map(int,input().split()))
count = 0

if bodies_count[1] == 0:
    print(sum(enemy_life))
else:
    for i in range(bodies_count[1]):
        if enemy_life == []:
            print(count)
            break
        else:
            enemy_life.pop(enemy_life.index(max(enemy_life)))

    if enemy_life != []:
        print(sum(enemy_life))


Fixed submission:
# coding: utf-8
bodies_count = list(map(int,input().split()))
enemy_life = list(map(int,input().split()))

if bodies_count[1] == 0:
    print(sum(enemy_life))
else:
    enemy_life.sort(reverse=True)
    if bodies_count[1] == 1:
        del enemy_life[0] 
    else:
        a = bodies_count[1]
        del enemy_life[0:a]

    if enemy_life != []:
        print(sum(enemy_life))
    else:
        print(0)
    # for i in range(bodies_count[1]):
    #     if enemy_life == []:
    #         print(count)
    #         break
    #     else:
    #         enemy_life.sort()
    #         print(enemy_life)
    #         enemy_life.pop(enemy_life.index(max(enemy_life)))

Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
bodies_count = list(map(int,input().split()))
enemy_life = list(map(int,input().split()))
count = 0

if bodies_count[1] == 0:
    print(sum(enemy_life))
else:
    for i in range(bodies_count[1]):
        if enemy_life == []:
            print(count)
            break
        else:
            enemy_life.pop(enemy_life.index(max(enemy_life)))

    if enemy_life != []:
        total_life = sum(enemy_life)
        while total_life > 0:
            total_life -= 1
            count += 1
        print(count)


Fixed submission:
# coding: utf-8
bodies_count = list(map(int,input().split()))
enemy_life = list(map(int,input().split()))

if bodies_count[1] == 0:
    print(sum(enemy_life))
else:
    enemy_life.sort(reverse=True)
    if bodies_count[1] == 1:
        del enemy_life[0] 
    else:
        a = bodies_count[1]
        del enemy_life[0:a]

    if enemy_life != []:
        print(sum(enemy_life))
    else:
        print(0)
    # for i in range(bodies_count[1]):
    #     if enemy_life == []:
    #         print(count)
    #         break
    #     else:
    #         enemy_life.sort()
    #         print(enemy_life)
    #         enemy_life.pop(enemy_life.index(max(enemy_life)))
Buggy python submission (verdict: Runtime Error):
x,y = map(int,input().split())

li = list(map(int,input().split()))

a = sum(li)

if a > x:
    print('Yes')
else:
    print('No')


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

count = x//y

if x%y != 0:
    count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
N , M = map(int,input().split())

if N = M:
    print('Yes')
else:
    print('No')

Fixed submission:
x,y = map(int,input().split())
if x == y:
    print('Yes')
else:
    print('No')

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

if N = M:
    print('Yes')
else:
    print('No')

Fixed submission:
x,y = map(int,input().split())
if x == y:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
n = list(int(map(int,input().split()))) 
H = n[0] 
A = n[1] 
sum = 0 
while H > 0 : 
    H = H - A 
    sum = sum + 1 
print(sum)

Fixed submission:
n = list(map(int,input().split()))
H = n[0] 
A = n[1] 
sum = 0 
while H > 0 : 
    H = H - A 
    sum = sum + 1 
print(sum)

Buggy python submission (verdict: Runtime Error):
H = int(input()) 
A = int(input()) 
sum = 0
while H > 0 : 
  H = H - A
  sum = sum + 1
print(sum)

Fixed submission:
n = list(map(int,input().split()))
H = n[0] 
A = n[1] 
sum = 0 
while H > 0 : 
    H = H - A 
    sum = sum + 1 
print(sum)
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
import sys

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

if H//2 < B or W//2 < A:
    print("No")
    sys.exit()

ans = np.zeros([H,W],dtype = int)
ans[0:B,0:A]=1
ans[B:,A:]=1
for i in range(H):
    S = list(ans[i,:])
    ans2=''
    for s in S:
         ans2 = ans2 + str(s)
    print(ans2)


Fixed submission:
import sys

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

if H//2 < B or W//2 < A:
    print("No")
    sys.exit()

ans1 = ''
ans2 = ''
for i in range(W):
    if i < A:
        ans1 = ans1 + '1'
        ans2 = ans2 + '0'
    else:
        ans1 = ans1 + '0'
        ans2 = ans2 + '1'

for _ in range(B):print(ans1)
for _ in range(H-B):print(ans2)

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
import sys

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

if H//2 < B or W//2 < A:
    print("No")
    sys.exit()

ans = np.zeros([H,W],dtype = int)
ans[0:B,0:A]=1
ans[B:,A:]=1
for i in range(H):
    S = ans[i,:]
    ans2=''
    for s in S:
         ans2 = ans2 + str(s)
    print(ans2)


Fixed submission:
import sys

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

if H//2 < B or W//2 < A:
    print("No")
    sys.exit()

ans1 = ''
ans2 = ''
for i in range(W):
    if i < A:
        ans1 = ans1 + '1'
        ans2 = ans2 + '0'
    else:
        ans1 = ans1 + '0'
        ans2 = ans2 + '1'

for _ in range(B):print(ans1)
for _ in range(H-B):print(ans2)
Buggy python submission (verdict: Runtime Error):
N = int(input())
print(int((N-1)*N/2))

Fixed submission:
S = input()
T = input()
cnt = 0
for i in range(len(S)):
    if S[i] == T[i]:cnt+=1
print(cnt)
Buggy python submission (verdict: Runtime Error):
import collections
from math import factorial

N = int(input())
S = [0]*N
for i in range(N):
    s = list(str(input()))
    s.sort()
    S[i] = "".join(s)

c = collections.Counter(S)
cnt = 0
r = 2

for n in c.values():
    if n >= 2:
        cnt += factorial(n) / factorial(r) / factorial(n - r)
print(int(cnt))


Fixed submission:
import collections
from math import factorial

N = int(input())
S = [0]*N
for i in range(N):
    s = list(str(input()))
    s.sort()
    S[i] = "".join(s)

c = collections.Counter(S)
cnt = 0
r = 2

for n in c.values():
    if n >= 2:
        a = factorial(n)
        b = factorial(r)*factorial(n - r)
        cnt += a/b
print(int(cnt))

Buggy python submission (verdict: Runtime Error):
import collections
from math import factorial

N = int(input())
S = [0]*N
for i in range(N):
    s = list(str(input()))
    s.sort()
    S[i] = "".join(s)

c = collections.Counter(S)
V = c.values()
V.sort()
cnt = 0
r = 2

for n in c.values():
    if n >= 2:
        cnt += factorial(n) / factorial(r) / factorial(n - r)
print(int(cnt))


Fixed submission:
import collections
from math import factorial

N = int(input())
S = [0]*N
for i in range(N):
    s = list(str(input()))
    s.sort()
    S[i] = "".join(s)

c = collections.Counter(S)
cnt = 0
r = 2

for n in c.values():
    if n >= 2:
        a = factorial(n)
        b = factorial(r)*factorial(n - r)
        cnt += a/b
print(int(cnt))

Buggy python submission (verdict: Runtime Error):
import collections
from math import factorial

N = int(input())
S = [0]*N
for i in range(N):
    s = list(str(input()))
    s.sort()
    S[i] = "".join(s)
print(S)

c = collections.Counter(S)
cnt = 0
r = 2
for n in c.values():
    if n >= 2:
        cnt += factorial(n) / factorial(r) / factorial(n - r)
print(int(cnt))


Fixed submission:
import collections
from math import factorial

N = int(input())
S = [0]*N
for i in range(N):
    s = list(str(input()))
    s.sort()
    S[i] = "".join(s)

c = collections.Counter(S)
cnt = 0
r = 2

for n in c.values():
    if n >= 2:
        a = factorial(n)
        b = factorial(r)*factorial(n - r)
        cnt += a/b
print(int(cnt))
Buggy python submission (verdict: Time Limit Exceeded):
import sys

N = int(input())
H = list(map(int,input().split()))

if len(H)==1:
    print("Yes")
    sys.exit()
else:
    Flag = [0 for i in range(len(H))]
    x = 0

while x < len(H)-1:

    diff = H[x+1] - H[x]
    if diff < 0:
        if Flag[x]==1:
            print("No")
            sys.exit()
        else:
            Flag[x]=1
            H[x] -= 1
            x=0
            continue
    x += 1
print("Yes")


Fixed submission:
import sys

N = int(input())
H = list(map(int,input().split()))

if len(H)==1:
    print("Yes")
    sys.exit()
else:

    Flag = [0 for i in range(len(H))]
    x = 0

while x < len(H)-1:

    diff = H[x+1] - H[x]
    if diff < 0:
        if Flag[x]==1:
            print("No")
            sys.exit()
        else:
            Flag[x]=1
            H[x] -= 1
            x-=1
            continue
    x += 1
print("Yes")
Buggy python submission (verdict: Runtime Error):
import numpy as np

def main():
    MOD=10**9+7

    S = input()
    S = S[::-1]
    N = len(S)
    dp=np.zeros((N+1,13),dtype=np.int)
    dp[0,0]=1

    for i in range(N):
        if S[i]=="?":
            for s in range(10):
                for j in range(13):
                    dp[i+1][(s*(10**i)+j) % 13] += dp[i][j]
                    dp[i+1][(s*(10**i)+j) % 13] %= MOD
        else:
            s=int(S[i])
            for j in range(13):
                dp[i+1][(s*(10**i)+j) % 13] += dp[i][j]
                dp[i+1][(s*(10**i)+j) % 13] %= MOD

    res = dp[N,5]
    print(res%MOD)

if __name__ == '__main__':
    main()


Fixed submission:
A,B=map(int,input().split())
if (A+B)%2 == 0:
    print(int((A+B)/2))
else:
    print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
a,b=map(int, input().split())

n_list = []
c = a + b
d = a - c
e = a * b

n_list.append(c)
n_list.append(d)
n_list.append(e)

sorted_list = sorted(n_list)

if sorted_list[2] > sorted_list[1]:
    print(sorted_list[2])
elif sorted_list[2] == sorted[1] & sorted_list[1] > sorted_list[0]:
    print(sorted_list[2], sorted_list[1])
else:
    print(sorted_list[2], sorted_list[1], sorted_list[0])

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

n_list = []
c = a + b
d = a - b
e = a * b

n_list.append(c)
n_list.append(d)
n_list.append(e)

print(max(n_list))
Buggy python submission (verdict: Runtime Error):
    n = int(input())
     
    cnt = 0
    for i in range(1, n+1):
        str_n = str(i)
        if len(str_n) % 2 != 0:
            cnt += 1
            
    print(cnt)

Fixed submission:
n = int(input())
     
cnt = 0
for i in range(1, n+1):
    str_n = str(i)
    if len(str_n) % 2 != 0:
        cnt += 1
            
print(cnt)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

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

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

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

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

n = int(stdin.readline().rstrip())

print(n)

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

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

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

n = int(stdin.readline().rstrip())

a, b = n[0], n[1]

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

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

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

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

a,b = n[0], n[1]

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

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

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

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

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

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

Buggy python submission (verdict: Runtime Error):
a,b = (int(i) for i in input().split())
     
     
if (a + b) % 2 === 0:
    print((a + b) // 2)
else:
    print("IMPOSSIBLE")

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

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

Buggy python submission (verdict: Runtime Error):
a,b=map(int, input().split())
     
     
if (a + b) % 2 === 0:
    print((a + b) // 2)
else:
    print("IMPOSSIBLE")

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

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

Buggy python submission (verdict: Runtime Error):
a,b=map(int, input().split())


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

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

if (a + b) % 2 == 0:
    print((a + b) // 2)
else:
    print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
a = input
a = int(a)
print(a **2 * 3)

Fixed submission:
a = int(input())
print(a**2 * 3)