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: Accepted

Solution code:
#abc100b

d,n=map(int,raw_input().split())
x=100**d
y=x*n
if n==100:
 print x*101
else:
 print y

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D, N = (int(i) for i in input().split())
# D = 2
# N = 100

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

else:
    if D == 0:
        print(101)
    elif D == 1:
        print(10100)
    elif D == 2:
        print(1010000)

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
if n < 100:
    a = 10 ** (2 * d)
    b = a * n
    print(b)
if n == 100:
    a = 10 ** (2 * d)
    b = a * (n + 1)
    print(b)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*= coding:utf-8 -*-

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if D==0 and N<100:
  print(N)

elif D==0 and N==100:
  print(N+1)
  
elif D==1 and N<100:
  print(100*N)

elif D==1 and N==100:
  print(100*(N+1))

elif D==2 and N<100:
  print(10000*N)

elif D==2 and N==100:
  print(10000*(N+1))

Submission status: Accepted

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

num = 0
count = 0
while count < N:
    num += 100**D
    if num / (100**D) != 100:
        count += 1

print(num)

Submission status: Accepted

Solution code:
def solve(d, n):
    return (100**d) * (n + (n==100))

assert solve(0, 5) == 5
assert solve(1, 11) == 1100
assert solve(2, 85) == 850000
assert solve(0, 100) == 101
assert solve(1, 100) == 10100
assert solve(2, 100) == 1010000

d, n = map(int, raw_input().split())
print solve(d, n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = raw_input()
ss = s.split()
d = int(ss[0])
n = int(ss[1])
i = 1
while 1:
	x = i
	c = 0
	while x % 100 == 0:
		x //= 100
		c += 1
	if c == d:
		n -= 1
		if n == 0:
			print i
			break
	i += 1

Submission status: Accepted

Solution code:
s = input().strip()
ss = s.split()
d = int(ss[0])
n = int(ss[1])
i = 1
while 1:
	x = i
	c = 0
	while x % 100 == 0:
		x //= 100
		c += 1
	if c == d:
		n -= 1
		if n == 0:
			print(i)
			break
	i += 1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding : utf-8

if __name__ == "__main__":
    d,n = list(map(int,input().split()))
    if n != 100:
        print(100**d*n)
    else:
        print(100**d*(n+1))

Submission status: Accepted

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

curr_number = 0

for i in range(1, 10**7):
	if i % (100**a) == 0 and i % (100**(a+1)) != 0:
		curr_number += 1

		if curr_number == b:
			print i
			break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
d, n = map(int, input().split())

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

Submission status: Accepted

Solution code:
def read():
    return int(input())


def readlist():
    return list(map(int, input().split()))


def readmap():
    return map(int, input().split())


D, N = readmap()

if D == 0:
    if N < 100:
        print(N)
    else:
        print(101)
elif D == 1:
    if N < 100:
        print(N * 100)
    else:
        print(10100)
else:
    if N < 100:
        print(N * 10000)
    else:
        print(1010000)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# AtCoder Beginner Contest


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D, N = [int(i) for i in input().split()]
if D == 0 and N != 100:
	ans = N
elif D == 1 and N != 100 :
	ans = N*(100**D)
elif D == 1 and N == 100 :
	ans = 10100
elif D == 2 and N != 100 :
	ans = N*(100**D)
elif D == 2 and N == 100 :
	ans = 1010000 
else :
	ans = 101
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def cal(x: int):
    count  = 0
    while True:
        q, r = divmod(x, pow(100, count+1))
        if q == 0:
            return count
        else:
            count += 1

for i in [1, 100, 10000]:
    if cal(i) == D:
        if N == 100:
            N += 1
        print(i*N)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

d_seed = 1
if d == 1:
    d_seed = 100
if d == 2:
    d_seed = 10000

if n == 100:
    n = 101
print(d_seed*n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
D,N = list(map(int,raw_input().split()))

count = 0
number = 0
a = 100**D
b = 100**(D+1)

while count < N:
    number += a
    if number%b != 0:
        count += 1
    else:
        pass
print number

Submission status: Accepted

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

Submission status: Accepted

Solution code:

n=list(map(int,input().split()))
D=n[0]
N=n[1]
if(N==100):
    print((100**(D))*101)

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

Submission status: Accepted

Solution code:
D, N = [int(x) for x in raw_input().split()]
print (100**D)*(N if N<100 else 101)

Submission status: Accepted

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

print (100**D)*(N if N<100 else 101)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D, N = [int(e) for e in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

o = int(n/100)

print((100 ** d) * (n+o))

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

D, N = map(lambda x: int(x), input().split())
if N != 100:
    if D != 0:
        print(100**D * N)
    else:
        print(N)
elif N == 100:
    if D != 0:
        print(100 ** D * (N + 1))
    else:
        print(N + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def func(x):
    if(x % 100 != 0):
        return 0
    else:
        return func(x / 100) + 1

if __name__ == '__main__':
    d, n = map(int, input().split())
    x = 1
    cnt = 0
    while True:
        if func(x) == d:
            cnt += 1
        if cnt == n:
            print(x)
            exit()
        x += 1

Submission status: Accepted

Solution code:
inp = input()
inp2 = inp.split()
A=int(inp2[0])
B=int(inp2[1])
C = B*(100**A)
if B == 100:
	if A == 0:
		C = 101
	elif A == 1:
		C = 10100
	elif A == 2:
		C = 1010000
print(C)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def ringo(d,n):
    if (d == 0 and n < 100):
        return n
    elif(d == 0 and n == 100):
        return n + 1
    elif(d == 1 and n < 100):
        return 100 * n
    elif(d == 1 and n == 100):
        return 100 * n + 100
    elif(d == 2 and n < 100):
        return 10000 * n
    elif(d == 2 and n == 100):
        return 10000 * n + 10000
    else:
        return 0

l = input().split()
print(ringo(int(l[0]),int(l[1])))

Submission status: Accepted

Solution code:
d,n = map(int,input().split())
res=0
if(d == 0):
    if n ==100:
        n=101
        for i in range(0,n+1):
            res = i
        print(res)
    else:
        for i in range(0,n+1):
            res = i
        print(res)
elif(d == 1):
    if n == 100:
        n=101
        for i in range(0,n+1):
            res = i*100
        print(res)
    else:
        for i in range(0,n+1):
            res = i*100
        print(res)
elif(d == 2):
    if n==100:
        n=101
        for i in range(0,n+1):
            res = i*10000
        print(res)
    else:
        for i in range(0,n+1):
            res = i*10000
        print(res)

Submission status: Accepted

Solution code:
d,n = map(int,input().split())
res=0
if(d == 0):
    if n ==100:
        n=101
        for i in range(0,n+1):
            res = i
        print(res)
    else:
        for i in range(0,n+1):
            res = i
        print(res)
elif(d == 1):
    if n == 100:
        n=101
        for i in range(0,n+1):
            res = i*100
        print(res)
    else:
        for i in range(0,n+1):
            res = i*100
        print(res)
elif(d == 2):
    if n==100:
        n=101
        for i in range(0,n+1):
            res = i*10000
        print(res)
    else:
        for i in range(0,n+1):
            res = i*10000
        print(res)

Submission status: Accepted

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

Submission status: Accepted

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

if x[1]==100:
    print(101,end ='')
else:
    print(str(x[1]),end='')
for _ in range(0,x[0]):
    print('00', end='')

Submission status: Accepted

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

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

print(X)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if N % 100 != 0:
	X = 100 ** D * (N + N // 100)
else:
	X = 100 ** D * (N + 1)



print(X)

Submission status: Accepted

Solution code:
D, N = [int(i) for i in input().split()]
# 100*k 番目はスキップして考えなければならない(100で割り切れてしまうため)
ans = (N + N//100) * pow(100, D)
print(ans)

Submission status: Accepted

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

for i in range(1,n+1):
    if i==n and n!=100:
        if d==0:
            print(i)
        elif d==1:
            print(100*i)
        else:
            print(100*100*i)
    if i==n and n==100:
        if d==0:
            print(101)
        elif d==1:
            print(100*(n+1))
        else:
            print(100*100*(n+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
if __name__ == "__main__":
    d, n = map(int, input().split())
    core = 100**d
    factors = [ core*tmp for tmp in range(1,102) if tmp != 100 ]
    print(factors[n-1])

Submission status: Accepted

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

Submission status: Accepted

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

result = 100 ** D * N

if N == 100:
    result += 100**D

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

get = sys.stdin.readline()
a, b = get.split(" ")
a2 = int(a)
b2 = int(b)
ans = 0
if(b2 == 100):
    ans = (b2+1) * (10 ** (a2*2))
else:
    ans = b2 * (10 ** (a2*2))
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
D, N = [int(_) for _ in input().split()]
 
if N == 100: N += 1
print(N * 100 ** D)

Submission status: Accepted

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

x = (100 ** d) * n

if (x // (100**d)) % 100 != 0:
    print(x)
else:
    print(x+(100**d))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

tmp = 0
if (d[0] == 0 and d[1] >= 100):
     tmp = d[1] / 100
if (d[0] == 1 and d[1] == 100):
     tmp = 100
if (d[0] == 2 and d[1] == 100):
    tmp = 10000

print(int(pow(100, d[0]) * d[1] + tmp));

Submission status: Accepted

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

if N==100:
 N+=1

print(100 ** D * N)

Submission status: Accepted

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

Submission status: Accepted

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



base = 100 ** d

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

Submission status: Accepted

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

if b == 100:
    b = 101


print(100 ** a * b)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import calendar as cal

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

z = 1
c = 0
while True:
    if z%(100**3)==0:
        pass
    elif z%(100**2)==0:
        if d==2:
            c = c+1
    elif z%100==0:
        if d==1:
            c = c+1
    else:
        if d==0:
            c = c+1
    if c == n:
        print(z)
        break
    z = z+1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().split()

b = int(a[0])
c = int(a[1])

if 0 <= b <= 2:
    if 1<= c <= 99:

      print(c*(100**(b)))
    elif c == 100:
      print(101*(100**(b)))

Submission status: Accepted

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


if D==2:
    dp = [10000*i for i in range(1,10010)]
    print(dp[N-1] if N!=100 else dp[N])
elif D==1:
    dp = [100*i for i in range(1,10010)]
    print(dp[N-1] if N!=100 else dp[N])
else:
    print(N if N!=100 else 101)

Submission status: Accepted

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

Submission status: Accepted

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

if d == 0 and n != 100:
    print(n)
elif d == 0 and n == 100:
    print(101)
elif d == 1 and n != 100:
    print(100*n)
elif d == 1 and n == 100:
    print(10100)
elif d == 2 and n != 100:
    print(10000*n)
else:
    print(1010000)

Submission status: Accepted

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

key = pow(100, D)


if N != 100:
    print(key * N)
else:
    print(key * N + key)

Submission status: Accepted

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

if b == 100:
    print((100**a)*(b+1))
    exit()

print((100**a)*b)

Submission status: Accepted

Solution code:
s = input().rstrip().split()

n = int(s[1])

if(s[0] == "0"):
  if(n == 100):
    print(101)
  else:
    print(n)
elif(s[0] == "1"):
  if(n == 100):
    print(10100)
  else:
    print(100*n)
elif(s[0] == "2"):
  if(n == 100):
    print(1010000)
  else:
    print(10000*n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def run(d, n):
    if n == 100:
        return (n + 1) * (100 ** d)
    else:
        return n * (100 ** d)


def read_line():
    a, b = input().split()
    a = int(a)
    b = int(b)
    return (a, b)


def main():
    d, n = read_line()
    print(run(d, n))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
from bisect import *
from collections import *
import fractions
import heapq 
from itertools import *
import math
import random
import re
import string
import sys

D, N = map(int, input().split())
if N <= 99:
    print(N * (100 ** D))
else:
    print(101 * (100 ** D))

Submission status: Accepted

Solution code:
ip = input().split()
usdata = []
D = int(ip[0])
N = int(ip[1])
flag = 0

b_number = 100 ** D
a_number = b_number * N
tester = a_number % 100 ** (D + 1)

if tester == 0:
    a_number += 100 ** D

print(a_number)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
tmp = input()
d = int(tmp.split(" ")[0])
n = int(tmp.split(" ")[1])

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

Submission status: Accepted

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

if b == 100:
    b = 101
    
print(100**a * b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input().split()
D = int(S[0])
N = int(S[1])
if N != 100:
    Ans = N*(100**D)
else:
    Ans = (N+1)*(100**D)
print(Ans)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 100 ** d * n
if n == 100:
    ans += 100 ** d
print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    print(main())

Submission status: Accepted

Solution code:
D,N=(int(i) for i in input().split())

a=100**D
if N == 100:
	ans = a*N+a
else:
	ans=a*N

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

d,n = na()
if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
elif d == 1:
    if n == 100:
        print(10100)
    else:
        print(n*100)
else:
    if n == 100:
        print(1010000)
    else:
        print(n*10000)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import numpy as np
 
line = input().split()
D = int(line[0])
N = int(line[1])
 
if D == 0:
    if N == 100:
        print(N+1)
    else:
        print(N)
elif D == 1:
    if N == 100:
        print((N+1)*100)
    else:
        print(N*100)
else :
    if N == 100:
        print((N+1)*10000)
    else:
        print(N*10000)

Submission status: Accepted

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("10100")
    else:
        print(pow(100,D) *N)
if D == 2:
    if N==100:
        print("1010000")
    else:
        print(pow(100,D) *N)

Submission status: Accepted

Solution code:
D, N = [int(s) for s in raw_input().split()]
if N == 100: N += 1
print (100**D) * N

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D, N = [int(x) for x in raw_input().split()]
if D==0:
  if N<100:
    print N
  else:
    print 101
elif D==1:
  if N<100:
    print N*100
  else:
    print 10100
else:
  if N<100:
    print N*10000
  else:
    print 1010000

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(X)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input().split()
D = int(n[0])
N = int(n[1])

if D == 0:
    if N == 100:
        print('101')
    else:
        print(str(N))
elif D == 1:
    if N == 100:
        print('10100')
    else:
        print(str(N * 100))
else:
    if N == 100:
        print('1010000')
    else:
        print(str(N * 10000))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d1,n=map(int,input().split())
if d1==0:
	i=0
	d=0
	while i<n:
		d+=1
		if d%100!=0:
			i+=1
	print(d)
if d1==1:
	i=0
	d=0
	while i<n:
		d+=100
		if d%100==0 and d%10000!=0:
			i+=1
	print(d)
if d1==2:
	i=0
	d=0
	while i<n:
		d+=10000
		if d%10000==0 and d%1000000!=0:
			i+=1
		#d+=10000
	print(d)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tmp = input()
tmp = tmp.split()
D = int(tmp[0])
N = int(tmp[1])

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

Submission status: Accepted

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

elif D == 2 and N <100:
    print(10000*N)
elif D == 2 and N==100:
    print((N+1)*10000)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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(N*100)
elif D == 2:
    if N == 100:
        print(1010000)
    else:
        print(N*10000)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D,N = [int(i) for i in input().split(' ')]
"""
ans = 100**D
ans *= N
print(ans)
"""
if N >= 100:
    N +=1
print(N,end="")
for i in range(D):
    print("00",end ="")

print()

Submission status: Accepted

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

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