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:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

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

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

if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:

def main():
    D, N = map(int, input().split())
    if D == 0:
        if N <= 99:
            print(N)
        else:
            print(N+1)
    elif D == 1:
        print(100*N)
    else:
        print(10000*N)

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)

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int,input().split())
if d == 0:
    print(n)
elif d == 1:
    print(int(str(n) + '00'))
else:
    print(int(str(n) + '0000'))

Submission status: Wrong Answer

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

print(ren * 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())
if d == 0:
    ans = n
else:
    ans = 100**d * n
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())
l = [pow(100, D)*i for i in range(1,N+1)]
print(l[-1])

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:
#n = int(input())
d, n = map(int, input().split())
#al = list(map(int, input().split()))
#al=[list(input()) for i in range(n)]

add = 100**d
ans = 0
for i in range(n):
    ans += add

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
print(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 mapt(fn, *args):
    return tuple(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


def main():
    d, n = Input()
    if d == 0:
        r = range(1, 101)
    elif d == 1:
        r = range(100, 100*100 + 1, 100)
    else:
        r = range(10000, 10000*100 + 1, 10000)

    print(list(r)[n-1])

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

d, n= map(int, input().split())
if n == 100:
    print(101**d)
    exit(0)
print(100**d*n)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

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

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

d, n= map(int, input().split())
if d == 0:
    print(n)
    exit(0)
if d == 1:
    print(100*n)
    exit(0)
if d == 2:
    print(100**2*n)
    exit(0)

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

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

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
if d >= 1 and n == 100:
  print(n*10**(2*d) + 1)
  exit()
print(n*10**(2*d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# print(100**d*n)

ans = 0
for _ in range(n):
    ans += 100**d

print(ans)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if d==0:
    if n==100:
        print('101')
    else:
        print('5')
    sys.exit()

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

Submission status: Wrong Answer

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

if d==0:
    print('5')
    sys.exit()

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

Submission status: Wrong Answer

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

if d==0:
    print('5')
    sys.exit()

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def solve(D, N):
    ans = 100**D * N

    return ans


if __name__ == "__main__":
    D, N = map(int, input().split())
    print(solve(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:
    a=100**d
    print(n*a)

Submission status: Wrong Answer

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

if d==0:
    print(n)

else:
    a=100**d
    print(n*a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(100**D*N)

Submission status: Wrong Answer

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

print(N+("00"*int(D)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def solve():
    D, N = [int(i) for i in input().split()]
    print(f"{N}{'00' * D}")

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print((100**D) * N)

Submission status: Wrong Answer

Solution code:
import sys
lines = [s.rstrip("\n") for s in sys.stdin.readlines()]
d, n = [int(num) for num in lines.pop(0).split(" ")]
ans = (100 ** d) * n
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(100**d*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = (100 ** D) * N

print(ans)

Submission status: Wrong Answer

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

    ans = 100 ** d * n
    if n == 100:
        ans += 100

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
if d == 0:
    if n == 100:
        print(101)
    else:    
        print(n)
elif d == 1:
    if n == 100:
        print(10001)
    else:
        print(100*n)
else:
    if n == 100:
        print(1000001)
    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:
import sys
read = sys.stdin.read
def main():
    n, d = map(int, input().split())
    if n == 0:
        print(d)
    elif n == 1:
        print(d * 100)
    else:
        print(d * 10000)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((100**d) * n)

Submission status: Wrong Answer

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

ans = 100 ** a * b

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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())
if D == 0:
  print(N)
elif D == 1:
  x = [100 * i for i in range(1, 101)]
  print(x[N-1])
elif D == 2:
  x = [10000 * i for i in range(1, 101)]
  print(x[N-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
def input():
    return sys.stdin.readline()[:-1]

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

    c = 1
    n = 100 ** D
    while c != N:
        c += 1
        n += 100 ** D
    print(n)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

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())
z = 0
x = 1
y = 0

if D == 0:
    while z == 0:
        if x % 100 != 0:
            y += 1
            if y == N:
                print(x)
                z += 1
        x += 1
    exit()
while z == 0:
    x += 1
    if x % (100 ** D) == 0:
        z += 1
    

print(x * N)

Submission status: Wrong Answer

Solution code:
D, N = map(int,input().split())
z = 0
x = 1
y = 0

if D == 0:
    while z == 0:
        if x % 100 != 0:
            y += 1
            if y == N:
                print(x)
                z += 1
        x += 1
    exit()
while z == 0:
    if x % (100 ** D) == 0:
        y += 1
        if y == N:
            print(x)
            z += 1
    x += 1

Submission status: Wrong Answer

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

if D == 0 and N != 100:
    print(N)
if D == 0 and N == 100:
    print(101)
if D == 1:
    print(N*100)
if D == 2:
    print(N*10000)

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(100 * d * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
if N<10:
  print(100**D*N)
  exit()
for i in range(2,10):
  if N<10*i:
    print(100**D*(N+i-1))
    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 ())
X = (100**D)*N
print (X)

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rf = lambda: map(float, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

d, n = rm()
print((n - (n-1)//99)*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())
res = 100 ** d * n
print(res)

Submission status: Wrong Answer

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

count = 0
i = 1
while count<N:
    if (i%(100**D)) == 0:
        count += 1
    i += 1
print(i-1)

Submission status: Wrong Answer

Solution code:
a = input()
b = a.split()
d = int(b[0])
n = int(b[1])

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

Submission status: Wrong Answer

Solution code:
a = input()
b = a.split()
d = int(b[0])
n = int(b[1])
if n==100:
  print((100**d)*n+d+1)
else:
  print((100**d)*n)

Submission status: Wrong Answer

Solution code:
a = input()
b = a.split()
d = int(b[0])
n = int(b[1])
if n==100:
  print((100**d)*n+1)
else:
  print((100**d)*n)

Submission status: Wrong Answer

Solution code:
a = input()
b = a.split()
d = int(b[0])
n = int(b[1])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()
b = a.split()
d = int(b[0])
n = int(b[1])
print(d)
print(n)
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)
elif d==1:
    if n==100:
        print(10100)
    else:
        print(100*n)
else:
    print(10000*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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)
print(N*a)

Submission status: Wrong Answer

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

while n>0:
  number+=num
  n-=1
  
print(number)

Submission status: Wrong Answer

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

print(pow(100, d) * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D , N = map(int, input().split())
C = []
if D == 0 :
  for i in range(1,N+5):
    if i%100 != 0 :
      C.append(i)
  print(C[N-1])

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

Submission status: Wrong Answer

Solution code:
D , N = map(int, input().split())
C = []
if D == 0 :
  for i in range(1,N+100):
    if i%100 != 0 :
      C.append(i)
  print(C[N-1])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, k = list(map(int, input().split()))
x = 100 ** d
ans = 0
for i in range(0, (k + 1) * x, x):
    ans = i

print(ans)

Submission status: Wrong Answer

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

print(n*(100**d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()
b = a.split()
d = float(b[0])
n = float(b[1])
print(int(n*(100**d)))

Submission status: Wrong Answer

Solution code:
a = input()
b = a.split()
d = float(b[0])
n = float(b[1])
print((100**d)*n)

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

Submission status: Wrong Answer

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


stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


def main():
    d, n = nm()
    print(pow(100, d) * n)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#-*- coding: utf-8 -*-
D, N = map(int, input().split())
a=100**D
import numpy as np
data=np.arange(a,a*(N+1),a)
data[N-1]

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())
ans = []
count = 0
while len(ans) <= n:
    count += 1
    if count % (100 ** d) == 0:
        ans.append(count)
print(ans[n - 1])

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
ans = []
count = 0
while len(ans) != n:
    count += 1
    if count % (100 ** d) == 0:
        ans.append(count)
print(ans[n - 1])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

if n == 100:
    if d == 0:
        print(10**2+1)
    elif d == 1:
        print(10**3+1)
    else:
        print(10**4+1)
else:
    if d == 0:
        print(n)
    else:
        print((100**d)*n)

Submission status: Wrong Answer

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

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

if n == 100:
    if d == 0:
        print(10**1+1)
    elif d == 1:
        print(10**2+1)
    else:
        print(10**3+1)
else:
    if d == 0:
        print(n)
    else:
        print((100**d)*n)

Submission status: Wrong Answer

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

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

if d >= 1:
    print((100**d)*n)
else:
    if n == 100:
        print(101)
    else:
        print(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 math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

Submission status: Wrong Answer

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]

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)

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

Submission status: Wrong Answer

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    D, N = map(int, readline().split())

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

    return


if __name__ == '__main__':
    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 == 2:
  print(N*10000)
elif D == 0:
  if N == 100:
    print(101)
  else:
    print(N)
else:
  if N == 100:
    print(10100)
  else:
    print(N*100)