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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
N,D = map(int,input().split())
E = 100**D
print(str(N)+str(E))

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().strip().split(" "))

q=int((N-1)/99)

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

Submission status: Wrong Answer

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

if(D==0):
    print(N)
    quit()

q=int((N-1)/99)

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

Submission status: Wrong Answer

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

if(D==0):
    print(N)
    quit()

print((100**D)*N)

Submission status: Wrong Answer

Solution code:
a = [int(i) for i in input().split()] 
if a[0] == 0:
 ans = a[1]
elif a[0] == 1:
 ans = 100*a[1]
else :
 ans =10000*a[1]

print(ans)

Submission status: Wrong Answer

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


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

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


if __name__ == "__main__":
    main()

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

ans = 100**D*N

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

n = 100 ** D
num = n
for i in range(N-1):
    num += n

print(num)

Submission status: Wrong Answer

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

n = 100 ** D
num = 0
for i in range(N):
    num += n

print(num)

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split(" "))
count = 0
x = 1
if a == 2:
    while True:
        if ((x / 100) % 100) == 0:
            count += 1
        if count == b:
            print(x)
            break
        else:
            x += 1
elif a == 1:
    while True:
        if x % 100 == 0:
            count += 1
            print(x)
        if count == b:
            print(x)
            break
        else:
            x += 1
else:
    print(b)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

print(100**d *n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


abc100_b()

Submission status: Wrong Answer

Solution code:
num = input().split(' ')
D = int(num[0])
N = int(num[1])
if D == 0:
    print(N)
elif D == 1:
    print(N * 100)
elif D == 2:
    print(N * 10000)

Submission status: Wrong Answer

Solution code:
import math
D,N = [int(i) for i in input().split()]
if (N != 100) :
    print(int(math.pow(100,D) * N))
else :
    # N = 100のときは割り切れてしまうので+1する
    print(int(math.pow(100,D) * N + 1))

Submission status: Wrong Answer

Solution code:
import math
input_lines = input()
num1 =int(input_lines.split(" ")[0])
num2 =int(input_lines.split(" ")[1])

if num1==0:
    print(num2)
else:
    print(int(num2*math.pow(100,num1)))

Submission status: Wrong Answer

Solution code:
import math
input_lines = input()
num1 =int(input_lines.split(" ")[0])
num2 =int(input_lines.split(" ")[1])

if num1==0:
    print(num2)
else:
    print(int(num2*math.pow(100,2)))

Submission status: Wrong Answer

Solution code:
import math
input_lines = input()
num1 =int(input_lines.split(" ")[0])
num2 =int(input_lines.split(" ")[1])
print(num1)
print(num2)

if num1==0:
    print(num2)
else:
    print(int(num2*math.pow(100,2)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
i = 0
j = 1
while i < n:
    if j%(100**d) == 0:
        i +=1
    j +=1
print(j-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:
inp = raw_input()
inp_ = inp.split(" ")

print 100 ** int(inp_[0]) * int(inp_[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:
a, b = map(int, input().split())
print(100 ** a * b if b != 100 else 100 ** a * b + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def calc(n):
    if n % 100 != 0:
        return 0
    return calc(n // 100) + 1

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

count = 0
i = 1
while(1):
    if (calc(i) == D):
        count += 1
        if count == N:
            print(i)
            break

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if D == 0:
    print(N)
else:
    ans = standard*N
    print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = input().split(" ")
D = int(D)
if D == 0 and int(N) == 100:
  print("101")
else:
  print(N+"0"*(2*D))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

c=[]
for i in range(1,101):
	c.append(i*100**a)
print(c[b-1])

Submission status: Wrong Answer

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

c=[]
for i in range(1,b+1):
	c.append(i*100**a)
print(c[b-1])

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

list =[]

num = 0

for i in range(1,1000001):

    if i%100**D == 0:

        list.append(i)

print(list[N-1])

Submission status: Wrong Answer

Solution code:
#x
D,N = map(int,input().split())
num = 0
count = 0
while True:
    num += 1
    if num%(100**D) == 0:
        count += 1
    if count == N:
        print(num)
        break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int,input().split())
inc, c = 100 ** d, 0
i = 0 
while c < n:
    
    if d == 0:
        if i % 100 != 0:
            c += 1
        i = i + inc
    else:
        c += 1
        i = i + inc
print(i - inc if d == 0 else i)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
a = N // 100
b = N % 99
print((100*a+b)*(100**D))

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
a = N // 99
b = N % 99
print((100*a+b)*(100**D))

Submission status: Wrong Answer

Solution code:
d, n = map(int,input().split())
inc, c = 100 ** d, 0
i = inc 
while c < n:
    
    if d == 0 and i % 100 != 0:
        c += 1
    else:
        c += 1
    i = i + inc
print(i - inc)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

def ok(i, D):
    for n in range(D):
        if i == 0 and i % 100 != 0:
            return False
        i = int(i / 100)
    if i % 100 != 0:
        return True
    return False


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

i = 1
count = 0
while count < N:
    # iが100でちょうどD回割り切れる？
    if ok(i, D):
        count += 1
    i += 1
print(i - 1)

Submission status: Wrong Answer

Solution code:
indata = input()
indata = indata.split()
A=int(indata[0])
B=int(indata[1])

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

elif A == 2:
    print(10000 * B)

Submission status: Wrong Answer

Solution code:
indata = input()
indata = indata.split()
A=int(indata[0])
B=int(indata[1])

if A == 0:
    print(B)
    exit()

result = (100 ** A) * B
print(result)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

cnt=1
for i in range(d):
    cnt=cnt*100

print(cnt*n)

Submission status: Wrong Answer

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

cnt=1
for i in range(d):
    cnt=cnt*100
    print(cnt)

print(cnt*n)

Submission status: Wrong Answer

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

cnt=1
for i in range(d):
    cnt=cnt*100
    print(cnt)

print(cnt*85)

Submission status: Wrong Answer

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

print  100 ** D * N if D > 0 else N if N < 100 else 100 ** D * 101

Submission status: Wrong Answer

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

print  100 ** D * N if D > 0 else N if N < 100 else 101

Submission status: Wrong Answer

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

print  100 ** D * N if D > 0 else 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=(int(i) for i in input().split(' '))
print((n-1)*(100**d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# Ringo's Favorite Numbers
print((lambda args: 100 ** args[0] * args[1])(list(map(int, input().split()))))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for i in range(100**d,100**d*100,100**d):
  if i == 100**d*n:
    print(i)

Submission status: Wrong Answer

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

print((100 ** d) * n)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
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()]
a = 100 ** d
print(n * a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
d0 = list(range(1, 1000))
d1 = list(range(100, 100000, 100))
d2 = list(range(10000, 10000000, 10000))

if D == 0:
    print(d0[N-1])
elif D == 1:
    print(d1[N-1])
elif D == 2:
    print(d2[N-1])

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
count = 0
d0 = list(range(1, 101))
d1 = list(range(100, 10001, 100))
d2 = list(range(10000, 1000001, 10000))

if D == 0:
    print(d0[N-1])
elif D == 1:
    print(d1[N-1])
elif D == 2:
    print(d2[N-1])

Submission status: Wrong Answer

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

if d == 0:
    print(n + n // 100)
elif d == 1:
    print(100*(n + n // 10000))
elif d == 2:
    print(10000*(n + n // 1000000))

Submission status: Wrong Answer

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

if d == 0:
    print(n + n // 100)
elif d == 1:
    print(100*n + n // 10000)
elif d == 2:
    print(10000*n + n // 1000000)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
d, n = list(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 N == 100:
    if D == 0:
        print(101)
    elif D == 1:
        print(10100)
    else:
        print(N * 1010000)
else:
    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)
elif D == 2:
    print(10000 * N)

Submission status: Wrong Answer

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

if d == 0:
    print(n)
    exit(0)

ans = 1

for i in range(d):
    ans *= 100

print(ans * n)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N = map(str, input().split())
zero = "00"
ans = N

for i in range(1,int(D)+1):
	ans = ans + zero

print(ans)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
print(n*(100**d))
#hello world jkh uyguyguk uykguutif

Submission status: Wrong Answer

Solution code:
D, N = [int(x) for x in input().split()]
for _ in range(D):
    N *= 100
q, r = divmod(N, 100)
ans = N + q if r == 0 else N
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

D, N = [int(a) for a in stdin.readline().rstrip().split()]

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

D, N = [int(a) for a in stdin.readline().rstrip().split()]

print((100**D) * N)

Submission status: Wrong Answer

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

base = 100 ** d
ans = base * k

print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
B - Ringo's Favorite Numbers
https://abc100.contest.atcoder.jp/tasks/abc100_b

"""
import sys
from sys import stdin
input = stdin.readline


def solve(D, N):
    if N != 100:
        return 100 ** D * N
    else:
        return 100 ** D * N + 1


def main(args):
    D, N = map(int, input().split())
    ans = solve(D, N)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
B - Ringo's Favorite Numbers
https://abc100.contest.atcoder.jp/tasks/abc100_b

"""
import sys
from sys import stdin
input = stdin.readline


def solve(D, N):
    return 100 ** D * N


def main(args):
    D, N = map(int, input().split())
    ans = solve(D, N)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

k=100**D
k=N*k

print(k)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(input())
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())

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

Submission status: Wrong Answer

Solution code:
# coding:utf-8


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


a, b = inpl()
print(100**a*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((100**D) * N if N!=100 else 10100)

Submission status: Wrong Answer

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

print((100**D) * N)

Submission status: Wrong Answer

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

print(100**D * N)

Submission status: Wrong Answer

Solution code:
def pow100(n):
	a = 1
	for i in range(0, n):
		a = a * 100
	return a

D, N = map(int, raw_input().split())
ans = pow100(D) * N
if N == 100: ans = pow100(D+1)+1
print ans

Submission status: Wrong Answer

Solution code:
def pow100(n):
	a = 1
	for i in range(0, n):
		a = a * 100
	return a

D, N = map(int, raw_input().split())
print N * pow100(D)

Submission status: Wrong Answer

Solution code:
headerData = input().split()
d = int(headerData[0])
n = headerData[1]
answer = n + "00" * d
print(answer)

Submission status: Wrong Answer

Solution code:
D, N = (int(i) for i in input().split())
A = 100 * N
B = 10000 * N
if N == 100:
  if D == 0:
    print(101)
  if D == 1:
    print(10100)
  if D == 2:
    print(10010000)
elif D == 0:
    print(N)
elif D == 1:
    print(A)
else:
    print(B)

Submission status: Wrong Answer

Solution code:
D, N = (int(i) for i in input().split())
A = 100 * N
B = 10000 * N
if N == 100:
  if D == 0:
    print(101)
  if D == 1:
    print(10100)
  if D == 2:
    print(10010000)

if D == 0:
    print(N)
elif D == 1:
    print(A)
else:
    print(B)

Submission status: Wrong Answer

Solution code:
D, N = (int(i) for i in input().split())
A = 100 * N
B = 10000 * N
if D == 0:
    print(N)
elif D == 1:
    print(A)
else:
    print(B)

Submission status: Wrong Answer

Solution code:
D, N = (int(i) for i in input().split())
A = 100 * N
B = 10000 * N
if D == 0:
    print('N')
elif D == 1:
    print(A)
else:
    print(B)

Submission status: Wrong Answer

Solution code:
#100b
d,n=map(int,input().split())
if d==0:
    print(n)
elif d==1:
    print(n*100)
else:
    print(n*10**4)

Submission status: Wrong Answer

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


if D == 0:
    print(ans)
    exit()
else:
    for i in range(0, D):
        ans *= 100

print(ans)

Submission status: Wrong Answer

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

for i in range(0, D):
    ans *= 100

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
D,N = list(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())
num=1
if D==0:
  print(N)
else:
  print(pow(100,D)*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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