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:
def main():
    D, N = [int(i) for i in input().split()]

    ans = (10**D)**2 * N
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

print(a*n)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
counter = 1
num = 100**D
from math import log
while counter < N:
    num += 100**D
    if int(log(num, 100)) == D:
        counter += 1
print(num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int,input().split())
s = 0
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())
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:
import math
d, n = map(int, input().split())
print(int(math.pow(100, d)) * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans=[]

for i in range(1,N+1):
    Ans = (100 ** D) *(i)
    ans.append(Ans)

print(ans[N-1])

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:
import sys
x,y = map(int, input().split())
if x == 0:
    print(y)
else:
    print((100 ** x)  *y)

Submission status: Wrong Answer

Solution code:
import sys
x,y = map(int, input().split())
if x == 0:
    print(y)
else:
    print(x * 100  *y)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

# code here
a, b = map(int, input().strip().split())

print(100 ** a * b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
li = input()
lo = li.split(" ")
D = int(lo[0])
N = int(lo[1])
num = 100**D
if num == 0:
  num = 1
print(num*N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
print(eval("100**%s*%s" % tuple(input().split())))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

div_num = 100 ** d

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

Submission status: Wrong Answer

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

div_num = 100 ** d

if d == 0:
    print(n)
else:
    print(div_num * n)

Submission status: Wrong Answer

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

print((100**D)* N)

Submission status: Wrong Answer

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

if D == 0:
    if N<100:
        print(N)
elif D == 1:
    if N<10000:
        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:
a = input()
a = a.split()
D = int(a[0])
N = int(a[1])
ans = (100 ** D) * N
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

#output
if D == 0:
    print(N)
elif D == 1:
    if N == 100:
        print(10100)
    else:
        print(100*N)
else:
    if N == 100:
        print(1010000)
    else:
        print(100**2*N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
data = list(map(int,input().split()))
D = data[0]
N = data[1]

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

print(R)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys


def solve(D: int, N: int):
    if N == 100:
        print(N + 100**D)
    else:
        print((100**D)*N)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  # type: int
    N = int(next(tokens))  # type: int
    solve(D, N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys


def solve(D: int, N: int):
    print(100**D*N)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  # type: int
    N = int(next(tokens))  # type: int
    solve(D, N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
L=[]
if D==0:
  for i in range(1,101):
    L.append(i)
elif D==1:
  for i in range(100,10100,100):
    L.append(i)
elif D==2:
  for i in range(10000,1010000,10000):
    L.append(i)
print(L[N-1])

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
s=0
L=[]
if D==0:
  for i in range(1,101):
    L.append(i)
elif D==1:
  for i in range(100,10100,100):
    L.append(i)
elif D==2:
  for i in range(10000,1010000,10000):
    L.append(i)
print(L[N-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((100**d) * n)

Submission status: Wrong Answer

Solution code:
DN = list(map(int,input().split()))
D=DN[0]
N=DN[1]

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

Submission status: Wrong Answer

Solution code:
DN = list(map(int,input().split()))
D=DN[0]
N=DN[1]

if D==0:
    print(N)

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

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

Submission status: Wrong Answer

Solution code:
DN = list(map(int,input().split()))
D=DN[0]
N=DN[1]

if D==0:
    print(N)

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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 (n)
	else:
		print (n+1)
elif d == 1:
	if n != 100:
		print (n * 100)
	else:
		print (n*100 + 100)
else:
	if n != 100:
		print (n * 10000)
	else:
		print (n*10000 + 100000)

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

elif D == 2:
    num = [i*10000 for i in range(1, N+1)]

elif D == 0:
    num = [i for i in range(1, N+1)]

print(num[-1])

Submission status: Wrong Answer

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

print(b * (100 ** a))

Submission status: Wrong Answer

Solution code:
def examB():
    D, N = LI()
    ans = (100**D)*N
    print(ans)


import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examB()

Submission status: Wrong Answer

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

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

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

# for D in range(0,3):
#     for N in range(1,101):
print("D, N = ",D,N,str(N+int(N==100))+"00"*D)

Submission status: Wrong Answer

Solution code:
##### 解けた #####

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

print(str(N)+"00"*D)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

syo = n // 99
amari = n % 99

if d == 0:
    print(syo*100 + amari)

elif d == 1:
    print(syo*10000 + amari*100)

else:
    print(syo*1000000 + amari*10000)

Submission status: Wrong Answer

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

syo = n // 99
amari = n % 99

if d == 0:
    print(syo + amari)

elif d == 1:
    print(syo*10000 + amari*100)

else:
    print(syo*1000000 + amari*10000)

Submission status: Wrong Answer

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

syo = n // 99
amari = n % 99

if d == 0:
    print(syo + amari)

elif d == 1:
    print(syo*100 + amari*100)

else:
    print(syo*10000 + amari*10000)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(n*(100**d))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
K = 1
count = 0
if(D == 0):
    while(True):
        A = K
        cnt = 0
        while(A>0):
            if(A % 100 == 0):
                cnt += 1
            A /= 100
        if(cnt == D):
            count +=1
        if(count == N):
            print(K)
            break
        K += 1
else:
    ans = 100 ** D * N
    print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
K = 1
count = 0
if(N == 100 and D ==0):
    print(101)
else:
    while(True):
        if(K % (100**D) == 0):
            count +=1
        if(count == N):
            print(K)
            break
        K += 1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = tuple(int(num) for num in input().split())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
import fractions

d,n = [int(x) for x in stdin.readline().rstrip().split()]

print(100**d*n)

Submission status: Wrong Answer

Solution code:
from sys import stdin
import fractions

d,n = [int(x) for x in stdin.readline().rstrip().split()]

if d==0:
    print(n)

else:
    print(100**d*n)

Submission status: Wrong Answer

Solution code:
# ABC 100: B – Ringo's Favorite Numbers
d, n = [int(s) for s in input().split()]
if n % 100 != 0:
    print(n * 100 ** d)
else:
    print(int(n * 100 ** (d - 1)))

Submission status: Wrong Answer

Solution code:
# ABC 100: B – Ringo's Favorite Numbers
d, n = [int(s) for s in input().split()]
if n % 100 != 0:
    print(n * 100 ** d)
else:
    print(n * 100 ** (d - 1))

Submission status: Wrong Answer

Solution code:
# ABC 100: B – Ringo's Favorite Numbers
d, n = [int(s) for s in input().split()]
print(n * 100 ** d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys


def input(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')


sys.setrecursionlimit(10**8)
inf = float('inf')
mod = 10**9+7

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
mod = 10**9+7

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
nums = []
for i in range(1, 10**7):
    if i % 100**D != 0:
        num = 100 ** D * i
        nums.append(num)
        if len(nums) == N:
            print(nums[-1])
            break

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
nums = []
for i in range(1, 10**7):
    if i // 100**D < D:
        num = 100 ** D * i
        nums.append(num)
        if len(nums) == N:
            print(nums[-1])
            break

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
nums = []
for i in range(1, 10**8):
    if i // 100**D < 9:
        num = 100 ** D * i
        nums.append(num)
        if len(nums) == N:
            print(nums[-1])
            break

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
nums = []
for i in range(1, 10**6):
    if i // 100**D < 9:
        num = 100 ** D * i
        nums.append(num)
        if len(nums) == N:
            print(nums[-1])
            break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
nums = []
for i in range(1, 10**4):
    num = 100 ** D * i
    if num % 100**D == 0 and num // 100**D == i:
        nums.append(num)
print(nums[N - 1])

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:
#                         author:  kagemeka 
#                         created: 2019-11-08 12:38:16(JST)
## internal modules
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator
## external modules
# import scipy.special   # if use comb function on AtCoder, 
# import scipy.misc      # select scipy.misc.comb (old version) 

def main():
    d, n = (int(x) for x in sys.stdin.readline().split())
    if n < 100:
        ans = n * 100 * d
    else:
        ans = 101 * 100 * d
    
    print(ans)


if __name__ == "__main__":
    # execute only if run as a script
    main()

Submission status: Wrong Answer

Solution code:
#                         author:  kagemeka 
#                         created: 2019-11-08 12:38:16(JST)
## internal modules
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator
## external modules
# import scipy.special   # if use comb function on AtCoder, 
# import scipy.misc      # select scipy.misc.comb (old version) 

def main():
    d, n = (int(x) for x in sys.stdin.readline().split())
    ans = n * 100 ** d
    print(ans)


if __name__ == "__main__":
    # execute only if run as a script
    main()

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((100 ** D) * N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A = list(map(int,input().split()))
a = A[0]
b = A[1]
if b == 100:
  b=b//100
  a = 100**a
  s = a*b
else:
  a = 100**a
  s = a*b  
print(int(s))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A = list(map(int,input().split()))
a = A[0]
b = A[1]
if b == 100:
  b = b / 100
  a = 100**a
  s = a*b
  print(int(s))
else:
  a = 100**a
  s = a*b
  print(int(s))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(100**d * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t = 1
if D == 1:
    t = 100
if D == 2:
    t = 10000

for i in range(1, N+1):
    ans = t * i
print(ans)

Submission status: Wrong Answer

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

t = 1
if D == 1:
    t = 100
if D == 2:
    t = 10000

for i in range(N+1):
    ans = t * i
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
INF = float("inf")


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

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
if D == 0:
    tmp = list(range(1,100))
    tmp.append(101)
elif D == 1:
    tmp = list(range(100,10000,100))
    tmp.append(100100)
else:
    tmp = list(range(10000,1000000,10000))
    tmp.append(1010000)
print(tmp[N-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
d,n=map(int,input().split())
if d==0 and n==100:
    print(101)
    quit()
print(n*(100)**d)

Submission status: Wrong Answer

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
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:
d, n = map(int,input().split())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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