TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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.

Submission attempts (in order):
d,n = map(int,input().split())

tmp = []
for i in range(1,100):
    tmp.append(i*100**d)
print(tmp[n])

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

tmp = []
for i in range(1,100):
    tmp.append(i*100**d)
tmp.append(101*100**d)
print(tmp[n-1])

Verdicts: Runtime Error

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

Submission attempts (in order):
n, k = map(int, input().split())
if k != 100:
    print(101*(100**n))
else:
    print((100**n)*k)


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


Verdicts: Wrong Answer

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

Submission attempts (in order):
D,N = map(int,input().split())


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


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


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


Verdicts: Runtime Error

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

Submission attempts (in order):
D,N = map(int,input().split())
from math import pow
print(int(pow(100,D) * N)) if N != 100 elseprint(int(pow(100,D) * 101))

D,N = map(int,input().split())
from math import pow
print(int(pow(100,D) * N)) if N != 100 else print(int(pow(100,D) * 101))

Verdicts: Runtime Error

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

Submission attempts (in order):
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 = 10001
	elif A = 2:
		C = 1000001
print(C) 

inp = input()
print("a")
inp2 = inp.split()
A=int(inp2[0])
B=int(inp2[1])
C = B*(100**A)
print(C) 

inp = input()
print("a")
inp2 = inp.split()
A=int(inp2[0])
B=int(inp2[1])
print(B*100**A) 

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) 

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
d, n = map(int, input().split())
if d == 0:
    print(x)
    exit()
x = 100 **d
print(x*n)

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

Verdicts: Runtime Error

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

Submission attempts (in order):
v

# ABC 100: B – Ringo's Favorite Numbers
d, n = map(int, input().split())
print(n * 100 ** d if n != 100 else (n + 1) * 100 ** d)

Verdicts: Runtime Error

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

Submission attempts (in order):
from sys import stdin
input = stdin.readline

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

ans = 100 ** D * N

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

print(ans)


from sys import stdin
input = stdin.readline

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

ans = 100 ** D * N

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

print(ans)


Verdicts: Runtime Error

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

Submission attempts (in order):
lA=list(map(int,input().split()))
D=lA[0]
N=lA[1]
if(D!=0):
    print(100**D*N)

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
D, N= int(input().split())
print(N*100**D)

D, N= int(input().split())
print(N*(100**D))

A = input().split()
D = int(A[0])
N = int(A[1])
 
if N != 100:
  print(100 ** D * N)
else:
  print(100 ** D * 101)

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
D, N = map(int,input())

print(N * (100**D))


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


Verdicts: Runtime Error

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

Submission attempts (in order):
D, N = map(int, input().split())
output = 1
for i in range(D):
	output *= 100
if N = 100:
	N = 101
output *= N
print(output)


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


Verdicts: Runtime Error

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

Submission attempts (in order):
d,n = map(int,input()split())
 
if d == 0:
  if n == 100:
    print(101)
  else:
    print(n)
elif d == 1:
  if n == 100:
    print(10001)
  else:
    print(100*n)
elif d == 2:
  if n == 100:
    print(1000001)
  else:
    print(10000*n)

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

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

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

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
C, N = map(int, input().split())
hund = 100 if N != 100 else 101
print((100**C)*hund)


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


Verdicts: Wrong Answer

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

Submission attempts (in order):
d, n = map(int, input().split())
print(100 ** d * (n if n == 100 else n + 1))

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
def myAnswer(D:int, N:int) -> int:
   return 100**D * (N - (N - 1)//99)


def modelAnswer():
   tmp=1
def main():
   D,N =map(int,input().split())
   print(myAnswer(D,N))
if __name__ == '__main__':
   main()

   return ans 


def myAnswer(D:int, N:int) -> int:
   if(D == 0):
      return 101 if(N == 100) else N
   elif(D == 1):
      return 10100 if(N == 100) else N*100
   else:
      return 1010000 if(N == 100) else N*10000
         



def modelAnswer():
   tmp=1
def main():
   D,N =map(int,input().split())
   print(myAnswer(D,N))
if __name__ == '__main__':
   main()


Verdicts: Runtime Error

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

Submission attempts (in order):
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)

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)

Verdicts: Runtime Error

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

Submission attempts (in order):
d, n = map(int, input().split())

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


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

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
import sys
sys.setrecursionlimit(10**6)

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

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


import sys
sys.setrecursionlimit(10**6)

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

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
#100b
D,N = map(int, input().split())

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

#100b
D,N = map(int, input().split())

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
a, b = (int(i) for i in input().split())
print(a * pow(100, b))

D, N = (int(i) for i in input().split())
if N != 100:
  print(N * pow(100, D))
else:
  print((N+1) * pow(100, D)) 


Verdicts: Wrong Answer

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

Submission attempts (in order):
#-*- coding: utf-8 -*-

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


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

#-*- coding: utf-8 -*-

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


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

Verdicts: Wrong Answer

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

Submission attempts (in order):
x, y=map(int, input().split())

res=100**x*y

if y=100:
	res=100**x*(y+1)

print(res)

x, y=map(int, input().split())

res=100**x*y

if y==100:
	res=100**x*(y+1)

print(res)

Verdicts: Runtime Error

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

Submission attempts (in order):
D, N = map(int, input().split())


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

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)

Verdicts: Runtime Error

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

Submission attempts (in order):
d,n = map(int, input().split())
if n <100:
    print(100**d*k)
else:
    print(100**d*101)

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

Verdicts: Runtime Error

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

Submission attempts (in order):


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

# for D in range(0,3):
#     for N in range(1,101):
print("D, N = ",D,N,str(N+int(N==100))+"00"*D)



D,N=list(map(int,input().split(" ")))
print(str(N+int(N==100))+"00"*D)

Verdicts: Wrong Answer

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

Submission attempts (in order):
d,N = map(int,input().split())
if N != 100:
    print((100*d)*N)
else:
    print((100**d)*101)


N = input()
s = 0
for i in range(len(N)):
    n = int(N[i])
    s += n
if int(N) % s == 0:
    print("Yes")
else:
    print("No")

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


Verdicts: Wrong Answer

Runtime Error

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

Submission attempts (in order):
d, n = map(int, input().split())

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


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

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


Verdicts: Runtime Error

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

Submission attempts (in order):
D, N = map(int, input().split())

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

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

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


Verdicts: Runtime Error

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

Submission attempts (in order):
D, N = map(int, input().split())
if N == 100:
	print(100**D*(N+1)
else:	
	print(100**D*N)

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

Verdicts: Runtime Error

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

Submission attempts (in order):
D, N = map(int, input().split())
list = []
i = 1

while len(list) < N:
    list.append(i * 100 * D)
    i += 1

    
print(list[-1])
  

D, N = map(int, input().split())
list = []
i = 1

while len(list) < N:
  if D != 0:
    if i != 100:
      list.append(i * 100 ** D)
      i += 1
    else:
      i += 1
   
  else:
    if i != 100:
      list.append(i)
      i += 1
    else:
      i += 1
    
print(list[-1])
  

Verdicts: Wrong Answer

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

Submission attempts (in order):
d, n = map(int, input().split())
print(100 ** d * (n + 100//n))

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
d,n = map(int,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(n*100)
elif d == 1 and n == 100:
    print(10100)
elif d == 2 and n != 100:
    print(n*10000)
elif:
    print(1010000)

d,n = map(int,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(n*100)
elif d == 1 and n == 100:
    print(10100)
elif d == 2 and n != 100:
    print(n*10000)
else:
    print(1010000)

Verdicts: Runtime Error

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

Submission attempts (in order):
linha = input()
d, n = [int(x) for x in linha.split()]

print("d = ", d)
print("n = ", n)

if (d == 0):
    x = 1
    y = 0
    n0 = []
    while ( x <= n ):
        n0.append(y)
        x = x + 1
        y = y + 1
    print(n0[-1])
elif (d == 1):
    x = 1
    y = 100
    n1 = []
    while (x <= n ):
        n1.append(y)
        x = x + 1
        y = y + 100
    print(n1[-1])
elif (d == 2):
    x = 1
    y = 1000
    n2 = []
    while (x <= n):
        n2.append(y)
        x = x + 1
        y = y + 1000
    print(n2[-1])

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
D,N = map(int, input().split())

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

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

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


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

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

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

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


Verdicts: Runtime Error

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

Submission attempts (in order):
D, N = (int(i) for i in input().split())
if D == 0:
    print(int(1*N)
elif D == 1:
    print(int(100*N)
elif D == 2:
    print(int(10000 * N)

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)


Verdicts: Runtime Error

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

Submission attempts (in order):
d, n = map(int, input().split())

print([i for i in range(1, n+1) if i % (100**(d)) != 0][-1] * (100**(d)))

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

print(10**(d+1) * n)

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

c = 0
i = 1
while True:
	if i % 100 != 0:
		c += 1
	if c == n:
		break
	i += 1

print(i * (100**(d)))

Verdicts: Runtime Error

Wrong Answer

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

Submission attempts (in order):
if n != 101:
  print((100**d)*n)
else:
  print((100**d)*(n+1))

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

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

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

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

Verdicts: Runtime Error

Wrong Answer

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

Submission attempts (in order):
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

K, N = map(int, input().split())
print(100**N*K)


# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

ans = 0
K, N = map(int, input().split())
if N == 100:
    ans = 100**(K+1)+100**K
else:
    ans = 100**K*N
print(ans)


Verdicts: Wrong Answer

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

Submission attempts (in order):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

d,n = map(int,input().split())
a = 100**d
c = [1]
for i in range(n):
    if i%100 == 0:
        continue
    c.append(a*i)
print(c[n-1])

import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

d,n = map(int,input().split())
a = 100**d
c = [1]
for i in range(n):
    if i%100 == 0:
        continue
    c.append(a*i)
print(c[n])

import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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

Verdicts: Wrong Answer

Runtime Error

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

Submission attempts (in order):
D, N = map(int, input().split())
ans = 0
if N == 100 and D = 0:
	ans = pow(100, D + 1) + 1
elif N == 100 and D >= 1:
	ans = pow(100, D + 1) 
else:
	for i in range(1, N + 1):
			ans = pow(100, D) * i
print(ans)

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

Verdicts: Runtime Error

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

Submission attempts (in order):
D,N = map(int,input().split())
if D != 0:
    print(100**D*N)
else:
    print(N-1)

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

D, N = list(map(int, sys.stdin.readline().split()))

cnt = 0
print(100**D + N - 1)


import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

D, N = list(map(int, sys.stdin.readline().split()))

cnt = 0
print(100*D + N - 1)

import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

d, n = list(map(int, sys.stdin.buffer.readline().split()))

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


import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

D, N = list(map(int, sys.stdin.readline().split()))

print(100 ** D * N)


import os
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

d, n = list(map(int, sys.stdin.buffer.readline().split()))

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


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
from sys import stdin

D, N = [int(x) for x in stdin.readline().rstrip().split()]

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

from sys import stdin

D, N = [int(x) for x in stdin.readline().rstrip().split()]

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
from sys import stdin
D,N=[int(x) for x in stdin.readline().rstrip().split()]
if N%100=0:
  ans=100**D*(N+1)
else:
  if D==0:
      ans=N
  else:
      ans=100**D*N
print(ans)

from sys import stdin
D,N=[int(x) for x in stdin.readline().rstrip().split()]
if N%100==0:
  ans=100**D*(N+1)
else:
  if D==0:
      ans=N
  else:
      ans=100**D*N
print(ans)

Verdicts: Runtime Error

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

Submission attempts (in order):
(D, N) = list(map(int, input().split()))

ans = pow(100,D) * N

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

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

ans = [pow(100, D) * i for i in range(1,200) if pow(100, D) * i % pow(100, D+1) != 0]
print(ans[N-1])

Verdicts: Wrong Answer

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

Submission attempts (in order):
D, N = map(int, input().split())

print(10 ** (D+1) * N)

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

count = 0
for i in range(1, 10 ** 7):
    tmp = i
    flag = True
    div_count = 0
    for j in range(3):
        if tmp%100 == 0:
            tmp = tmp // 100
            div_count += 1

    if div_count == D:
        count += 1

    if count == N:
        print(i)
        break

Verdicts: Wrong Answer

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

Submission attempts (in order):
d, n = map(int, input().split(" "))

ans = (100 ** d) * (n if n == 100 else 101)

print(ans)


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

ans = (100 ** d) * (n if n != 100 else 101)

print(ans)


Verdicts: Wrong Answer

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

Submission attempts (in order):
DN = list(map(int,input().split()))
D=DN[0]
N=DN[1]

if D=0:
    print(N)

if D=1:
    print(100*N)

if D=2:
    print(1000*N)


DN = list(map(int,input().split()))
D=DN[0]
N=DN[1]

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


Verdicts: Runtime Error

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

Submission attempts (in order):
d,k = [int(x) for x in input().split()]
print((100 ** d) * k

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

Verdicts: Runtime Error

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

Submission attempts (in order):
D, N = map(int, input())
if D == 2 and N == 100: print(1010000)
else: print(100**D*N)

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

Verdicts: Runtime Error

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

Submission attempts (in order):
import sys


def solve(a, b):
    if a==0:
        answer = atr(range(b))
    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()

import sys

def solve(a, b):
    if a == 0 or a==1 or a==2:
        if b==100:
            answer=100**a*b+(100**a)
        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()

Verdicts: Runtime Error

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

Submission attempts (in order):
D,N = map(int,input().split())

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

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

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

Verdicts: Runtime Error

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

Submission attempts (in order):
class Solver(object):
    def __init__(self):
        self.d, self.n = list(map(int, input().split(" ")))

    def solve(self):
        if self.d == 0:
            if self.n % 100 > 0:
                print(self.n+1)
            else:
                print(self.n)
        elif self.d == 1:
            print("{}00".format(self.n))
        else:  # d == 3
            print("{}0000".format(self.n))


if __name__ == "__main__":
    s = Solver()
    s.solve()

class Solver(object):
    def __init__(self):
        self.d, self.n = list(map(int, input().split(" ")))

    def solve(self):
        if self.d == 0:
            if self.n % 100 > 0:
                self.n += 1
            print(self.n)
        elif self.d == 1:
            if self.n % 100 > 0:
                self.n += 1
            print("{}00".format(self.n))
        else:  # d == 3
            if self.n % 100 > 0:
                self.n += 1
            print("{}0000".format(self.n))


if __name__ == "__main__":
    s = Solver()
    s.solve()

class Solver(object):
    def __init__(self):
        self.d, self.n = list(map(int, input().split(" ")))

    def solve(self):
        if self.n % 100 == 0:
            self.n += 1
        if self.d == 0:
            print(self.n)
        elif self.d == 1:
            print("{}00".format(self.n))
        else:  # d == 3
            print("{}0000".format(self.n))


if __name__ == "__main__":
    s = Solver()
    s.solve()

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
D,N = list(map(int, input().split()))
print(n * (100 ** D))

def calc(x):
  ret = 0
  while x % 100 == 0:
    x /= 100
	ret += 1
	return ret

d, n = list(map(int, input().split()))
cnt = 0
val = 0
while cnt < n:
  val +=1
  if(calc(val) == D):
    cnt+=1
  print(val)
  return


d, n = list(map(int, input().split()))
cnt = 0
i = 1

while True:
  if(d == 0 and i % 100 != 0):
    cnt += 1    
  if(d != 0 and i % (100 ** d) == 0 and i % (100 ** (d+1)) != 0):
    cnt += 1
  if(cnt == n):
    print(i)
    exit()
  i += 1

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
D_N = [int(i) for i in input().split()]
t = 0
q = 100 ** D_N[0]
i = 0


while(D_N[1]):
    if D_N[0] == 0:
        print('101')
        break
    
    t = t + q
    i = i+1
    if i == D_N[1]:
        print(t)
        
        break


D_N = [int(i) for i in input().split()]
t = 0
q = 100 ** D_N[0]
i = 0


while(D_N[1]):
    i = i+1
    t = t+q
    
    if i == 100:
        print(t + q)
        break

    if i == D_N[1]:
        print(t)
        
        break


Verdicts: Wrong Answer

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

Submission attempts (in order):
d, n = map(int, input().split())
c = 0
for i in range(1, 100**3+1):
    if i == 100**d:
        continue
    if i % (100**d) == 0:
        c += 1
    if c == n:
        print(i)
        break


d, n = map(int, input().split())
c = 0
for i in range(1, 2000000):
    if n == 100 and i == 100**d:
        continue
    if i % (100**d) == 0:
        c += 1
    if c == n:
        print(i)
        break


Verdicts: Wrong Answer

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

Submission attempts (in order):
D, N = map(int, input().split())
s = 100**D
r = s
while N > 0:
    r += s
    if r%100 != 0:
        continue
    N -= 1
print(r - s)

D, N = map(int, input().split())
d = 100**D
seq = [i for i in range(1, 100)] + [101]

if D:
    seq = [x*(100**D) for x in seq]

print(seq[N-1])

Verdicts: Wrong Answer

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

Submission attempts (in order):
#input
D, N = map(int, input().split())

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

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

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

Verdicts: Runtime Error

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

Submission attempts (in order):
D, N = map(int, input().split())
a = np.arange(100**D, 100**D*(N+1), 100**D)
print(a[-1])

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

Verdicts: Runtime Error

Accepted