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

while i != 0:
    i = i % 10
    if i == 0:
        print('pon')
    elif i == 1:
        print('pon')
    elif i == 2:
        print('hon')
    elif i == 3:
        print('bon')
    elif i == 4:
        print('hon')
    elif i == 5:
	print('hon')
    elif i == 6:
	print('pon')
    elif i == 7:
	print('hon')
    elif i == 8:
	print('pon')
    elif i == 9:
	print('hon')

    i = int(input())


Fixed submission:
i = int(input())
i = i % 10
if i == 0:
    print('pon')
elif i == 1:
    print('pon')
elif i == 2:
    print('hon')
elif i == 3:
    print('bon')
elif i == 4:
    print('hon')
elif i == 5:
    print('hon')
elif i == 6:
    print('pon')
elif i == 7:
    print('hon')
elif i == 8:
    print('pon')
elif i == 9:
    print('hon')
Buggy python submission (verdict: Runtime Error):
n = int(input)
if n % 1000 == 0:
  print("0")
  exit()
print(1000 - (n % 1000))

Fixed submission:
n = int(input())
if n % 1000 == 0:
  print("0")
  exit()
print(1000 - (n % 1000))
Buggy python submission (verdict: Runtime Error):
N,K = map(int,input().split())
li = [int(i) for i in input().split()]
total = 0

for _ in range(K):
	total += min(li)
	li = li.remove(min(li))

print(total)

Fixed submission:
N,K = map(int,input().split())
li = [int(i) for i in input().split()]
total = 0
 
for _ in range(K):
	total += min(li)
	li.remove(min(li))
 
print(total)
Buggy python submission (verdict: Runtime Error):
a = input()

b = a[len(a)-1]

if b=='3':
	print('bon')
else if b == '0' or  b == '1' or  b == '6' or b == '8':
	print('pon')
else:
	print('hon')
	

Fixed submission:
a = input()
 
b = a[len(a)-1]
 
if b=='3':
	print('bon')
elif b == '0' or  b == '1' or  b == '6' or b == '8':
	print('pon')
else:
	print('hon')
Buggy python submission (verdict: Runtime Error):
n = int(input())
li = list()
for i range(n):
	li.append(str(input()))

print(len(set(li)))



Fixed submission:
n = int(input())
li = list()
for i in range(n):
	li.append(str(input()))

print(len(set(li)))
Buggy python submission (verdict: Time Limit Exceeded):
k = int(input())
i = 1
x = 7 % k
x0 = x
while x != 0:
	x = (10 * x + 7) % k
	i += 1
	if x == x0:
		print(-1)
		break
else:
	print(i)

Fixed submission:
k = int(input())
i = 1
x = 7 % k
seen = {x}
while x != 0:
	x = (10 * x + 7) % k
	i += 1
	if x in seen:
		print(-1)
		break
	seen.add(x)
else:
	print(i)
Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())
a = list(map(int, input().split()))

mul = 1
for i in range(k):
	mul *= a[i]
last = mul
for i in range(k, n):
	mul //= a[i-k]
	mul *= a[i]
	if mul > last:
		print("Yes")
	else:
		print("No")
	last = mul


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

buff = []
mul = 1
# for i in range(k):
	# mul *= a[i]
# last = mul
for i in range(k, n):
	if a[i] > a[i-k]:
		buff.append("Yes")
	else:
		buff.append("No")
print('\n'.join(buff))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [num for num in map(int, input().split())]

ans = 1

for i in range(n):
  ans = ans * a[i]
  
if ans > (10 ** 18):
  ans = -1

print(ans)

Fixed submission:
import sys

n = int(input())
a = [num for num in map(int, input().split())]

if min(a) == 0:
  print(0)
  sys.exit(0)

ans = 1
m = 10 ** 18

for i in range(n):
  ans = ans * a[i]
  
  if ans > m:
    ans = -1
    break

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
t = input()

#print(t[-1])

ans = ''

if t[-1] == '?':
  ans += 'D'
else:
  ans += t[-1]
#print(t)
#print(ans)

for i in range(-2, -len(t)-1, -1):
  #print(i, t[i])
  if t[i] == '?':
    if t[i+1] == 'P':
      ans += 'D'
    else:
      ans += 'P'
  else:
    ans += t[i]
#print(ans)
print(ans[::-1])

Fixed submission:
t = input()
ans = list(t)

if ans[-1] == '?':
  ans[-1] = 'D'

tl = len(t)
for i in range(-2, -tl-1, -1):
  if ans[i] == '?':
    if ans[i+1] == 'P':
      ans[i] = 'D'
    else:
      if i != -tl and ans[i-1] == 'P':
        ans[i] = 'D'
      else:
        ans[i] = 'P'
print(''.join(ans))
Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())
a = list(map(int, input().split()))

d = [-1] * (n+1)
ls = 0
le = 0

def dfs(i, t):
  global d, ls, le
  if d[i] != -1:
    ls = i
    return False
  d[i] = t
  ret = dfs(a[i-1], t+1)
  if ret == False:
    le = i

dfs(1, 0)

#print(d)
#print(ls, le)

ans = 0
if k <= d[le] or ls == 0:
  ans = d.index(k)
else:
  ld = d[ls]
  t = (k-ld) % (d[le] - d[ls] + 1)
  t += d[ls]
  ans = d.index(t)

print(ans)


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

v = 1
s = [-1] * (n+1)
d = []
l = 0
c = 0

while s[v] == -1:
  s[v] = len(d)
  d.append(v)
  v = a[v-1]
l = s[v]
c = len(d) - s[v]

if k < l:
  print(d[k])
else:
  k -= l
  k %= c
  print(d[l+k])

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

d = [-1] * (n+1)
ls = 0
le = 0

def dfs(i, t):
  global d, ls, le
  if d[i] != -1:
    ls = i
    return False
  d[i] = t
  ret = dfs(a[i-1], t+1)
  if ret == False:
    le = i

dfs(1, 0)

#print(d)
#print(ls, le)

ans = 0

ld = d[ls]
t = (k-ld) % (d[le] - d[ls] + 1)
t += d[ls]
ans = d.index(t)

print(ans)


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

v = 1
s = [-1] * (n+1)
d = []
l = 0
c = 0

while s[v] == -1:
  s[v] = len(d)
  d.append(v)
  v = a[v-1]
l = s[v]
c = len(d) - s[v]

if k < l:
  print(d[k])
else:
  k -= l
  k %= c
  print(d[l+k])

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

d = [-1] * (n+1)
ls = 0
le = 0

def dfs(i, t):
  global d, ls, le
  if d[i] != -1:
    ls = i
    return False
  d[i] = t
  ret = dfs(a[i-1], t+1)
  if ret == False:
    le = i

dfs(1, 0)

#print(d)
#print(ls, le)
ld = d[ls]

ans = 0
if k <= d[le]:
  ans = d.index(k)
else:
  t = (k-ld) % (d[le] - d[ls] + 1)
  t += d[ls]
  ans = d.index(t)

print(ans)


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

v = 1
s = [-1] * (n+1)
d = []
l = 0
c = 0

while s[v] == -1:
  s[v] = len(d)
  d.append(v)
  v = a[v-1]
l = s[v]
c = len(d) - s[v]

if k < l:
  print(d[k])
else:
  k -= l
  k %= c
  print(d[l+k])
Buggy python submission (verdict: Time Limit Exceeded):
s = input()
q = int(input())

rev = False
for i in range(q):
  inp = list(input().split())
  if inp[0] == '1':
    rev = not rev
  else:
    f = inp[1]
    c = inp[2]
    if rev:
      if f == '1':
        f = '2'
      else:
        f = '1'
    if f == '1':
      s = c + s
    else:
      s = s + c
if rev:
  s = s[::-1]
print(s)

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

rev = False
before = []
after = []
for i in range(q):
  inp = list(input().split())
  if inp[0] == '1':
    rev = not rev
  else:
    f = inp[1]
    c = inp[2]
    if rev:
      if f == '1':
        f = '2'
      else:
        f = '1'
    if f == '1':
      before.append(c)
    else:
      after.append(c)
ans = ''
if rev:
  after.reverse()
  ans = ''.join(after) + s[::-1] + ''.join(before)
else:
  before.reverse()
  ans = ''.join(before) + s + ''.join(after)
print(ans)
Buggy python submission (verdict: Runtime Error):
import sys

a, b, c = map(int, input().split())

#print(a, b, c)
ab = a == b
ac = a == c
bc = b == c

if ab and bc:A
  print('No')
  sys.exit()

if not ab and not ac and not bc:
  print('No')
  sys.exit()

print('Yes')

Fixed submission:
import sys

a, b, c = map(int, input().split())

#print(a, b, c)
ab = a == b
ac = a == c
bc = b == c

if ab and bc:
  print('No')
  sys.exit()

if not ab and not ac and not bc:
  print('No')
  sys.exit()

print('Yes')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
m = []
for i in range(n):
  if a[i] in m:
    print('NO')
    exit(0)
  m.append(a[i])
print('YES')

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
a.sort()
for i in range(n-1):
  if a[i] == a[i+1]:
    print('NO')
    exit(0)
print('YES')
Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())
p = list(map(int, input().split()))

# 累積和
c = [0] * (n+1)
for i in range(n):
  c[i+1] = c[i] + p[i]
#print(c)
mx = 0
mx_a = []
for i in range(n-k+1):
  t = p[i:i+k]
  st = c[i+k] - c[i]
  if st > mx:
    mx = st
    mx_a = t
ans = 0
for i in range(k):
  a = mx_a[i]
  ans += ((a * (a+1)) // 2) / a
print(ans)
# print(mx_a)

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

# 累積和
c = [0] * (n+1)
for i in range(n):
  c[i+1] = c[i] + p[i]
#print(c)
mx = 0
mx_i = -1
for i in range(n-k+1):
  st = c[i+k] - c[i]
  if st > mx:
    mx = st
    mx_i = i
ans = 0
for i in range(mx_i, mx_i+k):
  a = p[i]
  ans += ((a * (a+1)) // 2) / a
print(ans)
# print(mx_a)

Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())
p = list(map(int, input().split()))

mx = 0
mx_a = []
for i in range(n-k+1):
  t = p[i:i+k]
  st = sum(t)
  if st > mx:
    mx = st
    mx_a = t
ans = 0
for i in range(k):
  a = mx_a[i]
  ans += ((a * (a+1)) // 2) / a
print(ans)
# print(mx_a)

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

# 累積和
c = [0] * (n+1)
for i in range(n):
  c[i+1] = c[i] + p[i]
#print(c)
mx = 0
mx_i = -1
for i in range(n-k+1):
  st = c[i+k] - c[i]
  if st > mx:
    mx = st
    mx_i = i
ans = 0
for i in range(mx_i, mx_i+k):
  a = p[i]
  ans += ((a * (a+1)) // 2) / a
print(ans)
# print(mx_a)
Buggy python submission (verdict: Time Limit Exceeded):
a, b = map(int, input().split(' '))

def cf(x1,x2):
    cf=[]
    for i in range(2,min(x1,x2)+1):
        if x1 % i == 0 and x2 % i == 0:
            cf.append(i)
    return cf

k = cf(a, b)

ans = 0
if len(k) == 0:
  ans = 1
elif len(k) == 1:
  ans = 2
else:
  ans = 2
  for i in range(1, len(k)):
    tmp = k[i]
    for j in range(0, i):
      if (tmp % k[j]) == 0:
        break
    else:
      ans += 1

print(ans)

Fixed submission:
a, b = map(int, input().split(' '))
 
def divisor(n):
  ass = []
  for i in range(1,int(n**0.5)+1):
    if n%i == 0:
      ass.append(i)
      ass.append(n//i)
  return ass #sortされていない
 
a_div = divisor(a)
b_div = divisor(b)

k = []
for val in a_div:
  if val != 1 and val in b_div:
    k.append(val)
k.sort()

ans = 0
if len(k) == 0:
  ans = 1
elif len(k) == 1:
  ans = 2
else:
  ans = 2
  for i in range(1, len(k)):
    tmp = k[i]
    for j in range(0, i):
      if (tmp % k[j]) == 0:
        break
    else:
      ans += 1
 
print(ans)
Buggy python submission (verdict: Runtime Error):
import sys
 
stringCount = int(input())
targetString = input()
 
maxCount = stringCount // 2
 
for exclusionCount in range(maxCount):
    count = maxCount - exclusionCount
 
    for i in range(maxCount):
        if (i + count * 2) > stringCount:
            break
 
        word = targetString[i:count]
        end = stringCount - len(word)
        if (targetString.count(word, 0, end) > 1):
            print('{}'.format(count))
            sys.exit()
 
print('0')

Fixed submission:
weather = {'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Sunny'}
 
today = input()
print(weather[today])

Buggy python submission (verdict: Runtime Error):
weather = {'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Sunny'}

in = input()
print(weather[in])

Fixed submission:
weather = {'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Sunny'}
 
today = input()
print(weather[today])
Buggy python submission (verdict: Time Limit Exceeded):
l, r = map(int, input().split(' '))
ary = [num for num in range(l, r+1)]
# print(ary)
ans = 10000

for i in range(len(ary) -1):
  for j in range(i+1, len(ary)):
    tmp = (ary[i] * ary[j]) % 2019
    if tmp < ans:
      ans = tmp
    if ans == 0:
      break

print(ans)

Fixed submission:
l, r = map(int, input().split(' '))
if (r - l) > 2019:
  r = l + 2019
ary = [num for num in range(l, r+1)]
# print(ary)
ans = 10000

for i in range(len(ary) -1):
  for j in range(i+1, len(ary)):
    tmp = (ary[i] * ary[j]) % 2019
    if tmp < ans:
      ans = tmp
    if ans == 0:
      break

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
import heapq
#これを加える！！！！
def _heappush_max(heap, item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappop_max(heap):
    """Maxheap version of a heappop."""
    lastelt = heap.pop()    # raises appropriate IndexError if heap is empty
    if heap:
        returnitem = heap[0]
        heap[0] = lastelt
        heapq._siftup_max(heap, 0)
        return returnitem
    return lastelt

n = int(input())
works = [[]] * n
for i in range(n):
  a, b = map(int, input().split(' '))
  works[i] = [a, b]

ans = 'Yes'
sorted_works = sorted(works, key=lambda x: x[1], reverse=True)
max_deadline = sorted_works[0][1]
# print('max_deadline', max_deadline)
h = []
deadline_i = 0
work_day = max_deadline # 作業日
# 締め切り最終日から0日に向かってループ
for d in range(max_deadline, -1, -1):
  # その日が締め切りの作業時間を優先度キューに追加
  for i in range(deadline_i, n):
    work_time, deadline = sorted_works[i]
    if deadline == d:
      _heappush_max(h, work_time)
      deadline_i += 1
    else:
      break
  # 作業ができない日であれば、次のループへ
  if d > work_day:
    continue
  
  # 作業ができる日
  
  # 作業がなければ次のループへ
  if len(h) == 0:
    continue
  
  
  # その日に終了しても良い作業の中で時間が最長の作業時間を取得
  max_work_time = _heappop_max(h)
  # 次の作業日を設定
  work_day = d - max_work_time
  
  # 0日より前になる = 作業量が多いので実行不可
  if work_day < 0:
    ans = 'No'
  
  

print(ans)
# print(works)
# print(sorted_works)

Fixed submission:
n = int(input())
works = [[]] * n
for i in range(n):
  a, b = map(int, input().split(' ')) # a = 時間, b = 締め切り
  works[i] = [a, b]

ans = 'Yes'
sorted_works = sorted(works, key=lambda x: x[1]) # 締切の早い順にソート
total = 0

for work in sorted_works:
  total += work[0]
  if total > work[1]:
    ans = 'No'
    break
  
print(ans)
Buggy python submission (verdict: Runtime Error):
a, b, k = map(int, input().split())
m = b if a > b else a
ans = []
for i in range(1, (m // 2)+2):
  if a % i == 0 and b % i == 0:
    ans.append(i)
print(ans[-k])

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

def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i:
        divisors.append(n // i)
  divisors.sort()
  return divisors

a_divs = make_divisors(a)
b_divs = make_divisors(b)

common_divs = []
for i in range(len(a_divs)):
  a_div = a_divs[i]
  if a_div in b_divs:
    common_divs.append(a_div)
print(common_divs[-k])

Buggy python submission (verdict: Runtime Error):
a, b, k = map(int, input().split())
m = a if a > b else b
ans = []
for i in range((m // 2)+1, 0, -1):
  if a % i == 0 and b % i == 0:
    ans.append(i)
print(ans[k-1])

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

def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i:
        divisors.append(n // i)
  divisors.sort()
  return divisors

a_divs = make_divisors(a)
b_divs = make_divisors(b)

common_divs = []
for i in range(len(a_divs)):
  a_div = a_divs[i]
  if a_div in b_divs:
    common_divs.append(a_div)
print(common_divs[-k])
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    N, K = map(int, input().split())
    A = [int(i) for i in input().split()]

    test_sum = 1
    for i in A[:K]:
        test_sum *= i


    for i in range(K, N):
        before_sum = test_sum
        test_sum //= A[i - K]
        test_sum *= A[i]

        if test_sum > before_sum:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    main()


Fixed submission:
def main():
    N, K = map(int, input().split())
    A = [int(i) for i in input().split()]

    for i in range(K, N):
        if A[i] > A[i - K]:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
def main():
    N = int(input())
    ans = ""

    while N > 26:
        tmp = N % 26
        txt = "z" if tmp == 0 else chr(tmp + 96)
        # if tmp == 0:
        #     ans += "z"
        # else:
        #     ans += chr(tmp + 96)
        ans += txt
        # print(f"{ans = }. {N = }")
        N //= 26
    else:
        txt = "z" if tmp == 0 else chr(tmp + 96)
        ans += txt

    print(ans[::-1])


if __name__ == '__main__':
    main()


Fixed submission:
def main():
    N = int(input())
    ans = ""

    while N:
        N -= 1
        tmp = N % 26
        ans += chr(tmp + ord("a"))
        N //= 26

    print(ans[::-1])


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Runtime Error):
def main():
    N = int(input())
    ans = ""

    while N > 26:
        tmp = N % 26
        txt = "z" if tmp == 0 else chr(tmp + 96)
        ans += txt
        print(f"{ans = }. {N = }")
        N //= 26
    else:
        txt = "z" if tmp == 0 else chr(tmp + 96)
        ans += txt

    print(ans[::-1])


if __name__ == '__main__':
    main()

Fixed submission:
def main():
    N = int(input())
    ans = ""

    while N:
        N -= 1
        tmp = N % 26
        ans += chr(tmp + ord("a"))
        N //= 26

    print(ans[::-1])


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline


def main():
    x, n = [int(i) for i in input().split()]
    p = set([int(i) for i in input().split()])

    for i in range(1, 101):
        if i in p:
            continue

        if i <= x:
            ans = i
        elif x - ans > i - x:
            ans = i
            break

    print(ans)


if __name__ == '__main__':
    main()

Fixed submission:
# import numpy as np
import sys
input = sys.stdin.readline


def main():
    x, n = [int(i) for i in input().split()]
    p = set([int(i) for i in input().split()])

    ans = x
    for i in range(-1, 102):
        if i in p:
            continue

        if i <= x:
            ans = i
        else:
            if x - ans > i - x:
                ans = i
            break

    print(ans)


if __name__ == '__main__':
    main()

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


def main():
    x, n = [int(i) for i in input().split()]
    p = set([int(i) for i in input().split()])

    for i in range(1, 101):
        if i in p:
            continue

        if i <= x:
            ans = i
        elif x - ans > i - x:
            ans = i
    else:
        print(ans)


if __name__ == '__main__':
    main()

Fixed submission:
# import numpy as np
import sys
input = sys.stdin.readline


def main():
    x, n = [int(i) for i in input().split()]
    p = set([int(i) for i in input().split()])

    ans = x
    for i in range(-1, 102):
        if i in p:
            continue

        if i <= x:
            ans = i
        else:
            if x - ans > i - x:
                ans = i
            break

    print(ans)


if __name__ == '__main__':
    main()

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


def main():
    x, n = [int(i) for i in input().split()]
    p = set([int(i) for i in input().split()])

    for i in range(1, 101):
        if i in p:
            continue

        if i <= x:
            ans = i
        elif x - ans > i - x:
            ans = i
    else:
        print(ans)


if __name__ == '__m

Fixed submission:
# import numpy as np
import sys
input = sys.stdin.readline


def main():
    x, n = [int(i) for i in input().split()]
    p = set([int(i) for i in input().split()])

    ans = x
    for i in range(-1, 102):
        if i in p:
            continue

        if i <= x:
            ans = i
        else:
            if x - ans > i - x:
                ans = i
            break

    print(ans)


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline


def main():
    n = int(input())
    a = [int(i) for i in input().split()]
    limit = 10 ** 18

    ans = 1
    for i in a:
        ans *= i
    if ans > limit:
        ans = -1

    print(ans)

if __name__ == '__main__':
    main()

Fixed submission:
import sys
input = sys.stdin.readline


def main():
    n = int(input())
    a = [int(i) for i in input().split()]
    limit = 10 ** 18

    if 0 in a:
        print(0)
        exit()

    ans = 1
    for i in a:
        ans *= i
        if ans > limit:
            ans = -1
            break

    print(ans)


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
from decimal import Desimal
import sys
input = sys.stdin.readline


def main():
    a, b = [Desimal(i) for i in input().split()]
    a = int(a)
    b = int(float(b) * 100)
    ans = a * b // 100
    print(ans)


if __name__ == '__main__':
    main()


Fixed submission:
import decimal
import sys
input = sys.stdin.readline


def main():
    a, b = [decimal.Decimal(i) for i in input().split()]
    ans = a * b
    print(int(ans))


if __name__ == '__main__':
    main()

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


def main():
    a, b = [float(i) * 100 for i in input().split()]
    print((a ** b) // 100)


if __name__ == '__main__':
    main()


Fixed submission:
import decimal
import sys
input = sys.stdin.readline


def main():
    a, b = [decimal.Decimal(i) for i in input().split()]
    ans = a * b
    print(int(ans))


if __name__ == '__main__':
    main()

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


def main():
    a, b = [int(i * 100) for i in input().split()]
    print((a ** b) // 100)


if __name__ == '__main__':
    main()


Fixed submission:
import decimal
import sys
input = sys.stdin.readline


def main():
    a, b = [decimal.Decimal(i) for i in input().split()]
    ans = a * b
    print(int(ans))


if __name__ == '__main__':
    main()