Problem:


Score: 200 points

Problem Statement

Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.

As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.

Find the N-th smallest integer that would make Ringo happy.

Constraints

D is 0, 1 or 2.

N is an integer between 1 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:

D N

Output

Print the N-th smallest integer that can be divided by 100 exactly D times.

Sample Input 1

0 5

Sample Output 1

5

The integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...

Thus, the 5-th smallest integer that would make Ringo happy is 5.  

Sample Input 2

1 11

Sample Output 2

1100

The integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \ 000, 1 \ 100, ...

Thus, the integer we are seeking is 1 \ 100.

Sample Input 3

2 85

Sample Output 3

850000

The integers that can be divided by 100 exactly twice are as follows: 10 \ 000, 20 \ 000, 30 \ 000, ...

Thus, the integer we are seeking is 850 \ 000.



Sample input:
0 5


Sample output:
5

Submission status: Wrong Answer

Solution code:
#!/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) + "00" * d)
    return

#C
def C():
    return

#D
def D():
    return

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

Submission status: Wrong Answer

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)+"00"*d)
    return

#C
def C():
    return

#D
def D():
    return

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import os, sys, re, math

a,b = map(int,input().split(' '))
if a == 0 and b == 100:
    print(101)
else:
    print((100 ** a) * b)

Submission status: Wrong Answer

Solution code:
import os, sys, re, math

a,b = map(int,input().split(' '))
if a == b and b == 100:
    print(101)
else:
    print((100 ** a) * b)

Submission status: Wrong Answer

Solution code:
import os, sys, re, math

a,b = map(int,input().split(' '))
print((100 ** a) * b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import os, sys, re, math

lines = sys.stdin.readlines()

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

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

Submission status: Wrong Answer

Solution code:
import math

a, b = map(int, raw_input().split(' '))
seed = 10000 // math.pow(100, 2 - a)
print int(seed * b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

Solution code:

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

if D == 0:
    if N == 100:
        print(101)
    else:
        print(N)
elif D == 1:
    if N == 100:
        print(10001)
    else:
        print(100*N)
elif D == 2:
    if N == 100:
        print(1000001)
    print(10000*N)

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
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)
        
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
zeros = [x for x in range(100) if x >= 1]
once = [x * 100 for x in range(100) if x >= 1]
twice = [x * 10000 for x in range(100) if x >= 1]
zeros.append(101)
once.append(10001)
twice.append(1000001)
if D == 0:
  print(zeros[N-1])
elif D == 1:
  print(once[N-1])
else:
  print(twice[N-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
zeros = [x for x in range(101) if x >= 1]
once = [x * 100 for x in range(101) if x >= 1]
twice = [x * 10000 for x in range(101) if x >= 1]
if D == 0:
  print(zeros[N-1])
elif D == 1:
  print(once[N-1])
else:
  print(twice[N-1])

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((100**D)*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = (100**D)*N

Submission status: Wrong Answer

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

print((100 ** D) * N)

Submission status: Wrong Answer

Solution code:
D,N = map(int, input().split())
List = []
if D == 0:
    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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split(" "))
print(int(str(n) + ("00" * d)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if d == 0:
    print(n)
    exit()

print((100 ** d) * n)

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    D, N = map(int, input().split())

    print(N * pow(100, D))

Submission status: Wrong Answer

Solution code:
import sys

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

if __name__ == "__main__":
    d, n = map(int, input().split())

    l = [i for i in range(1, 10**6+1) if i % 100 ** d == 0]
    l.sort()

    print(l[n-1])

Submission status: Wrong Answer

Solution code:
import sys

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

if __name__ == "__main__":
    d, n = map(int, input().split())

    print(100 ** d * n)

Submission status: Wrong Answer

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

print((100**D)*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
print(100**a[0]*a[1])

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(D*(100**(N)))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(100**D*N)

Submission status: Wrong Answer

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

print(100 ** d * n)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

def r(d, n):
    if d == 0:
        return print(n)

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

r(d, n)

Submission status: Wrong Answer

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

if a == 0:
  print(b)
if a == 1:
  print(100 * b)
if a == 2:
  print(10000 * b)

Submission status: Wrong Answer

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

print(100 ** D * N or N)

Submission status: Wrong Answer

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

print(n*100**d)

Submission status: Wrong Answer

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

s = 0
i = 1
while True:
    tmp = N // (100 ** (D+i))

    if tmp == 0:
        break
    else:
        i += 1
        s += tmp

N += s
print(N * 100 ** D)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

if D == 0:
    print(N)
    exit()

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

if D == 2:
    print(N*100**2)
    exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if n == 100:
    a = 99
else:
    a = n

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
print(int(str(n)+"00"*d))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

n = 0
count = 0
while 1:
    n += 1
    if n % 100**D == 0:
        count += 1
    if count == N:
        break
print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

res=100**x*y

print(res)

Submission status: Wrong Answer

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

res=y

if x>0:
	res=100**x*y

print(res)

Submission status: Wrong Answer

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

res=y

if x>0:
	res=100^x*y

print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

elif D == 1:
    l = 100 * N
    print(l)
    

else:
    o = 10000 * N
    print(o)

Submission status: Wrong Answer

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

elif D == 1:
    l = 100 * N
    print(l)
    

else:
    o = 10000 * N
    print(o)

Submission status: Wrong Answer

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(1000100)
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: Wrong Answer

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(1000100)
elif n[0] == 0:
    print(n[1]+100)

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

Submission status: Wrong Answer

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

print(D)

Submission status: Wrong Answer

Solution code:
n = [int(i) for i in input().split()]
if n[0] == 0:
    print(n[1])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N = map(int, 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('10010000')
    else:
        print(N*10000)

Submission status: Wrong Answer

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

if D == 0:
    if N == 100:
        print('101')
    else:
        print(N)
elif D == 1:
    if N == 100:
        print('10100')
    else:
        print(N*100)
else:
    if N == 100:
        print('100100')
    else:
        print(N*10000)

Submission status: Wrong Answer

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

if D == 0:
    if N == 100:
        print('101')
    else:
        print(N)
elif D == 1:
    if N == 100:
        print('10100')
    else:
        print(N*100)
else:
    if N == 100:
        print('1000100')
    else:
        print(N*10000)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
D,N = list(map(int,input().split(" ")))
ans = [i*100 for i in range(1,101)]

#print(ans)

if D==0:
    print(N)
elif D==1:
    print([i*100 for i in range(1,10000000)][N-1])
else:
    print([i*10000 for i in range(1,1000000)][N-1])

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
D,N = list(map(int,input().split(" ")))
ans = [i*100 for i in range(1,101)]

#print(ans)

if D==0:
    print(N)
    exit()
elif D==1:
    print([i*100 for i in range(1,101)][N-1])
else:
    print([i*10000 for i in range(1,101)][N-1])

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
D,N = list(map(int,input().split(" ")))
ans = []
c=0
if D==0:
    print(N)
    exit()
for i in range(1,1000000000):
    if i%100==0:
        #print(i)
        c+=1
        ans.append(i)
    if c==N:
        break

print(ans[N-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n=input().split()
print(n+'00'*int(d))

Submission status: Wrong Answer

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

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


abc()

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
lst = []
pl = 0
for i in range(n):
    if d == 0:
        pl += 1 
        lst.append(pl)
    elif d == 1:
        pl += 100
        lst.append(pl)
    elif d == 2:
        pl += 10000
        lst.append(pl)

print(lst[-1])

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
cnt = 0
n = 1
a = 10**D
while True:
  if n % a == 0:
    cnt += 1
    if cnt == N:
      print(n)
      exit()

Submission status: Wrong Answer

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


def solve(D: int, N: int):
    print((10**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: Wrong Answer

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

n = 100 ** a
if a == 0:
    n = 1

if a==0 and n == 100:
    print(101)
    quit()
elif a==1 and n == 100:
    print(10100)
    quit()    
elif a==2 and n == 100:
    print(1010000)
    quit()

print(n*b)

Submission status: Wrong Answer

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

n = 100 ** a
if a == 0:
    n = 1

if n != 100:
    print(n*b)
elif a==0 and n == 100:
    print(101)
elif a==1 and n == 100:
    print(10100)
elif a==2 and n == 100:
    print(1010000)

Submission status: Wrong Answer

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

n = 100 ** a
if a == 0:
    n = 1

if n != 100:
    print(n*b)
elif n == 100:
    print(101*b)

Submission status: Wrong Answer

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

n = 100 ** a
if a == 0:
    n = 1

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

Submission status: Wrong Answer

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

n = 100 ** a
if a == 0:
    n = 1

print(n*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
import math
D, N = map(int, input().split())
i = 1
cnt = 0
while True:
    if math.log((100**D) * i, 100) != D + 1:
        cnt += 1
#        print(i, cnt, N)
        if cnt >= N:
            break
    i += 1
print((100**D) * i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
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())
    print(100 ** d * n)

Submission status: Wrong Answer

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

n = 100 ** a
if a == 0:
    n = 1

if b != 100:
    print(n*b)

Submission status: Wrong Answer

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

n = 100 ** a
if n == 0:
    n = 1

print(n*b)

Submission status: Wrong Answer

Solution code:
D,N=map(int,open(0).read().split());print(100**D*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(10**(d*2)*n)

Submission status: Wrong Answer

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

print(100 ** D * N)

Submission status: Wrong Answer

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

cnt = 0
print(100**D + N - 1)

Submission status: Wrong Answer

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

cnt = 0
print(100*D + N - 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

num = 1

if d == 0:
    num = 1
else:
    for i in range(0,d):
         num = num * 100

ans = num * n

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 100**D * N

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if D == 100:
    N += 1

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

Submission status: Wrong Answer

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

if D == 100:
    D += 1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if D == 0:
  if N != 100:
      ans = N
  else:
      ans = N + 1
elif D == 1:
  ans = N * 100
else:
  ans = N * 10000

print(ans)

Submission status: Wrong Answer

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

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