Problem:


Score: 200 points

Problem Statement

Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.

As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.

Find the N-th smallest integer that would make Ringo happy.

Constraints

D is 0, 1 or 2.

N is an integer between 1 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:

D N

Output

Print the N-th smallest integer that can be divided by 100 exactly D times.

Sample Input 1

0 5

Sample Output 1

5

The integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...

Thus, the 5-th smallest integer that would make Ringo happy is 5.  

Sample Input 2

1 11

Sample Output 2

1100

The integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \ 000, 1 \ 100, ...

Thus, the integer we are seeking is 1 \ 100.

Sample Input 3

2 85

Sample Output 3

850000

The integers that can be divided by 100 exactly twice are as follows: 10 \ 000, 20 \ 000, 30 \ 000, ...

Thus, the integer we are seeking is 850 \ 000.



Sample input:
0 5


Sample output:
5

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
lis=input().split(" ")
d=int(lis[0])
n=int(lis[1])
print(n*(100**d))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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

print(n * (100 ** d))

Submission status: Wrong Answer

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

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

print(str(N) + '00'*int(D))

Submission status: Wrong Answer

Solution code:
a, b = (int(i) for i in input().split())
print(b * pow(100, a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

out =( 100 ** a ) * b

print(out)

Submission status: Wrong Answer

Solution code:
from sys import stdin

D, N = map(int, stdin.readline().rstrip().split())

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
if D <= 2 and N >= 1 and N <= 100:
    p = pow(100,D)
    num = 0
    for i in range(N):
        num += p
    print(num)

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    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 and N<100:
  print(N)

elif D==1 and N<100:
  print(100*N)
  
elif D==2 and N<100:
  print(10000*N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from sys import stdin, stdout
input = lambda: stdin.readline().rstrip()
println = stdout.write

def main():
    D, N = map(int, input().split())

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

main()

Submission status: Wrong Answer

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

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

    print(X)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

if d==0:
    print(n)
else:
    N=0
    a = 100**d
    for i in range(0,n):
        N = N + a
    print(N)

Submission status: Wrong Answer

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

if a == 0:
    print(b)
elif a == 1:
    print(b*100**1)
elif a == 2:
    print(b*100**2)
else:
    pass

Submission status: Wrong Answer

Solution code:
D, N = map(int, raw_input().split())
if N == 100:
 if D == 0:
    print(101)
 elif D == 1:
    print(10001)
 elif D == 2:
    print(1000001)

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

Submission status: Wrong Answer

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

list_ = []
for k in range(1, 101):
    str_ = str(k) + "00"*D
    int_ = int(str_)
    list_.append(int_)

if N == 100:
    str_ = "1" + "00"*(D+1)
    int_ = int(str_)
    print(int_ +1)
else:
    print(list_[N-1])

Submission status: Wrong Answer

Solution code:

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

if A == 0:
    print(B)
elif B == 100:
    print(101*100**A)

else:
    print(B * 100 ** A)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


def main():
    D, N = map(int, input().split())

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a, b = (int(i) for i in input().split())
print(a * pow(100, b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = pow(100,D) * N

if ans % 100:
    ans = ans + 1
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

D, N = map(int, stdin.readline().rstrip().split())

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

Submission status: Wrong Answer

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

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

if d==0:
    print(n)
if d==1:
    if n<100:
        sub=n*100
    elif n==100:
        sub=(n+1)*100
    print(sub)
if d==2:
    if n<100:
        sub2=n*10000
    elif n==100:
        sub2=(n+1)*10000
    print(sub2)

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
c = 0
a = 100**d
for i in range(n):
    c += a
if n == 100:
    c /= 100
print(c)

Submission status: Wrong Answer

Solution code:
a,b =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 n == 100:
    print(0)
else:
    num = (100**d)*n
    print(num)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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

print(n * 100 ** d)

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())
ans = 0
num = 100**x
for i in range(1,y+1):
    ans = num*i
if(y == 0):
    ans = num
print(ans)

Submission status: Wrong Answer

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

cnt = 0
ans = 0

while cnt != N:
    ans += 1
    if ans % (100 ** D) == 0:
        cnt += 1

print(ans)

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

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

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:
D, N = [int(i) for i in input().split()]
ans = N*pow(100, D)
if D == 0 and N == 100:
    ans += 1
elif N == 100:
    ans += 100
print(ans)

Submission status: Wrong Answer

Solution code:
def m():
    d, n = map(int, input().split())
    if d == 0:
        return n
    return (100 **d)*n


print(m())

Submission status: Wrong Answer

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

if a[0] == 0:
    if a[1] == 100:
        print(101)
    else:
        print(a[1])
elif a[0] == 1:
    print(a[1]*100)
elif a[0] == 2:
    print(a[1]*10000)

Submission status: Wrong Answer

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

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+N//100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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

a = 0
if d == 0:
    a = n
    if n == 100:
        a += 1
elif d == 1:
    a = 100 * n
elif d == 2:
    a = 100 * 100 * n

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = (int(x) for x in input().split())
if d > 0 and n == 100:
    n == 101
print('{0}{1}'.format(n, '00' * d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#input one int
#a = int(input())

#input some val
#a, b, c = (int(i) for i in input().split())
#val = [[int(i) for i in input().split()] for i in range(N)]

#input matrix
#a = [input().split() for i in range()]

D, N = (int(i) for i in input().split())

if(D == 0):
    if(N%100 == 0):
        print(N+(N//100))
    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:
    if N %100 == 0:
        print(N+1)
    else: 
        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 == 1:
  print(100 * N)
elif D == 2:
  print(10000 * N)

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split(" "))
if( b < (100**(a+1))):
    print((100**a)*b)
else:
    n = int (b / (100**(a+1)))
    print((100 ** a) * b + n)

Submission status: Wrong Answer

Solution code:
nums = [int(i) for i in input().split()]

if nums[0] == 0:
    print(nums[1])
elif nums[0] == 1:
    print(nums[1] * 100)
else:
    print(nums[1] * 10000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

start = pow(n, d)

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

Submission status: Wrong Answer

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

print(100**n*m if m !=100 else 100**n*m+1)

Submission status: Wrong Answer

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

a = 1
for i in range(d):
	a *= 100
	
print str(a*n)

Submission status: Wrong Answer

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

x = 100 ** d

if n != 100:
    print(x * n)
else:
    print(x*n+1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(N * (100 ** D))

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
ans = [[(100**j)*i for i in range(1, 101)] for j in range(3)]
print(ans[D][N-1])

Submission status: Wrong Answer

Solution code:
(d, n) = [int(e) for e in input().split()]
if d == 0:
    ge = int(n / 100)
    print(n + ge)
elif d == 1:
    ge = int(n / 100)
    print((n + ge) * 100)
elif d == 2:
    print(n * 10000)

Submission status: Wrong Answer

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


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

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

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

if __name__ == "__main__":
        main()

Submission status: Wrong Answer

Solution code:
d, n = (int(x) for x in input().split())
if d > 0 and n == 100:
    d, n = d + 1, 1
print('{0}{1}'.format(n, '00' * d))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print((100**a)*b)

Submission status: Wrong Answer

Solution code:
ip = input().split()
usdata = []
D = int(ip[0])
N = int(ip[1])

b_number = 100 ** D
a_number = b_number * N

print(a_number)

Submission status: Wrong Answer

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

import calendar as cal

i = input().split(' ')
d = int(i[0])
n = int(i[1])


if d == 0:
    print(n)
else:
    c = 0
    sa = 100**d
    z = sa
    maxN = 99 * z
    a = z + sa*(n-1)
    print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
multi_0 = [a for a in range(1,101)]
multi_100 = [a for a in range(100,10001) if a % 100 == 0]
multi_10000 = [a for a in range(10000, 1000001) if a % 10000 == 0]

D, N = map(int, input().split())
if D == 0:
    print(multi_0[N-1])
elif D == 1:
    print(multi_100[N-1])
elif D == 2:
    print(multi_10000[N-1])

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
inp = input()
inp2 = inp.split()
A=int(inp2[0])
B=int(inp2[1])
C = B*(100**A)
print(C)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
D = a[0]
N = a[1]
ans = pow(100,D) * N
print(ans)

Submission status: Wrong Answer

Solution code:
from itertools import islice

def nth(iterable, n, default=None):
        "Returns the nth item or a default value"
        return next(islice(iterable, n, None), default)

def gen_numbers(D):
        n = 100**D
        while True:
                yield n
                n += 100**D 
        
D, N = [int(i) for i in input().split()]
print(nth(gen_numbers(D), N-1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
inp = input()
print("a")
inp2 = inp.split()
A=int(inp2[0])
B=int(inp2[1])
C = B*(100**A)
print(C)

Submission status: Wrong Answer

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

X = 100 ** D * N

print(X)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
p = pow(100,D)
num = 0
for i in range(N):
    num += p
print(num)

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-
if __name__ == "__main__":
    d, n = map(int, input().split())
    core = 100**d
    factors = [ core*tmp for tmp in range(1,101) ]
    print(factors[n-1])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
inp = input()
print("a")
inp2 = inp.split()
A=int(inp2[0])
B=int(inp2[1])
print(B*100**A)

Submission status: Wrong Answer

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

if str(n[0]) == '0':
    print(str(n[1]))
elif str(n[0]) == '1':
    print(str(int(n[1]) * 100))
else:
    print(str(int(n[1]) * 10000))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((100**a)*b)

Submission status: Wrong Answer

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

print(100**D * N)

Submission status: Wrong Answer

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

if int(input[0]) == 0:
    print(input[1])
elif int(input[0]) == 1:
    print(int(input[1]) * 100)
elif int(input[0]) == 2:
    print(int(input[1]) * 10000)
else:
    pass

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
text = input().split()
d = (int)(text[0])
n = (int)(text[1])
if (d == 0 and n < 100):
    print(n)
elif(d == 0 and n == 100):
  print(101)
elif(d == 1 and n < 100):
    print(n * 100)
elif(d == 1 and n == 100):
  print(10001)
elif(d == 2 and n < 100):
    print(n * 10000)
elif(d == 2 and n == 100):
  print(1000001)

Submission status: Wrong Answer

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

tmp = (100 ** d) * n

if tmp % 100 == 0:
    tmp += 1

print(tmp)

Submission status: Wrong Answer

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

print(pow(100,D)*N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split(" "))

if(A == 0):print(B)
else:print(100**A*B)

Submission status: Wrong Answer

Solution code:
dn = input()
d , n = dn.split()
d = int(d)
n = int(n)
ringo = 100^d
res = ringo * n
print(res)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(pow(100,d[0])*d[1])

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())
for _ in range(D):
    N *= 100
print(N)

Submission status: Wrong Answer

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

for i in range(len(inp)):
    inp[i] = int(inp[i])

d = inp[0]
n = inp[1]

ds = 100**d

print(ds*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(N * (100 ** D))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if (d > 0):
    print(100**d * n)
else:
    print(n)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
a,b=map(int,input().split())
print(b*100**a)

Submission status: Wrong Answer

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

c = 100**a

print(c*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
s=str(n)
s+="0"*(2*d)
print(int(s))

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(i) for i in input().split()]
if d == 0:
    ans = n
else:
    ans = 100**d*n
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
tmp = input()
D = int(tmp.split(' ')[0])
N = int(tmp.split(' ')[1])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

    if D == 0:
        ans = N
        if N == 100:
            ans = 101
    elif D == 1:
        xs = range(100, 100 * 101, 100)
        ans = xs[N-1]
    else:
        # D=2
        xs = range(100**2, (100 ** 2) * 101, 100**2)
        ans = xs[N-1]

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#coding: utf-8

def check(d,n):
    nums = []
    r = 100 ** d
    if r == 0: r = 1
    for i in range(1,n+1):
        nums.append(r * i)

    return nums[-1]

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

    print(check(d,n))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

x = 100**d

print(x*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())

if A == 0:
    print(B)

else:
    print(B*100**A)

Submission status: Wrong Answer

Solution code:
from sys import stdin, stdout
input = lambda: stdin.readline().rstrip()
println = stdout.write

def main():
    D, N = map(int, input().split())

    if not D:
        ans = N
    elif D == 1:
        ans = N * 100
    else:
        ans = 10000 + (N - 1) * 100
    print(ans)

main()

Submission status: Wrong Answer

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

print(N*pow(100,D))

Submission status: Wrong Answer

Solution code:
d, n = map(int, raw_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:
input_line = input().split()
target_divide = int(input_line[0])
num_target = int(input_line[1])

if target_divide == 0:
    counter = 0
    current_num = 0
    while counter < num_target:
        current_num += 1
        if current_num % 100 == 0:
            continue
        else:
            counter += 1

    print(str(current_num))
    exit(0)

else:
    current_num = num_target * 100 ** target_divide
    print(str(current_num))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
nums = [int(i) for i in input().split()]

if nums[0] == 0:
    print(nums[1])
elif nums[0] == 1:
    print(nums[1] * 100)
elif nums[0] == 2:
    print(nums[1] * 10000)

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:
    if n == 100:
        print(101)
    else:
        print(n)
elif d == 1:
    if n == 100:
        print(10001)
    else:
        print(n * 100)
else:
    if n == 100:
        print(1000001)
    else:
        print(n * 10000)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
l=input().split()
d=int(l[0])
n=int(l[1])
print((100^d)*n)

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(elem) for elem in input().split(' ')]

result = N * 100**D

print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# スペース区切りの整数の入力
D, N = map(int, input().split())

base = 100 ** D

ans = base * N

print(ans)

Submission status: Wrong Answer

Solution code:
from sys import stdin, stdout
from math import sqrt
from collections import defaultdict
#t = int(stdin.readline().strip())
#R, L, C, Vin = [float(x) for x in stdin.readline().strip().split()]
D, N = [int(x) for x in stdin.readline().strip().split()]
D = 100 ** D
print(D * N)

Submission status: Wrong Answer

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