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: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D,N=map(int,input().split())
n = 1
while True:
  if n%(100**D) == 0 and n%(100**(D+1)) != 0:
    N -= 1
  if N == 0:
    print(n)
    break
  n += 1

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


def main():
    d, n = nm()
    if n != 100:
        print(pow(100, d) * n)
    else:
        print(pow(100, d) * 101)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D, N = map(int,input().split())
ls = [0]*2000000
for i in range(1,2*10**6):
    if i % 100 == 0:
        ls[i] = 1
    if i % 10000 == 0:
        ls[i] = 2
    if i % 1000000 == 0:
        ls[i] = 3
ii = 0
for i in range(1,2*10**6):
    if ls[i] == D:
        ii += 1
    if ii == N:
        ans = i
        break
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
D,N=map(int,input().split())
i=0
c=0
while c<N:
  i+=1
  if (i*(100**D))%(100**(D+1))==0:
    continue
  c+=1
print(i*(100**D))

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]

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

print(100**d * (n+n//100))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

    ans = pow(100, D)
    if N < 100:
        ans *= N
    else:
        ans *= 101

    print(ans)

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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('10100')
    else:
        print(n*100)
else:
    if n == 100:
        print('1010000')
    else:
        print(n*10000)

Submission status: Accepted

Solution code:
D, N = list(map(lambda x : int(x), input().split(" ")))
print((N + int(N/100)) * (100 ** D))

Submission status: Accepted

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(10100)
  else:
    print(100*N)
else:
  if N==100:
    print(1010000)
  else:
    print(10000*N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if B==100:
  print((100**A)*101)
  exit()
print((100**A)*B)

Submission status: Accepted

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

l0 = []
for i in range(1, 102):
    if i != 100:
        l0.append(i)
l1 = []
for i in range(1, 102):
    if i != 100:
        l1.append(100 * i)
l2 = []
for i in range(1, 102):
    if i != 100:
        l2.append(10000 * i)

if D == 0:
    print(l0[N - 1])
elif D == 1:
    print(l1[N - 1])
elif D == 2:
    print(l2[N - 1])

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
x = 100 ** d
y = x
cnt = 0
while cnt < n:
    if y % 100**(d+1) != 0:
        cnt += 1
    y += x
print(y-x)

Submission status: Accepted

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

print(100 ** D * (N + N // 100))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=(int(i) for i in input().strip().split(" "))
if b!=100:
    print(b*(100**a))
else:
    print(101*(100**a))

Submission status: Accepted

Solution code:
d,n=map(int,input().split())
# # nは1<=n<=100

s=1
if d==1:
    s=100
elif d==2:
    s=10000

if s==1:
    ans=[i for i in range(1,100)]
    ans.append(101)
elif s==100:
    ans=[100*i for i in range(1,100)]
    ans.append(10100)

else:
    ans=[10000*i for i in range(1,100)]
    ans.append(1010000)

print(ans[n-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D,N=map(int,input().split())
if D == 0:
  count=0
  for i in range(1,1000):
    if i % 100 != 0:
      count += 1
    if count == N:
      print(i)
      exit()
if D == 1:
  count = 0
  for i in range(100,1000000,100):
    if i % 10000 != 0:
      count += 1
    if count == N:
      print(i)
      exit()
if D == 2:
  count = 0
  for i in range(10000,10000*10000,10000):
    if i % 1000000 != 0:
      count += 1
    if count == N:
      print(i)
      exit()

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 100
# B - Ringo's Favorite Numbers

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

Submission status: Accepted

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

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

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

else:
    if n!=100:
        print(10000*n)
    else:
        print(1010000)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

d = int(s[0])
n = int(s[1])

answer = 0

if d == 0:
    if n == 100:
        answer = 101
    else:    
        answer = n
elif d == 1:
    if n == 100:
        answer = 10100
    else:
        answer = 100 * n
elif d == 2:
    if n == 100:
        answer = 1010000
    else:
        answer = 10000 * n

print(answer)

Submission status: Accepted

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

print((100 ** d) * (n if n < 100 else n + 1))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0
m = 0
n = 0
c = 0

if D == 0:
  n = 1
  m = 100
elif D == 1:
  n = 100
  m = 10000
else:
  n = 10000
  m = 1000000

while 1:
  c += n
  if c % m == 0:
    pass
  else:
    count += 1
      
  if count == N:
    print(c)
    break

Submission status: Accepted

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

if N != 100:
    ans = N*100**D
else:
    ans = 101*100**D

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if D == 2:
    if N == 100:
        print(1010000)
    else:
        print(N*10000)

Submission status: Accepted

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

if n[1]==100:
  print((n[1]+1)*(100**n[0]))
else:
  print(n[1]*(100**n[0]))

Submission status: Accepted

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

if n == 100:
  n += 1

print(100 ** d * n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# numが100で何回割れるか
def getDevide100Count(num: int):
    n = 0
    while num % 100 == 0:
        num = num / 100 
        n += 1
    return n


d, n = map(int, input().split())
count = 0
i = 0
while count != n:
    i += 1
    if getDevide100Count(i) == d:
        count += 1

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
count = 0
i = 1

while True:
    c = 0
    num = i
    while num >= 100:
        if num%100==0:
            num = num//100
            c += 1
        else:
            break
    if c==d:
        count += 1
    if count == n:
        print(i)
        break
    i += 1

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
MM = input().split()
D = int(MM[0])
N = int(MM[1])
if N ==100:
  ans = 100**D*(N+1)
else:
  ans = 100**D *N
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

if n == 100:
  n = 101
print(str(n) + ('00' * d))

Submission status: Accepted

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

Submission status: Accepted

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

if n == 100:
    ans += 100**d

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if n == 100:
    a=101*100**d
else:
    a=100**d*n

print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
a = 100 ** d
counter = 0
for i in range(1,111) :
    num = a * i
    if i % 100 != 0 :
        counter += 1
        if counter == n :
            print(num)
            break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# B - Ringo's Favorite Numbers
D, N = map(int, input().split())

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

Submission status: Accepted

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

# print(100 ** 0)
# print(100 ** 1)
# print(100 ** 2)

start = 100 ** d
# step = 100 ** d
# end 

# print(start * n)

value = start
count = 1
while True:
    # print(f'{count} : {value}')
    if n == count:
        break
    
    value += start
    if d == 0:
        if value % 100 != 0:
            count += 1
    elif d == 1:
        if value % 10000 != 0:
            count += 1
    elif d == 2:
        if value % 1000000 != 0:
            count += 1
    else:
        count += 1
    
print(value)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

lst = []
X = "00" * D

for i in range(1,102):
    if i % 100 == 0:
        pass
    else:
        lst.append(str(i) + X)

print(lst[N-1])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D,N = (int(X) for X in input().split())
if N==100: print((N+1)*pow(100,D))
else: print(N*pow(100,D))

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

if n == 100:
    n = 101
print(100**d*n)

Submission status: Accepted

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

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(10100)
  
elif D == 2 and N != 100:
  print(N*10000)
  
else:
  print(1010000)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
def main():
  d,n = list(map(int,input().split()))
  if n==100:
    n+=1
  print(pow(100,d)*n)
main()

Submission status: Accepted

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
d, n = map(int, input().split())
print((n + (n == 100)) * 100**d)

Submission status: Accepted

Solution code:
import itertools
import sys
input = sys.stdin.readline

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

n = 0
for i in itertools.count(0):
    for j in range(1, 100):
        n += 1
        if n == N:
            ans = (100 * i + j) * 100**D
            print(ans)
            break
    else:
        continue
    break

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import defaultdict, deque
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline()[:-1]

def check(d, x):
    c = 0
    while x % 100 == 0:
        x //= 100
        c += 1
    return c == d

def solve():
    d, n = [int(x) for x in input().split()]
    cnt = 0
    val = 0
    while cnt < n:
        val += 1
        if check(d, val): cnt += 1
    print(val)


t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()

"""

"""

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

B=100**D
I=0
A=0
while I<N:
    A+=B
    if (A//B)%100:
        I+=1
print(A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


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

Submission status: Accepted

Solution code:
import sys

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
    d, n = MI()
    if n%100 == 0:
        n += 1
    ans = (100**d)*n
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    d, n = i_map()

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

    if n == 100:
        if d == 1:
            print(10100)
        elif d == 2:
            print(1010000)
        exit()

    print(pow(100, d) * n)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    D, N = list(map(int, input().split()))
    ls = [100 ** D * i for i in range(1, 100)]
    ls.append(100 ** D * 101)
    print(ls[N-1])
    return

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

def main():
    D,N = map(int,input().split())
    if N != 100:
        ans = N * pow(100,D)
    else:
        ans = 101 * pow(100,D)
    print(ans)
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
d, n = map(int, input().split())
if n == 100:
    print((n+1)*(100**d))
else:
    print(n*(100**d))

Submission status: Accepted

Solution code:
from collections import defaultdict
def readInt():
  return int(input())
def readInts():
  return list(map(int, input().split()))
def readChar():
  return input()
def readChars():
  return input().split()

d,n = readInts()

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