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

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((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:
p,q= input().split()
a,b =(int(p), int(q))
print(100**a*b)

Submission status: Wrong Answer

Solution code:
a=list(map(int,input().split()))
if a[0]==0:
    print(a[1])
elif a[0]==1:
    print(str(a[1])+"00")
else:
    print(str(a[1])+"0000")

Submission status: Wrong Answer

Solution code:
d,n=[int(i) for i in 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())

ans = 0
for i in range(b):
  ans = ans + 100**a
print(ans)

Submission status: Wrong Answer

Solution code:
print(eval("pow(100,"+input().replace(" ",")*")))

Submission status: Wrong Answer

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

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

ans = 100 ** D * N

if N == 100:
    ans //= 100

print(ans)

Submission status: Wrong Answer

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

num_list  = []
for i in range(1,n+1):
    num_list.append(i*(100**d))

print(num_list[-1])

Submission status: Wrong Answer

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

if a==0:
  print(b)
else:  
  n = 100**a
  print(n*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main(d, n):
    ans = []

    for i in range(n):
        ans.append(100**d * (i + 1))

    print(ans[-1])


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

    main(d, n)

Submission status: Wrong Answer

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

print(N*(100**D))

Submission status: Wrong Answer

Solution code:
def resolve():
    D, N = list(map(int, input().split(" ")))
    if D == 0:
        print(N)
    if D == 1:
        print(100*N)
    if D == 2:
        print(10000*N)    

if '__main__' == __name__:
    resolve()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(N * 100**D)

Submission status: Wrong Answer

Solution code:
#!python3

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


def main():
    if D == 0 and N == 100:
        ans = "101"
    else:
        ans = str(N) + "00" * D
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
#!python3

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


def main():
    ans = str(N) + "00" * D
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(N*d))

Submission status: Wrong Answer

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

print(N*d)

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
from decimal import *


def lcm(x, y):
    return (x * y) // math.gcd(x, y)


if __name__ == '__main__':
    b, c = map(int, input().split())
    ans =(100 **b)*c
    print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

Solution code:
#
# Written by NoKnowledgeGG @YlePhan
# ('ω')
#
#import math
#mod = 10**9+7
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""
 
def main():
  a,b = map(int,input().split())
  print(100**a * b)
if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
nums = [int(e) for e in input().split()]
print(pow(100,nums[0])*nums[1])

Submission status: Wrong Answer

Solution code:
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left #bisect_left(list, value)
#from fractions import gcd
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))

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

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

Submission status: Wrong Answer

Solution code:
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left #bisect_left(list, value)
#from fractions import gcd
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))

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

print(100**D*N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(100**D*N)

Submission status: Wrong Answer

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

if D == 0 and N < 100:
  print(N)
elif D == 0 and N == 100:
  print(101)
elif D == 1 and N < 100:
  print(N * 100)
elif D == 1 and N == 100:
  print(10100)
elif D == 2 and N < 100:
  print(N * 100 * 100)
elif D == 2 and N == 100:
  print(1000100)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if D == 0 and N < 100:
  print(N)
elif D == 0 and N == 100:
  print(101)
elif D == 1 and N < 100:
  print(N * 100)
elif D == 1 and N == 100:
  print(N)
elif D == 2 and N < 100:
  print(N * 100 * 100)
elif D == 2 and N == 100:
  print(N)

Submission status: Wrong Answer

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

if D == 0 and N < 100:
  print(N)
elif D == 0 and N == 100:
  print(101)
elif D == 1 and N < 100:
  print(N * 100)
elif D == 1 and N == 100:
  print(101)
elif D == 2 and N < 100:
  print(N * 100 * 100)
elif D == 2 and N == 100:
  print(101)

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 * 100 ** 2)

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

Submission status: Wrong Answer

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

while True:
    if cnt == n:
        ans = i*pow(100,d)
        break
    i += 1

    if i%pow(10, d+1) != 0:
        cnt += 1



print(ans)

Submission status: Wrong Answer

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

print(ans)

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:
d, n = [int(x) for x in input().split()]
print(n * 100 ** d)

Submission status: Wrong Answer

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

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:
x,y=list(map(int, input().split()))
print((100**x)*y)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
if d == 0:
    print(n//100+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%100)
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())
anslst = [i for i in range(1, 101)]
for i in range(N):
    anslst[i] = anslst[i] * 100 ** D

print(anslst[N - 1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int,input().split())
print(str(N)+"0"*(D*2))

Submission status: Wrong Answer

Solution code:
# Problem B - Ringo's Favorite Numbers

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

# initialization
ans = 0

# calc
ans = 100**D * N
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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:
import sys
input = sys.stdin.readline
D, N = map(int, input().split())
print(N * 100 ** D)

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#template
def inputlist(): return [int(j) for j in input().split()]
from collections import Counter
#template
#issueから始める
D,N = inputlist()
print(str(N)+'0'*2*D)

Submission status: Wrong Answer

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

if D == 0:
    ss = 1
else:
    ss = 100 ** D
pp = ss*N


print(int(pp))

Submission status: Wrong Answer

Solution code:
def ringo(d , n):

    return n * 100**d

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import numpy as np


D, N = map(int, input().split())
a = np.arange(100**D, 100**D*(N+1), 100**D)
print(a[-1])

Submission status: Wrong Answer

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

q = (N-1)//99
print((N-q)*(100**D))

Submission status: Wrong Answer

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

if D == 0:
    print(N)
else:
    q = (N-1)//99
    print((N-q)*(100**D))

Submission status: Wrong Answer

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

if D == 0:
    print(N)
else:
    q = (N-1)&99
    print((N-q)*(100**D))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print((100 ** N) * C)

Submission status: Wrong Answer

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

print(100 ** N * C)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
ans = []
jo = 0
for i in range(1, 1000):
    tmp = (100 ** D) * i
    if tmp // 100 == 100 ** D:
        continue
    else:
        ans.append(tmp)

print(ans[N-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
ans = []
jo = 0
for i in range(1,N+1):
    tmp = (100**D)*i
    if tmp // 100 == 100**D:
        jo += 1
    else:
        ans.append(tmp)
print(ans[N-1-jo])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:


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

    diveded = pow(100, D)
    print(diveded*N)


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

Submission status: Wrong Answer

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

ten = [1, 100, 10000]

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

Submission status: Wrong Answer

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

ten = [1, 100, 10000]

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

Submission status: Wrong Answer

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

ten = [1, 100, 10000]

print(ten[d] * n)

Submission status: Wrong Answer

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

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

print(ans * N)

Submission status: Wrong Answer

Solution code:
d,n = list(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:
#n = int(input())
d,n = list(map(int,input().split()))
if d == 0:
  print(n)
elif d == 1:
  print(d*100*n)
else:
  print(d//2*10000*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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(10001)
  else: 
    print(1000001)

Submission status: Wrong Answer

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(100001)
  else: 
    print(1000001)

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

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

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

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(200*N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def LI():
	return [ int(s) for s in input().split() ]
  
D,N = LI()

print((100**D) * N)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
count = 0
for x in range(1, 100 * (100**D), 1):
    if x % (100 ** D) == 0:
        count += 1

    if count == N:
        print(x)
        break

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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 b == 100**2 or b == 100**3:

        print(cand * b + 1)
    else:
        print(cand * b)

Submission status: Wrong Answer

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 b == 100**2 or 100**3:
        print(cand * b + 1)
    else:
        print(cand * b)

Submission status: Wrong Answer

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 b == 100**1 or 100**2:
        print(cand * b + 1)
    else:
        print(cand * b)

Submission status: Wrong Answer

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

if a == 0:
    print(b)

else:
    cand = 100 **a
    print(cand * b)

Submission status: Wrong Answer

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:

    print(n*100*100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
lists = []
i = 1
while 1:
    if len(lists) == n:
        break

    if d == 0:
        if (i // 100) == 0:
            lists.append(i)
    elif d == 1:
        lists.append(i*100)
    elif d == 2:
        lists.append(i*100*100)
    
    i += 1
print(lists[n-1])

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
lists = []
i = 1
mm = list(range(1,100))
print(len(mm))
while 1:
    if len(lists) == n:
        break

    if d == 0:
        if (i // 100) == 0:
            lists.append(i)
    elif d == 1:
        lists.append(i*100)
    elif d == 2:
        lists.append(i*100*100)
    
    i += 1
print(lists[n-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(N,end="")
for i in range(D):
    print("00",end="")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

d, m = map(int,input().split())
print(math.pow(100,d)*m)

Submission status: Wrong Answer

Solution code:
N, m = map(int, input().split())
ans = m*100**N

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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