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

print(n*(100**d))

Submission status: Wrong Answer

Solution code:
iD, iN = map(int, input().split())

unit = 100 ** iD
result = unit * iN

print (result)

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, raw_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,b = map(int,input().split( ))
x = b*100**a
print(x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Jun 16 20:49:48 2018
ABC100B
@author: maezawa
"""

#a = int(input())
#b = int(input())
d, n = list(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())
base = 1
for j in range(D):
    base *= 100
if(D!=0):
    num = base * N
    print(str(num))
else:
    print(str(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=[int(i) for i in input().split()]

if d==0:
    print(n)

elif d==1:
    print(n*100)

else:
    print(n*10000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if D == 0:
    print(N)
elif D == 1:
    print(N, end='00')
else:
    print(N, end='0000')

Submission status: Wrong Answer

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


print(m())

Submission status: Wrong Answer

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

a=100**D
ans=a*N

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
ui = input()

D, N = int(ui.split()[0]), int(ui.split()[1])

print(100**D*N)

Submission status: Wrong Answer

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

print N*(100**D)

Submission status: Wrong Answer

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

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

print(100 ** d * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

D, N = 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:
    print(n)
else:
    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(s) for s in raw_input().split()]

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

Submission status: Wrong Answer

Solution code:
from collections import deque
import sys

def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [D, N] = [int(input_raw[0]), int(input_raw[1])]
    print (100**D)*N



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(pow(100, d)*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)
elif d == 2:
    print(100 * 100 * n)

Submission status: Wrong Answer

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

print( (100 ** d )* n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print a*N

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

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(N * 100 ** D)

Submission status: Wrong Answer

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

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:
# -*- coding: utf-8 -*-
D, N = map(int, input().split())
print (pow(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:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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

a = 0
if d == 0:
    a = n
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())
print("{}".format(n*(100**d)))

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:
#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):
    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(10**(d+1) * n)

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()

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

print(N * 100 ** D)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
list=input().rstrip().split() 
D=int(list[0]) 
N=int(list[1])
print((100**D)*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:
lA=list(map(int,input().split()))
D=lA[0]
N=lA[1]
print(100**D*N)

Submission status: Wrong Answer

Solution code:
d,n = map(int,raw_input().split())
x = 100**d
ans = 0
for a in range(n):
  ans += x
if ans % x == 0:
  ans += x
print ans

Submission status: Wrong Answer

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

result = 100 ** D * N

print(result)

Submission status: Wrong Answer

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


print(k * ((100)**n))

Submission status: Wrong Answer

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

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

else:
    print(10000*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

DN = list(int(i) for i in input().split())

ans = 100**DN[0]*DN[1]

print(ans)

Submission status: Wrong Answer

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

tmp = input()
d = int(tmp.split(" ")[0])
n = int(tmp.split(" ")[1])

print(n*(100**d))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations

sys.setrecursionlimit(10000)


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(D, N):
    if D == 0:
        return N

    return N * (100**D)


def main():
    D, N = read_int_n()
    print(slv(D, N))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int, raw_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("{}".format(100 ** D * N))

Submission status: Wrong Answer

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

print(pow(100, d) * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
lA=list(map(int,input().split()))
D=lA[0]
N=lA[1]
if(D!=0):
    print(100**D*N)

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

print(100**d * n)

Submission status: Wrong Answer

Solution code:
(d, n) = [int(e) for e in 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:
# -*- coding: utf-8 -*-

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

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

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

Submission status: Wrong Answer

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

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

if __name__ == "__main__":
        main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print n * 100**d

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(100**n*d)

Submission status: Wrong Answer

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

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

print("{}".format(100**D*N))

Submission status: Wrong Answer

Solution code:
from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect

def read():
  return int(input())

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

D, N = reads()
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:
a, b = map(int, input().split())
num = 0
init = 100 ** a

num += init * b
print(num)

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

Submission status: Wrong Answer

Solution code:
l = map(int, raw_input().split())
d = l[0]
n = l[1]

print n * (100 ** d)

Submission status: Wrong Answer

Solution code:
if __name__ == "__main__":
    d, n = map(int, input().split(" "))
    num = 100**d
    print(num * 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:
D,N = map(int,input().split())
a = []
if D == 0:
    print(N)
elif D == 1:
    if N == 100:
        print(10100)
    else:
        print(N*100)
else:
    if N == 100:
        print(10000*101)
    else:
        print(10000*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(100 ** D * N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# https://abc100.contest.atcoder.jp/tasks/abc100_b

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

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
import math
[a, b] = map(int, input().split())
print(int(b * math.pow(100, a)))

Submission status: Wrong Answer

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

print((100**D)*N)

Submission status: Wrong Answer

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

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
from heapq import heapify, heappop, heappush
from sys import stdin, stdout, setrecursionlimit
from bisect import bisect, bisect_left, bisect_right
from collections import defaultdict, deque


# d = defaultdict(lambda: 0)
# setrecursionlimit(10**7)
# inf = float("inf")


##### stdin ####
def LM(t, r): return list(map(t, r))
def R(): return stdin.readline()
def RS(): return R().split()
def I(): return int(R())
def F(): return float(R())
def LI(): return LM(int,RS())
def LF(): return LM(float,RS())
def ONE_SL(): return list(input())
def ONE_IL(): return LM(int, ONE_SL())
def ALL_IL(): return LM(int,stdin)


##### tools #####
def ap(f): return f.append
def pll(li): print('\n'.join(LM(str,li)))
def pljoin(li, s): print(s.join(li))


##### Library ####


##### main #####
def main():
    
    D, N = LI()
    a = 100**D
    print(a * N)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
text = input().split()
d = (int)(text[0])
n = (int)(text[1])
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())

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:
from sys import stdin
n,k = map(int,stdin.readline().split())
print k * (100**n)

Submission status: Wrong Answer

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

print(n*(100**(d)))

Submission status: Wrong Answer

Solution code:
import sys

cin = sys.stdin
# cin = open("in.txt", "r")


def line2N():
    return map(int, cin.readline().split())


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

Submission status: Wrong Answer

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

print(N*100**D)

Submission status: Wrong Answer

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

print((100 ** d) * n)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

D, N = map(int, stdin.readline().rstrip().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())
print((100**a) * b)

Submission status: Wrong Answer

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

print(100**n*m)

Submission status: Wrong Answer

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

if d == 0:
    num = 1
elif d == 1:
    num = 100
else:
    num = 10000
print(str(num * 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 = list(map(int, input().split()));print(100**D * N)

Submission status: Wrong Answer

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

if __name__ == "__main__":
    print(main())

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

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
D, N = [int(i) for i in 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:
DN=input()
DN=DN.rstrip().split(" ")
D=int(DN[0])
N=int(DN[1])

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

Submission status: Wrong Answer

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

print(100 ** a * b)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys,collections,math;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

d,n = Is()
print(n*(100**d))

Submission status: Wrong Answer

Solution code:
# # n = int(input())
# a, b = map(int, input().split())
# # c = list(map(int, input().split()))
# # d = [list(map(int, input().split())) for _ in range(n)]
# # s = input()
#
# ans = "Yey!"
#
# if a <= 8 and b <= 8:
#     ans ="Yey!"
# else:
#     ans = ":("
#
# print(ans)

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

ans = pow(100,D)*N

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

Submission status: Wrong Answer

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

print(pow(100, D)*N)

Submission status: Wrong Answer

Solution code:
import re

inp = re.split(" ",input())

D = int(inp[0])
N = int(inp[1])

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

d,n = na()
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(" ")]
print(N*(100**D))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
import sys

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

x = int(math.pow(100, D))
print(x * N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

base = 100 ** d

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

Submission status: Wrong Answer

Solution code:
#coding:utf-8

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

key = pow(100, D)

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

Submission status: Wrong Answer

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

if d[0] == 0:
	print(d[1])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(pow(100,D) * N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# AtCoder Beginner Contest


if __name__ == '__main__':
    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:
    print(n)
else:
    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()]
ans = (100**D)*N
print(ans)

Submission status: Wrong Answer

Solution code:
Data = input()

import re

Shift = re.split(" ",Data)
D = int(Shift[0])
N = int(Shift[1])

print(100**D*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

base = 1
for _ in range(d):
    base *= 100

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

Submission status: Wrong Answer

Solution code:
import math
import numpy as np

line = input().split()
D = int(line[0])
N = int(line[1])

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

print(100 ** d * n)

Submission status: Wrong Answer

Solution code:
import math

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

print(int(math.pow(100,d)*n))

Submission status: Wrong Answer

Solution code:
from sys import stderr
from functools import reduce
from operator import add
def f(): return [int(i) for i in input().split()]
def debug(*x): stderr.write(reduce(add,repr(x)).strip("()\',")+'\n')

d,n = f()

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:
import sys, math
from sys import stdin, stdout

rem = 10 ** 9 + 7
sys.setrecursionlimit(10 ** 6)
take = lambda: map(int, stdin.readline().split())

d,n=take()
print 100**(d)*n

Submission status: Wrong Answer

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

if n == 0:
    print(n)
else:
    print(n*pow(100,d))

Submission status: Wrong Answer

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

print(pow(100,D)*N)

Submission status: Wrong Answer

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

def solve():
    a, b = map(int, input().split())
    print(100 ** a * b)

if __name__=="__main__":
    solve()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(B*100**A)

Submission status: Wrong Answer

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

print((100**a)*b)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
n,k = map(int,stdin.readline().split())
print k * (10**n)

Submission status: Wrong Answer

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