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:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

D, K =  map(int, sys.stdin.readline().split())

print(100 ** D * K)

Submission status: Wrong Answer

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

D, K =  map(int, sys.stdin.readline().split())

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
if d==0:
    ans=n+n//100
if d==1:
    ans=n*100+n*100//100
if d==2:
    ans=n*10000+n*10000//100
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
from collections import deque
from functools import reduce
import copy
import math


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [D, N] = string_to_int(inputs[0])
    return N * (100 ** D)


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Submission status: Wrong Answer

Solution code:
import sys
from collections import deque
from functools import reduce
import copy
import math


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [D, N] = string_to_int(inputs[0])
    count = 0
    for i in range(1010000):
        if i % (100 ** D) == 0:
            if count == N:
                return i
            count += 1


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Submission status: Wrong Answer

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

ans = n*(100**d)
if n == 100:
    ans//= 100
print(ans)

Submission status: Wrong Answer

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

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

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 = map(int, input().split())

print(n*(10**d))

Submission status: Wrong Answer

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

print("d = ", d)
print("n = ", n)

if (d == 0):
    x = 1
    y = 0
    n0 = []
    while ( x <= n ):
        n0.append(y)
        x = x + 1
        y = y + 1
    print(n0[-1])
elif (d == 1):
    x = 1
    y = 100
    n1 = []
    while (x <= n ):
        n1.append(y)
        x = x + 1
        y = y + 100
    print(n1[-1])
elif (d == 2):
    x = 1
    y = 1000
    n2 = []
    while (x <= n):
        n2.append(y)
        x = x + 1
        y = y + 1000
    print(n2[-1])

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 = map(int,input().split())
if D == 0:
  print(N)
  exit()
else:
  print(N * (100 ** D))

Submission status: Wrong Answer

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


if __name__ == "__main__":
    test()

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())
print((100**x)*y)

Submission status: Wrong Answer

Solution code:


def main():

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

if __name__== "__main__":
    main()

Submission status: Wrong Answer

Solution code:
d,n = map(int, input().split())
d10 = 1
if d == 0:
    print(n)
else:
    for i in range(d):
        d10 *=100
    A = [(k+1)*d10 for k in range(100)]
    print(A[n-1])

Submission status: Wrong Answer

Solution code:
import sys
from collections import deque
from functools import reduce
import copy
import math


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [D, N] = string_to_int(inputs[0])
    adder = reduce(lambda acc, _: acc * 100, range(D), 1)
    count = 0
    for _ in range(N):
        count += adder
    return count


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Submission status: Wrong Answer

Solution code:
def main():
    D, N = map(int, input().split())
    v = pow(100, D)
    return v * N

if __name__ == '__main__':
    print(main())

Submission status: Wrong Answer

Solution code:
d, n = list(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())
n = [x for x in range(N+1)]
print(100**D*n[len(n)-1] if D != 0 else n[len(n)-1])

Submission status: Wrong Answer

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

print ( 100 ** D * N)

Submission status: Wrong Answer

Solution code:
print(eval("100**"+input().replace(" ","*")))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
d, n = (int(i) for i in input().split())
if d == 0:
    if n != 100:
        print(n)
    else:
        print(n+1)
elif d == 1:
    if n != 100:
        print(100*n)
    else:
        print(100*n+1)
elif d == 2:
    if n != 100:
        print(10000*n)
    else:
        print(10000*n+1)

Submission status: Wrong Answer

Solution code:
d, n = (int(i) for i in input().split())
cnt = 0
i = 0
while cnt < n:
    i += 1
    if d == 0 and i%100 != 0:
        cnt += 1 
    elif d == 1:
        print(100*n)
        break
    elif d == 2:
        print(10000*n)
        break
else:
    print(i)

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((100**d)*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def solve():
    d, n = map(int, input().split())
    return (n - (n - 1) // 99) * (100 ** d)


if __name__ == "__main__":
    print(solve())

Submission status: Wrong Answer

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


if __name__ == "__main__":
    print(solve())

Submission status: Wrong Answer

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


if __name__ == "__main__":
    print(solve())

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
lst = []
for i in range(1,101):
    lst.append(i*(10**(2*d)))
print(lst[n-1])

Submission status: Wrong Answer

Solution code:

d, n = map(int, input().split())
if d == 0:
    start = 1
elif d == 1:
    start = 100
else:
    start = 10000

print(start * n)

Submission status: Wrong Answer

Solution code:

d, n = map(int, input().split())
if d == 0:
    start = 1
else:
    start = 100**d
    step = start

print(start * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y=map(int,input().split())
y=y-int(y/100)
z=y*(100**x)
print(z)

Submission status: Wrong Answer

Solution code:
x,y=map(int,input().split())
z=y*(100**x)
print(z)

Submission status: Wrong Answer

Solution code:
x,y=map(int,input().split())
print(y*(100**x))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((100**d)*n)

Submission status: Wrong Answer

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

    print((100 ** D) * N)

main()

Submission status: Wrong Answer

Solution code:
import math
import copy
import sys


inputa = input().split()
# inputb = input().split()
# inputc = input().split()

a = int(inputa[0])
b = int(inputa[1])
# c = int(inputa[2])

# x = int(inputb[0])
# y = int(inputb[1])

# inputaList = [int(n) for n in inputa]

# inputb = input().split()
# inputbList = [int(n) for n in inputb]
#
# inputList = []
# inputNumList = []
# for i in range(a):
#     inputNum = input()
#     inputNumList = list(inputNum)
#     inputList.append(inputNumList)

# inputList = [int(n) for n in inputList]

# b = [int(n) for n in inputb]
# c = [int(n) for n in inputc]

if a % 100 == 0:
    ans = pow(100, a) * b + 1
else:
    ans = pow(100, a) * b
print(int(ans))

Submission status: Wrong Answer

Solution code:
import math
import copy
import sys


inputa = input().split()
# inputb = input().split()
# inputc = input().split()

a = int(inputa[0])
b = int(inputa[1])
# c = int(inputa[2])

# x = int(inputb[0])
# y = int(inputb[1])

# inputaList = [int(n) for n in inputa]

# inputb = input().split()
# inputbList = [int(n) for n in inputb]
#
# inputList = []
# inputNumList = []
# for i in range(a):
#     inputNum = input()
#     inputNumList = list(inputNum)
#     inputList.append(inputNumList)

# inputList = [int(n) for n in inputList]

# b = [int(n) for n in inputb]
# c = [int(n) for n in inputc]

ans = pow(100, a) * b
print(int(ans))

Submission status: Wrong Answer

Solution code:
import math
import copy
import sys


inputa = input().split()
# inputb = input().split()
# inputc = input().split()

a = int(inputa[0])
b = int(inputa[1])
# c = int(inputa[2])

# x = int(inputb[0])
# y = int(inputb[1])

# inputaList = [int(n) for n in inputa]

# inputb = input().split()
# inputbList = [int(n) for n in inputb]
#
# inputList = []
# inputNumList = []
# for i in range(a):
#     inputNum = input()
#     inputNumList = list(inputNum)
#     inputList.append(inputNumList)

# inputList = [int(n) for n in inputList]

# b = [int(n) for n in inputb]
# c = [int(n) for n in inputc]

ans = pow(100, a) * b
print(ans)

Submission status: Wrong Answer

Solution code:
import math
import copy
import sys


inputa = input().split()
# inputb = input().split()
# inputc = input().split()

a = int(inputa[0])
b = int(inputa[1])
# c = int(inputa[2])

# x = int(inputb[0])
# y = int(inputb[1])

# inputaList = [int(n) for n in inputa]

# inputb = input().split()
# inputbList = [int(n) for n in inputb]
#
# inputList = []
# inputNumList = []
# for i in range(a):
#     inputNum = input()
#     inputNumList = list(inputNum)
#     inputList.append(inputNumList)

# inputList = [int(n) for n in inputList]

# b = [int(n) for n in inputb]
# c = [int(n) for n in inputc]

if a == 0:
    print(b)
else:
    ans = a * 100 * b
    print(ans)

Submission status: Wrong Answer

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

step = 100**d

print(step * n)

Submission status: Wrong Answer

Solution code:
d,n = [int(x) for x in 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:
import sys
input=sys.stdin.readline
import fractions

d,n = map(int, input().split())
ans = 100**d*n
if d == 0:
    if ans % 100 == 0:
        ans += ans//100
elif d == 1:
    if ans % 10000 == 0:
        ans += ans//10000
elif d == 2:
    if ans % 1000000 == 0:
        ans += ans//1000000

print(ans)

Submission status: Wrong Answer

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

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)

Submission status: Wrong Answer

Solution code:
D,N = input().split()
cnt=0
temp_N = int(N)

while temp_N%100==0:
  cnt+=1
  temp_N/=100
#print(cnt)
for _ in range(int(D)-cnt):
  N+="00"
print(int(N))

Submission status: Wrong Answer

Solution code:
D,N = input().split()
for _ in range(int(D)):
  N+="00"
print(int(N))

Submission status: Wrong Answer

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

if (N == 100):
  print(100**D * N + 1)
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*(100**D))

Submission status: Wrong Answer

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

if N == 100:
    num = 101 * (10**D)
else:
    num = 100 * (10**D)

print(num)

Submission status: Wrong Answer

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

if D == 0:
    num = N
elif D == 1:
    num = N * 100
elif D == 2:
    num = N * 10000

print(num)

Submission status: Wrong Answer

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

if D == 0:
    num = N
elif D == 1:
    num = N * 100
elif D == 2:
    num = N * 10000

if N == 100:
    num += 1

print(num)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
m = n
count = 0
while m < 100:
  m /= 100
  count +=1
print(100**d*(n+count))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# スペース区切りの整数の入力
b, c = map(int, input().split())
# 出力
print(pow(100,b)*c)

Submission status: Wrong Answer

Solution code:
# スペース区切りの整数の入力
b, c = map(int, input().split())
# 出力
print(100^b*c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N= input().split()
D=int(D)
N=int(N)
print(N*(100**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(N*(100**D))
else:
    print(N*(100**D)+1)

Submission status: Wrong Answer

Solution code:
A = input().split()
D = int(A[0])
N = int(A[1])

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

Submission status: Wrong Answer

Solution code:
A = input().split()
D = int(A[0])
N = int(A[1])

if N != 100:
  print(100 ** D * N)

Submission status: Wrong Answer

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

ans = 0
for i in range(N):
    ans += 100**D
print(ans)

Submission status: Wrong Answer

Solution code:
A = input().split()
D = int(A[0])
N = int(A[1])

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
A = input().split()
D = int(A[0])
N = int(A[1])

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

Submission status: Wrong Answer

Solution code:
A = input().split()
D = int(A[0])
N = int(A[1])

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

Submission status: Wrong Answer

Solution code:
# ABC100-B
D, N = map(int, input().split())
if N != 100:
    if D == 0:
        print(N)
    elif D == 1:
        print(N * 100)
    elif D == 2:
        print(N * 10000)
else:
    if D == 0:
        print(N + 1)
    elif D== 1:
        print(N * 100 + 100)
    else:
        print(N * 10000 + 100)

Submission status: Wrong Answer

Solution code:
# ABC100-B
D, N = map(int, input().split())
if D == 0:
    print(N)
elif D == 1:
    print(N * 100)
elif D == 2:
    print(N * 10000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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(list(map(lambda x: x * 100**D, range(1,101)))[N-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = [int(i) for i in input().split()]
d = l[0]
n = l[1]

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

Submission status: Wrong Answer

Solution code:
a,b = [int(i) for i in input().split()]

def tb(x):
  y = x % 100
  return (x - y) / 100

if a == 0:
  ans = b - tb(b)
else:
  ans = (b - tb(b)) * 100 ** a

print(int(ans))

Submission status: Wrong Answer

Solution code:
a,b = [int(i) for i in input().split()]

def tb(x):
  y = x % 100
  return (x - y) / 100

if a == 0:
  ans = b - tb(b)
else:
  ans = (b - tb(b)) * 100**2
  
print(ans)

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())
print(N*10**(2*N))

Submission status: Wrong Answer

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

cnt = 1
for i in range(1, 1000001):
    if i % (100 ** D) == 0:
        if cnt == N:
            print(i)
            exit(0)
        else:
            cnt += 1

Submission status: Wrong Answer

Solution code:
D,N = list(map(int,input().split(' ')))
#ar = [ar.append(100**D*i) for i in range(1,N+1)
ar = []
for i in range(1,N+1):
  ar.append(100**D*i)
 
  
print(ar[-1])

Submission status: Wrong Answer

Solution code:
D,N = list(map(int,input().split(' ')))
ar = [(100**D*i) for i in range(1,N+1)]
 
  
print(ar[-1])

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())
if D == 0:
  print(N)
elif N != 100:
  print(100**D * N)
else:
  print(100**D * 101)

Submission status: Wrong Answer

Solution code:
a,b=list(map(int, input().split()))
if b != 100:
    print(100**a*b)
else:
    print(100**a*(b-1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
print(str(n) + "00" * d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s = 100**d

cnt = 0
i = 1

while True:
    if i%s == 0:
        cnt += 1
        if cnt == n:
            ans = i
            break
    i += 1
    
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
if N != 100:
    print(N * 100 ** D)
else:
    print((N - 1) * 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:
a, b = map(int, input().split())
ans = 100 **a * b
print(ans)

Submission status: Wrong Answer

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

x = d * 100

y = []

if d == 0:
    print(n)
else:
    for i in range(x, x * n + 1, x):
        y.append(i)

    print(y[n-1])

Submission status: Wrong Answer

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

x = d * 100

y = []

if d == 0:
    print(5)
else:
    for i in range(x, x * n + 1, x):
        y.append(i)

    print(y[n-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

tail = "00" * d

s = str(n) + tail

print(s)

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())

start = 100 ** D
print(start * N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#ABC 100 B - Ringo's favorite number
A = [int(el) for el in input().split(' ')]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a != 100:
    print(b * 100 ** a)
else:
    print(101 * 100 ** a)

Submission status: Wrong Answer

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

print(b * 100 ** a)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
X = []
count = 0
base = 100 ** D
while True:
    count += 1
    value = (base * count)
    if D == 0:
        if value % 100 != 0:
            X.append(value)
    else:
        if value % base == 0:
            X.append(value)
    if len(X) == 100:
        break
print(X[N-1])

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
X = [i * (100 ** D) for i in range(1, N+1)]
print(X[N-1])

Submission status: Wrong Answer

Solution code:
D,N=map(int, input().split())
ans=0
if D==0:
  ans=N
elif D==1:
  ans=100*N
elif D==2:
  ans=10000*N
if N==100 and D==2:
  ans+=ans
  #N=100の時は100で割り切れてしまうから、N=101にする
print(ans)

Submission status: Wrong Answer

Solution code:
D,N=map(int, input().split())
ans=0
if D==0:
  ans=N
elif D==1:
  ans=100*N
elif D==2:
  ans=10000*N
if N==100:
  ans+=ans
  #N=100の時は100で割り切れてしまうから、N=101にする
print(ans)

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(5)
elif D==1:
  print(100*N)
elif D==2:
  print(10000*N)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
ans = []
if D == 0:
    for i in range(110):
        if i % 100 != 0:
            ans.append(i)
elif D == 1:
    for i in range(100, 10001, 100):
        ans.append(i)
else:
    for i in range(10000, 1010001, 10000):
        ans.append(i)

print(ans[N - 1])

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
ans = []
if D == 0:
    for i in range(110):
        if i % 100 != 0:
            ans.append(i)
elif D == 1:
    for i in range(100, 10001, 100):
        ans.append(i)
else:
    for i in range(10000, 1000001, 10000):
        ans.append(i)

print(ans[N - 1])

Submission status: Wrong Answer

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

if D == 0:
    if N!=100:
        print(N)
    else:
        print(101)

elif D == 1:
    print(100*N)

elif D == 2:
    print(100*100*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(1000100)
  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)
elif D == 1:
  if N == 100:
    print(10100)
  else:
    print(N*100)
else:
  if N == 100:
    print(1000100)
  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)
elif D == 1:
  if N == 10000:
    print(10100)
  else:
  	print(N*100)
else:
  print(N*10000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
"""
# 標準入力取得
## 文字列
 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())

## 数値
 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

# 0埋め, 小数点出力桁指定時のときの出力
a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654

# 文字列をリストに格納
char_list = list("abcd") # ["a","b","c","d"]
"""

import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

if __name__ == "__main__":
    D,N = map(int, sys.stdin.readline().split())
    print((100**D)*N)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b = LI()
    if a <= 8 and b <= 8:
        print("Yay!")
    else:
        print(":(")
    return

#B
def B():
    d, n = LI()
    print(int(str(n) + "00" * d))
    return

#C
def C():
    return

#D
def D():
    return

#Solve
if __name__ == '__main__':
    B()