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:
    if N==100:
        print(101)
    else:
	    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:
	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 n==100:
	print(100**d*n+1)
else:
	print(100**d*n)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import numpy as np
import math
import re

x = input()
x = re.split(" ",x)
D = int(x[0])
N = int(x[1])

t = 0
y = 0
while True:
    t += 1
    if(t % 100**D == 0):
        y += 1
        if(y == N):
            break;
print(t)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split(' '))
x = 100**D
num = 0
for i in range(N):
  if i == 100:
    pass
  else:
     num += 1
print(num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
d, n = [int(c) for c in 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:
    print(n)
elif d == 1:
    print(100*n)
elif d == 2:
    print(100**d*n)
elif n == 100:
    print(100**d*(n+1))

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

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
l = []
for i in range(1,n+1):
    l.append((100**d)*i)
print(l[n-1])

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
l = []
for i in range(n+1):
    l.append((100**d)*i)
print(l[n])

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
l = []
for i in range(n+1):
    l.append(100**d*i)
print(l[n])

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

Submission status: Wrong Answer

Solution code:
num = list(map(int,input()
.split()))
if num[0] == 0:
    ans = num[1]
elif num[0] == 1:
    ans = num[1]*100
else:
    ans = num[1]*10000

print(ans)

Submission status: Wrong Answer

Solution code:
# ABC100B - Ringo's Favorite Numbers
d, n = list(map(int, input().rstrip().split()))
print(100 ** d * n if n <= 99 else 100 * d * 101)

Submission status: Wrong Answer

Solution code:
# ABC100B - Ringo's Favorite Numbers
n, t = list(map(int, input().rstrip().split()))
print(t if n == 0 else 100 ** n * t)

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= (int(i) for i in input().split())
print(N*(100**D)) if N!=100 else print(1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
import sys
import numpy as np

readInt = lambda: int(sys.stdin.readline())
readIntN = lambda: [int(v) for v in sys.stdin.readline().split(' ')]

d, n = readIntN()
ret = n * (100 ** d)
print(ret)

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np

readInt = lambda: int(sys.stdin.readline())
readIntN = lambda: [int(v) for v in sys.stdin.readline().split(' ')]

d, n = readIntN()
ret = n * (100 ** d)
if d == 0 and ret == 100:
    ret += 1
print(ret)

Submission status: Wrong Answer

Solution code:
import sys

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

print(100 ** d * n)

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

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for i in range(n+1):
    if i == n:
        if d == 0:
            ans = i
        elif d == 1:
            ans = i * 100
        elif d == 2:
            ans = i * 10000
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y = (int(i) for i in input().split())
z = (y - 1) // 99
print(((y - z) * 100) ** x)

Submission status: Wrong Answer

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

if __name__ == '__main__':
	main()

Submission status: Wrong Answer

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

if __name__ == '__main__':
	main()

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:
  ans = (100 ** d) * n
  print(ans)
else:
  ans = (100 ** (d+1)) + 100 ** n
  print(ans)

Submission status: Wrong Answer

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

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 N != 100:
    print((100*d)*N)
else:
    print((100**d)*101)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#ABC100B
D, N = map(int, input().split())
ans = (100 ** D) * N
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,k = [int(x) for x in input().split()]
print((100 ** d) * k)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=input()
print(x[2:]+"00"*int(x[0]))

Submission status: Wrong Answer

Solution code:
D,n=map(int,input().split())
number=[]
i=1
while len(number)<n+1:
  if i%(10**D)==0:
    number.append(i)
    i=i+1
print(number[n-1])

Submission status: Wrong Answer

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

if n <= 99:
  print(100**d*n)
else:
  print(100**d*n + 100)

Submission status: Wrong Answer

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

ans = N*100**D
if N == 100:
    ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())
if N == 100:
  print(101)
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:
  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:
    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:
    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())
print(int(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:
# 2019/04/12
# AtCoder Beginner Contest 100 - B

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

print(n*100**d)

Submission status: Wrong Answer

Solution code:
# 2019/04/12
# AtCoder Beginner Contest 100 - B

# Input
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 = list(map(int,input().split()))
print(N*(100**D))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int,input().split())
li = []
if D == 0:
    for i in range(1,N+1,1):
        li.append(i)
elif D == 1:
    for i in range(1,N+1,1):
        li.append(i*100)
else:
    for i in range(1,N+1,1):
        li.append(i*10000)
print(li[-1])

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(D: int, N: int):
    print(str(N)+"00"*D)
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  # type: int
    N = int(next(tokens))  # type: int
    solve(D, N)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

print(pow(100,d)*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:
# -*- coding: utf-8 -*-

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

if d == 0 and n == 100:
    print(101)
elif d == 0:
    print(n)

if d == 1:
    print(100 * n)

if d == 2 and n == 100:
    print(1000000)
elif d == 2:
    print(10000 * n)

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 = [int(x) for x in input().split()]
print((100**D)*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(100**2*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())
ans = []
count = 0
while (True):
    try:
        print(ans[N])
        break
    except:
        ans.append((100 ** D) * count)
    count += 1

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
ans = []
count = 1
while (True):
    try:
        print(ans[N - 1])
        break
    except:
        ans.append((100 ** D) * count)
    count += 1

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())

D, N = tuple(li())
print(N * 100 ** D)

Submission status: Wrong Answer

Solution code:

import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())

D, N = tuple(li())
print(D * 100 + N)

Submission status: Wrong Answer

Solution code:
x,y = (int(i) for i in input().split())
z = (y - 1) // 99
print((y - z) * 100 ** x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

D, N = MAP()
if N == 100:
	print(100 ** (D)*N+1)
else:
	print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

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

print(100**d * n)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

D, N = MAP()
if N == 100:
	print(100 ** (D+2))
else:
	print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

D, N = MAP()
if N == 100:
	print(100 ** D * N - 1)
else:
	print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

D, N = MAP()

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

D, N = MAP()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())
list_ans = [n * 100 ** d for n in range(1, n + 1)]
print(max(list_ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())
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(list(range(0, 101))[N]*(100**D))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=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 d == 0:
    print(1*n)
elif d == 1:
    print(100*n)
elif d == 2:
    print(10000*n)

Submission status: Wrong Answer

Solution code:
#coding: utf-8
D, N = map(int, input().split())
print(100 ** D * (N - (N-1)//99))

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N = map(int,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:
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:
d, n = map(int, input().split())
if d == 0:
    print(n)
elif d == 1:
    if n != 100:
        print(100 * n)
    else:
        print(100*101)
else:
    if n != 100:
        print(10000 * n)
    else:
        print(10000 * 101)

Submission status: Wrong Answer

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


for i in range(N):
  if D == 0 and N == 100:
    list_ans = [101]
    break
  list_ans = [n*100**D for n in range(1,N+1)]


print(list_ans[-1])


'''　考え方
1.d=0
1,2,3,4,5....
つまり、1*100**0,2*100**0


2.d=1
100,200,300...
つまり、1*100**1,2*100**1

3.d=2
10000,20000....
つまり、1*100**2,2*100**2...

Dの値に応じて、上記のリストをN個分まで出力すれば良い
'''

Submission status: Wrong Answer

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


for i in range(N):
  list_ans = [n*100**D for n in range(1,N+1)]


print(list_ans[-1])


'''　考え方
1.d=0
1,2,3,4,5....
つまり、1*100**0,2*100**0


2.d=1
100,200,300...
つまり、1*100**1,2*100**1

3.d=2
10000,20000....
つまり、1*100**2,2*100**2...

Dの値に応じて、上記のリストを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:
    print(n*100)
else:
    print(n*10000)

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 = [int(item) for item in input().split()]

print(n * 10**(2*d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((100**D)*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 = [int(elem) for elem in 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())
a = (100**d) * n
print(a)

Submission status: Wrong Answer

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

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

if D == 2:
    print(10000*N)

if D == 0:
    print(N)

Submission status: Wrong Answer

Solution code:
from sys import stdin
d,n=[int(x) for x in stdin.readline().rstrip().split()]
if d==0:
    print(n)
else:
    if n==100:
        print((100**d)*101)
    else:
        print((100**d)*n)

Submission status: Wrong Answer

Solution code:
from sys import stdin
d,n=[int(x) for x in stdin.readline().rstrip().split()]
if d==0:
    print(n)
else:
    print((100**d)*n)

Submission status: Wrong Answer

Solution code:
s,t = map(int,input().split())
print((100 ** s) * t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n = map(int, input().split())
print(101 if d == 0 and n == 100 else (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 = (int(i) for i in input().split())

print(n*100**d)

Submission status: Wrong Answer

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

l = [N] + ['00'] * int(D)
print(''.join(l))

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

Submission status: Wrong Answer

Solution code:
D,N = tuple(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)
    
elif d == 1:
	print(n*100)

else:
	print(n*10000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def ringos_favorite_numbers(D: int, N: int) -> int:
    return N * (10 ** D)


if __name__ == "__main__":
    D, N = map(int, input().split())
    ans = ringos_favorite_numbers(D, N)
    print(ans)

Submission status: Wrong Answer

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

hundreds = int(a[0])
hundreds = 100 ** hundreds

ans = int(a[1]) * hundreds
print(ans)

Submission status: Wrong Answer

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

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())
num = [100**d*i for i in range(1,n+1)]
print(num[-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,m=map(int,input().split())
print(m*pow(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 d == 0:
    print(n)

else:
    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:
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

ans = 0
K, N = map(int, input().split())
if N == 100:
    ans = 100**(K+1)+1
else:
    ans = 100**K*N
print(ans)