Problem:


Score: 200 points

Problem Statement

Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.

As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.

Find the N-th smallest integer that would make Ringo happy.

Constraints

D is 0, 1 or 2.

N is an integer between 1 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:

D N

Output

Print the N-th smallest integer that can be divided by 100 exactly D times.

Sample Input 1

0 5

Sample Output 1

5

The integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...

Thus, the 5-th smallest integer that would make Ringo happy is 5.  

Sample Input 2

1 11

Sample Output 2

1100

The integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \ 000, 1 \ 100, ...

Thus, the integer we are seeking is 1 \ 100.

Sample Input 3

2 85

Sample Output 3

850000

The integers that can be divided by 100 exactly twice are as follows: 10 \ 000, 20 \ 000, 30 \ 000, ...

Thus, the integer we are seeking is 850 \ 000.



Sample input:
0 5


Sample output:
5

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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("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 N != 100:
    print(100**D * N)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
import sys
 
tmp = [int(i) for i in input().split()]
 
a = tmp[0]
b = tmp[1]
 
numbers = [100 ** a * i for i in range(1, 10000)]
for i in range(len(numbers)):
    tmp = numbers[i]
    for j in range(a):
        if tmp % 100 == 0:
            tmp /= 100
        else:
            numbers.pop(i)
            break
print(numbers[b-1])
sys.stdout.flush()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if D == 1:
    print(N*100**1)
elif D == 2:
    print(N*10**2)
else:
    print(N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = []
if d == 0:
    x = 1
    while True:
        if x % 100 != 0 and x % 10000 != 0:
            ans.append(x)
        x += 1
        if len(ans) == n:
            break
elif d == 1:
    x = 100
    while True:
        if x % 10000 != 0:
            ans.append(x)
        x += 100
        if len(ans) == n:
            break
else:
    x = 10000
    while True:
        if x % 100000000 != 0:
            ans.append(x)
        x += 10000
        if len(ans) == n:
            break

print(ans[-1])

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
d,n  = (int(i) for i in input().split())
answer = 0
 
if d == 0 :
    answer = n
elif d == 1:
    answer = 100*n
else:
    answer = 10000*n

print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

result = 100 ** D * N

#if N == 100:
#    result = '' #100 ** D * (N - 1)
if N < 100:
    print(result)

Submission status: Wrong Answer

Solution code:
from sys import stdin


def main():
    D, N = [int(x) for x in stdin.readline().rstrip().split()]
    result = 100 ** D * 100
    if D == 0 and N == 100:
        result += 1
    print(result)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if int(a) == 0:
    print(b)
elif int(a) == 1:
    print(b*100)
else:
    print(b*10000)

Submission status: Wrong Answer

Solution code:
import sys

get = sys.stdin.readline()
a, b = get.split(" ")
a2 = int(a)
b2 = int(b)
ans = b2 * (10 ** (a2*2))
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

result = 100 ** D * N

if N == 100:
    result = False #100 ** D * (N - 1)

print(result)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
if d != 0 and d != 1 and d != 2:
    raise ValueError
    print("Invalid numbers are entered.")
elif n <= 0 or n >= 101:
    raise ValueError
    print("Invalid numbers are entered.")
else:
    list = []
    for i in range(100):
        list.append(100**d * (i + 1))
    print(list[n - 1])

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
D, N = [int(i) for i in 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 == 1:
    print(N*100)
elif D == 2:
    print(N*10000)
else:
    print(N)

Submission status: Wrong Answer

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

key = pow(100, D)


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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = map(int, input().split())


def get_ans(a, b):
    if a == 0:
        if b % 100 == 0:
            ans = b+1
        else:
            ans = b
        return int(ans)
    if a == 1:
        ans = b * 100
        return int(ans)
    if a == 2:
        ans = b * 10000
        return int(ans)


# 出力
print(get_ans(a, b))

Submission status: Wrong Answer

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

for i in range(1,n+1):
    if i==n:
        if d==0:
            print(i)
        elif d==1:
            print(100*i)
        elif d==2:
            print(100*100*i)

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = list(map(int, input().split()))
print(str(x[1]),end='')
for _ in range(0,x[0]):
    print('00', end='')

Submission status: Wrong Answer

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:
  print(100*N)
  
elif D==2 :
  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(str(100*n))
elif d == 2:
    print(str(10000*n))
else:
    pass

Submission status: Wrong Answer

Solution code:
from sys import stdin


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

result = 100 ** D * N

if N == 100:
    result = None #100 ** D * (N - 1)

print(result)

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

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
 
tmp = [int(i) for i in input().split()]
 
a = tmp[0]
b = tmp[1]
 
number = 100 ** a * b
print(number)

Submission status: Wrong Answer

Solution code:

x = list(map(int, input().split()))
if x[1]==100:
    if x[0]==1:
        print(10000)
    if x[0]==2:
        print(10000)
print(x[1],end='')
for _ in range(0,x[0]):
    print('00', end='')

Submission status: Wrong Answer

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

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=[int(i) for i in input().split()]
print(100**D*N)

Submission status: Wrong Answer

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

X = 10**(2*D) + (N-1)*10**(2*D)
print(X)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

result = 100 ** D * N

if N == 100:
    result = 100 ** D * (N - 1)

print(result)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
if d != 0 and d != 1 and d != 2:
    print("Invalid numbers are entered.")
elif n <= 0 or n >= 101:
    print("Invalid numbers are entered.")
else:
    list = []
    for i in range(100):
        list.append(100**d * (i + 1))
    print(list[n - 1])

Submission status: Wrong Answer

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

else:
  print(N+1)

Submission status: Wrong Answer

Solution code:
from sys import stdin


def main():
    D, N = [int(x) for x in stdin.readline().rstrip().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:
	ans = pow(100, D + 1) + 1
else:
	for i in range(1, N + 1):
			ans = pow(100, D) * i
print(ans)

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:
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 += 1

print(a_number)

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

result = 100 ** D * N

if N == 100:
    result = 0 #100 ** D * (N - 1)

print(result)

Submission status: Wrong Answer

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

list = []
for i in range(101):
    list.append(100**D*i)

print(list[N])

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = map(int, input().split())


def get_ans(a, b):
    if a == 0:
        if b % 100 != 0:
            ans = b+1
        else:
            ans = b
        return int(ans)
    if a == 1:
        ans = b * 100
        return int(ans)
    if a == 2:
        ans = b * 10000
        return int(ans)


# 出力
print(get_ans(a, b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#encoding:utf-8

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

r=(100**d)*n
print(int(r))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

base = 100**d

print(base*n)

Submission status: Wrong Answer

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

print ans

Submission status: Wrong Answer

Solution code:
#coding : utf8

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

if( D == 0 and N == 100):
    print(101)
else:
    print( pow(100,D) * N )

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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:
s = input().rstrip().split()

if(s[0] == "0"):
  print(s[1])
elif(s[0] == "1"):
  print(100*int(s[1]))
else:
  print(10000*int(s[1]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,raw_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:
    if N==100:
        print("101")
    else:
        print(N)
if D == 1:
    if N==100:
        print("10101")
    else:
        print(pow(100,D) *N)
if D == 2:
    if N==100:
        print("1010001")
    else:
        print(pow(100,D) *N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#Ringo's Favorite Numbers
D, N = map(int, input().split())
m = []
for i in range(N+1):
	m.append(i*100**D)
print(m[N])

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

Submission status: Wrong Answer

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

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 run(d, n):
    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: Wrong Answer

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

ans = []
if d == 0:
    x = 1
    while True:
        if x % 100 != 0 and x % 10000 != 0:
            ans.append(x)
        x += 1
        if len(ans) == n:
            break
elif d == 1:
    x = 100
    while True:
        if x % 10000 != 0:
            ans.append(x)
        x += 100
        if len(ans) == n:
            break
else:
    x = 10000
    while True:
        ans.append(x)
        x += 10000
        if len(ans) == n:
            break

print(ans[-1])

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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)*100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a[0] == 0:
    wk = 1 * a[1]
    print(wk)
elif a[0] == 1:
    wk = int,pow(100,1) * a[1]
    print(wk)
elif a[0] == 2:
    wk = int,pow(100,2) * a[1]
    print(wk)

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())
if D == 0:
    out = N
else:
    out = 100 ** D * N
if N == 100:
    out = None
print(out)

Submission status: Wrong Answer

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)*100)

Submission status: Wrong Answer

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

if a[0] == 0:
    wk = 1 * a[1]
    print(wk)
elif a[0] == 1:
    wk = int,pow(100,1) * a[1]
    print(wk)
elif a[0] == 2:
    wk = int,(100,2) * a[1]
    print(wk)

Submission status: Wrong Answer

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

if(d == 0):
    res = 0
    for i in range(0,n+1):
        res = i
    print(i)
elif(d == 1):
    res = 0
    for i in range(0,n+1):
        res = i*100
    print(res)
elif(d == 2):
    es = 0
    for i in range(0,n+1):
        res = i*10000
    print(res)

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*100*100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(100**a * b)

Submission status: Wrong Answer

Solution code:
#encoding:utf-8

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

r=(100**d)*n
print(int(r))

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())
if n != 100:
	print((100**d)*n)
elif n == 0:
	print(101)
elif n == 1:
	print(10100)
else:
	print(1010000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

if 0 <= b <= 2:
    if 1<= c <= 100:
      print(c*(100**(b)))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = map(int, input().split())


def get_ans(a, b):
    if a == 0:
        return b
    if a == 1:
        ans = b * 100
        return int(ans)
    if a == 2:
        ans = b * 10000
        return int(ans)


# 出力
print(get_ans(a, b))

Submission status: Wrong Answer

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

if a[0] == 0:
    wk = 1 * a[1]
    print(wk)
elif a[0] == 1:
    wk = pow(100,1) * a[1]
    print(wk)
elif a[0] == 2:
    wk = pow(100,2) * a[1]
    print(wk)

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:
D,N = list(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())

ans = []
if d == 0:
    x = 1
    while True:
        if x % 100 != 0 and x % 10000 != 0:
            ans.append(x)
        x += 1
        if len(ans) == n:
            break

if d == 1:
    x = 100
    while True:
        if x % 10000 != 0:
            ans.append(x)
        x += 100
        if len(ans) == n:
            break

else:
    x = 10000
    while True:
        ans.append(x)
        x += 10000
        if len(ans) == n:
            break

print(ans[-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if a == 0:
    print(b)
elif a == 1:
    print(100 * b)
else:
    print(10000 * b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if int(input[0]) == 0:
    print(input[1])
elif int(input[0]) == 1:
    if input[1] == 100:
        input[1] + 1
    print(int(input[1]) * 100)
elif int(input[0]) == 2:
    if input[1] == 100:
        input[1] + 1
    print(int(input[1]) * 10000)
else:
    pass

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:
inp = input()
inp2 = inp.split()
A=int(inp2[0])
B=int(inp2[1])
C = B*(100**A)
if B == 100:
	C = 100**A

print(C)

Submission status: Wrong Answer

Solution code:
d, n = list(map(int, input().split()))
if 0 <= d and d <= 2 and 0 <= n and n <= 100:
    print(str(100 ** d * n))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if D == 0:
    print(N)

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

else:
    print(10000*N)

Submission status: Wrong Answer

Solution code:

a = input().split()

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

if 0 <= b <= 2:
    if 0<= c <= 100:
      print(c*(100**(b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = map(int, input().split())


def get_ans(a, b):
    if a == 0:
        return b
    if a == 1:
        ans = b * 1000
        return int(ans)
    if a == 2:
        ans = b * 10000
        return int(ans)


# 出力
print(get_ans(a, b))

Submission status: Wrong Answer

Solution code:
#encoding:utf-8

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

print(r)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
if d != 0 and d != 1 and d != 2:
    print("Invalid numbers are entered.")
elif n <= 0 or n >= 101:
    print("Invalid numbers are entered.")
else:
    list = []
    for i in range(100):
        list.append(100**d * (i + 1))
print(list[n - 1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
if n == 100:
    print("{}".format(100**(d + 1) + 1))
else:
    print("{}".format(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:
#-*- coding: utf-8 -*-
# １００でちょうどD回割り切れる正の整数のうちN番目に小さいものを求める
D, N = map(int, input().split())
# D = 0, 1, 2のいずれか
# N は1以上100以下の整数
if N != 100:
    print(100 ** D * (N+1))
else:
    print(100 ** D * (N +1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = []
if d == 0:
    for x in range(1, 1*200, 1):
        if x % 100 != 0:
            ans.append(x)
        if len(ans) == n:
            break

if d == 1:
    for x in range(100, 100*200, 100):
        if x % 100 == 0 and x % 10000 != 0:
            ans.append(x)
        if len(ans) == n:
            break

else:
    for x in range(10000, 10000*200, 10000):
        if x % 10000 == 0:
            ans.append(x)
        if len(ans) == n:
            break

print(ans[-1])