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

Submission status: Accepted

Solution code:
d,n = map(int,input().split())
print((n+n//100)*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())
x = 1100000
cnt = 1
for i in range(x):
    if i % 100**d == 0 and i % 100**(d+1) != 0:
        if cnt == n:
            print(i)
            exit()
        cnt += 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:
  print(101 if D==0 else (100**D)*101)
else:
  print((100**D)*N if D!=0 else 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 * 101)
else:
    print(100 ** D * N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D,N = list(map(int,input().split(' ')))
#ar = [ar.append(100**D*i) for i in range(1,N+1)
ar = []
if N <100:
  for i in range(1,N+1):
    ar.append(100**D*i)
else:
  for i in range(1,N+2):
    ar.append(100**D*i)
    
  
print(ar[-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(100**D * N)
else:
  print(100**D * 101)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
ans = (100 ** d) * n
if n == 100:
  ans += n ** d
  #n=100のときd+1かいになる
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


i = 1
ans = 0

while True:
    cnt = 0
    s = i
    while s%100 == 0:
        s /= 100
        cnt += 1
        
    if cnt == d:
        ans += 1
        if ans == n:
            break
    i += 1
    
print(i)

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:
a, b = map(int, input().split())
c = 100 ** a
d = 0
e = 0
while True:
    d += c
    if d // c != 100:
        e += 1
    if e == b:
        print(d)
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

count = 0
i = 0
while count != b:
    if i %100 != 0:
        count += 1
    i += 1


ans = 100 **a * (i-1)
print(ans)

Submission status: Accepted

Solution code:

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


if n == 100:
    n = n + 1

tail = "00" * d
s = str(n) + tail
print(s)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#ABC 100 B - Ringo's favorite number
A = [int(el) for el in input().split(' ')]
if A[1] != 100:
    print(100**A[0] * A[1])
else:
    print(100**A[0] * 101)

Submission status: Accepted

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

Submission status: Accepted

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

if b != 100:
    print(b * 100 ** a)
else:
    print(101 * 100 ** a)

Submission status: Accepted

Solution code:
def calc(x):
    ret = 0
    while x % 100 == 0:
        x /= 100
        ret += 1
    return ret

D, N = map(int, input().split())
cnt, val = 0, 0
while cnt < N:
    val += 1
    if calc(val) == D:
        cnt += 1
print(val)

Submission status: Accepted

Solution code:
D,N=map(int, input().split())
x=100**D
ans=x*N
if N==100:
  ans+=x
  #N=100の時は100で割り切れてしまうから、N=101にする
print(ans)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
D, N = map(int, input().split())
ans = []
if D == 0:
    for i in range(110):
        if i % 100 != 0:
            ans.append(i)
elif D == 1:
    for i in range(100, 10101, 100):
        if i != 10000:
            ans.append(i)
else:
    for i in range(10000, 1010001, 10000):
        if i != 1000000:
            ans.append(i)

print(ans[N - 1])

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(100*101)

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

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 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:
"""
# 標準入力取得
## 文字列
 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())

## 数値
 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

# 0埋め, 小数点出力桁指定時のときの出力
a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654

# 文字列をリストに格納
char_list = list("abcd") # ["a","b","c","d"]
"""

import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

if __name__ == "__main__":
    D,N = map(int, sys.stdin.readline().split())
    if N != 100:
        print((100**D)*N)
    else:
        print((100**D)*101)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b = LI()
    if a <= 8 and b <= 8:
        print("Yay!")
    else:
        print(":(")
    return

#B
def B():
    d, n = LI()
    print(str(n * (n != 100) or n + 1) + "00" * d)
    return

#C
def C():
    return

#D
def D():
    return

#Solve
if __name__ == '__main__':
    B()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os, sys, re, math

D,N = map(int,input().split(' '))
#ret = (100 ** D) * N
#if N == 100:
#    ret += 100 ** D
#print(ret)

cnt = 0
cur = 0

while cnt < N:
    cur += 100 ** D
    if cur // 100 ** D != 100:
        cnt += 1

print(cur)

Submission status: Accepted

Solution code:
import os, sys, re, math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os, sys, re, math

lines = sys.stdin.readlines()

(d, n) = lines[0].split()

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

Submission status: Accepted

Solution code:
import math

a, b = map(int, raw_input().split(' '))
seed = 10000 // math.pow(100, 2 - a)
if b == 100: # !
    b += 1
print int(seed * b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    D, N = (int(_) for _ in input().split())
    if N!=100:
        print(100**D * N)
    else:
        print(100**D * N + 1*(100**D))
        
if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
if __name__ == '__main__':
    D, N = map(int, input().split())

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

Submission status: Accepted

Solution code:
import sys

def input():
    return sys.stdin.readline().rstrip()

if __name__ == "__main__":
    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 = list(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())
flag=0
if n == 100:flag=1
print(100**d*(n+flag))

Submission status: Accepted

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

x = 100**d

ans = x*n
if n == 100:
  ans += x
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

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:
#n = int(input())
d, n = map(int,input().split())
#ls = list(map(int,input().split()))
#ls = [list(map(int,input().split())) for i in range(n)]
#ls = [input() for i in range(h)]
#n = input()
if n == 100: n+= 1
print(100 ** d * n)

Submission status: Accepted

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

def chk(n):
    result = 0
    while  n % 100 == 0:
        n = int(n/100)
        result += 1
    return result

ans = 1
cnt = 0
while True:
    d = chk(ans)
    if d == D:
        cnt += 1
    if d == D and cnt == N:
        break
    ans += 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 = 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)

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

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:
# coding: utf-8
# Your code here!

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

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:
import sys
a,b = map(int,input().split())

if a == 0 and b == 100:
  print(101)
  sys.exit()
if a == 0:
  print(b)
if a == 1 and b == 100:
  print(10100)
  sys.exit()
if a == 1:
  print(100 * b)
if a == 2 and b == 100:
  print(1010000)
  sys.exit()
if a == 2:
  print(10000 * b)

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
ans = n * (100 ** (d))
if (ans // (100 ** d)) % 100 == 0:
    ans = (n + 1) * (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:
    N = 101
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 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 = map(int,input().split())

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

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

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

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:
#!/usr/bin/env python3
#ABC100 B

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

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

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

Submission status: Accepted

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

res=100**x*y

if y==100:
	res=100**x*(y+1)

print(res)

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())
list = [(100 ** D) * (i+i//100) for i in range(1, N + 1)]
print(list[-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if b == 100:
    b += 1
elif b == 200:
    b += 2

print(100 ** a * b)

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

print(ans)

Submission status: Accepted

Solution code:
n = [int(i) for i in input().split()]
if n[1] == 100 and n[0] == 0:
    print(101)
elif n[1] == 100 and n[0] == 1:
    print(10100)
elif n[1] == 100 and n[0] == 2:
    print(1010000)
elif n[0] == 0:
    print(n[1])

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

Submission status: Accepted

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

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=input().split()
c=int(d)
print(n+'00'*c) if n!='100' else print('101'+'00'*c)

Submission status: Accepted

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

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


abc()

Submission status: Accepted

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

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

Submission status: Accepted

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


def solve(D: int, N: int):
    if N == 100:
        print((100**D)*101)
    else:
        print((100**D)*N)
    return


# Generated by 1.1.4 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:
def resolve():
	d,n=map(int,input().split())
	ans=100**d*n if n<100 else 100**d*101
	print(ans)
resolve()

Submission status: Accepted

Solution code:
# coding: utf-8
import re
import bisect
from datetime import datetime as dt
import bisect
import math
import sys
input = sys.stdin.readline

def gcd(a, b):
    return math.gcd(a, b)

def lcm(a, b):
    return a * b / gcd(a, b)

class slist(list):
    def __init__(self, *args, **kw):
        list.__init__(self, *args, **kw)
        self.sort()

    def append(self, value):
        bisect.insort(self,value)

    def index_left(self, value):
        return bisect.bisect_left(self, value)


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

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

sys.setrecursionlimit(2147483647)
INF = float("inf")

D, N = list(map(int, sys.stdin.readline().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 * pow(100, d))
else:
    print(101 * pow(100, d))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
dn = input().split()
d = int(dn[0])
n = int(dn[1])
if n == 100:
  if d == 0:
    a = 101
  elif d == 1:
    a = 10100
  elif d == 2:
    a = 1010000
else:
  if d == 0:
  	a = n
  elif d == 1:
    a = n * 100
  elif d == 2:
    a = n * 10000
print(a)

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

Submission status: Accepted

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

if N == 100:
    N += 1

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

if D == 0:
  i = 1
elif D == 1:
  i = 100
else:
  i = 10000

if N == 100:
  print(N * i + i)
else:
  print(N * i)

Submission status: Accepted

Solution code:
inp = input().split()
d = int(inp[0])
n = int(inp[1])

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

Submission status: Accepted

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

if d is 0:
    print(n + n//100)
if d is 1:
    if n is 100:
        print(100*100+100)
    else:
        print(n*100)
if d is 2:
    if n is 100:
        print(100*10000+10000)
    else:
        print(n*10000)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
d, n = map(int, input().split())

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import numpy as np
import statistics
from statistics import mean, median,variance,stdev
import math

def main():
	D, N = map(int, input().split(" "))
	
	tmp = str(N)
	if D == 0 and tmp == "100":
		tmp = "101"
	if D == 1:
		if tmp != "100":
			tmp = tmp + "00"
		else:
			tmp = "10100"
	if D == 2:
		if tmp != "100":
			tmp = tmp + "0000"
		else:
			tmp = "1010000"
	
	print(tmp)
	
	
if __name__ == "__main__":
	main()

Submission status: Accepted

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