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

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

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

Submission status: Accepted

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

cnt = 0
n = 1
while True:
    x = n * 100 ** D
    if n % 100 != 0:
        cnt += 1
    if cnt == N:
        print(x)
        exit()
    n += 1

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if d==1 and n==100:
    print(10100)
elif d==1:
  print(100*n)
  
if d==2 and n==100:
    print(1010000)
elif d==2:
  print(10000*n)

Submission status: Accepted

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

n = 1

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
D, N = [int(x) for x in input().split()]
ans = []
for i in range(1, 1010001):
    if i % (100 ** D) == 0 and i % (100 ** (D + 1)) != 0:
        ans.append(i)
print(ans[N-1])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# データ読み込み

import sys
from collections import deque

def input_data(d=""):
  t = sys.stdin.read()
  if t:
    return t
  else:
    if d[0] == "\n":
      d = d[1:]
    if d[-1] == "\n":
      d = d[:-1]    
    return d

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

if B == 100:
  B = 101

out = 100 ** A * B

print(out)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
D, N = (int(x) for x in 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())
s = 0
if N != 100:
    print(100**D*N)
else:
    print(100**D*(N+1))

Submission status: Accepted

Solution code:
import math
d, n = map(int, input().split())
n += n//100
print(int(math.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:
i = list(map(int , input().split()))
if i[1] == 100:
	i[1] = 101
print(i[1]*(100**i[0]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
x,y = map(int, input().split())

tmp = 100 ** x
ans = tmp * y

if y == 100:
    ans += tmp
print(ans)

Submission status: Accepted

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

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

if b == 100:
    print(100 ** a * (b+ 1))
else:
    print(100 ** a * b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
d,n=map(int,input().split())
print((n+n//100)*100**d) #n=100*kの時は飛ばす.

Submission status: Accepted

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

Submission status: Accepted

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

def f(x):
  if x % 100 != 0:
    return 0
  else:
    return f(x // 100) + 1

cnt = 0
i = 1
while True:
    if f(i) == D:
        cnt += 1
        if cnt == N:
            ans = i
            break
    i += 1

 
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


def f(x):  # 何回割り切れるか
    if x % 100 != 0:
        return 0
    else:
        return f(x // 100) + 1


cnt = 0
i = 1

while 1:
    if f(i) == d:
        cnt += 1
        if cnt == n:
            ans = i
            break
    i += 1

print(ans)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(100**D,(N+1)*100**D,100**D):
  tmp = i
  
if N!=100:
  print(tmp)
else:
  print(tmp+100**D)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#output
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(100**2*N)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lst = [int(i) for i in input().split()]
n = lst[1] // 100

print((lst[1] + n) * 100 ** lst[0])

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

Submission status: Accepted

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

Submission status: Accepted

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


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


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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


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


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if D == 1:
    num = [i*100 for i in range(1, N+1)]
    if N == 100:
        num[-1] += 100

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

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

print(num[-1])

Submission status: Accepted

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

print([b, b+1][int(b == 100)] * (100 ** a))

Submission status: Accepted

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

# numが100で割り切れる回数を返す
def getCount(num):
    cnt = 0

    while num % 100 == 0:
        cnt += 1
        num //= 100

    return cnt

idx = 1
while True:
    if len(a) > n:
        break
    temp = (100**d) * idx
    if getCount(temp) == d:
        a.append(temp)
    idx += 1

print(a[n-1])

Submission status: Accepted

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


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

examB()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
D,N = map(int,input().split())
# 100番目はすなわち、100で割り切れるので+1番目とする
if N == 100:
	N += 1
target = 100 ** D
print(N*target)

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

Submission status: Accepted

Solution code:
D, N = list(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 n <= 99:
    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(100**d*101)
else:
  print(100**d*n)

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:
import sys
input = sys.stdin.readline
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:
    n += 1
print(100 ** d * n)

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 :
    ans = 101 * (100 ** d)
else :
    ans = n * (100 ** d)
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
d,n = map(int,input().split())
#n=100の時は、100で割り切れてまうからそのときだけは101番目のものを出力
if n != 100:
  ans = (100**d) * n
else:
  ans = (100**d) * 101
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import fractions

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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 and n!=100:
    print(n*100)
elif d==1 and n==100:
    print(10100)
elif d==2 and n!=100:
    print(n*10000)
elif d==2 and n==100:
    print(1010000)

Submission status: 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)
elif D == 2:
    if N == 100:
        print(1010000)
    else:
        print(N * 10000)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


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

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

Submission status: Accepted

Solution code:
D, N = map(int, input().split())
nums = []
for i in range(120):
    if i % 100 == 0:
        continue
    nums.append(100**D * i)

print(nums[N - 1])

Submission status: Accepted

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

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

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


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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

flag = True
tmp = 0
count = 0

while(flag):
    count += 1
    if((100 ** d * count) % (100 ** (d+1)) != 0):
        tmp += 1
        if(tmp == n):
            print(100 ** d * count)
            exit()

Submission status: Accepted

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

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

Submission status: Accepted

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


def main():
    D, N = map(int, input().split())
    if N<100:
        ans = (100**D)*N
    else:
        ans = (100**D)*N + (100**D)
    print(ans)



if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
D,N = map(int,input().split())
tmp = list(range(1,100))
tmp.append(101)
tmp = np.array(tmp)
tmp = tmp*(100**D)
print(tmp[N-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
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())

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

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

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:
from collections import Counter,defaultdict,deque
import sys,bisect,math,itertools,string,queue
from heapq import heappop, heappush
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

d,n = inpl()
if n == 100:
    n += 1
print(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 = (int(x) for x in input().split())
print(n*(100**d)) if n != 100 else print(101*(100**d))

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
    ans=N*100**D
else:
    ans=(N+1)*100**D

print(ans)

Submission status: Accepted

Solution code:
if __name__ == '__main__':

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

	num = pow(100,D)

	if N == 100:
		num = num * N + num
	else:
		num = num * N

	print(num)

Submission status: Accepted

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

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

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())
if n!=100:
    print(n*[1,100,10000][d])
else:
    print([101,10100,1010000][d])

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    print(solve())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

if N == 100:
    N += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    d, n = list(map(int, input().rstrip('\n').split()))
    m = 100 ** d
    t = m
    cnt = 0
    while True:
        tt = t // m
        if tt % 100 != 0:
            cnt += 1
        if cnt == n:
            print(t)
            exit()
        t += m


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

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

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

n = []
for i in range(1,1001):
    if i % 100 !=0:
        if D == 0:
            n.append(i)
        elif  D == 1:
            n.append(100*i)
        elif D == 2:
            n.append(10000*i)
print(n[N-1])