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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

def solve(D, N):
    base = 100
    return pow(base, D) * N

if __name__ == "__main__":
    D, N = map(int, input().split())
    print(solve(D,N))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python3

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#入力数列配列
A = list(map(int, input().split()))

if A[1] == 100:
    print((A[0]+1)*100+(A[0])**100*1)
else:
    print(100**A[0]*A[1])

Submission status: Wrong Answer

Solution code:
#入力数列配列
A = list(map(int, input().split()))

if A[1] == 100:
    print((A[0]+1)*100+1)
else:
    if A[0] == 0:
        print(A[1])
    else:
        print(100**A[0]*A[1])

Submission status: Wrong Answer

Solution code:
#入力数列配列
A = list(map(int, input().split()))

if A[0] == 0:
    print(A[1])
else:
    print(100**A[0]*A[1])

Submission status: Wrong Answer

Solution code:
#入力数列配列
A = list(map(int, input().split()))

if A == 0:
    print(A[1])
else:
    print(100**A[0]*A[1])

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if D == 0:
    print(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())
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())

if D == 0 and N == 100:
    ans = 101
elif D == 1 and N == 100:
    ans = 10100
elif D == 2 and N == 100:
    ans = 100 ** 3 + 100 * 1
else:
    ans = (100 ** D) * N


print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

 
rslt =( n - ((n-1)//99) ) * fctr
 
print(rslt)

Submission status: Wrong Answer

Solution code:
import sys 
import math

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:
import sys 
import math

a, b = map(int, input().split(" "))
print(100**a*b)

Submission status: Wrong Answer

Solution code:
import sys 
import math

a, b = map(int, input().split(" "))

print(100**a*b)

Submission status: Wrong Answer

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

fctr = 100**d


rslt = n * fctr

print(rslt)

Submission status: Wrong Answer

Solution code:
def B(d,n):
    print(100**d*n)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
print(int(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:
A,B = map(int,input().rstrip().split())

for i in range(B):
    a = (i+1)*100**A
print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = (100**ringo[0])*ringo[1]

if ringo[1] is 100:	
	a+=1

print(a)

Submission status: Wrong Answer

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

a = (100**ringo[0])*ringo[1]

if ringo[0] is 0 and ringo[1] is 100:	
	a+=1

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = 100**ringo[0]

print(ringo[1]*a)

Submission status: Wrong Answer

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

a = 100**ringo[0]

print("answer is %d" % (ringo[1]*a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(n, end='')
for i in range(d):
    print('00', end='')
print()

Submission status: Wrong Answer

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

temp = 100 ** d
res = temp * n 

print(res)

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-

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

    ans = 0
    #D=0の場合
    if D == 0:
        if N == 100:
            ans = 101
        else:
            ans = N

    #D=1の場合
    elif D == 1:
        if N == 100:
            ans = 10100
        else:
            ans = 100 * N

    #D=2の場合
    elif D == 2:
        if N == 100:
            ans = 1010000
        ans = 10000 * N
    
    print(ans)

    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-

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

    ans = 0
    #D=0の場合
    if D == 0:
        if N == 100:
            ans = 101
        else:
            ans = N

    #D=1の場合
    elif D == 1:
        ans = 100 * N

    #D=2の場合
    elif D == 2:
        ans = 10000 * N
    
    print(ans)

    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-

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

    ans = 0
    #D=0の場合
    if D == 0:
        if N == 100:
            ans = 99
        else:
            ans = N

    #D=1の場合
    elif D == 1:
        ans = 100 * N
        
    #D=2の場合
    elif D == 2:
        ans = 10000 * N
    
    print(ans)

    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-

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

    ans = 0
    #D=0の場合
    if D == 0:
        ans = N
    #D=1の場合
    elif D == 1:
        ans = 100 * N
    #D=2の場合
    elif D == 2:
        ans = 10000 * N
    
    print(ans)

    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
num = []
if D == 0:
    print(N)
else:
    for i in range(N+1):
        p = (i)*(100**D)
        num.append(p)
    print(num[N])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = list(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:
# coding: utf-8

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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

print(100 ** d * n)

Submission status: Wrong Answer

Solution code:
"""
https://abc100.contest.atcoder.jp/tasks/abc100_b
"""
[d,n]=[int(i) for i in input().split()]
a=100**d
for i in range(n+1):
    b=a*i
print(b)

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

Submission status: Wrong Answer

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

print(100 ** D * N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split(" "))
if a == 0:
  b = b + int(b/100) + int(b/10000)
elif a == 1:
  b = b + int(b/100)
else:
  pass
print(b*(100**a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
if a == 0:
    print(b)
elif a == 1:
    print(b * 1000)
else:
    print(b * 10000)

Submission status: Wrong Answer

Solution code:
def getinputdata():

    array_result = []    
    array_result.append(input().split(" "))

    flg = True

    try:
        while flg:

            data = input()

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = True

            else:

                flg = False
    finally:

        return array_result

arr_data = getinputdata()

#0 or 1 or 2
d = int(arr_data[0][0])

#1<=n<=100
n = int(arr_data[0][1])


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())
counter = 0
a = n
while d>counter :
    counter+=1
    a/=100
ans= (100**d)*n+(n/a)
print(int(ans))

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
counter = 0
a = n
while d>counter :
    counter+=1
    a/=100
ans= (100**d)*n+(n/a)
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

d = 100 **A
print(d * B)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

if A == 0:
    print(0)
else:
    d = 100 **A
    print(d * B)

Submission status: Wrong Answer

Solution code:
import math
print((lambda x: int(math.pow(100,x[0])*x[1]))(list(map(int, input().split()))))

Submission status: Wrong Answer

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

li = []
for i in range(1,N + 1):
    li.append(100 ** D * i)

print(li[N - 1])

Submission status: Wrong Answer

Solution code:
#coding:utf-8

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

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

print(lis[N-1])

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#coding:utf-8

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

ans = (100**D)*N

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

number = 0

if D == 0:
    for i in range(N):
        number += 1
        if (number % 100 == 0):
            number += 1
    print(number)
else:
    for i in range(N):
        number += 100 ** D
    print(number)

Submission status: Wrong Answer

Solution code:
n, k = input().split()
n=int(n)
k=int(k)
if k==100:
   k+=1
if n==0:
   sum=k
else:
   sum=(100**n)*k

Submission status: Wrong Answer

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

if n==0:
   sum=k
else:
   sum=(100**n)*k
   
if sum==100 or 1000000:
   sum +=1
if 10000 or 1000000:
   sum +=100
if sum== 1000000:
   sum +=10000

print(sum)

Submission status: Wrong Answer

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

if n==0:
   print(k)
else:
   sum=(100**n)*k
   print(sum)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:

def main():
    d, n = [int(i) for i in input().split(' ')]

    print(100 ** d * n)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

answer = N * (100 ** D)

if N == 100:
    answer = answer - 1

print(answer)

Submission status: Wrong Answer

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

answer = N * (100 ** D)

print(answer)

Submission status: Wrong Answer

Solution code:
import math

DN = [int(i) for i in input().split()]
D, N = DN[0], DN[1]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if N<100:
  N+=1

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:
if __name__ == '__main__':
    D, N = map(int, input().split(' '))

    print(N * 10**(2*D))

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
num = 100**D
ans = 0
for _ in range(N):
    ans += num
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

for i in range(1,N+1):
	if(i == 100):
		C = math.pow(100,D+1)
	C = math.pow(100,D) * i

print(int(C))

Submission status: Wrong Answer

Solution code:
import math

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

for i in range(1,N+1):
	if(i % 100 == 0):
		continue
	C = math.pow(100,D) * i

print(int(C))

Submission status: Wrong Answer

Solution code:
import math

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

for i in range(1,N+1):
	C = math.pow(100,D) * i

print(int(C))

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

if(a == 0):
    print(b)
else:
    print(b*pow(100,a))

Submission status: Wrong Answer

Solution code:
D, N = list(int(n) for n in input().split(" "))
digit = 100 ** D
if digit == 0:
    print(N)
else:
    print(digit * N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding:utf-8

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

print(n*(100**d))

Submission status: Wrong Answer

Solution code:
# coding:utf-8

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

print(100**d*n)

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

Submission status: Wrong Answer

Solution code:
N = [int(i) for i in input().split(" ")]
print(N[1]*(100**N[0]))

Submission status: Wrong Answer

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

cnt = 0
index = 0
while cnt < N:
    index += 1
    if pow(100,D)*index % pow(100,D+1) == 0:
        continue
    cnt += 1

print(str(pow(100,D)*cnt))

Submission status: Wrong Answer

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

print(str(pow(100,D)*N))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

# if D = 0, any positive integer *NOT* divisible by 100, pick the N-th one
# if D = 1, any positive integer divisible by 100 exactly once, i.e. 100*range(N+1)
# if D = 2, any positive integer divisible by 100 exactly twice, i.e. 100*100*range(N+1)
if D == 0:
    print([n for n in range(1, N + 1 + N//100) if n%100 != 0][N-1])
elif D == 1:
    print(N*100)
elif D == 2:
    print(N*100*100)

Submission status: Wrong Answer

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

print(100 ** D * N)

Submission status: Wrong Answer

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

base = 100**d
ans = base*n
if (d==0 and ans%100==0)or(d ==1 and ans%10000==0)or(d ==2 and ans%1000000==0):
    ans +=1
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

count = N
x = (100 ** D) * (N - (N-1)//99)                                                                         
print(x)

Submission status: Wrong Answer

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

count = N 
x = (100 ** D) * N    
print(x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = N
x = (100 ** D) * N
print(x)

Submission status: Wrong Answer

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(d,n):
    if  n != 100 :
        return (100**d)*n
    elif n == 100:
         return (d**100)*101 
    else:
        return n

# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(d,n):
    N=n%100
    if d != 0:
        return(100**d)*n
    elif d == 0 and n == 100:
        return(100**d)*(n+1)
    else:
        return n


# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

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

   
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

def solve(d, n):
    return (100**d)+1*n

   
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

def solve(a,b):
    if a == 0 and b<=99:
        return(b)
    elif a == 1 and b<=99:
        return(100*b)
    elif a == 2 and b<=99:
        return(10000*b)
    elif a == 0:
        return(101)
    elif a == 1:
        return(10100)
    else:
        return(1000100)

def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(d,n):
    if d != 0 and n != 100:
        return (100**d)*n
    elif n == 100:
        return (100**d)+n
    else:
        return n

# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

def solve(d, n):
    return (100**d)+n
solve(1, 11)

   
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(d,n):
    if d != 0:
        return (100**d)*n
    elif n == 100:
        return (100**d)+n
    else:
        return n

# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(d,n):
    N=n%100
    if d != 0:
        return(100**d)*n
    elif n == 0 and d == 100:
        return (100*n)
    else:
        return n

# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

def solve(d, n):
    return (100**d)*n

   
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

def solve(a,b):
    if a == 0 and b<=99:
        return(b)
    elif a == 1 and b<=99:
        return(100*b)
    elif a == 2:
        return(10000*b)
    elif a == 0:
        return(101)
    elif a == 1:
        return(10001)
    else:
        return(1000001)

def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

def solve(a, b):
    if a == 0 or a==1 or a==2:
        if b==100:
            answer=100**a*b+1
        else:
            answer=100**a*b
    return answer

def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)

if __name__ == '__main__':
    main()