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

    print(pow(100, d) * n)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if d == 0 or d == 1 or d == 2:
  if n >= 1 and n <= 100:
    if d == 0:
      num = 1 * n
      print(num)
    if d == 1:
      num = 100 * n
      print(num)
    if d == 2:
      num = 10000 * n
      print(num)

Submission status: Wrong Answer

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

if d == 0 or d == 1 or d == 2:
  if n >= 0 and n <= 100:
    if d == 0:
      num = 1 * n
      print(num)
    if d == 1:
      num = 100 * n
      print(num)
    if d == 2:
      num = 10000 * n
      print(num)

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

print((100**D) * N )

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

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:
def resolve():
    D, N = list(map(int, input().split()))
    ls = [100 ** D * i for i in range(1, 100+1)]
    print(ls[N-1])
    return

resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

def main():
    D,N = map(int,input().split())
    ans = N * pow(100,D)
    print(ans)
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
def readInt():
  return int(input())
def readInts():
  return list(map(int, input().split()))
def readChar():
  return input()
def readChars():
  return input().split()

d,n = readInts()

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

Submission status: Wrong Answer

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

print(100**N*M)

Submission status: Wrong Answer

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

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())
ans = 0
df = 0

if D == 0:
    df = 1
elif D == 1:
    df = 100**1
else:
    df = 100**2

ans = df * N
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t = 100**d

print(t*n)

Submission status: Wrong Answer

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

t = 100**d

if t == 0:
    print(n)
else:
    print(n*t)

Submission status: Wrong Answer

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

t = d*100

if t == 0:
    print(n)
else:
    print(n*t)

Submission status: Wrong Answer

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

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())
if d==0 and n==100:
    print(101)
else:
    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:
    count = 0
    for i in range(1, 102):
        if i % 100 != 0:
            count += 1
            if count == n:
                print(i)
                break
        else:
            continue
        

if d == 1:
    count = 0
    for i in range(100, 20000):
        if i % 100 == 0:
            count+=1
            if count == n:
                print(i)
                break
        else:
            continue
        

if d == 2:
    count = 0
    for i in range(10000, 2000000, 10000):
        if i % 10000 == 0:
            count+=1
            if count == n:
                print(i)
                break
        else:
            continue

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[13]:


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


# In[14]:


if N % 10 != 0:
    print(100**D*N)
else:
    k = N//9
    a = N - k*9
    print(100**D*(10*k+a))


# In[ ]:

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[8]:


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


# In[ ]:

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
ans = []
for i in range(1,1000000):
	if i%(100**D) == 0:
		ans.append(i)
		if len(ans) == N:
			print(ans[N-1])

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
ans = []
for i in range(1000000):
  if i%(100**D) == 0:
    ans.append(i)
print(ans[4])

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

if d == 0:
    if n == 100:
        print(1 * n + 1)
    else:
        print(1 * 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(1 * 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())
l=[]
for i in range(1,n+1):
    l.append(i*100**d)
print(l[-1])

Submission status: Wrong Answer

Solution code:
import numpy as np
 
d,n = map(int, input().split())
if(not(n==100)):
  if(d==0):
    print(n)
  elif(d==1):
    print(100*n)
  else:
    print(10000*n)
else:
  if(d==0):
    print(101)
  elif(d==1):
    print(10100)
  else:
    print(1000000)

Submission status: Wrong Answer

Solution code:
import numpy as np
 
d,n = map(int, input().split())
if(not(n==100)):
  if(d==0):
    print(n)
  elif(d==1):
    print(100*d)
  else:
    print(10000*d)
else:
  if(d==0):
    print(101)
  elif(d==1):
    print(10100)
  else:
    print(1000000)

Submission status: Wrong Answer

Solution code:
import numpy as np

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:
def resolve():
    D, N = [int(i) for i in input().split()]
    if D == 0:
        print(N + (N) // 100)
        return
    print(100**D * N)


resolve()

Submission status: Wrong Answer

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

a = 0  
if N==100: a=1
print(N*pow(100,D) + a)

Submission status: Wrong Answer

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

print(N*pow(100,D))

Submission status: Wrong Answer

Solution code:
from itertools import permutations

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def main():
    D, N = mi()
    print((N-(N-1)//99)*(100**D))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from itertools import permutations

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def main():
    D, N = mi()
    print(N*100**D)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

D,N = I()
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 D == 1:
        print(1010000)
    else:
        print(N*10000)

Submission status: Wrong Answer

Solution code:
x = input()

print(x)

print("Hello World!")

Submission status: Wrong Answer

Solution code:
#tc=int(input())
for _ in range(1):
    n,k=[int(x) for x in input().split()]
    print(k*(10**n))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((100**a[0])*a[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:
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:
    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(str(N) + '00' * D) if N != 100 else int(str(N) + '00' * D) + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

if D == 0:
    print(N)

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

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

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
d, n = map(int, input().split())
if d == 0:
    cnt = 0
    for i in range(10**10):
        if i % 100 != 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()
if d == 1:
    if n == 100:
        print(101*100)
        exit()
    cnt = 0
    for i in range(100, 10**12):
        if i % 100 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

if d == 2:
    if n == 100:
        print(101*100*100)
    cnt = 0
    for i in range(10000, 10**12):
        if i % 10000 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

Submission status: Wrong Answer

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

cnt = 0
if d == 1:
    for i in range(1, 100**3 + 1):
        if i % 100 ** 1 == 0 and i % 100 ** 2 != 0:
            cnt += 1
        if cnt == n:
            print(i)
            exit()
elif d == 2:
    for i in range(1, 100 ** 3 + 1):
        if i % 100 ** 2 == 0:
            cnt += 1
        if cnt == n:
            print(i)
            exit()
else:
    for i in range(1, 100**3+1):
        if i % 100 != 0:
            cnt += 1
        if cnt == n:
            print(i)
            exit()

Submission status: Wrong Answer

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

cnt = 0
if d == 1:
    for i in range(1, 100**3+1):
        if i % 100 ** 1 == 0 and i % 100 ** 2 != 0:
            cnt += 1
        if cnt == n:
            print(i)
            exit()
elif d == 2:
    for i in range(1, 100 ** 3 + 1):
        if i % 100 ** 2 == 0 and i % 100 ** 1 != 0:
            cnt += 1
        if cnt == n:
            print(i)
            exit()
else:
    for i in range(1, 100**3+1):
        if i % 100 != 0:
            cnt += 1
        if cnt == n:
            print(i)
            exit()

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
d, n = map(int, input().split())
if d == 0:
    cnt = 0
    for i in range(10**10):
        if i % 100 != 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()
if d == 1:
    cnt = 0
    for i in range(100, 10**12):
        if i % 100 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

if d == 2:
    cnt = 0
    for i in range(10000, 10**12):
        if i % 10000 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
d, n = map(int, input().split())
if d == 0:
    cnt = 0
    for i in range(10**10):
        if i % 100 != 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()
if d == 1:
    cnt = 0
    for i in range(1, 10**12):
        if i % 100 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

if d == 2:
    cnt = 0
    for i in range(1, 10**12):
        if i % 10000 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
d, n = map(int, input().split())
if d == 0:
    cnt = 0
    for i in range(10**10):
        if i % 100 != 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()
if d == 1:
    cnt = 0
    for i in range(1, 10**10):
        if i % 100 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

if d == 2:
    cnt = 0
    for i in range(1, 10**10):
        if i % 10000 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

Submission status: Wrong Answer

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

cnt = 0
if d != 0:
    for i in range(1, 100**4):
        if i % 100 ** d == 0:
            cnt += 1
        if cnt == n:
            print(i)
            exit()
else:
    for i in range(1, 100**4):
        if i % 100 != 0:
            cnt += 1
        if cnt == n:
            print(i)
            exit()

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
d, n = map(int, input().split())
if d == 0:
    cnt = 0
    for i in range(1, 10**10):
        if i % 100 != 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()
if d == 1:
    cnt = 0
    for i in range(1, 10**10):
        if i % 100 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

if d == 2:
    cnt = 0
    for i in range(1, 10**10):
        if i % 10000 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

Submission status: Wrong Answer

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

cnt = 0
for i in range(1, 100**4):
    if i % 100 ** d == 0:
        cnt += 1
    if cnt == n:
        print(i)
        exit()

Submission status: Wrong Answer

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

cnt = 0
for i in range(1, 100**3+1):
    if i % 100 ** d == 0:
        cnt += 1
    if cnt == n:
        print(i)
        exit()

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
d, n = map(int, input().split())
if d == 0:
    cnt = 0
    for i in range(1, 10**10):
        if i % 100 != 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()
if d == 1:
    cnt = 0
    for i in range(1, 10**10):
        if i % 100 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()
if d == 2:
    cnt = 0
    for i in range(10000, 10**10):
        if i % 10000 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
d, n = map(int, input().split())
if d == 0:
    cnt = 0
    for i in range(1, 10**10):
        cnt += 1
        if cnt == n:
            print(i)
            exit()
if d == 1:
    cnt = 0
    for i in range(1, 10**10):
        if i % 100 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()
if d == 2:
    cnt = 0
    for i in range(10000, 10**10):
        if i % 10000 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

Submission status: Wrong Answer

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

print((100**D)*N)

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
d, n = map(int, input().split())
if d == 0:
    cnt = 0
    for i in range(1, 10**5):
        cnt += 1
        if cnt == n:
            print(i)
            exit()
if d == 1:
    cnt = 0
    for i in range(1, 10**5):
        if i % 100 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()
if d == 2:
    cnt = 0
    for i in range(10000, 10**10):
        if i % 10000 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
d, n = map(int, input().split())
if d == 0:
    cnt = 0
    for i in range(1, 10**5):
        cnt += 1
        if cnt == n:
            print(i)
            exit()
if d == 1:
    cnt = 0
    for i in range(1, 10**5):
        tmp = 100*i
        cnt += 1
        if cnt == n:
            print(tmp)
            exit()
if d == 2:
    cnt = 0
    for i in range(1, 10**5):
        tmp = 10000*i
        cnt += 1
        if cnt == n:
            print(tmp)
            exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
d, n = map(int, input().split())
if d == 0:
    cnt = 0
    for i in range(1, 101):
        cnt += 1
        if cnt == n:
            print(i)
            exit()
if d == 1:
    cnt = 0
    for i in range(1, 101):
        tmp = 100*i
        cnt += 1
        if cnt == n:
            print(tmp)
            exit()
if d == 2:
    cnt = 0
    for i in range(1, 101):
        tmp = 10000*i
        cnt += 1
        if cnt == n:
            print(tmp)
            exit()

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
d, n = map(int, input().split())
if d == 0:
    cnt = 0
    for i in range(1, 100):
        cnt += 1
        if cnt == n:
            print(i)
            exit()
if d == 1:
    cnt = 0
    for i in range(1, 101):
        tmp = 100*i
        cnt += 1
        if cnt == n:
            print(tmp)
            exit()
if d == 2:
    cnt = 0
    for i in range(1, 101):
        tmp = 10000*i
        cnt += 1
        if cnt == n:
            print(tmp)
            exit()

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

Submission status: Wrong Answer

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

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


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

if D == 2:
    if N == 1000000:
        print(1000100)
    else:
        print(N*10000)

Submission status: Wrong Answer

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

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 = list(map(int,input().split()))
print((100**d)*n)

Submission status: Wrong Answer

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

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, x = (int(i) for i in input().split())
ans = 100**d
add = ans
for i in range(x-1):
    ans += add
print(ans)

Submission status: Wrong Answer

Solution code:
d, x = (int(i) for i in input().split())
ans = str(x)
for i in range(d):
    ans += '00'
print(ans)