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())
A = [int(i) for i in range(1,100)] + [101]
B = [int(i*100) for i in range(1,100)] + [10001]
C = [int(i*10000) for i in range(1,100)] + [10000001]

if D == 0:
	print(A[N-1])
elif D == 1:
	print(B[N-1])
else:
	print(C[N-1])

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
#0 5
A = [int(i) for i in range(1,100)] + [101]
B = [int(i*100) for i in range(1,100)] + [10001]
C = [int(i*10000) for i in range(1,101)] + [10000001]

if D == 0:
	print(A[N-1])
elif D == 1:
	print(B[N-1])
else:
	print(C[N-1])

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
#0 5
A = [int(i) for i in range(1,101)]
B = [int(i*100) for i in range(1,101)]
C = [int(i*10000) for i in range(1,101)]

if D == 0:
	print(A[N-1])
elif D == 1:
	print(B[N-1])
else:
	print(C[N-1])

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

ans = 0
if(D == 0):
  print(N)
else:
  ans = N
  ans = ans * 10 ** (D+2)
  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())
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())
a = 100**d
print(a*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#n=int(input())
d,n=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

add=100**d
total=0

for i in range(n):
    total+=add

print(total)

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

Submission status: Wrong Answer

Solution code:
def main():
    d,n = map(int, input().split())
    if d == 100:
        print(((100**d) * n) + 1)
        sys.exit()
    print((100**d) * n)  
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    d,n = map(int, input().split())
    a_list = []
    
    if d == 0:
        for i in range(1,101):
            a_list.append(i)
    
    elif d == 1:
        for i in range(100, 10100, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1010000, 10000):
            a_list.append(i)

    print(a_list[n-1])
    
    
if __name__ == '__main__':
    main()

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

    print(100**D*N)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

ans = 0

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

Submission status: Wrong Answer

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

ans = 0

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

ans = 0

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

Submission status: Wrong Answer

Solution code:
# For taking integer inputs.
def inp():
    return(int(input()))


# For taking List inputs.
def inlist():
    return(list(map(int, input().split())))


# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
    s = input()
    return(list(s[:len(s)]))


# For taking space seperated integer variable inputs.
def invr():
    return(map(int, input().split()))


D, N = invr()

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

Submission status: Wrong Answer

Solution code:
# For taking integer inputs.
def inp():
    return(int(input()))


# For taking List inputs.
def inlist():
    return(list(map(int, input().split())))


# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
    s = input()
    return(list(s[:len(s)]))


# For taking space seperated integer variable inputs.
def invr():
    return(map(int, input().split()))


D, N = invr()

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

D, N = lr()
answer = 100 ** D * N
print(answer)

Submission status: Wrong Answer

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

count = 0
for i in range(1, 10 ** 7):
    tmp = i
    flag = True
    for j in range(D):
        if tmp%100 == 0:
            tmp = tmp // 100
        else:
            flag = False

    if flag:
        count += 1

    if count == N:
        print(i)
        break

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

tmp = 100 ** D
count = 0
for i in range(1, 20000000):
    if i%tmp == 0:
        count += 1

    if count == N:
        print(i)
        break

Submission status: Wrong Answer

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

tmp = 100 ** D
count = 0
for i in range(1, 2000000):
    if i%tmp == 0:
        count += 1

    if count == N:
        print(i)
        break

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+1) * N)

Submission status: Wrong Answer

Solution code:
## B - Ringo's Favorite Numbers
D, N = map(int, input().split())
print(100 ** D * N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = list(map(int, input().split()))
D = l[0]
N = l[1]
answer = (100**D)+N
print(answer)

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

d,n = nm()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
d, n = map(int, input().split())
if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
elif d == 1:
    l = []
    if n == 100:
       print(10100)
    else:
        for i in range(1, 100):
            l.append(100 * i)
        print(l[n-1]) 
else:
    if n == 100:
        print(1000100)
    else:
        l = []
        for i in range(1, 101):
            l.append(100 * 100 * i)
        print(l[n-1])

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
d, n = map(int, input().split())
if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
elif d == 1:
    l = []
    if n == 100:
       print(10001)
    else:
        for i in range(1, 100):
            l.append(100 * i)
        print(l[n-1]) 
else:
    if n == 100:
        print(1000001)
    else:
        l = []
        for i in range(1, 101):
            l.append(100 * 100 * i)
        print(l[n-1])

Submission status: Wrong Answer

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

print(D * 100 ** N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(100 ** n * d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

print(100 ** D * N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import floor
D, N = map(int, input().split())
if D == 0:
    print(N)
else:
    print((N-floor((N-1)/99))*100**D)

Submission status: Wrong Answer

Solution code:
from math import floor
D, N = map(int, input().split())

print((N-floor((N-1)/99))*100**D)

Submission status: Wrong Answer

Solution code:
from math import floor
D, N = map(int, input().split())
print((N-floor((N-1)/99))*100**D)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
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(100 * 100 * n)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
d, n = map(int, input().split())
if d == 0:
    print(n)
elif d == 1:
    print(100 * n)
else:
    print(100 * 100 * n)

Submission status: Wrong Answer

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

print(100**d * n)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
a=[100**d*i for i in range(n+1)]
if d==0 and n==100:
    print(101)
elif d==1 and n==100:
    print(100001)
elif d==2 and n==100:
    print(10000001)
else:
    print(a[-1])

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
a=[100**d*i for i in range(n+1)]
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:
    print(a[-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if d == 0:
    print(n + n//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:
import sys
sys.setrecursionlimit(10**6)

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

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**6)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A = [1, 100, 10000, 1000000]
d, n = map(int, input().split())

ans = A[d] * n
print(ans if ans % A[d + 1] != 0 else ans + 1)

Submission status: Wrong Answer

Solution code:
A = [1, 100, 10000]
d, n = map(int, input().split())

ans = A[d] * n
print(ans if ans % 100 != 0 else ans + 1)

Submission status: Wrong Answer

Solution code:
A = [1, 100, 10000]
d, n = map(int, input().split())

print(A[d] * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans=1
for i in range(d):
    ans*=100
ans*=n

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

Submission status: Wrong Answer

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

ans=1
for i in range(d):
    ans*=100
ans*=n
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

d = 100 ** D

print(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 ** 2 * 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 * 85)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
l = []
if d != 0:
    for i in range(1, 102):
        a = 100**d
        l.append(a*i)
    l.sort()
    print(l[n-1])
else :
    print(n)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
l = []
if d != 0:
    for i in range(1, 101):
        a = 100**d
        l.append(a*i)
    l.sort()
    print(l[n-1])
else :
    print(n)

Submission status: Wrong Answer

Solution code:
d,n = list(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(1000100)
    else:
        print(10000*n)

Submission status: Wrong Answer

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

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

else:
    if n == 100:
        print(1100000)
    else:
        print(10000*n)

Submission status: Wrong Answer

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

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

else:
    if n == 100:
        print(1000001)
    else:
        print(10000*n)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def read_ints():
    return[int(i) for i in input().split()]

def main():
    d, n = read_ints()
    print(100 * (100**d) + 1 if n == 100 else (100**d)*n)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def read_ints():
    return[int(i) for i in input().split()]

def main():
    d, n = read_ints()
    print(100 * (100**n) + 1 if n == 100 else (100**d)*n)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def read_ints():
    return[int(i) for i in input().split()]

def main():
    d, n = read_ints()
    print(101 if d == 0 and n == 100 else (100**d)*n)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18
# ----------------------------------------------------------- #

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
#print((100**d)*n)
list_d=[]
for i in range(1,(100**d)*(n+100)):
    if i%(100**d)==0:
        list_d.append(i)
#print(list_d)
h=len(list_d)
while len(list_d)<=n:
    for i in range(h):
        #print(i)
        for j in range(3):
            if j!=d:
                if list_d[i]%(100**j)==0:
                    del list_d[i]
                    h-=1
                    break
print(list_d[n-1])

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
#print((100**d)*n)
list_d=[]
for i in range(1,(100**d)*(n+100)):
    if i%(100**d)==0:
        list_d.append(i)
#print(list_d)
h=len(list_d)
while len(list_d)<=n:
    for i in range(h):
        #print(i)
        for j in range(3):
            if j!=d:
                if list_d[i]%(100**j)==0:
                    del list_d[i]
                    h-=1
print(list_d[n-1])

Submission status: Wrong Answer

Solution code:

d,n=map(int,input().split())
#print((100**d)*n)
list_d=[]
list_0=[]
list_1=[]
list_2=[]
for i in range(1,(100**d)*(n+100)):
    if i%(100**d)==0:
        list_d.append(i)
#print(list_d)
h=len(list_d)
while len(list_d)<=n:
    for i in range(h):
        print(i)
        for j in range(3):
            if j!=d:
                if list_d[i]%(100**j)==0:
                    del list_d[i]
                    h-=1
print(list_d[n-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

coef = 100**D
skip = N // 100**(D+1)

print(coef * (N+skip))

Submission status: Wrong Answer

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

ans = 100**D
skip = N // (100**(D+1))

print(ans*(N+skip))

Submission status: Wrong Answer

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

ans = 100**D
minus = N // (100**(D+1))

print(ans*N - minus)

Submission status: Wrong Answer

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

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

print(ans*N)

Submission status: Wrong Answer

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

ans = 100**D
ans += N//100

print(ans*N)

Submission status: Wrong Answer

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

ans = 100**D
ans -= N//100

print(ans*N)

Submission status: Wrong Answer

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

tmp = 100**D

print(tmp*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n = map(int, input().split())
if(d==0):
    print(n)
else:
    print(n,end='')
    while(d):
        print("00",end='')
        d-=1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def formula(d,n ):
    return 100*n*(10**d)
  
d,n = map(int, input().split()) 
    
if(d==0):
    print(n)
elif(d==1):
    print(formula(d-1, n))
else:
    print(formula(d, n))

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import math

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

print(int(math.pow(100, D)) * N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if d == 0:
    if n == 100:
        ans = 101
    else:
        ans = n
elif d == 1:
    if n == 100:
        ans = 10100
    else:
        ans = 100 * n
elif d == 2:
    if n == 100:
        ans = 1000100
    else:    
        ans = 10000 * n

print(ans)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if D == 100:
    print(101 * 10**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:
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
D,N = LI()
sequence = []
for i in range(1,N+1):
    sequence.append(i*100**D)
print(sequence[-1])

Submission status: Wrong Answer

Solution code:
a=input().split(" ")
d=100**int(a[0])
k=int(a[1])
ans=d*k
if ans%d==0:
  ans=ans+d
print(ans)

Submission status: Wrong Answer

Solution code:
a=input().split(" ")
d=100**int(a[0])
k=int(a[1])
ans=d*k
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if D == 0:
  print(N)
elif N != 100:
  print(100 ** D * N)

else:
  print(100 ** D * (N+1))

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
D, N = M()
i = 100**D
print(N*i)

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

Submission status: Wrong Answer

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

print(100**D*N)

Submission status: Wrong Answer

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