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())
cnt = 0
for i in range(1,10**9+1):
    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())
tmp = str(100**D)
print(str(N)+tmp[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(d,n)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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())
#print(d,n)

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

Submission status: Wrong Answer

Solution code:
D, N = [int(i) for i in 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(100 ** d * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
if D == 0:
    D = 1
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())

ans_list=[100**d*i for i in range(1,101)]

print(ans_list[n-1])

Submission status: Wrong Answer

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

if(d == 0):
    for i in range(1, 102):
        if(i % 100 != 0):
            cnt += 1
            if(cnt == n):
                ans = i
                print(ans)
                break
else:
    for j in range(1, 102):
        ans = 100**d*j
        cnt += 1
        if(cnt == n):
            print(ans)
            break

Submission status: Wrong Answer

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

if(d == 0):
    for i in range(1, 101):
        if(i % 100 != 0):
            cnt += 1
            if(cnt == n):
                ans = i
                print(ans)
                break
else:
    for j in range(1, 101):
        ans = 100**d*j
        cnt += 1
        if(cnt == n):
            print(ans)
            break

Submission status: Wrong Answer

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

li = []
for i in range(n):
    li.append(100**d*(i+1))

print(li[n-1])

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
ans = N*100**D
if D ==0:
    if N==100:
        print(101)
        exit()
        
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:
import sys

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(N*pow(100,D)))

Submission status: Wrong Answer

Solution code:
L, R = map(int,input().split())
print((100**L)*(int(R-1)/99)+R)

Submission status: Wrong Answer

Solution code:
L, R = map(int,input().split())
print((100**L)*int((R-1)/99)+R)

Submission status: Wrong Answer

Solution code:
L, R = map(int,input().split())
print((100**L)*R)

Submission status: Wrong Answer

Solution code:
import sys
 
stdin = sys.stdin

mod = 1000000007
inf = 1 << 60
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()

d, n = na()

m = n
for i in range(d):
    m *= 100

print(m)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
ans=0
m=0
while True:
  ans+=1
  if ans//100==d:
    m+=1
    if n==m:
      break
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

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

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

d, n = list(map(int, sys.stdin.buffer.readline().split()))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = list(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:
# coding: utf-8
# Your code here!
d,n=map(int,input().split())
print(100**d*n)

Submission status: Wrong Answer

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

while True:
    ans += add
    if d == 0:
        if ans % 100 != 0:
            cnt += 1
    else:
        if ans % (100 ** d) == 0:
            cnt += 1
    if cnt == n:
        break
print(ans)

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:
"""
author : halo2halo
date : 24, Jan, 2020
"""

import sys

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b = map(int, readline().split())
print(100**a*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from __future__ import print_function

import sys
input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return


# import re
# import array
# import copy
# import functools
# import operator

# import math
# import string
# import fractions
# from fractions import Fraction
from fractions import gcd

# import collections
# import itertools
# import bisect

# import heapq
# from heapq import heappush
# from heapq import heappop
# from heapq import heappushpop
# from heapq import heapify
# from heapq import heapreplace
# from queue import PriorityQueue as pq
from queue import Queue

# from itertools import accumulate

# from collections import deque
# from collections import Counter

# from operator import mul
# from functools import reduce

# def lcm(n,m):
#     return int(n*m/gcd(n,m))


def coprimize(p, q):
    common = fractions.gcd(p, q)
    return (p // common, q // common)


def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


# import random
# import time

d, n = map(int, input().strip().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 d == 1:
    if n == 100:
        print((n+1)*100)
    else:
        print(n*100)
elif d == 2:
    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)
elif d == 2:
    print((n)*10000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, raw_input().split())
ans = 1
c = 0
for i in range(a):
    ans = ans * 100
print ans * b

Submission status: Wrong Answer

Solution code:
d, n = map(int, raw_input().split())
ans = 1
for i in range(d):
    ans = ans * 100
print ans * n

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
ans = 0
cnt = 0
for ans in range(1, 10000000):
    if ans % (100 ** d) == 0:
        cnt += 1
        if (cnt == n):
            print(ans)
            exit()

Submission status: Wrong Answer

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

c = pow(100, d)

a = c * n

print(a)

Submission status: Wrong Answer

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

ans = N * 100 ** D

if D == 0 and N >= 100:
    ans += N // 100

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

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

Submission status: Wrong Answer

Solution code:
import math
a,b = map(int, input().split(' '))
c = int(b//math.pow(100,(a+1)))
d = int(b//math.pow(100,(a+2)))
# print(a,b,c)
print(int(b*math.pow(100,a))+c+d)

Submission status: Wrong Answer

Solution code:
import math
a,b = map(int, input().split(' '))
c = int(b//math.pow(100,(a+1)))
print(int(b*math.pow(100,a))+c)

Submission status: Wrong Answer

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

print(int(b*math.pow(100,a)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

result = 0
for i in range(1,n+1):
  if i // 100 == 0:
    result = i*(100**d)
  else:  
    result = i*(100**d)+1

print(result)

Submission status: Wrong Answer

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

result = 0
for i in range(1,n+1):
  if i // 100 == 0:
    result = i*(100**d)
#  else:
 #   j = 0
  #  while not(((i+j) //100 == 0)):
   #   j += 1

    #result = (i+j)*(100**d)

print(result)

Submission status: Wrong Answer

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

result = 0
for i in range(1,n+1):
  if (i*100**d) // (100**d) // 100 == 0:
    result = i*100**d
  else:
    j = 0
    while not(((i+j)*100) // (100**d) //100 == 0):
      j += 1
      result = (i+j)*(100**d)

print(result)

Submission status: Wrong Answer

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

result = 0
if d == 0:
  for i in range(1,n+1):
    if i % 100 != 0:
      result = i
    else:
      j = 0
      while (i+j) %100 == 0:
        j +=1
        result = i+j

else:
  for i in range(1,n+1):
    result = 100**d*i

print(result)

Submission status: Wrong Answer

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

result = 0
if d == 0:
  result = n

else:
  for i in range(1,n+1):
    result = 100**d*i

print(result)

Submission status: Wrong Answer

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

result = 0
if d == 0:
  result = n

else:
  for i in range(1,n+1):
    result = 100*d*i

print(result)

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())
l = []
l.append(str(n))
for i in range(d):
    l.append("00")
print("".join(l))

Submission status: Wrong Answer

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

div = 100 ** D

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

Submission status: Wrong Answer

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

div = 100 ** D

print(N * div)

Submission status: Wrong Answer

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

div = 100 ** D

print(div)
print(N * div)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if 100*D == 0:
    number = 1
else:
    number = 100**D



print(N*number)

Submission status: Wrong Answer

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

if 100*D == 0:
    number = 1
else:
    number = 100**D

ans = []

for i in range (1,N+1):
    kotae = number*i
    ans.append(kotae)

print(ans[-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)
else:
  print(N * (D*100))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
d = 100**d
aa = []
    
for i, num in enumerate(range(100)):
    num *= d
    if i==n:
        print(num)
        break

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 = list(map(int, input().split()))
cnt = 0
i = 1
while True:
  if(i % (100 ** d) == 0):
    cnt += 1
  if(cnt == n):
    print(i)
    exit()
  i += 1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main(d, n):
    print((100**d) * n)


if __name__ == "__main__":
    d, n = map(int, input().split())

    main(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)
elif D == 2:
  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)
elif D == 2:
  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 * 10 ** 2)
elif D == 2:
  print(N * 10 ** 4)

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

i = 0
count = 0

while not count == n:
    i += 1
    if i % 100 == 0:
        continue
    count += 1

print(i)

Submission status: Wrong Answer

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

i = 0
count = 0

while not count == n:
    i += 1
    if i % 100 == 0:
        continue
    else:
        count += 1

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

start_num = 0


if d == 0:
    start_num = 1
elif d == 1:
    start_num = 100
else:
    start_num = 10000

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

start_num = 0
ans_num = 0
count = 0


if d == 0:
    start_num = 1
elif d == 1:
    start_num = 100
else:
    start_num = 10000

while not count == n:
    ans_num += start_num
    count += 1

print(ans_num)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if n == 100:
    print('1010000')
else:
    print(100 ** d * n)

Submission status: Wrong Answer

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

ans = (100 ** d) * (n if n == 100 else 101)

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:
import sys
input = sys.stdin.readline
D,N = [int(i) for i in input().split()]
ans = (100 ** D) * N
if N == 100 :
    ans +=1
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
D,N = [int(i) for i in 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*(101**D))

Submission status: Wrong Answer

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

if d == 1 and n == 100:
    print("10100")
elif d == 2 and n == 100:
    print("1010000")
else:
    print(int(100**d * n))

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())  #複数数値入力　「A B」みたいなスペース空いた入力のとき

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

print((100**d)*n)

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

while n > 0:
    a += 100**d
    n -= 1
print(a)

Submission status: Wrong Answer

Solution code:
# 問題文の意味はわからんけど（ちょうど1回、ちょうど2回割り切れる？？？？は？？？？？？？？）サンプルを適当に読む
d, n = map(int, input().split())
if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
elif d == 1:
    if n == 100:
        print(101 * 100)
    else:
        print(n * 100)
else:
    if n == 100:
        print(101 * 10000)
    else:
        print(n * 100)

Submission status: Wrong Answer

Solution code:
# 問題文の意味はわからんけど（ちょうど1回、ちょうど2回割り切れる？？？？は？？？？？？？？）サンプルを適当に読む
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())

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())
if b != 100:
    print(b * (100 ** a))
else:
    print(b * (100 ** a)+1)

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(b * 10 ** (a*2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
ncos = 0
for i in range(1,10**6+1):
    if i%(100**d) == 0:
        ncos += 1
        if ncos == n:
            print(i)
            exit()

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
a=[]
if d!=0:
    print(100**d*n)
else:
    for i in range(1,2*n):
        if i!=100:
            a.append(i)
    print(a[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())
a=[]
for i in range(1,n+1):
    a.append(100**d *i)
print(a[n-1])

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

else:
    if n==100:
        print(10000+10000*n)
    else:
        print(10000*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())

if d == 0:
    print(n)

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

Submission status: Wrong Answer

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

cnt = 0
n = 1
while True:
    x = n * 100 ** D
    if x % 100 ** D == 0:
        cnt += 1
    if cnt == N:
        print(x)
        exit()
    n += 1

Submission status: Wrong Answer

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

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

if d==1 and n==100:
    print(10001)
elif d==1:
  print(100*n)
  
if d==2 and n==100:
    print(1000001)
elif d==2:
  print(10000*n)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

n = 1

for i in range(1, D+1):
        n *= 100

print(n * N)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
D, N = [int(x) for x in input().split()]
ans = []
for i in range(1, 1010000):
    if i % (100 ** D) == 0:
        ans.append(i)
print(ans[N-1])

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
D, N = [int(x) for x 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 n==100:
    print(100**d+101)
    exit()
print(n*100**d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = list(map(int, input().split()))
if a!=0:
  n = b%100
  print(100**a * (b+n))
elif a==0:
  if b<100:
    print(b)
  else:
    n = b%100
    print(b+n)

Submission status: Wrong Answer

Solution code:
a,b = list(map(int, input().split()))
if a!=0:
  ans = 100**a
  print(ans * b)
elif a==0:
  if b<100:
    print(b)
  else:
    n = b%100
    print(b+n)

Submission status: Wrong Answer

Solution code:
a,b = list(map(int, input().split()))
if a!=0:
  print(100**a * b)
elif a==0:
  if b<100:
    print(b)
  else:
    n = b%100
    print(b+n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# データ読み込み

import sys
from collections import deque

def input_data(d=""):
  t = sys.stdin.read()
  if t:
    return t
  else:
    if d[0] == "\n":
      d = d[1:]
    if d[-1] == "\n":
      d = d[:-1]    
    return d

A, B  = map(int,input_data().split())

out = 100 ** A * B

print(out)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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*10000)

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()