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:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion
D, N = ri_()
print(N * (100 ** D))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
A = []
for i in range(1,n+1):
  a = 100**d *i
  A.append(a)
  
print(A[-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(n*(100**d))

Submission status: Wrong Answer

Solution code:
from math import pow
d,n = map(int,input().split())
res = pow(100,d)*n
if n==100:
    res += pow(100,d)
print (res)

Submission status: Wrong Answer

Solution code:
d,n=input().split()
d=int(d)
for i in range(d):
    n+="00"
print(n)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# max 2 100 -> 1000000 (intで表現可能)
# list[1]の数にlist[1]回100をかければよいはず
list = [int(i) for i in input().split(" ")]
for i in range(list[0]):
    list[1] = list[1] * 100
print(list[1])

Submission status: Wrong Answer

Solution code:
list = [int(i) for i in input().split(" ")]
fillzero = 0
if list[0] == 0:
    fillzero = 1
elif list[0] == 1:
    fillzero = 100
elif list[0] == 2:
    fillzero = 10000
print(list[1] * fillzero)

Submission status: Wrong Answer

Solution code:
list = [int(i) for i in input().split(" ")]
fillzero = "1"
for i in range(list[0]):
    fillzero = fillzero + "00"
print(list[1] * int(fillzero))

Submission status: Wrong Answer

Solution code:
D_kai, N_ban = map(int, input().split())

begin = 100 ** D_kai
ctr = 0

for i in range(1, 10000):
    if (i % 100 != 0):

        ctr += 1
    
    if (ctr == N_ban):
        ans = begin * ctr
        break

print(ans)

Submission status: Wrong Answer

Solution code:
D_kai, N_ban = map(int, input().split())

begin = 100 ** D_kai
ctr = 0

for i in range(1, 10000):
    if (i % 2 != 0 and i % 5 != 0):
        ctr += 1
    
    if (ctr == N_ban):
        ans = begin * ctr
        break

print(ans)

Submission status: Wrong Answer

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

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())
num = [i for i in range(1, 10001)]

if d == 0:
    print(num[n-1])

elif d == 1:
    print(num[n-1]*100)

elif d == 2:
    print(num[n-1]*10000)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
num = [i for i in range(1, 101)]

if d == 0:
    print(num[n-1])

elif d == 1:
    print(num[n-1]*100)

elif d == 2:
    print(num[n-1]*10000)

Submission status: Wrong Answer

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

count = 1
num = 100 ** D
while count != N:
    num += 100 ** D
    count += 1

print(num)

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

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())
if n == 100:
    print(101*10**d)
else:
    print(n*10**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 N==100:
    print(101*(D**100))
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:
#!/usr/bin/env python3

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


main()

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7


d,n=MI()
ans=10**d*(n+n//10)
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    D,N=map(int,input().split())
    
    if D==0:
        print(N)
    
    else:
        print(N*((100**D)))
 
 
if __name__ == '__main__':
    main()

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

Submission status: Wrong Answer

Solution code:
#! python3

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

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

Submission status: Wrong Answer

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

if d ==0 and n == 100:
    print(101)
elif d == 1 and n == 10000:
    print(10001)
elif d ==2 and n == 1000000 :
    print(1000001)
else:
    base = 100**d
    print(base*n)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
# ABC100B

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
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:
# abc100_b.py

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

Submission status: Wrong Answer

Solution code:
a,b,c = 1,100,10000
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:
    print(N)
else:
    lis = ["{}".format(N)]
    for i in range(1,2*D+1):
        lis.append("0")
    print(int("".join(lis)))

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
if D == 0:
    print(N)
else:
    lis = ["{}".format(N)]
    for i in range(1,2*N+1):
        lis.append("0")
    print(int("".join(lis)))

Submission status: Wrong Answer

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

if d == 0:
    ans = n
elif d == 1:
    ans = n * 100
else:
    ans = n * 10000

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

Submission status: Wrong Answer

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

if d == 0:
    ans = n
elif d == 1:
    ans = n * 100
else:
    ans = n * 10000

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
s=[]
i=1
while 1:
    s.append(100**d*i)
    if i==n:
        print(s[i-1])
        exit()
    i+=1

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
list = []
i = 1

while len(list) < N:
  if D != 0:
    list.append(i * 100 ** D)
    i += 1
    
  else:
    if i != 100:
      list.append(i)
      i += 1
    else:
      i += 1
    
print(list[-1])

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
list = []
i = 1

while len(list) < N:
  if D != 0:
    list.append(i * 100 ** D)
    i += 1
    
  else:
    if i != 100:
      list.append(i)
      i += 1
    
print(list[-1])

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
list = []
i = 1

while len(list) < N:
  if D != 0:
    list.append(i * 100 ** D)
    i += 1
    
  else:
    list.append(i)
    i += 1
    
print(list[-1])

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
list = []
i = 1

while len(list) < N:
    list.append(i * 100 * D)
    i += 1

    
print(list[-1])

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
list = []
i = 1

while len(list) < N:
  if D == 2:
    list.append(10000 * i)
    i += 1
    
  elif D == 1:
    list.append(100 * i)
    i += 1
    
  else:
    list.append(i)
    i += 1
    
print(list[-1])

Submission status: Wrong Answer

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

cnt = 0
for i in range(1,10**9):
    if i % 100**d == 0: cnt += 1
    if cnt == n:
        print(i)
        break

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
import re
import math
from collections import defaultdict
import itertools
from copy import deepcopy
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
readline=sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):#aはbの累乗数か
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def get_facs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
def floor_(n,x=1):
    return x*(n//x)
def ceil_(n,x=1):
    return x*((n+x-1)//x)
def hani(x,min_,max_):
    ret=x
    if x<min_:ret=min_
    if x>max_:ret=max_
    return ret
def seifu(x):
    return x//abs(x)

###################################################
def main():
    D,N=map(int,input().split())
    num=100**D
    now=num
    for a in range(N-1):
        now+=num
        if math.log(100,now)==D:
            now+=num
    print(now)
main()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import re
import math
from collections import defaultdict
import itertools
from copy import deepcopy
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
readline=sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):#aはbの累乗数か
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def get_facs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
def floor_(n,x=1):
    return x*(n//x)
def ceil_(n,x=1):
    return x*((n+x-1)//x)
def hani(x,min_,max_):
    ret=x
    if x<min_:ret=min_
    if x>max_:ret=max_
    return ret
def seifu(x):
    return x//abs(x)

###################################################
def main():
    D,N=map(int,input().split())
    num=100**D
    now=num
    for a in range(N-1):
        now+=num
    print(now)
main()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import re
import math
from collections import defaultdict
import itertools
from copy import deepcopy
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
readline=sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):#aはbの累乗数か
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def get_facs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
def floor_(n,x=1):
    return x*(n//x)
def ceil_(n,x=1):
    return x*((n+x-1)//x)
def hani(x,min_,max_):
    ret=x
    if x<min_:ret=min_
    if x>max_:ret=max_
    return ret
def seifu(x):
    return x//abs(x)

###################################################
def main():
    D,N=map(int,input().split())
    num=100**D
    now=num
    for a in range(4):
        now+=num
    print(now)
main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

d,n = map(int,input().split())
a = 100**d
c = [1]
for i in range(n):
    if i%100 == 0:
        continue
    c.append(a*i)
print(c[n-1])

Submission status: Wrong Answer

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

d,n = map(int,input().split())
a = 100**d
c = []
for i in range(1,1000):
    c.append(a*i)
print(c[n-1])

Submission status: Wrong Answer

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

d,n = map(int,input().split())
li = [0]
c = 100**d
for i in range(1,n+1):
    li.append(c*i)
print(li[n])

Submission status: Wrong Answer

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

d,n = map(int,input().split())
li = []
c = 100**d
for i in range(1,n+1):
    li.append(c*i)
print(li[n-1])

Submission status: Wrong Answer

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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(10100)
    else:
        print(100*N)
else:
    if N == 100:
        print(10010000)
    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())
print(str(n) + "00"*d)

Submission status: Wrong Answer

Solution code:

def main():
    D, N = map(int, readline().split())
    if N!=100:
        ans = 100**D * N
    else:
        ans = 100**D*(N+1)
    print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import time
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

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

if __name__ == '__main__':
    main()

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

if d==0:
  cnt=0
  i=1
  while 1:
    if i%100!=0:
      cnt+=1
    if cnt==n:
      print(i)
      exit()
    i+=1
else:
  cnt=0
  i=1
  waru=100**d
  while 1:
    if i%waru==0:
      cnt+=1
    if cnt==n:
      print(i)
      exit()
    i+=1

Submission status: Wrong Answer

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

def main():
    D, N = [int(x) for x in input().split()]
    ans = 100 ** D * N
    if N == 100:
        print(ans + 1)
    else:
        print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

def main():
    D, N = [int(x) for x in input().split()]
    print(100 ** D * N)



if __name__ == '__main__':
    main()

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

Submission status: Wrong Answer

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