Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
from sys import stdin
n,m = map(int, input().split())
li = []
for i in range(n):
    li.append([])
for i in range(m):
    a, b = map(int, stdin.readline().split())
    if a > b:
        a, b = b, a
    if a == 1:
        li[a-1].append(b-1)
    else:
        li[a-1].append(b-1)
        li[b-1].append(a-1)
if len(li[0])==0:
    print("No")
else:
    print("Yes")
    # guide: [[before, kyori]]
    guide = [-1]*n
    dist = [10**8]*n
    dist[0] = 0
    def rec(i):
        # 部屋i と 部屋v をつなぐ道がある
        li_v = li[i]
        for v in li_v:
            if v!=0 and dist[v] > dist[i]+1:
                guide[v] = i
                dist[v] = dist[i] + 1
                rec(v)
    rec(0)

    for i in range(n):
        if i==0:
            continue
        print(guide[i]+1)

Fixed submission:
from sys import stdin
from collections import deque
import numpy as np
class edge(object):
    def __init__(self, to, rev):
        self.to = to
        self.rev = rev
def add_edge(from_, to_, G):
    G[from_].append(edge(to_, len(G[to_])))
    G[to_].append(edge(from_, len(G[from_])-1))

def bfs(src, level, li, li_from):
    que = deque([src])
    level[src] = 0
    while len(que)!=0:
        v = que.popleft()
        for i in range(len(li[v])):
            e = li[v][i]
            if level[e.to]<0:
                level[e.to] = level[v]+1
                li_from[e.to] = v
                que.append(e.to)

n,m = map(int, input().split())
li = []
for i in range(n):
    li.append([])
for i in range(m):
    a, b = map(int,  stdin.readline().split())
    if a > b:
        a, b = b, a
    add_edge(a-1, b-1, li)


if len(li[0])==0:
    print("No")
else:
    print("Yes")
    level = np.full(n, -1, dtype=np.int)
    li_from = np.full(n, -1, dtype=np.int)
    bfs(0,level,li, li_from)
    for i in li_from:
        if i==-1:
            continue
        print(i+1)
Buggy python submission (verdict: Runtime Error):
n = int(input())
index = list(map(int, input().split()))
energy = []
for p in range(min(index), max(index)):
    sum = 0
    for xi in index:
        sum += (xi-p)**2
    energy.append(sum)
print(min(energy))

Fixed submission:
n = int(input())
index = list(map(int, input().split()))
energy = []
for p in range(min(index), max(index)+1):
    sum = 0
    for xi in index:
        sum += (xi-p)**2
    energy.append(sum)
print(min(energy))
Buggy python submission (verdict: Time Limit Exceeded):
amount = 10 ** 6
x = int(input())
cnt = 0
can_buy = 0

xx = x % 100
if x >= 100:
    for i in range(xx + 1):
        for j in range(xx//2 + 1):
            for k in range(xx // 3 + 1):
                for l in range(xx // 4 + 1):
                    for m in range(xx // 5 + 1):
                        if i + 2 * j + 3 * k + 4 * l + 5 * m == xx:
                            rest = x - 101 * i - 102 * j - 103 * k - 104 * l - 105 * m
                            cnt = rest // 100
                            if rest >= 0 and cnt <= amount:
                                can_buy = 1
                                break

print(can_buy)

Fixed submission:
x = int(input())
n = x // 100
can_buy = 0
while n > 0:
    if 100 * n <= x <= 105 * n:
        can_buy = 1
        break
    else:
        n -= 1
print(can_buy)
Buggy python submission (verdict: Runtime Error):
import math
a,b,x = map(int,input().split())
v = a **2 * b
h = 0
ans = 0
if v == x:
    ans = 0
if(x > v // 2):
    ans = 90 - math.degrees(math.atan(a ** 3 / ( 2 * (v - x))))
else:
    ans = 90 - math.degrees(math.atan(x / (a * b **2 // 2)))
print(ans)

Fixed submission:
import math
a,b,x = map(int,input().split())
v = a **2 * b
h = 0
ans = 0
if v == x:
    ans = 0
elif(x > v // 2):
    ans = 90 - math.degrees(math.atan(a ** 3 / ( 2 * (v - x))))
else:
    ans = 90 - math.degrees(math.atan(x / (a * b **2 // 2)))
print(ans)

Buggy python submission (verdict: Runtime Error):
import math
a,b,x = map(int,input().split())
v = a **2 * b
h = 0
ans = 0
if(x > v // 2):
    ans = 90 - math.degrees(math.atan(a ** 3 / ( 2 * (v - x))))
else:
    ans = 90 - math.degrees(math.atan(x / (a * b **2 // 2)))
print(ans)

Fixed submission:
import math
a,b,x = map(int,input().split())
v = a **2 * b
h = 0
ans = 0
if v == x:
    ans = 0
elif(x > v // 2):
    ans = 90 - math.degrees(math.atan(a ** 3 / ( 2 * (v - x))))
else:
    ans = 90 - math.degrees(math.atan(x / (a * b **2 // 2)))
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
c = a.copy()
for i in a:
    print(a.index(min(c))+1,end= " ")
    c.remove(min(c))

Fixed submission:
n = int(input())
a = []
li = [0] * n
a = list(map(int,input().split()))
for i in range(n):
    li[a[i]-1] = i+1
for i in range(n):
    print(li[i], end = " ")

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
co = a.copy()
co = sorted(co)
for i in co:
    print(a.index(i)+1,end= " ")

Fixed submission:
n = int(input())
a = []
li = [0] * n
a = list(map(int,input().split()))
for i in range(n):
    li[a[i]-1] = i+1
for i in range(n):
    print(li[i], end = " ")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
ans = 0
for i in range(n):
    ans += b[a[i]-1]
    if i < n-1 and a[i+1] == a[i] + 1:
        ans += c[a[i]-1]
print(ans)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
ans = 0
for i in range(n):
    ans += b[a[i]-1]
    if i < n-1 and a[i+1] == a[i] + 1:
        ans += c[a[i]-1]
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
ans = 0
for i in range(n):
    ans += b[a[i]-1]
    if i < n-1 and a[i+1] == a[i] + 1:
        ans += c[i-1]
print(ans)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
ans = 0
for i in range(n):
    ans += b[a[i]-1]
    if i < n-1 and a[i+1] == a[i] + 1:
        ans += c[a[i]-1]
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
li = []
ans = 0
a = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
for i in range(n):
    s = list(input())
    for j in range(10):
        s[j] = a.index(s[j])
    s = sorted(s)
    li.append(s)
li2  = li.copy()
for s in li2:
    ans -= 1
    ans += li.count(s)
    li.remove(s)
    if ans < 0:
        ans = 0
print(ans)

Fixed submission:
n = int(input())
di = {}
ans = 0

for i in range(n):
    s = sorted(input())
    s = "".join(s)
    if s in di:
        ans += di[s]
        di[s] += 1
    else:
        di[s] = 1

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
li = []
for i in range(n):
    li.append(int(input()))
m = max(li)
li2 = li.copy()
li2.remove(max(li2))
d = max(li2)
for i in range(n):
    if li[i] == max(li):
        print(d)
    else:
        print(m)

Fixed submission:
n = int(input())
li = []
for i in range(n):
    x = int(input())
    li.append(x)
p = max(li)
r = li.index(p)
li.remove(p)
q = max(li)
for i in range(n):
    if i == r:
        print(q)
    else:
        print(p)
Buggy python submission (verdict: Runtime Error):
n = int(input())
d_lis = list(map(int,input().split()))
li = sorted(d_lis)
mid = n // 2
print(li[mid] - li[mid-1n = int(input())
d_lis = list(map(int,input().split()))
li = sorted(d_lis)
mid = n // 2
print(li[mid] - li[mid-1])

Fixed submission:
n = int(input())
d_lis = list(map(int,input().split()))
li = sorted(d_lis)
mid = n // 2
print(li[mid] - li[mid-1])

Buggy python submission (verdict: Runtime Error):
n = int(input())
d_lis = [int(d) for d in input().split()]
ans = 0
c = 0
li = sorted(li)
for a in set(li):
    if a > li[n // 2] and a <= li[(n // 2) + 1]:
        b = a
        c = 1
if c == 1:
    ans = li[(n // 2) + 1] - b + 1
    print()

Fixed submission:
n = int(input())
d_lis = list(map(int,input().split()))
li = sorted(d_lis)
mid = n // 2
print(li[mid] - li[mid-1])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
d_lis = [int(d) for d in input().split()]
cnt = 0
ans = 0
for i in range(max(d_lis)+1):
    cnt += d_lis.count(i)
    if cnt == n // 2:
        ans += 1
print(ans)

Fixed submission:
n = int(input())
d_lis = list(map(int,input().split()))
li = sorted(d_lis)
mid = n // 2
print(li[mid] - li[mid-1])
Buggy python submission (verdict: Runtime Error):
n,x = map(int,input().split())
lis = list(map(int,input().split()))
d = 0
c = 0
for i in range(n+1):
    d = d + lis[i]
    if d > x:
        c = 1
        print(i+1)
        break
if c == 0:
    print(n+1)

Fixed submission:
n,x = map(int,input().split())
lis = list(map(int,input().split()))
d = 0
c = 1
for l in lis:
    d += l
    if d <= x:
        c += 1
print(c)

Buggy python submission (verdict: Runtime Error):
n,x = map(int,input().split())
lis = list(map(int,input().split()))
d = 0
for i in range(n+1):
    d = d + lis[i]
    if d > x:
        print(i+1)
        break

Fixed submission:
n,x = map(int,input().split())
lis = list(map(int,input().split()))
d = 0
c = 1
for l in lis:
    d += l
    if d <= x:
        c += 1
print(c)
Buggy python submission (verdict: Runtime Error):
li1 = []
c = 0
n = int(input())
for i in range(n):
    h = int(input())
    if i == 0:
        c += 1
    else:
        if h >= max(li1):
            c += 1
    li1.append(h)
print(c)

Fixed submission:
c = 0
n = int(input())
li = list(map(int,input().split()))
li1 = []
for a in li:
    li1.append(a)
    if a >= max(li1):
            c += 1
print(c)
Buggy python submission (verdict: Runtime Error):
s = list(input())
c = 0
li = ["A","C","G","T"]
li2 = []
for i in range(len(s)):
    if s[i] in li:
        c += 1
    else:
        li2.append(c)
        c = 0
print(max(li2))

Fixed submission:
s = list(input())
c = 0
li = ["A","C","G","T"]
li2 = []
for i in range(len(s)):
    if s[i] in li:
        c += 1
        
    else:
        li2.append(c)
        c = 0
li2.append(c)
print(max(li2))

Buggy python submission (verdict: Runtime Error):
s = list(input())
c = 0
li = ["A","C","G","T"]
li2 = []
for i in range(len(s)):
    if s[i] in li:
        c += 1
        
    else:
        li2.append(c)
        c = 0
print(max(li2))

Fixed submission:
s = list(input())
c = 0
li = ["A","C","G","T"]
li2 = []
for i in range(len(s)):
    if s[i] in li:
        c += 1
        
    else:
        li2.append(c)
        c = 0
li2.append(c)
print(max(li2))
Buggy python submission (verdict: Runtime Error):
k,a,b = map(int,input().split())
biscuits = 1

#交換しても割に合わない
if a > b:
        biscuits = k+1

#交換するとお得

#交換できない(叩き続ける)
if a < b:
    if k - 1 < a:
        biscuits = k + 1

#交換可能(集まり次第交換)
    if k - 1 >= a:
        if (k - a - 1) % 2 == 0:
            p = k - a - 1
            biscuits = (p / 2 + 1) * b - p / 2 * a
        else:
            biscuits = (p / 2 + 1) * b + 1

        
print(biscuits)    

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

if b - a <= 1:
        biscuits = k+1
else:
    p = k - a + 1
    biscuits = a + (b - a) * (p // 2)
    biscuits = biscuits + (k - a + 1) % 2

print(biscuits)
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
li_X = list(map(int, input().split()))

if(m==1):
    print(0)

else:
    li_X.sort()

    li_X_delta = []
    for i in range(len(li_X)-1):
        li_X_delta.append(li_X[i+1]-li_X[i])

    li_X_delta_sorted_rev = sorted(li_X_delta, reverse=True)
    path_ignorable = []
    cnt = 0

    for i in range(n-1):
        path_ignorable.append(li_X_delta.index(li_X_delta_sorted_rev[cnt]))
        cnt += 1
    # ignore path from li_X[i] to li_X[i+1] for i in path_ignorable
    
    ans = 0
    for i in range(len(li_X_delta)):
        if(i in path_ignorable):
            continue
        ans += li_X_delta[i]
    print(ans)

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

li_X.sort()
li_X_delta = []
for i in range(len(li_X)-1):
    li_X_delta.append(li_X[i+1]-li_X[i])
li_X_delta.sort(reverse=True)
cnt = 0

ans = li_X[-1] - li_X[0]
for i in range(min(n-1, len(li_X_delta))):
    ans -= li_X_delta[i]
print(ans)

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

if(m==1):
    print(0)

else:
    li_X.sort()

    li_X_delta = []
    for i in range(len(li_X)-1):
        li_X_delta.append(li_X[i+1]-li_X[i])

    li_X_delta_sorted_rev = sorted(li_X_delta, reverse=True)
    path_ignorable = []
    cnt = 0

    for i in range(n-1):
        path_ignorable.append(li_X_delta.index(li_X_delta_sorted_rev[cnt]))
        cnt += 1
    # ignore path from li_X[i] to li_X[i+1] for i in path_ignorable
    
    ans = 0
    """
    for i in path_ignorable:
        print("from " + str(i) + " to " + str(i+1))
    """
    for i in range(len(li_X_delta)):
        if(i in path_ignorable):
            continue
        ans += li_X_delta[i]
    print(ans)

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

li_X.sort()
li_X_delta = []
for i in range(len(li_X)-1):
    li_X_delta.append(li_X[i+1]-li_X[i])
li_X_delta.sort(reverse=True)
cnt = 0

ans = li_X[-1] - li_X[0]
for i in range(min(n-1, len(li_X_delta))):
    ans -= li_X_delta[i]
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().slplit())

print(a * b / 2)


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

print(a * b // 2)

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

s = a * b / 2

print(s)

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

print(a * b // 2)
Buggy python submission (verdict: Runtime Error):
d = int(input())

if d = 22:
    print("Christmas Eve Eve Eve")
elif d = 23:
    print("Christmas Eve Eve")
elif d = 24:
    print("Christmas Eve")
else:
    print("Christmas")

Fixed submission:
d = int(input())

if d == 22:
    print("Christmas Eve Eve Eve")
elif d == 23:
    print("Christmas Eve Eve")
elif d == 24:
    print("Christmas Eve")
else:
    print("Christmas")
Buggy python submission (verdict: Runtime Error):
a,b = ma-(int,input().split())
print(a + (b//2))

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

Buggy python submission (verdict: Runtime Error):
a,b = ma-(int,input().split())
print(a + (b/2))

Fixed submission:
a,b = map(int,input().split())
print(a + (b//2))
Buggy python submission (verdict: Runtime Error):
n = int(input())
t,a = map(int,input().split())
li = list(map(int,input().split()))
p = []
for i in range(len(li)):
    m = t - 0.006 * li[i]
    p.append(m)
print(li.index(int((t-min(p)) / 0.006)))

Fixed submission:
n = int(input())
t,a = map(int,input().split())
li = list(map(int,input().split()))
p = []
for i in range(len(li)):
    m = abs(a-(t - 0.006 * li[i]))
    p.append(m)

print((p.index(min(p)) + 1))
Buggy python submission (verdict: Runtime Error):
N,T = map(int,input().split())
li = []
for i in range(N):
    c,t = map(int,input().split())
    if t > T:
        continue
    else:
        li.append(c)
print(min(li))

Fixed submission:
N,T = map(int,input().split())
li = []
for i in range(N):
    c,t = map(int,input().split())
    if t > T:
        continue
    else:
        li.append(c)
if li == []:
    print("TLE")
else:
    print(min(li))
Buggy python submission (verdict: Runtime Error):
n = int(input())
li = []
c = 0
for i in range(n):
    w = input()
    if w in li:
        print("No")
        break
    else:
        li.append(w)
for i in range(n-1):
    if li[i][-1] == li[i + 1][0]:
        c = 1
    else:
        c = 0
        break
if c == 0:
    print("No")
else:
    print("Yes")

Fixed submission:
n = int(input())
li = []
c = 1
for i in range(n):
    w = input()
    if w in li:
        c = 0
        
    else:
        li.append(w)

if c == 1:
    for i in range(1,n):
        if li[i - 1][-1] != li[i][0]:
            c = 0
            break
        else:
            c = 1
        
if c == 0:
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
h,w = map(int,input().split())
li = []
for i in range(h):
    a = list(input().split())
    li.append(a)
li2 = li.copy()
c = 0
for i in range(h):
    for j in range(w):
        c = 0
        if li[i][j] == ".":
            continue
        elif li[i][j] == "#":
            c = 1
            break
    if c == 0:
        li[i] = ["a"] * w
d = 0
n = []
for i in range(w):
    for j in range(h):
        d = 0
        if li[j][i] == "." or li[j][i] == "a":
            continue
        else:
            d = 1
            break
    if d == 0:
        n.append(i)
for i in n:
    for j in range(h):
        li[j][i] = "a"

for i in range(h):
    grid = ""
    for x in li[i]:
        if x != "a":
            grid += x
    print(grid)

Fixed submission:
h,w = map(int,input().split())
li = []
for i in range(h):
    a = list(input())
    li.append(a)
li2 = li.copy()
c = 0
for i in range(h):
    for j in range(w):
        c = 0
        if li[i][j] == ".":
            continue
        elif li[i][j] == "#":
            c = 1
            break
    if c == 0:
        li[i] = ["a"] * w
d = 0
n = []
for i in range(w):
    for j in range(h):
        d = 0
        if li[j][i] == "." or li[j][i] == "a":
            continue
        else:
            d = 1
            break
    if d == 0:
        n.append(i)
for i in n:
    for j in range(h):
        li[j][i] = "a"

for i in range(h):
    grid = ""
    for x in li[i]:
        if x != "a":
            grid += x
    if grid != "":
        print(grid)
Buggy python submission (verdict: Runtime Error):
d,g = map(int,input().split())
po = [0]
co = [0]
for i in range(d):
    p,c = map(int,input().split())
    po.append(p)
    co.append(c)

# f(g,i) :　残りG点で、i番目の問題を最大いくつ選べるか
# i番目の問題をn問解いて、
# その得点sがGより小さかったら、f(G-s,i-1)をnに加える。
# ここでiをデクリメントするのは、完全に解く問題より高い得点の問題を
# 中途半端に解くことが最適な問題の選び方ではないため。
# i == 0 の時は float('inf') を返す。（解けない場合）
def f(G,i):
    if i == 0:
        return float("inf")
    n = min(G//(i * 100),po[i])
    s = 100 * i * n 
    if n == po[i]:
        s += c[i]
    if s < G:
        n += f(G-s,i-1)
    return min(n,f(G,i-1))

print(f(g,d))

Fixed submission:
d,g = map(int,input().split())
po = [0]
co = [0]
for i in range(d):
    p,c = map(int,input().split())
    po.append(p)
    co.append(c)

# f(g,i) :　残りG点で、i番目の問題を最大いくつ選べるか
# i番目の問題をn問解いて、
# その得点sがGより小さかったら、f(G-s,i-1)をnに加える。
# ここでiをデクリメントするのは、完全に解く問題より高い得点の問題を
# 中途半端に解くことが最適な問題の選び方ではないため。
# i == 0 の時は float('inf') を返す。（解けない場合）
def f(G,i):
    if i == 0:
        return float("inf")
    n = min(G//(i * 100),po[i])
    s = 100 * i * n 
    if n == po[i]:
        s += co[i]
    if s < G:
        n += f(G-s,i-1)
    return min(n,f(G,i-1))

print(f(g,d))

Buggy python submission (verdict: Runtime Error):
d,g = map(int,input().split())
po = [0]
co = [0]
for i in range(d):
    p,c = map(int,input().split())
    po.append(p)
    co.append(c)

# f(g,i) :　残りG点で、i番目の問題を最大いくつ選べるか
# i番目の問題をn問解いて、
# その得点sがGより小さかったら、f(G-s,i-1)をnに加える。
# ここでiをデクリメントするのは、完全に解く問題より高い得点の問題を
# 中途半端に解くことが最適な問題の選び方ではないため。
# i == 0 の時は float('inf') を返す。（解けない場合）
def f(G,i):
    if i == 0:
        return float("inf")
    n = min(G//(i * 100),p[i])
    s = 100 * i * n 
    if n == p[i]:
        s += c[i]
    if s < G:
        n += f(G-s,i-1)
    return min(n,f(G,i-1))

print(f(g,d))

Fixed submission:
d,g = map(int,input().split())
po = [0]
co = [0]
for i in range(d):
    p,c = map(int,input().split())
    po.append(p)
    co.append(c)

# f(g,i) :　残りG点で、i番目の問題を最大いくつ選べるか
# i番目の問題をn問解いて、
# その得点sがGより小さかったら、f(G-s,i-1)をnに加える。
# ここでiをデクリメントするのは、完全に解く問題より高い得点の問題を
# 中途半端に解くことが最適な問題の選び方ではないため。
# i == 0 の時は float('inf') を返す。（解けない場合）
def f(G,i):
    if i == 0:
        return float("inf")
    n = min(G//(i * 100),po[i])
    s = 100 * i * n 
    if n == po[i]:
        s += co[i]
    if s < G:
        n += f(G-s,i-1)
    return min(n,f(G,i-1))

print(f(g,d))
Buggy python submission (verdict: Runtime Error):
n = int(input())
li = list(input())
print(max(li)-min(li))

Fixed submission:
n = int(input())
li = list(map(int,input().split()))
print(max(li)-min(li))
Buggy python submission (verdict: Runtime Error):
D,N = map(int, input().split())

if N == 100:
    N = 101

if D == 0:
    print(N)
elif D == 1:
    print(100 * N)
else:
    print(100 ** 2 * N)
print(n)

Fixed submission:
D,N = map(int, input().split())

if N == 100:
    N = 101

if D == 0:
    print(N)
elif D == 1:
    print(100 * N)
else:
    print(100 ** 2 * N)

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

if N = 100:
    N = 101

if D == 0:
    print(N)
elif D == 1:
    print(100 * N)
else:
    print(100 ** 2 * N)
print(n)

Fixed submission:
D,N = map(int, input().split())

if N == 100:
    N = 101

if D == 0:
    print(N)
elif D == 1:
    print(100 * N)
else:
    print(100 ** 2 * N)

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


if D == 0:
    n = N
elif D === 1:
    n = 100 * N 
else:
    n = 100 ** 2 * N
print(n)

Fixed submission:
D,N = map(int, input().split())

if N == 100:
    N = 101

if D == 0:
    print(N)
elif D == 1:
    print(100 * N)
else:
    print(100 ** 2 * N)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()

for i in range(1,n-1):
    a = set(s[:i])
    b = set(s[i:])
    cnt = len(a) + len(b) - len(s)
    c = max(c,cnt)

print(c)

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

for i in range(1,n-1):
    a = set(s[:i])
    b = set(s[i:])
    cnt = len(a) + len(b) - len(a|b)
    c = max(c,cnt)

print(c)
Buggy python submission (verdict: Runtime Error):
a,b,k = map(int,input().split())
li = []
if k >= b - a:
    print([x for x in range(a,b+1)])
else:
    for i in range(k):
        li.append(a + i)
    for i in range(k):
        li.append(b - i)
    for i in sorted(li):#sorted()で昇順にできる
     　 print(i)

Fixed submission:
a,b,k = map(int,input().split())
li = []
if 2 * k > b - a:
    for x in range(a,b+1):
        print(x)
else:
    for i in range(k):
        li.append(a + i)
    for i in range(k):
        li.append(b - i)
    for i in sorted(set(li)):
        print(i)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())
for i in range(a, b + 1):
    if i - a <= k - 1:
        print(i)
    elif b - i <= k - 1:
        print(i)

Fixed submission:
a,b,k = map(int,input().split())
li = []
if 2 * k > b - a:
    for x in range(a,b+1):
        print(x)
else:
    for i in range(k):
        li.append(a + i)
    for i in range(k):
        li.append(b - i)
    for i in sorted(set(li)):
        print(i)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())
for i in range(a, b + 1):
    if i - a <= k - 1:
        print(i)
    elif b - i <= k - 1:
        print(i)

Fixed submission:
a,b,k = map(int,input().split())
li = []
if 2 * k > b - a:
    for x in range(a,b+1):
        print(x)
else:
    for i in range(k):
        li.append(a + i)
    for i in range(k):
        li.append(b - i)
    for i in sorted(set(li)):
        print(i)