Problem:


Score: 200 points

Problem Statement

Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.

As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.

Find the N-th smallest integer that would make Ringo happy.

Constraints

D is 0, 1 or 2.

N is an integer between 1 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:

D N

Output

Print the N-th smallest integer that can be divided by 100 exactly D times.

Sample Input 1

0 5

Sample Output 1

5

The integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...

Thus, the 5-th smallest integer that would make Ringo happy is 5.  

Sample Input 2

1 11

Sample Output 2

1100

The integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \ 000, 1 \ 100, ...

Thus, the integer we are seeking is 1 \ 100.

Sample Input 3

2 85

Sample Output 3

850000

The integers that can be divided by 100 exactly twice are as follows: 10 \ 000, 20 \ 000, 30 \ 000, ...

Thus, the integer we are seeking is 850 \ 000.



Sample input:
0 5


Sample output:
5

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
if D == 0:
  print(N)
elif D == 1:
  print(N*100)
else:
  print(N*10000)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())

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

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())

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

Submission status: Wrong Answer

Solution code:
D,N = map(int, input().split())

print(N * 100**D)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
if d == 0:
    if n == 100:
        print('101')
    else:
        print(n)
elif d == 1:
    if n == 100:
        print('100100')
    else:
        print(n*100)
else:
    if n == 100:
        print('10100000')
    else:
        print(n*10000)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
if N == 100:
	print(N*100**D+100)
else:
	print(N*100**D)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
ans = N
for i in range(D):
	ans *= 100
print(ans)

Submission status: Wrong Answer

Solution code:
D, N = list(map(lambda x : int(x), input().split(" ")))
print(N * (100 ** D))

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
if D==0:
  print(N)
elif D==1:
  print(100*N)
else:
  print(10000*N)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
print(N * 10**(2*D))

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())

if d == 0:
    print(n)
elif d == 1:
    print(100*n)
elif d == 2:
    print(10000*n)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())

if d == 0:
    print(n)
else:
    print((100**d)*n)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
print((100**d)*n)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split());print(n if d==0 else [n*100,n*10000][d==2])

Submission status: Wrong Answer

Solution code:
def main():
    D, N = map(int, input().split())
    h = 100
    if D == 0:
        print(1*N)
    else:
        print((100 ** D)*N)
main()

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
print((100**A)*B)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
def resolve():
    D, N = map(int, input().split())
    if D == 0:
        print(N)
    elif D == 1:
        print(100*N)
    else:
        print(10000*N)
resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    D, N  =map(int, input().split())
    if D == 0:
        print(N)
    elif D == 1:
        print(100*N)
    else:
        print(10000*N)
resolve()

Submission status: Wrong Answer

Solution code:
a,b=(int(i) for i in input().strip().split(" "))
print(b*(100**a))

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())


s=1
if d==1:
    s=100
elif d==2:
    s=10000

print(s*n)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a == 0:
  ans = b
elif a == 1:
  ans = b*100
else:
  ans = b*100**2
print(ans)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())

if d==0:
  print(n)
elif d==1:
  print(n*100)
else:
  print(n*10000)

Submission status: Wrong Answer

Solution code:
import sys
d,n = map(int,input().split())
if d == 0:
  if n == 100:
    print(101)
    sys.exit()
  else:
    print(n)
    sys.exit()
else:
  print((100**d)*n)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(100**a*b)

Submission status: Wrong Answer

Solution code:
d,n = map(int, input().split())
print(n*100**d)

Submission status: Wrong Answer

Solution code:
import sys
d,n = map(int,input().split())
if d == 0:
	if n%100 == 0:
		print(n)
		sys.exit()
	else:
		print(n+1)
		sys.exit()
print((100**d)*n)

Submission status: Wrong Answer

Solution code:
import sys
d,n = map(int,input().split())
if d == 0:
  print(n)
  sys.exit()
print(n*(100**d))

Submission status: Wrong Answer

Solution code:
import sys
d,n = map(int,input().split())
if d == 0:
	print(n)
	sys.exit()
print((100**d)*n)

Submission status: Wrong Answer

Solution code:
# AtCoder Beginner Contest 100
# B - Ringo's Favorite Numbers

D,N=map(int,input().split())
if N==100:
    print(N*101**D)
else:
    print(N*100**D)

Submission status: Wrong Answer

Solution code:
# AtCoder Beginner Contest 100
# B - Ringo's Favorite Numbers

D,N=map(int,input().split())
if N<100:
    print(N*100**D)
else:
    print(N*101**D)

Submission status: Wrong Answer

Solution code:
# AtCoder Beginner Contest 100
# B - Ringo's Favorite Numbers

D,N=map(int,input().split())

L=[]

for i in range (1,105):
    n=i*100**D
    L.append(n)

print(L[N-1])

Submission status: Wrong Answer

Solution code:
# AtCoder Beginner Contest 100
# B - Ringo's Favorite Numbers

D,N=map(int,input().split())
if N<100:
    print(N*100**D)
else:
    print(N*100**D+N*100**D)

Submission status: Wrong Answer

Solution code:
# AtCoder Beginner Contest 100
# B - Ringo's Favorite Numbers

D,N=map(int,input().split())

print(N*100**D)

Submission status: Wrong Answer

Solution code:
n,d = list(map(int,input().split()))

print(100**n * d)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
if d == 0:
    print(n if n!=100 else "101")
elif d == 1:
    print(n*100 if n!=100 else 10100)
else:
    print(n*10000 if n!=100 else 10001000)

Submission status: Wrong Answer

Solution code:
s = input().split()

d = int(s[0])
n = int(s[1])

answer = 0

if d == 0:
    if n == 100:
        answer = 101
    else:    
        answer = n
elif d == 1:
    answer = 100 * n
elif d == 2:
    answer = 10000 * n

print(answer)

Submission status: Wrong Answer

Solution code:
s = input().split()

d = int(s[0])
n = int(s[1])

answer = 0

if d == 0:
    answer = n
elif d == 1:
    answer = 100 * n
elif d == 2:
    answer = 10000 * n

print(answer)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())

print( (100**d) * n )

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())

print(N * (100 ** D))

Submission status: Wrong Answer

Solution code:
n,d=map(int,input().split())
if n<=99:
    print(100**n*d)
else:
    print(100**n*101)

Submission status: Wrong Answer

Solution code:
n,d=map(int,input().split())
if n<=99:
    print(100**n*d)
else:
    print(10**n*101)

Submission status: Wrong Answer

Solution code:
n,d=map(int,input().split())
print(100**n*d)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
ans = (100 ** d) * n
print(ans)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())

count = 0
m = 0
n = 0
c = 0

if D == 0:
  n = 1
  m = 100
elif D == 1:
  n = 100
  m = 10000
else:
  n = 10000

while 1:
  c += n
  if D == 0 or D == 1:
    if c % m == 0:
      pass
    else:
      count += 1
  else:
    count += 1
      
  if count == N:
    print(c)
    break

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
if D == 0:
    ans = N
elif D == 1:
    if N != 100:
        ans = N*100
    else:
        ans = 10100
elif D == 2:
    if N != 100:
        ans = N*100**2
    else:
        ans = 101*100**2
print(ans)

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
if n<=99:
  print((100**n)*k)
else:
  print((101**n)*k)

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
if n<=100:
  print((100**n)*k)
else:
  print((101**n)*k)

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
print((100**n)*k)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())

if D==0:
    print(N)
    exit()
if D==1:
    print(N*100)
    exit()
if D == 2:
    print(N*10000)
    exit()

Submission status: Wrong Answer

Solution code:
n=list(map(int, input().split()))

print(n[1]*(100**n[0]))

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())

if d == 0:
  print(n)
elif d == 1:
  print(100 * n)
else :
  print(10000 * n)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())

if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
elif d == 1:
    if n == 100:
        print(10100)
    else:

        print(n*100)
else:
    if n == 100:
        print(1010000)
    print(n*10000)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())

if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
elif d == 1:
    if n == 100:
        print(10100)
    else:

        print(n*100)
else:
    if n == 100:
        print(1001000)
    print(n*10000)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())

if d == 0:
    print(n)
elif d == 1:
    print(n*100)
else:
    print(n*10000)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
if d == 0:
    count = 0
    for num in range(1, 10000000):
        if num % 100 == 0:
            continue
        count += 1
        if count == n:
            print(num)
            break
else:
    print(pow(100, d) * n)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
count = 0
for i in range(1, pow(100, d) * n + 1):
    if i % pow(100, d) != 0:
        continue
    count += 1
    if count == n:
        print(i)
        break

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
print(pow(100, d) * n)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
print(100 ** d * n)

Submission status: Wrong Answer

Solution code:
d,n = map(int, raw_input().split())
print n * (100 ** d)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
num=10**d
if n==100:
    print(num*101)
else:
    print(num*n)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
count = 0
i = 1

while True:
    c = -1
    for j in range(0, 3):
        if i%(100**j)==0:
            c = j
    if c==d:
        count += 1
    if count == n:
        print(i)
        break
    i += 1

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
count = 0
i = 1
if d==0:
    print(n)
    exit()
while True:
    if i%100**d==0 and i//(100**d) < 100**d:
        count += 1
    if count == n:
        print(i)
        break
    i += 1

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
count = 0
i = 1
if d==0:
    print(5)
    exit()
while True:
    if i%100**d==0 and i//(100**d) < 100**d:
        count += 1
    if count == n:
        print(i)
        break
    i += 1

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
count = 0
i = 1
if d==0:
    print(5)
    exit()
while True:
    if i%100*d==0 and i//(100**d) < 100**d:
        count += 1
    if count == n:
        print(i)
        break
    i += 1

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
count = 0
i = 1
while True:
    if i%100*d==0 and i//(100**d) < 100**d:
        count += 1
    if count == n:
        print(i)
        break
    i += 1

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
count = 0
i = 1
while True:
    if i%100**d==0:
        count += 1
    if count == n:
        print(i)
        break
    i += 1

Submission status: Wrong Answer

Solution code:
def main():
    d, n = map(int,input().split())
    if d == 0:
        print(n)
    else:
        print((100**d)*n)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
print(N*(100**D))

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
print(N*(10**D))

Submission status: Wrong Answer

Solution code:
MM = input().split()
D = int(MM[0])
N = int(MM[1])
if N ==100:
  ans = 100**D*N +1
else:
  ans = 100**D *N
print(ans)

Submission status: Wrong Answer

Solution code:
MM = input().split()
D = int(MM[0])
N = int(MM[1])
ans = 100**D *N
print(ans)

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())

if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
else:
    tmp = 100**d
    print(tmp*n)

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
ans = n
if d != 0:
    ans *= 100**d

if n == 100:
    ans /= 100

print(int(ans))

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
ans = n
if d != 0:
    ans *= 100**d
    
print(ans)

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())

if d == 0:
    print(n)
else:
    tmp = 100**d
    print(tmp*n)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
x = (100**d)*n
if d==0 and x%100==0:
  print(x+1)
else:
  print(x)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
print((100**d)*n)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())

if n == 100:
    a=101**d
else:
    a=100**d*n

print(a)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())

if n != 100:
    a=100**d*n
else:
    a=101**d*n

print(a)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
n=str(n)
if d==0:
    print(n)
elif d==1:
    print(n+"00")
elif d==2:
    print(n+"0000")

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())

a=100**d
print(a*n)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
print(str(N)+D*'00')

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
if D == 0:
    if N != 100:
        print(N)
    else:
        print(101)
    exit()
if D == 1:
    if N != 100:
        print(N*100)
    else:
        print(10100)
    exit()
if N != 100:
    print(N*10000)
else:
    print(100010000)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
print(N*pow(100,D))

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
num = 100 ** d
print(num * n)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
num = 100 ** d
print(num * n if num != 0 else 1 * n)

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
c = 0
for i in range(1,100**3):
    if i%(100**d) == 0:
        c += 1
    if c == n:
        print(i)
        break

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
print((100**d)*n)

Submission status: Wrong Answer

Solution code:
# B - Ringo's Favorite Numbers
D, N = map(int, input().split())

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

# B - Ringo's Favorite Numbers
D, N = map(int, input().split())

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

d, n = map(int, readline().split())

ans = n * 100 ** d
print(ans)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())

# print(100 ** 0)
# print(100 ** 1)
# print(100 ** 2)

start = 100 ** d
# step = 100 ** d
# end 

# print(start * n)

value = start
count = 1
while True:
    if n == count:
        break
    
    value += start
    if d == 0:
        if value % 100 != 0:
            count += 1
    elif d == 1:
        if value % 10000 != 0:
            count += 1
    else:
        count += 1
    
print(value)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())

# print(100 ** 0)
# print(100 ** 1)
# print(100 ** 2)

start = 100 ** d
# step = 100 ** d
# end 

# print(start * n)

value = start
count = 1
while True:
    if n == count:
        break
    
    value += start
    if d == 0:
        if value % 100 != 0:
            count += 1
    else:
        count += 1
    
print(value)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())

# print(100 ** 0)
# print(100 ** 1)
# print(100 ** 2)

start = 100 ** d
# step = 100 ** d
# end 

print(start * n)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
if d==0:
  print(n)
else:
  print(n*100**d)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
res = 0
if a == 0:
  res = b
elif a == 1:
  res =100*b
elif a == 2:
  res =10000*b
print(res)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
res = 0
if a == 0:
  for i in range(101):
    res +=1
    if i+1 == b:
      break
  print(res)
elif a == 1:
  for i in range(101):
    res +=100
    if i+1 == b:
      break
  print(res)
elif a == 2:
  for i in range(101):
    res +=10000
    if i+1 == b:
      break
  print(res)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
res = 0
if a == 0:
  for i in range(100):
    res +=1
    if i+1 == b:
      break
  print(res)
elif a == 1:
  for i in range(100):
    res +=100
    if i+1 == b:
      break
  print(res)
elif a == 2:
  for i in range(100):
    res +=10000
    if i+1 == b:
      break
  print(res)

Submission status: Wrong Answer

Solution code:
i = list(map(int,input().split()))
num = 100 ** i[0]
print(num * i[1])

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
ans = 100**d*n
if n == 100:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
print(100**d*n)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
ans=N * (100**D)
print(ans)

Submission status: Wrong Answer

Solution code:
D,N = (int(X) for X in input().split())
print(N*pow(100,D))

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
print(N * (100 ** D))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

D, N = map(int, input().split())

if (100 ** D * N) / 100 != 100 ** D:
    print(100 ** D * N)
else:
    print((100 ** D * N) + 100 * D)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

D, N = map(int, input().split())

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
print(100**D*N if D else N)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())

ans = 100**d * (n)
if n==100:
    ans+=1

print(ans)

Submission status: Wrong Answer

Solution code:
d, n = [int(w) for w in input().split()]

print(100**d*n)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
ans = 0

if D == 0:
  print(N)
  
elif D == 1 and N !=100:
  print(N*100)
  
elif D == 1 and N == 100:
  print(10100)
  
elif D == 2 and N != 100:
  print(N*10000)
  
else:
  print(1010000)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
ans = 0

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

Submission status: Wrong Answer

Solution code:
d,n = map(int, input().split())

if d == 0:
  if n == 100: print(101)
  else: print(n)
else:
  print(100**d*n)

Submission status: Wrong Answer

Solution code:
d,n = map(int, input().split())

if d == 0:
  if d == 100: print(101)
  else: print(n)
else:
  print(100**d*n)

Submission status: Wrong Answer

Solution code:
import math
def main():
  d,n = list(map(int,input().split()))
  print(pow(100,d)*n)
main()

Submission status: Wrong Answer

Solution code:
def solve():
    D, N = map(int, input().split())
    print(100 ** D * N)


if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
D,N = [int(i) for i in input().split()]
print(N*100**D)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
ans = (100**d)*n
print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
d, n = map(int, input().split())
print(n * 100**d + (n == 100))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
d, n = map(int, input().split())
print(n * 100**d + (n == 100 and d ==0))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
d, n = map(int, input().split())
print(n * 100**d + (n == 100 and d ==1))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
d, n = map(int, input().split())
print(n, "00" * d, sep="")

Submission status: Wrong Answer

Solution code:
import itertools
import sys
input = sys.stdin.readline

D, N = map(int, input().split())

M = N // 99
ans = 100**D * (100*M + N % 100)
print(ans)

Submission status: Wrong Answer

Solution code:
import itertools
import sys
input = sys.stdin.readline

D, N = map(int, input().split())

M = N // 99
ans = 100**D * (100*M + (N-M*99))
print(ans)

Submission status: Wrong Answer

Solution code:
import itertools
import sys
input = sys.stdin.readline

D, N = map(int, input().split())

M = N // 99
ans = 100**D * (100*M + N % 99)
print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import defaultdict, deque
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline()[:-1]


def solve():
    d, n = [int(x) for x in input().split()]
    print(n * (100 ** d))

t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()



"""

"""

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import defaultdict, deque
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline()[:-1]


def solve():
    d, n = [int(x) for x in input().split()]
    if d == 2:
        print(2 ** n)
    else:
        print(n)

t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()



"""

1 4
7
RRRR
1 1 0 1
----
4

1 4
47
RCRR
1 1 0 1
----
-1

2 2
10
RR
RR
1 7
4 1
----
4

2 2
10
RR
RR
7 4
7 4
----
-1

3 3
8
RCR
RRC
RRR
1 1 1
1 1 1
1 3 1


3 3
1
RCR
RRC
RRR
1 1 1
1 1 1
1 3 1


2 2
300
RR
RC
7 4
7 4

"""

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
if n == 100:
    print(max(100 ** d, 1) * n + 100)
else:
    print(max(100 ** d, 1) * n)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
if n == 100:
    print(max(100 ** d, 1) * n + 1)
else:
    print(max(100 ** d, 1) * n)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
print(max(100 ** d, 1) * n)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split());print(((n==100)*(d<2)+n)*100**d)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split());print(((n==100)*(d<2)+n)*10**d)

Submission status: Wrong Answer

Solution code:
n,d=map(int,input().split());print(((n==100)*(d<2)+n)*10**d)

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())

print(100 ** d * n)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
if n==100:
  print(100**(d+1)+100*d)
else:
  print(100**d*n)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
if N != 100:
    print(N*100**D)
else:
    print(100**(D+1)+1)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
if N != 100:
    print(N*100**D)
else:
    print(100**D+1)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
print(N*100**D)

Submission status: Wrong Answer

Solution code:
D, N = [int(_) for _ in input().split()]

ans = 1 * 100 ** D * N

if ans >= 1 * 100 ** (D+1):
    ans = 1 * 100 ** D * 99

print(ans)

Submission status: Wrong Answer

Solution code:
D, N = [int(_) for _ in input().split()]

ans = 1 * 100 ** D * N

print(ans)

Submission status: Wrong Answer

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    D, N = il()
    limit = (100 ** D) * N
    print(limit)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    D, N = il()
    print(100 ** D * N)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
D,N = map(int,input().split())

if D not in [0,1,2] or not (1 <= N < 100):
    sys.exit()

print(N*(100**D))

Submission status: Wrong Answer

Solution code:
import sys
D,N = map(int,input().split())

if D not in [0,1,2] or not (1 <= N <= 100):
    sys.exit()

print(N*100**D)

Submission status: Wrong Answer

Solution code:
import sys
D,N = map(int,input().split())

if D not in [0,1,2] and not (1 <= N <= 100):
    sys.exit()

print(N*100**D)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
if d == 0:
    print(n if n!=100 else "101")
elif d == 1:
    print(n*100 if n!=100 else 10100)
else:
    print(n*10000 if n!=100 else 1000100)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline


D,N = list(map(int,input().split()))
if N == 100:
    D +=1
print(100**D*N)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline


D,N = list(map(int,input().split()))
print(100**D*N)

Submission status: Wrong Answer

Solution code:
import sys

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
    d, n = MI()
    ans = (100**d)*n
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
print(100**(D + 1) + 100 if N == 100 else N * 100**D)

Submission status: Wrong Answer

Solution code:
d,n = map(int, input().split())

if d == 0:
  print(n - n//100)
elif d == 1:
  print(100*n)
elif d == 2:
  print(10000*n)

Submission status: Wrong Answer

Solution code:
d,n = map(int, input().split())

if d == 0:
  print(n)
elif d == 1:
  t = 0
  s = 0
  while t != n:
    t += 1
    s = 100*t
  print(s)
elif d == 2:
  t = 0
  s = 0
  while t != n:
    t += 1
    s = 10000*t
  print(s)

Submission status: Wrong Answer

Solution code:
d,n = map(int, input().split())

if d == 0:
  for i in range(1,101):
    if i == n: print(i)
elif d == 1:
  t = 0
  s = 0
  while t != n:
    t += 1
    s = 100*t
  print(s)
elif d == 2:
  t = 0
  s = 0
  while t != n:
    t += 1
    s = 10000*t
  print(s)

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
print(pow(100,d)*n)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
print(n*(100**d))

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())

print(N*100**D)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
d,n = list(map(int, input().split()))
print(100**d * n)

Submission status: Wrong Answer

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    d, n = i_map()

    if d == 0:
        if n == 100:
            print(101)
        else:
            print(n)
        exit()

    if n == 100:
        if d == 1:
            print(10100)
        else:
            print(1010000)

    print(pow(100, d) * n)

if __name__ == '__main__':
    main()