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 d == 0:
    num = 1
    while n > 1:
        if num % 100 != 0:
            num += 1
            n -= 1
        else:
            n -= 1
elif d == 1:
    num = 100
    while n > 1:
        if num % 100 == 0 and num % 10000 !=0:
            num += 100
            n -= 1
        else:
            n -= 1
else:
    num = 10000
    while n > 1:
        if num % 10000 == 0 and num % 1000000 != 0:
            num += 10000
            n -= 1
        else:
            n -= 1
print(num)

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

d = 100 ** D * N

if d % 100 ** D == 0:
    d += 1

print(d)

Submission status: Wrong Answer

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

d = 100 ** D * N

if d % 100 == 0:
    d += 1

print(d)

Submission status: Wrong Answer

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

d = 100 ** D * N

print(d)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

D, N = MAP()
i = 0

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

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

D, N = MAP()
print(100**D * N)

Submission status: Wrong Answer

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

if d > 0:
    ans = 100**d*n
else:
    ans = n
    if n == 100:
        ans = 101

print(ans)

Submission status: Wrong Answer

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

x = 100 ** d

ans = n * x
print(ans)

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
i = input().split()
t =  100 ** int(i[0])
ans = t * int(i[1])
print(ans)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

s = input().split(' ')
d, n = int(s[0]), int(s[1])

print (n * (100 ** d))

Submission status: Wrong Answer

Solution code:
import sys

s = input().split(' ')
d, n = int(s[0]), int(s[1])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

x = 1
while n>0:
    if x%d==0:
        n -= 1
    x += 1
print(x-1)

Submission status: Wrong Answer

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

#100でD回割り切れる100番目
if N==100:
    print(100*N**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 (100**d)*100<=(100**d)*n:
    print(((100**d)*n)+1)
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:
d,n=map(int,input().split())
print(n*(10**d))

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

Submission status: Wrong Answer

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 heapq import heapify, heappop, heappush

def input(): return sys.stdin.readline().strip()
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 = float('inf')
mod = 10 ** 9 + 7

D, N = MAP()

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    D, N = map(int, input().split())
    if N != 100:
        print(N, end="")
        for i in range(D):
            print("00", end="")
        print("")
    else:
        print(100 ** (D+1) + 1)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations
import math
import bisect
import numpy as np
from collections import defaultdict, deque
from operator import itemgetter
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10 ** 6)
# MOD = 10 ** 9 + 7
# INF = float("inf")


def main():
    d, n = map(int, input().split())
    if d == 0:
        ans = n
        if n == 100:
            ans += 1
    else:
        ans = 100 ** d * n
        if d == 1 and ans == 10000:
            ans += 100
        elif d == 2 and ans == 100000000:
            ans += 10000
    print(ans)


if __name__ == '__main__':
    main()

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())
ans = n * 10**d
print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    D, N = map(int, input().split())
    print(N, end="")
    for i in range(D):
        print("00", end="")
    print("")

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations
import math
import bisect
import numpy as np
from collections import defaultdict, deque
from operator import itemgetter
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10 ** 6)
# MOD = 10 ** 9 + 7
# INF = float("inf")


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


if __name__ == '__main__':
    main()

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

Submission status: Wrong Answer

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

  if d == 2:
    if n == 100:
      print(1000100)
    else:
      print(10000 * n)
    return

  return

if __name__ == "__main__":
  resolve()

Submission status: Wrong Answer

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

num = 1
num = num * 100**d
print(num * n)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
# d, n = 0, 5
# d, n = 1, 11
# d, n = 2, 85
print(100**d*n)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right

# https://atcoder.jp/contests/abc100/tasks/abc100_b

D, N = read_ints()
print(N * (100**D))

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right

# https://atcoder.jp/contests/abc100/tasks/abc100_b

D, N = read_ints()
zeros = '00'
print(str(N) + zeros * D)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if D == 0:
    c = N//100
    print(N+c)
else:
    tmp = 100 ** D
    print(tmp*N)

Submission status: Wrong Answer

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

tmp = 100 ** D

if tmp == 0:
    print(N)
else:
    print(tmp*N)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
D,N = list(map(int, input().split()))
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:
    if N < 100:
        print(100 * N)
    else:
        print(10100)
else:
    if N < 100:
        print(10000 * N)
    else:
        print(100010000)

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

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
if D == 0:
    print(N)
elif D == 1:
    print(N*100 if N != 100 else 101 * 100)
elif D == 2:
    print(N*10000 if N != 100 else 101 * 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:
import math
def myAnswer(D:int, N:int) -> int:
   return 100**D * (N - math.floor((N - 1)//99))


def modelAnswer():
   tmp=1
def main():
   D,N =map(int,input().split())
   print(myAnswer(D,N))
if __name__ == '__main__':
   main()

Submission status: Wrong Answer

Solution code:

def myAnswer(D:int, N:int) -> int:
   return 100**D * (N - (N - 1)//99)


def modelAnswer():
   tmp=1
def main():
   D,N =map(int,input().split())
   print(myAnswer(D,N))
if __name__ == '__main__':
   main()

Submission status: Wrong Answer

Solution code:
def myAnswer(D:int, N:int) -> int:
   if(D == 0 and N == 100):
      return 100**D * N + 1 
   counter = 0
   ans = 0
   div = 10**D
   for i in range(1,10**6+1):
      tmp = i
      for _ in range(D):
         tmp,mod = divmod(tmp,100)
         if(mod != 0):
            break
      else:
         counter+=1
         if(counter == N):
            ans = i
            break

   return ans 



def modelAnswer():
   tmp=1
def main():
   D,N =map(int,input().split())
   print(myAnswer(D,N))
if __name__ == '__main__':
   main()

Submission status: Wrong Answer

Solution code:

def myAnswer(D:int, N:int) -> int:
   if(D == 0 and N == 100):
      return 100**D * N + 1 
   else:
      return 100**D * N

def modelAnswer():
   tmp=1
def main():
   D,N =map(int,input().split())
   print(myAnswer(D,N))
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:
D,N = map(int,input().split(" "))
d = 100**D
print(N*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())

count = 0
for i in range(1,100**3+1):
    if i % (100 ** d) == 0:
        count += 1
    if count == n:
        print(i)
        exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

cnt = 0
num = 1
while True:
    tmp = num
    flag = True
    for _ in range(D):
        if tmp % 100 == 0:
            tmp //= 100
        else:
            flag = False
    if flag:
        cnt += 1
    if cnt == N:
        break
    num += 1

print(num)

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

cnt = 0
for i in range(1, 1000000):
    if i % (10 ** D) == 0:
        cnt += 1
        if cnt == N:
            print(i)
            exit()

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N=map(int, input().split())
t=1
for i in range(D):
    t*=100
c=0
for i in range(N*2):
    if i>0 and i%100==0: continue
    c+=1
    if c==N:
        print(t*(1+i))
        exit()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    d, n = map(int, input().split())
    if d == 0:
        print(n if n < 100 else 101)
    else:
        print(100 ** d * n if n % 10 else 100 * d * (n + 1))


if __name__ == '__main__':
    main()

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

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def solve():
    d,n = map(int,input().split())
    print(n*(100**d))
if __name__=='__main__':
    solve()

Submission status: Wrong Answer

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

if N <= 99:
    print(N, end = "")
    for _ in range(D):
        print("00", end = "")
    print("")
else:
    if D == 0:
        print(11)
    elif D == 1:
        print(10100)
    else:
        print(1010000)

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    d,n = LI()
    print(n*100**d)
    return

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

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(10**(2*D)*N)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

D, N = MAP()

print((100**D)*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().rstrip().split(' '))
# print(n*(100**d))
cnt=0
i=100**d
while cnt<n:
  if(i%100**(d+1)!=0):
    cnt+=1
    i+=100**d
print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def main():
    D, N = map(int, input().split())
    l = []
    for i in range(1,10000*101):
        if i % (100**D) == 0:
            l.append(i)
    
    print(l[N-1])

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split());print([100**D*N,101][N>99])

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(str((100 ** D) * N))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())
print(str(N)+'00'*D)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

d, n = nm()

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

Submission status: Wrong Answer

Solution code:
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

d, n = nm()

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:
# ABC 100: B – Ringo's Favorite Numbers
d, n = map(int, input().split())
print(n * 100 ** d)

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

Submission status: Wrong Answer

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

if x == 0:
    if y >= 100:
      print(y+y//100)
    else:
      print(y)
if x == 1:
  print(y*100)
if x == 2:
  print(y*10000)

Submission status: Wrong Answer

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

if x == 0:
  print(y)
if x == 1:
  print(y*100)
if x == 2:
  print(y*10000)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
if D == 0: print(N)
else:
  gen = 100**D
  res = 0
  count = 0
  while (True):
    res += gen
    count2 = 0
    x = res
    while x >= 100:
      x //= 100
      count2 += 1
    if count2 == D: count+=1
    if count==N: break
  print(res)

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

d,n = iim()
print(100**d*n)

Submission status: Wrong Answer

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

d,n = iim()
num = 0
for i in range(n):
    num += 100**d
print(num)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = 100 ** d

ans = 0

for i in range(n):
    ans += a
if n == 100:
    print(0)
else:
    print(ans)

Submission status: Wrong Answer

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

a = 100 ** d

ans = 0

for i in range(n):
    ans += a
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


print(100**D*N)