Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
def resolve():
    N = int(input())
    arr = tuple(map(int, input().split()))
    tmp = arr[0]
    counter = 0
    for i in arr:
        if i<=tmp:
            tmp=i
            counter += 1
    print(counter)

if __name__ == "__main__":
    resolve()

Fixed submission:
n, m = map(int, input().split())
if n==m:
	print("Yes")
	exit()
else:
	print("No")
Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    N = int(input())
    arr = tuple(map(int, input().split()))
    counter = 1
    for i in range(1,N):
        if arr[i] == min(arr[0:i+1]):
            counter += 1
    print(counter)

if __name__ == "__main__":
    resolve()

Fixed submission:
def resolve():
    N = int(input())
    arr = tuple(map(int, input().split()))
    tmp = arr[0]
    counter = 0
    for i in arr:
        if i<=tmp:
            tmp=i
            counter += 1
    print(counter)

if __name__ == "__main__":
    resolve()

Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    N = int(input())
    arr = tuple(map(int, input().split()))
    counter = 1
    for i,j in enumerate(arr):
        if i >0 and j == min(arr[0:i+1]):
            counter += 1
    print(counter)

if __name__ == "__main__":
    resolve()

Fixed submission:
def resolve():
    N = int(input())
    arr = tuple(map(int, input().split()))
    tmp = arr[0]
    counter = 0
    for i in arr:
        if i<=tmp:
            tmp=i
            counter += 1
    print(counter)

if __name__ == "__main__":
    resolve()

Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    N = int(input())
    arr = tuple(map(int, input().split()))
    counter = 0
    for i,num in enumerate(arr):
        for j in range(i):
            if num > arr[j]:
                counter +=1
                break
    print(N-counter)

if __name__ == "__main__":
    resolve()

Fixed submission:
def resolve():
    N = int(input())
    arr = tuple(map(int, input().split()))
    tmp = arr[0]
    counter = 0
    for i in arr:
        if i<=tmp:
            tmp=i
            counter += 1
    print(counter)

if __name__ == "__main__":
    resolve()

Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    N = int(input())
    arr = tuple(map(int, input().split()))
    counter = 0
    for i,num in enumerate(arr):
        for j in range(i):
            if num > arr[j]:
                counter +=1
                break
    print(N-counter)

if __name__ == "__main__":
    resolve()

Fixed submission:
def resolve():
    N = int(input())
    arr = tuple(map(int, input().split()))
    tmp = arr[0]
    counter = 0
    for i in arr:
        if i<=tmp:
            tmp=i
            counter += 1
    print(counter)

if __name__ == "__main__":
    resolve()
Buggy python submission (verdict: Time Limit Exceeded):
num = int(input())
if num == 2:
	print(2)
	exit()

flag = False
while True:
    for i in range(2, int(num**0.5)+1):
        if num % i ==0:
            flag = False
            break
        else:
            flag = True
    if flag:
        print(num)

Fixed submission:
num = int(input())

flag = False
while True:
    if num == 2:
        print(2)
        exit()
    for i in range(2, int(num**0.5)+1):
        if num % i ==0:
            flag = False
            break
        else:
            flag = True
    if flag:
        print(num)
        exit()
    else:
        num+=1

Buggy python submission (verdict: Runtime Error):
num = int(input())
if num == 2:
	print(2)
    exit()

flag = False
while True:
    for i in range(2, int(num**0.5)+1):
        if num % i ==0:
            flag = False
            break
        else:
            flag = True
    if flag:
        print(num)
        exit()
    else:
        num+=1

Fixed submission:
num = int(input())

flag = False
while True:
    if num == 2:
        print(2)
        exit()
    for i in range(2, int(num**0.5)+1):
        if num % i ==0:
            flag = False
            break
        else:
            flag = True
    if flag:
        print(num)
        exit()
    else:
        num+=1

Buggy python submission (verdict: Time Limit Exceeded):
num = int(input())

while True:
    for i in range(1,num+1):
        count =0
        for j in range(i):
             if i%(j+1) == 0:
                count +=1
    if count ==2:
        print(num)
        exit()
    else:
        num += 1

Fixed submission:
num = int(input())

flag = False
while True:
    if num == 2:
        print(2)
        exit()
    for i in range(2, int(num**0.5)+1):
        if num % i ==0:
            flag = False
            break
        else:
            flag = True
    if flag:
        print(num)
        exit()
    else:
        num+=1
Buggy python submission (verdict: Runtime Error):
X, Y, A, B, C = map(int, input().split())
Alist = list(map(int, input().split()))
Blist = list(map(int, input().split()))
cl = list(map(int, input().split()))

Alist.sort(reverse = True)
Blist.sort(reverse = True)
cl.sort(reverse = True)
list=[]

for i in range(X):
    list.append(Alist[i])
for i in range(Y):
    list.append(Blist[i])
list.sort()

k = min (A + B, C)

for i in range(k):
    if cl[0] > list[i]:
        list[i] = cl[0]
        cl.pop(0)
ans = 0
for i in list:
    ans += i

print(ans)

Fixed submission:
X, Y, A, B, C = map(int, input().split())
Alist = list(map(int, input().split()))
Blist = list(map(int, input().split()))
list = list(map(int, input().split()))

Alist.sort(reverse = True)
Blist.sort(reverse = True)

for i in range(X):
    list.append(Alist[i])
for i in range(Y):
    list.append(Blist[i])
list.sort(reverse = True)

ans =0
for i in range(X + Y):
    ans += list[i]
    
print(ans)

Buggy python submission (verdict: Runtime Error):
X, Y, A, B, C = map(int, input().split())
Alist = list(map(int, input().split()))
Blist = list(map(int, input().split()))
cl = list(map(int, input().split()))

Alist.sort(reverse = True)
Blist.sort(reverse = True)
cl.sort(reverse = True)
list=[]

for i in range(X):
    list.append(Alist[i])
for i in range(Y):
    list.append(Blist[i])
list.sort()

for i in range(C):
    if cl[0] > list[i]:
        list[i] = cl[0]
        cl.pop(0)
ans = 0
for i in list:
    ans += i

print(ans)

Fixed submission:
X, Y, A, B, C = map(int, input().split())
Alist = list(map(int, input().split()))
Blist = list(map(int, input().split()))
list = list(map(int, input().split()))

Alist.sort(reverse = True)
Blist.sort(reverse = True)

for i in range(X):
    list.append(Alist[i])
for i in range(Y):
    list.append(Blist[i])
list.sort(reverse = True)

ans =0
for i in range(X + Y):
    ans += list[i]
    
print(ans)
Buggy python submission (verdict: Runtime Error):
L, S = map(int, input().split())

if L % 2 == 1:
    if S % 2 == 1:
        ans = int(L*(S-1)/2 + (L+1)/2)
else:
    ans = int(L*S/2)

print(ans)

Fixed submission:
L, S = map(int, input().split())

if L % 2 == 1 and S % 2 == 1:
    ans = int(L*(S-1)/2 + (L+1)/2)
else:
    ans = int(L*S/2)

if L == 1 or S == 1:
    ans = 1

print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
list = list(map(int, input().split()))
ans = 1

dict = {}
for i in range(N):
    if list[i] in dict.keys():
        dict[list[i]] += 1
    else:
        dict.setdefault(list[i], 1)

max = max(dict)

try:
    for i in range(1,max+1):
        ans = (ans * (dict[i-1] ** dict[i])) % 998244353
except KeyError:
    ans = 0

if dict[0] != 1:
    ans = 0

print(ans)


Fixed submission:
N = int(input())
list = list(map(int, input().split()))
ans = 1

dict = {}
for i in range(N):
    if list[i] in dict.keys():
        dict[list[i]] += 1
    else:
        dict.setdefault(list[i], 1)

max = max(dict)

try:
    for i in range(1,max+1):
        ans = (ans * (dict[i-1] ** dict[i])) % 998244353
    if dict[0] != 1:
        ans = 0
    if list[0] != 0:
        ans = 0
except KeyError:
    ans = 0

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input()) #get 1st row
inlist = [input() for i in range(N)] #read row (add int using brackets if needed)
result = []

#make dic from input parameters
for component in inlist :
    dic = []
    for n in component:
        dic.append(n)
    dic.sort()
    result.append(dic)

counter = 0
for k1, v1 in enumerate(result):
    for k2, v2 in enumerate (result):
        if v1 == v2 and k1 > k2:
            counter += 1

print (counter)

Fixed submission:
N = int(input()) #get 1st row
inlist = [input() for i in range(N)] #read row (add int using brackets if needed)
result = {}

def combination(a):
    x = 1
    x = a * (a-1) / 2
    return x

#make dic from input parameters
for component in inlist :
    dic = []
    for n in component:
        dic.append(n)
    dic.sort()
    dic2 = "".join(dic)
    if dic2 in result.keys():
        result[dic2] += 1
    else :
        result[dic2] = 1

#count the number
counter = 0
for v in result.values():
    counter += combination(v)

print (int(counter))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input()) #get 1st row
inlist = [input() for i in range(N)] #read row (add int using brackets if needed)
result = []

#make dictionary from input parameters
for component in inlist :
    dic = {}
    #read each
    for n in component:
        if n in dic.keys():
            dic[n] += 1
        else :
            dic[n] = 1
    result.append(dic)

counter = 0
for k1, v1 in enumerate(result):
    for k2, v2 in enumerate (result):
        if v1 == v2 and k1 > k2:
            counter += 1

print (counter)

Fixed submission:
N = int(input()) #get 1st row
inlist = [input() for i in range(N)] #read row (add int using brackets if needed)
result = {}

def combination(a):
    x = 1
    x = a * (a-1) / 2
    return x

#make dic from input parameters
for component in inlist :
    dic = []
    for n in component:
        dic.append(n)
    dic.sort()
    dic2 = "".join(dic)
    if dic2 in result.keys():
        result[dic2] += 1
    else :
        result[dic2] = 1

#count the number
counter = 0
for v in result.values():
    counter += combination(v)

print (int(counter))
Buggy python submission (verdict: Runtime Error):
s=input()
q= int(input())
 
for iq in range(1,q+1):
	t=input().split()
	if t[0]=='1':
		s=s[::-1]
	else:
		if t[1]=='1':
#			s=t[2]+s
#			s=f"{t[2]}{s}"
			list1=[t[2],s]
			s="".join(list1)
		else:
#			s=s+t[2]
#			s=f"{s}{t[2]}"   
			list2=[s,t[2]]
			s="".join(list2)
 
print (s)


Fixed submission:
str=input()
if str=="AAA" or str=="BBB":
  print ("No")
else:
  print ("Yes")

Buggy python submission (verdict: Runtime Error):
s=input()
q= int(input())
 
for iq in range(1,q+1):
	t=input().split()
	if t[0]=='1':
		s=s[::-1]
	else:
		if t[1]=='1':
#			s=t[2]+s
#			s=f"{t[2]}{s}"
			list1=[t[2],s]
			s="".join(list1)
		else:
#			s=s+t[2]
#			s=f"{s}{t[2]}"   
			list2=[s,t[2]]
			s="".join(list2)
 
print (s)


Fixed submission:
str=input()
if str=="AAA" or str=="BBB":
  print ("No")
else:
  print ("Yes")

Buggy python submission (verdict: Runtime Error):
a,b=(int(x) for x in input().split())
#print(a)
#print(b)

am=int(100/8*a)
al=int(100/8*(a+1))
if ((a+1)%4)==0:
       al=al-1

bm=int(10*b)
bl=int(10*(b+1))-1

#print (am,al)
#print (bm,bl)
for ia in range(am,al):
       for ib in range(bm,bl):
       		if ia==ib:
       			print (ia)
       			exit()
else:
  print(-1)

Fixed submission:
str=input()
if str=="AAA" or str=="BBB":
  print ("No")
else:
  print ("Yes")

Buggy python submission (verdict: Runtime Error):
a,b=(int(x) for x in input().split())
print(a)
print(b)

am=int(100/8*a)
al=int(100/8*(a+1))
if (a%4)==0:
       al=al-1

bm=int(10*b)
bl=int(10*(b+1))-1

#print (am,al)
#print (bm,bl)
for ia in range(am,al+1):
       for ib in range(bm,bl+1):
       		if ia==ib:
       			print (ia)
       			exit()
      
print -1

Fixed submission:
str=input()
if str=="AAA" or str=="BBB":
  print ("No")
else:
  print ("Yes")
Buggy python submission (verdict: Runtime Error):
a,b=(int(x) for x in input().split())
print(a)
print(b)

am=int(100/8*a)
al=int(100/8*(a+1))
if (a%4)==0:
       al=al-1

bm=int(10*b)
bl=int(10*(b+1))-1

#print (am,al)
#print (bm,bl)
for ia in range(am,al+1):
       for ib in range(bm,bl+1):
       		if ia==ib:
       			print (ia)
       			exit()
      
print -1

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

for i in range(1,1010):
#	print (i)
	ia=int(i*0.08)
	ib=int(i*0.1)
#	print (ia,ib)
	if ia==a and ib==b:
		print (i)
		exit()
else:
	print (-1)

Buggy python submission (verdict: Runtime Error):
a,b=(int(x) for x in input().split())
print(a)
print(b)

am=int(100/8*a)
al=int(100/8*(a+1))
if (a%4)==0:
       al=al-1

bm=int(10*b)
bl=int(10*(b+1))-1

print (am,al)
print (bm,bl)
for ia in range(am,al+1):
       for ib in range(bm,bl+1):
       		if ia==ib:
       			print (ia)
       			exit()
      
print -1

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

for i in range(1,1010):
#	print (i)
	ia=int(i*0.08)
	ib=int(i*0.1)
#	print (ia,ib)
	if ia==a and ib==b:
		print (i)
		exit()
else:
	print (-1)
Buggy python submission (verdict: Time Limit Exceeded):
mod = 998244353


def pow(a, b):
    ans = 1
    for i in range(b):
        ans = ((ans % mod) * (a % mod)) % mod
    return ans


def sum_mod(v):
    ans = 0
    for i in range(1, len(v)):
        ans = (ans + v[i]) % mod
    return ans


n = int(input())
a = []
for _ in range(n):
    a.append(int(input()))
A = sum(a)

dp = [[0 for _ in range(A+1)] for _ in range(n+1)]
dp2 = [[0 for _ in range(A+1)] for _ in range(n+1)]
dp[0][0] = 1
dp2[0][0] = 1
for t in range(1, n+1):
    for r in range(0, A+1):
        dp[t][r] = dp[t-1][r] * 2 % mod
        dp2[t][r] = dp2[t-1][r] % mod
        if r - a[t-1] >= 0:
            dp[t][r] = (dp[t][r] + dp[t-1][r-a[t-1]]) % mod
            dp2[t][r] = (dp2[t][r] + dp2[t-1][r-a[t-1]]) % mod
# print(dp)

ans = pow(3, n)
for r in range((A + 1) // 2, A+1):
    ans -= dp[n][r] * 3
    ans %= mod
    ans += mod
    ans %= mod
if A % 2 == 0:
    ans = (ans + dp2[n][A // 2] * 3) % mod
print(ans)

Fixed submission:
import numpy as np

mod = 998244353


def sum_mod(v):
    ans = 0
    for i in range(1, len(v)):
        ans = (ans + v[i]) % mod
    return ans


n = int(input())
a = []
for _ in range(n):
    a.append(int(input()))
A = sum(a)

dp = np.zeros((n + 1, A + 1), dtype=int)
dp2 = np.zeros((n + 1, A + 1), dtype=int)
dp[0][0] = 1
dp2[0][0] = 1
for t in range(1, n + 1):
    dp[t, :] = dp[t - 1, :] * 2 % mod
    dp2[t, :] = dp2[t - 1, :] % mod
    dp[t, a[t - 1]:] += dp[t - 1, :-a[t - 1]] % mod
    dp2[t, a[t - 1]:] += dp2[t - 1, :-a[t - 1]] % mod
#print(dp)

ans = 3 ** n % mod
ans -= np.sum(dp[n][(A + 1) // 2:]) * 3 % mod
if A % 2 == 0:
    ans += dp2[n][A // 2] * 3 % mod
print(ans % mod)
Buggy python submission (verdict: Time Limit Exceeded):
n, q = map(int, input().split())
s = input()

a = [[s[i], 1] for i in range(n)]

for k in range(q):
    t, d = input().split()
    for i in range(n):
        if a[i][0] == t:
            if d == 'R':
                if i < n - 1:
                    a[i+1][1] += a[i][1]
            else:
                if i > 0:
                    a[i-1][1] += a[i][1]
            a[i][1] = 0

print(sum([a[i][1] for i in range(n)]))

Fixed submission:
n, q = map(int, input().split())
s = input()
td = [input().split() for _ in range(q)]


def sim(i):
    if i == -1:
        return -1
    if i == n:
        return 1
    for t, d in td:
        if t == s[i]:
            if d == 'L':
                i -= 1
            else:
                i += 1
        if i == -1:
            return -1
        if i == n:
            return 1
    return 0


l =-1
r = n
while l + 1 < r:
    m = (l + r) // 2
    if sim(m) == -1:
        l = m
    else:
        r = m
A = l

l = -1
r = n
while l + 1 < r:
    m = (l + r) // 2
    if sim(m) == 1:
        r = m
    else:
        l = m
B = r

print(B - A - 1)
Buggy python submission (verdict: Time Limit Exceeded):
def f(s):
    _s = s + '*'
    i = 0
    ans = 0
    while True:
        if _s[i] == '*':
            return _s[:-1], ans
        elif _s[i+1] == '*':
            i += 1
        elif _s[i] == _s[i+1]:
            i += 1
        else:
            ans += 2
            if i == 0:
                _s = _s[i+2:]
            else:
                _s = _s[:i] + _s[i+2:]


s = input()
ans = 0
while True:
    s, _ans = f(s)
    if _ans != 0:
        ans += _ans
    else:
        break
print(ans)

Fixed submission:
s = input()
c0 = 0
c1 = 0
for i in range(len(s)):
    if s[i] == '0':
        c0 += 1
    else:
        c1 += 1
print(2 * min(c0, c1))
Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, input().split())
Ps = []
Ys = []
l = [[] for _ in range(N)]
for _ in range(M):
    P_i, Y_i = map(int, input().split())
    Ps.append(P_i)
    Ys.append(Y_i)
    l[P_i-1].append(Y_i)
for i in range(N):
    l[i].sort()
for i in range(M):
    print("{:012}".format(Ps[i] * 1000000 + l[Ps[i]-1].index(Ys[i]) + 1))

Fixed submission:
N, M = map(int, input().split())
py = []
for _ in range(M):
    py.append(list(map(int, input().split())))
d = {}
now = 0
num = 0
for p, y in sorted(py):
    if now != p:
        now = p
        num = 1
    d[(p, y)] = num
    num += 1
for p, y in py:
    print('{:06d}{:06d}'.format(p, d[(p, y)]))
Buggy python submission (verdict: Runtime Error):
import math


N = int(input())
x = [0] * N
y = [0] * N
xy = []
for i in range(N):
    xy.append(list(map(int, input().split())))


def signed_area(p1, p2, p3):
    area = (p2[0] - p1[0]) * (p3[1] - p1[1])\
            - (p3[0] - p1[0]) * (p2[1] - p1[1])
    return area/2


def convex_hull(p_list):
    p_sort = []
    for i in p_list:
        p_sort.append(i[0])

    # x座標が最小のものをリストの先頭に配置。
    min_index = p_sort.index(min(p_sort))
    min_p = p_list.pop(min_index)
    p_list.insert(0, min_p)

    # 座標最小の点と他の点との角度順にソート ソートアルゴリズムに選択の余地が有る。
    p_length = len(p_list)
    count = 0
    index = 0
    while True:
        count += 1
        index += 1

        area_sign = signed_area(p_list[0], p_list[index], p_list[index + 1])

        # 符号付き面積が負ならば点を入れ替え
        if area_sign < 0:
            p_list[index], p_list[index + 1] = p_list[index + 1], p_list[index]
            count = 0

        if count == p_length - 1:
            break

        if index == p_length - 2:
            index = 0

    # 凹部の点を削除する。
    index = -1
    count = 0
    while True:
        index += 1
        count += 1

        area_sign = signed_area(p_list[index],
                                p_list[index + 1],
                                p_list[index + 2])
        if area_sign < 0:
            del p_list[index + 1]
            count = 0

        if count == len(p_list):
            break

        if index >= len(p_list) - 3:
            index = -1
    return p_list


def euc(p1, p2):
    return (p1[0]-p2[0])**2 + (p1[1]-p2[1])**2


def find_max_euc(xy):
    ans = []
    max_dis = 0
    n = len(xy)
    for i in range(n):
        for j in range(n):
            dis = math.sqrt(euc(xy[j], xy[i]))
            if dis >= max_dis+1e-05:
                max_dis = dis
                ans = [xy[j], xy[i]]
    return ans


if len(xy) == 2:
    dis = math.sqrt(euc(xy[0], xy[1]))
    print(dis/2)
else:
    xy = convex_hull(xy)
    xy = find_max_euc(xy)
    dis = math.sqrt(euc(xy[0], xy[1]))
    print(dis/2)


Fixed submission:
C = input()
print(chr(ord(C)+1))
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
pS = {}
for i in range(N):
    pS[i] = [0, 0, 0]  # is_ac, penatly, AC

for i in range(M):
    p, S = input().split()
    p = int(p) - 1
    if pS[p][0] == 0 and S == 'WA':
        pS[p][1] += 1
    elif pS[p][0] == 0 and S == 'AC':
        pS[p][0] = 1
        pS[p][2] = 1

AC = 0
penatly = 0
for i in range(N):
    if pS[p][0] == 1:
        penatly += pS[int(i)][1]
        AC += pS[int(i)][2]
print(AC, penatly)


Fixed submission:
N, M = map(int, input().split())
pS = {}
for i in range(N):
    pS[i] = [0, 0, 0]  # is_ac, penatly, AC

for i in range(M):
    p, S = input().split()
    p = int(p) - 1
    if pS[p][0] == 0 and S == 'WA':
        pS[p][1] += 1
    elif pS[p][0] == 0 and S == 'AC':
        pS[p][0] = 1
        pS[p][2] = 1

AC = 0
penatly = 0
for i in range(N):
    if pS[i][0] == 1:
        penatly += pS[int(i)][1]
        AC += pS[int(i)][2]
print(AC, penatly)
Buggy python submission (verdict: Time Limit Exceeded):
import copy

N = int(input())

As = list(map(lambda i: int(i), input().split()))

ns = [0 for i in range(N)]

for a in As:
    ns[a-1] += 1

def get_comb(arr):
    res = 0
    for a in arr:
        if a == 0:
            continue
        res += a*(a-1)/2
    return int(res)

# print(ns)
for a in As:
    tmp = copy.copy(ns)
    tmp[a-1] -= 1
    print(get_comb(tmp))
    

Fixed submission:
import copy

N = int(input())

As = list(map(lambda i: int(i), input().split()))

ns = [0 for i in range(N)]

for a in As:
    ns[a-1] += 1

def get_comb(arr):
    res = 0
    for a in arr:
        if a == 0:
            continue
        res += a*(a-1)/2
    return int(res)

ba = get_comb(ns)

for a in As:
    print(ba - get_comb([ns[a-1]]) + get_comb([ns[a-1]-1]))
Buggy python submission (verdict: Runtime Error):
from math import floor

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

    for i in range(110):
        dp.append(10000000)
    dp[0] = 0

    seven = floor(n/7)
    for i in range(seven+1):
        mod = n - i*7
        if mod % 4 == 0:
            print('Yes')
            return
    print('No')


main()


Fixed submission:
from math import floor

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

    seven = floor(n/7)
    for i in range(seven+1):
        mod = n - i*7
        if mod % 4 == 0:
            print('Yes')
            return
    print('No')


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

if a == 0:
  if b == 100:
    print(101)
  else:
    print(b)
else:
  if b == 100:
    print(101*10**a)
  else:
    printe(b*10**a)

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

if a == 0:
  if b == 100:
    print(101)
  else:
    print(b)
else:
  if b == 100:
    print(101*100**a)
  else:
    print(b*100**a)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
aas = list(map(int, input().split()))

r = 0
i = 1
while True:
  f = False
  for a in aas:
    if a%2 == 0:
      a /= 2
      r += 1
      f = True
  if not f:
    break
print(r)
  


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

r = 0
i = 1

while True:
  f = False
  for a in aas:
    if a%2**i == 0:
      r += 1
      f = True
  if not f:
    break
  i += 1
print(r)

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

r = 0
i = 1
while True:
  f = False
  for a in as:
    if a%2 == 0:
      a /= 2
      r += 1
      f = True
  if not f:
    break
print(r)
  

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

r = 0
i = 1

while True:
  f = False
  for a in aas:
    if a%2**i == 0:
      r += 1
      f = True
  if not f:
    break
  i += 1
print(r)

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

r = 0
i = 1
while True:
  for a in as:
    f = False
    if a%2 == 0:
      a /= 2
      r += 1
      f = True
    if not f:
      break
print(r)
  

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

r = 0
i = 1

while True:
  f = False
  for a in aas:
    if a%2**i == 0:
      r += 1
      f = True
  if not f:
    break
  i += 1
print(r)
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    s = input()
    w = 0
    e = 0
    r = []
    for i in range(n):
        c = 0
        ls = list(s[0:i])
        rs = list(s[i+1:])
        c += ls.count('W')
        c += rs.count('E')

        r.append(c)
    print(min(r))
main()


Fixed submission:
def main():
    n = int(input())
    s = list(input())
    w = 0
    e = 0
    r = [0]*n
    r[0] = s[1:].count('E')
    for i in range(n-1):
        r[i+1] = r[i]
        if s[i] == 'W':
            r[i+1] += 1
        if s[i+1] == 'E':
            r[i+1] -= 1
    print(min(r))
main()
Buggy python submission (verdict: Runtime Error):
s = input()
r = 700

for i in range(3):
    if s[i] == 'o':
        700 += 100
print(r)

Fixed submission:
s = input()
r = 700
 
for i in range(3):
    if s[i] == 'o':
        r += 100
print(r)