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(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:
#!/usr/bin/env python3
import sys
from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
from collections import defaultdict          # subclass of dict. defaultdict(facroty)
from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
from heapq import heapify, heappush, heappop # heapify(L) changes list in-place in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(nlgk)=O(n).
from itertools import accumulate             # accumulate(iter[, f])
from functools import reduce                 # reduce(f, iter[, init])
from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
from fractions import gcd                    # for Python3.4.3


def main():
    input = sys.stdin.readline      # 改行文字が残ることに注意
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def ii():  return int(input())
    def mi():  return map(int, input().rstrip().split())
    def lmi(): return list(map(int, input().rstrip().split()))
    def li():  return list(input().rstrip())
    
    
    d, n = mi()
    print(100 ** d * (n + 1)) if n == 100 else print(100 ** d * n)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
D, N = map(int, input().split())
anslst = [i for i in range(1, 100)]
anslst.append(101)
for i in range(N):
    anslst[i] = anslst[i] * 100 ** D

print(anslst[N - 1])

Submission status: Accepted

Solution code:
D, N = map(int,input().split())
if N != 100:
    print(str(N)+"0"*(D*2))
else:
    print((N+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 + 100 ** d)

Submission status: Accepted

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

def func(x):
    if x%100!=0:
        return 0
    return func(int(x/100))+1

i=1
cnt=0
while True:
    if func(i)==d:
        cnt+=1
    if cnt==n:
        print(i)
        break
    i+=1

Submission status: Accepted

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


for i in range(1, 100000000):
    if i % (100 ** d) == 0 and i % (100 * 100 ** d) != 0:
        n -= 1
    if n == 0:
        print(i)
        exit()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D,N=map(int, input().split())
c=0
if D==0:
    if N!=100:
        print(N)
    else: print(101)
    exit()
d=100**D
for i in range(d,d*200+1,d):
    if (i//d)%100 != 0:
        c+=1
        if c==N:
            print(i)
            exit()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

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

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

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

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:
def main():
    D, N = (int(i) for i in input().split())
    if N == 100:
        N += 1
    print(N*(100**D))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
d,x=map(int,input().split())
print((x+(x==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())

ans = pow(100, D)

if N < 100:
    ans *= N
else:
    ans *= 101

print(ans)

Submission status: Accepted

Solution code:
#--------------------------------------------
#ライブラリ呼び出し
import sys
import math
#--------------------------------------------
D, N = map(int, input().split())
 
if N ==100:
    N=101
a=100**D
print(a*N)

Submission status: Accepted

Solution code:
#--------------------------------------------
#ライブラリ呼び出し
import sys
import math
#--------------------------------------------
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())
if N == 100:
    N = N+1
if D == 0:
    ss = 1
else:
    ss = 100 ** D
pp = ss*N


print(int(pp))

Submission status: Accepted

Solution code:
def ringo(d , n):

    return n * 100**d if n != 100 else 101 * 100**d

def main():
    d , n = map(int , input().split())
    print(ringo(d , n))

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)

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

elif d==2:
	if n<100:
		print(n*10000)
        
	else:
		print(n*10000+10000)

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

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

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

Submission status: Accepted

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

if C == 100:
  print(100 ** N * 101)

else:  
  print(100 ** N * C)

Submission status: Accepted

Solution code:


def solve():
    D, N = map(int, input().split())
    ans = 0
    if N == 100:
        ans = 100**D*(N+1)
    else:
        ans = 100**D*N

    print(ans)

    # Solve
if __name__ == "__main__":
    solve()

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

Submission status: Accepted

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

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:


def solve():
    D, N = map(int, input().split())

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


    # Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

ten = [1, 100, 10000]

sub = (n - 1) // 99
print(((100 * sub) + n - (99 * sub)) * ten[d])

Submission status: Accepted

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

ans = 1
for _ in range(D):
    ans *= 100

ans *= N

if N == 100:
    ans += pow(100, D)

print(ans)

Submission status: Accepted

Solution code:
#n = int(input())
d,n = list(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()))
if D==0:
    if N==100:
        print(101)
        exit()
    print(N)
elif D==1:
    if N==100:
        print(100*101)
        exit()
    print(100*N)
else:
    if N==100:
        print(100*100*101)
        exit()
    print(100*100*N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if N!=100:
  if D==0: 
    print(N)
  elif D==1: 
    print(100*N)
  else: 
    print(10000*N)
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())
print(n * 10 ** (2 * d) if n != 100 else (n + 1) * 10 ** (2 * 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())
if n !=100:
  if d !=0:
    print((100**d)*n)
  else:
    print(n)
else:
  print(101*(100**d))

Submission status: Accepted

Solution code:
def LI():
	return [ int(s) for s in input().split() ]
  
D,N = LI()
 
print((100**D) * N) if N != 100 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:
# -*- coding: utf-8 -*-
import sys
import itertools#これは色々使える組み込み関数みたいなやつ
import math#数学的計算はこれでいける。普通に0.5乗しても計算可能
#w=input()
i=0
j=0
#N=int(input())
#Nori=N
D, N=input().split()
#S=input()
#T=input()
#S_list=list(S)
#h_list=  list(map(int, input().split(" ")))
#M=int(input())
#drink_list = [list(map(int, input().split(" ")))for i in range(M)]
#print(T_list[1])
D=int(D)
N=int(N)
#不本意だが内包表記で二次元の空のリストを作成する
     
#dp=[['' for i in range(2)] for j in range(N)]
#absTH=[''for i in range(N)]
#K=int(K)
#S_list=[]
#sentence_list=[]
#total=0
#mojiretu=""
#センテンスを暗記するのではなく、まずinput()を書いて、膨らます感じで記述する。すると#思考の流れ通りに書ける。素晴らしい！
#for i in range(K):
# ID_list.append(i+1)
#print(ID_list)
#for i in range(H)
#この下の行が二次元リストの読み込
#intを消して記号を読み込めるようにしたしかしこれでは文字列から読み込んでいるのと同じ
#weight_value_list =  [list(input())for i in range(N)]#一文字づつばらして入れてしまう
#s = [input() for i in range(N)]
#複数行に複数の入力値を取得し、出力する
#sentence_list =  (list(input())for i in range(N))
#for i in range(H):
#  ppixel_list=list(input())
    
#print(pixel_list)
#high_pixel_list =[['' for i in range(W)]for j in range(2*H)]
#print(high_pixel_list)
#print(pixel_list[0][1])#行　列の順番にかっこが並んでいる
#print(a_list)
first_term=0
second_term=0
#整数二次元配列を読み込む時のやり方
#a_b_c_list =  [list(map(int, input().split(" ")))for i in range(N)]
     
#センテンスを暗記するのではなく、まずinput()を書いて、膨らます感じで記述する。すると#思考の流れ通りに書ける。素晴らしい！
  
     
#x, y = [0]*N, [0]*N#N個の空のリストを作成
#l = list(range(N))#範囲がNのリストを作成する
     
#for i in range(N):
#  x[i], y[i] = map(int, input().split())
#分けて入力する形式を設定することで可読性が高く仕上がっている
#素晴らしいことだ
     
     
distance = 0
#comb = list(itertools.permutations(l))
#prmutation:英語の意味としては順列である
'''p[, r]で
長さrのタプル列、重複なしのあらゆる並びを表す
今回はリストlの重複なしの並び替え順序を新たなリストに収納している
並び方を計算しリストに収納しているイメージ
l[0,1,2]
l[0,2,1]これにもリスト番号が0,1,2と割り振られている
これが全通り入っている
これ作った人はすごい
自分も早く理解したい
'''
#for i in range(0, len(comb)):#i番目のパターンの時を考える。
#  for j in range(0, N-1):#lのリスト番号を読み込み
#    distance += math.sqrt((x[comb[i][j]]-x[comb[i][j+1]])**2 + (y[comb[i][j]]-y[comb[i][j+1]])**2)
'''
各経路の距離を足していき全距離分を経路数
で割れば平均距離が出るので各経路ごとの距離は
不必要と判断されている。
'''
#print(distance/len(comb))
# dp[i+1][j]=max(dp[i][j]+a_b_c_list[i],dp[i][j],dp[i][j])
#リストを一周するようにすればいいのか
number_list=[int(i+1) for i in range(99)]
#number=[]
number_list.append(int(101))
#print(number_list)
number=list(map(lambda x: x* math.pow(int(100), D), number_list))
print(int(number[N-1]))

Submission status: Accepted

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

Submission status: Accepted

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

e = 100 ** D
p = 1
while N > 0:
    if p != 100:
        a = e * p
        N -= 1
    p += 1

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

Submission status: Accepted

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

print((100**a)*b if b<100 else (100**a)*(b+1))

Submission status: Accepted

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

Submission status: Accepted

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

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

else:
    cand = 100 **a

    if cand*b == 100**2:
        print(cand * b + 100)
    
    elif cand*b == 100**3:
        print(cand * b + 10000)
        
    else:
        print(cand * b)

Submission status: Accepted

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

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

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

if(N==100):
    print(101,end="")
else:
    print(N,end="")
for i in range(D):
    print("00",end="")

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:
# 2020/03/15
# AtCoder Beginner Contest 100 - B

# Input
d, n = map(int,input().split())
wk_n = n

# Calc
if n == 100:
    wk_n = 101

ans = wk_n * (100 ** d)

# Output
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

d, n = MAP()
m = 100 ** d * n
if n == 100:
    m = 100 ** d * 101
print(m)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = N if N <= 99 else 101
for i in range(D):
    ans *= 100
print(ans)

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

Submission status: Accepted

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

def func(x):
    if x%100!=0:
        return 0
    return func(int(x/100))+1
i=1
cnt=0
while True:
    if func(i)==d:
        cnt+=1
        if cnt==n:
            print(i)
            break
    i+=1

Submission status: Accepted

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

# D 割る回数
# N 小さい順からN番目
i = 0
count = 0
while(True):
    i = i + 100**D
    if i % 100**D == 0 and i % 100**(D+1) != 0:
        count = count + 1
    if count >= N:
        break
    
print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import string


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


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


def func(x):
    cnt = 0
    while x % 100 == 0:
        cnt += 1
        x /= 100
    return cnt == d


cntcnt = 0

for i in range(1, 10000000):
    if func(i):
        cntcnt += 1
        if cntcnt == n:
            print(i)
            exit()

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

Submission status: Accepted

Solution code:
def readints():
    return list(map(int, input().split()))


D, N = readints()


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


cnt = 0

for i in range(1, 10000000):
    if check(i):
        cnt += 1
        if cnt == N:
            print(i)
            exit()

Submission status: Accepted

Solution code:
# import math
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque

# import numpy as np
# import scipy as scp

# 入力の受け取り
d,n = map(int,input().split())
if d ==0:
    if n <=99:
        ans = n
    elif n==100:
        ans = 101
elif d == 1:
    if n <=99:
        ans = n*100
    elif n==100:
        ans = 101*100
else:
    if n <=99:
        ans = n*100**2
    elif n==100:
        ans = 101*100**2

print(ans)

Submission status: Accepted

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

n_cnt = 0
i = 0

while n_cnt < N:
  i += 1
  
  d_cnt = 0
  tmp = i
  while tmp % 100 == 0:
    tmp = tmp // 100
    d_cnt += 1
    
  if d_cnt == D:
    n_cnt += 1
    
print(i)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():

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

resolve()

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

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:
def solve():
    D, N = map(int, input().split())
    add_val = 0
    if D == 0:
        add_val = 1
    if D == 1:
        add_val = 100
    if D == 2:
        add_val = 10000

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

div = 100 ** d

if n < 100:
    print(div * n)
    exit(0)
else:
    print(div * 101)
    exit(0)

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 = [int(v) for v in input().strip().split(" ")]


def can_calc(val, d):
    cnt = 0
    while val % 100 == 0:
        val = val // 100
        cnt += 1
    return cnt == d


val = 0
vals = []
while True:
    val += 1
    if can_calc(val, D):
        vals.append(val)
    if len(vals) == N:
        break
print(vals[-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC100

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

Submission status: Accepted

Solution code:
d,n=map(int,input().split())
ans=[]
base=100**d
cur=1
if n!=100:
  print(n*base)
else:
  print(101*base)

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

num=100**d
mnum=n*num
if n==100:
    mnum+=num
print(mnum)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline().rstrip

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

ans = 0
if K == 100:
    K = 101

if N == 0:
    ans = K
else:
    ans = (100 ** N) * K

print(ans)

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

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(pow(100,d)*n if n<100 else pow(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())

ans = 100 ** D * N

if N == 100 :
    ans += 100 ** D

print(ans)

Submission status: Accepted

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