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

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

Submission status: Wrong Answer

Solution code:
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

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

Submission status: Wrong Answer

Solution code:
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

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

Submission status: Wrong Answer

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

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

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())
if d == 0:
  num = 1
elif d == 1:
  num = 100
else:
  num = 1000
 
if n == 100:
  print(101 * num)
else:
  print(n * num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# https://atcoder.jp/contests/abc100/tasks/abc100_b
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())
answer = 0

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

Submission status: Wrong Answer

Solution code:
#100B

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if D==0:
    print(N)
if D==1:
    print(a)
if D==2:
    print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    D, N = list(map(int, input().split()))
    mod = 100 ** D
    cnt = 0
    i = 1
    while True:
        if i % mod == 0:
            cnt += 1
        if cnt == N:
            print(i)
            break
        i += 1


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(b*10**(2*a)))

Submission status: Wrong Answer

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

print(b*10**(2*a))

Submission status: Wrong Answer

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

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())
l = [i for i in range(1,1010001) if i % (100**d) == 0]
print(l[n-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

def main():
  input = sys.stdin.readline
  D, N = map(int, input().split())
  if D == 0 and N < 100:
    print(N)
  elif D == 0:
    print(N+1)
  elif N < 100:
    print(D*100*N)
  else:
    print(D*100*(N+1))


if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

print([i * (100 ** d) for i in range(1, 101)][n - 1])

Submission status: Wrong Answer

Solution code:
from sys import stdin
d,n=[int(x) for x in stdin.readline().rstrip().split()]
x=1
for i in range(d):
    x*=100
ans=0
for i in range(n):
    ans+=x
print(ans)

Submission status: Wrong Answer

Solution code:
D_N = [int(i) for i in input().split()]
t = 0
q = 100 ** D_N[0]
i = 0


while(D_N[1]):
    i = i+1
    t = t + q
    
    if D_N[0] == 0 and i == 100:
        print(t + q)
        break

    if i == D_N[1]:
        print(t)
        
        break

Submission status: Wrong Answer

Solution code:
D_N = [int(i) for i in input().split()]
t = 0
q = 100 ** D_N[0]
i = 0


while(D_N[1]):
    if D_N[0] == 0 and i == 100:
        print('101')
        break
    
    t = t + q
    i = i+1
    if i == D_N[1]:
        print(t)
        
        break

Submission status: Wrong Answer

Solution code:
D_N = [int(i) for i in input().split()]
t = 0
q = 100 ** D_N[0]
i = 0


while(D_N[1]):
    if D_N[0] == 0:
        print('101')
        break
    
    t = t + q
    i = i+1
    if i == D_N[1]:
        print(t)
        
        break

Submission status: Wrong Answer

Solution code:
D_N = [int(i) for i in input().split()]
t = 0
q = 100 ** D_N[0]
i = 0
while(D_N[1]):
    t = t + q
    i = i+1
    if i == D_N[1]:
        break
print(t)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
D,N=[int(x) for x in stdin.readline().rstrip().split()]
if D==0:
    ans=N
else:
    ans=D**2*N
print(ans)

Submission status: Wrong Answer

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

if(a==0 and b == 100):
    print(101)
else:
    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())

print((100**d)*(n-1))

Submission status: Wrong Answer

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

print(100**d+n-1)

Submission status: Wrong Answer

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

print(100**d+n)

Submission status: Wrong Answer

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

print(100**d * n)

Submission status: Wrong Answer

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

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(1000001)
    else:
        print(N*10000)
else:
    if N==100:
        print(100000001)
    else:
        print(N*1000000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
if N == 100:
    N + 1
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)
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=[int(i) for i 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=[int(i) for i in input().split()]
result=n
for j in range(d):
    result*=100
print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
class Solver(object):
    def __init__(self):
        self.d, self.n = list(map(int, input().split(" ")))

    def solve(self):
        if self.d == 0:
            if self.n % 100 > 0:
                self.n += 1
            print(self.n)
        elif self.d == 1:
            if self.n % 100 > 0:
                self.n += 1
            print("{}00".format(self.n))
        else:  # d == 3
            if self.n % 100 > 0:
                self.n += 1
            print("{}0000".format(self.n))


if __name__ == "__main__":
    s = Solver()
    s.solve()

Submission status: Wrong Answer

Solution code:
class Solver(object):
    def __init__(self):
        self.d, self.n = list(map(int, input().split(" ")))

    def solve(self):
        if self.d == 0:
            if self.n % 100 > 0:
                print(self.n+1)
            else:
                print(self.n)
        elif self.d == 1:
            print("{}00".format(self.n))
        else:  # d == 3
            print("{}0000".format(self.n))


if __name__ == "__main__":
    s = Solver()
    s.solve()

Submission status: Wrong Answer

Solution code:
class Solver(object):
    def __init__(self):
        self.d, self.n = list(map(int, input().split(" ")))

    def solve(self):
        if self.d == 0:
            print(self.n)
        elif self.d == 1:
            print("{}00".format(self.n))
        else:  # d == 3
            print("{}0000".format(self.n))


if __name__ == "__main__":
    s = Solver()
    s.solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Tue Feb 12 15:50:41 2019

@author: shinjisu
"""


import math


def getInt(): return int(input())


def getIntList(): return [int(x) for x in input().split()]


def zeros(n): return [0]*n


def dmp(x):
    global debug
    if debug:
        print(x)


# ABC 100 B
def abc100b():
    D, N = getIntList()
    return N*100**D


debug = False  # True False
print(abc100b())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(n*(100**d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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)

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:
    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 and N == 100:
    print(101)
    exit()
if D == 1 and N == 100:
    print(10001)
    exit()

if D == 2 and N == 100:
    print(1000001)
    exit()

print(100**D*N)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
if D == 0 and N == 100:
    print(101)
    exit()
if D == 1 and N == 10000:
    print(10001)
    exit()

if D == 2 and N == 1000000:
    print(1000001)
    exit()

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

Submission status: Wrong Answer

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math
import fractions

def j(q):
    if q==1: print("AC")
    else:print("WA")
    exit(0)


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())

#n = ip()                              #入力整数1つ
d,n= (int(i) for i in input().split())      #入力整数横2つ
#x,y,z = (int(i) for i in input().split())    #入力整数横3つ
#n,m,x,y= (int(i) for i in input().split())  #入力整数横4つ
#a = [int(i) for i in input().split()]        #入力整数配列
#a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列

#jの変数はしようできないので注意
#xor は(a ^ b)でいける
if n == 100:
    print(pow(100,d)*n+1)
else :print(pow(100,d)*n)

Submission status: Wrong Answer

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math
import fractions

def j(q):
    if q==1: print("AC")
    else:print("WA")
    exit(0)


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())

#n = ip()                              #入力整数1つ
d,n= (int(i) for i in input().split())      #入力整数横2つ
#x,y,z = (int(i) for i in input().split())    #入力整数横3つ
#n,m,x,y= (int(i) for i in input().split())  #入力整数横4つ
#a = [int(i) for i in input().split()]        #入力整数配列
#a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列

#jの変数はしようできないので注意
#xor は(a ^ b)でいける

print(pow(100,d)*n)

Submission status: Wrong Answer

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

print((100**D)*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    D,N = map(int, lines.pop(0).split(' '))
    num = 100 ** D
    print(num * N)
    

#
# main
#

## 1. use list instead of stdin
#
#contents = '''\
#2 10\
#'''
#lines = contents.split('\n')
#
# 2. use stdin

lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    D,N = map(int, lines.pop(0).split(' '))
    num = 100 ** D
    print(num * N)


#
# main
#

# 1. use list instead of stdin

# contents = '''\
# 0 5\
# '''
# lines = contents.split('\n')

# 2. use stdin

lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# encoding:utf-8

import copy
import numpy as np
import random

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

Submission status: Wrong Answer

Solution code:
# encoding:utf-8

import copy
import numpy as np
import random

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

Submission status: Wrong Answer

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


main()

Submission status: Wrong Answer

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


main()

Submission status: Wrong Answer

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

n = 100 ** D
answer = n * N

print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

ans = 0

for _ in range(N):
    ans += 100**D

print(ans)

Submission status: Wrong Answer

Solution code:
def func(x):
    c = 0
    n = x
    while True:
        if n < 100:
            break

        if n % 100 == 0:
            c += 1
            n = n // 100
        else:
            break
    return c


def main():
    d, n = map(int, input().split())

    # i = 1
    i = 10000
    count = 0
    if d == 0:
        while True:
            if i % 100 != 0:
                count += 1
            if count == n:
                break
            i += 1
    else:
        while True:
            if i % 100 == 0 and func(i) == d:
                count += 1
            if count == n:
                break
            # i += 1
            i += 1000
    print(i)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

    i = 1
    count = 0
    while True:
        if d == 0:
            if i % 100 != 0:
                count += 1
        else:
            if i % (100 ** d) == 0:
                count += 1

        if count == n:
            break
        i += 1

    print(i)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

    i = 1
    count = 0
    while True:
        if i % (100 ** d) == 0:
            count += 1

        if count == n:
            break
        i += 1

    print(i)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

    if d == 0:
        start = 1
    elif d == 1:
        start = 100
    else:
        start = 100 ** 2

    print(n * start)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

    if d == 0:
        start = 1
    elif d == 1:
        start = 100
    else:
        start = 100 ** 2

    print(start + (n - 1) * start)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
dn=[int(x) for x in input().split()]
print(dn[1]*(100**dn[0]))

Submission status: Wrong Answer

Solution code:

base = [ 100**i//100 for i in range(1,4) ]

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

print( base[d]*n + base[d]*n//(100) )

Submission status: Wrong Answer

Solution code:

base = [ 100**i//100 for i in range(1,4) ]

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

print( base[d]*n + n//(base[d]*100) )

Submission status: Wrong Answer

Solution code:

base = [ 100**i//100 for i in range(1,4) ]

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

print( base[d]*n )

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys 

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

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

Submission status: Wrong Answer

Solution code:
import sys

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def chk(n):
    for _ in [0]*D:
        if n % 100 == 0:
            n //= 100
            continue
        else:
            return False
    return True

i = 0
cnt = 0
while cnt < N:
    i += 1
    if chk(i):
        cnt += 1

print(i)

Submission status: Wrong Answer

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

def chk(n):
    for _ in [0]*D:
        if n % 100 == 0:
            n //= 100
            continue
        else:
            return False
    return True

i = 1
cnt = 0
while cnt < N:
    i += 1
    if chk(i):
        cnt += 1

print(i)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
A = []
for i in range(b+1):
    A.append(i*(100**a))
if(b!=100):
    print(A[b])
else:
    print(A[99]+100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
input = sys.stdin.readline

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
input = sys.stdin.readline

D, N = map(int, input().split())
print(pow(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())
if a == 0:
    print(b)
elif a == 1:
    print(b*100)
else:print(b*10000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
count = 0
i = 1
l = []
while count < N:
    l.append(pow(100, D) * i)
    count += 1
    i += 1
print(l[N-1])

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
D,N = map(int,input().split())
if N == 0:
  print(D)
else:
  print(N*(100**D))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
D,N = map(int,input().split())
if D == 0:
  print(D)
else:
  print(N*(100**D))