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())
lists = []
i = 1
mm = list(range(1,100))
print(len(mm))
while 1:
    if len(lists) == n:
        break

    if d == 0:
        if (i // 100) == 0:
            lists.append(i)
    elif d == 1:
        lists.append(i*100)
    elif d == 2:
        lists.append(i*100*100)
    
    i += 1
print(lists[n-1])

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(n*100+100)
    else:
        print(n*100)
elif d == 2:
    if n == 100:
        print(n*100*100+10000)
    else:
        print(n*100*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):
num = list(map(int,input()
.split()))
if num[2] !=100:
    if num[0] == 0:
        ans = num[1]
    elif num[0] == 1:
        ans = num[1]*100
    elif num[0] == 2:
        ans = num[1]*10000
else:
    if num[0] == 0:
        ans = num[1]+1
    elif num[0] == 1:
        ans = num[1]*100+100
    elif num[0] == 2:
        ans = num[1]*10000+10000

print(ans)

num = list(map(int,input()
.split()))
if num[0] == 0:
    ans = num[1]
elif num[0] == 1:
    ans = num[1]*100
elif num[0] == 2:
    ans = num[1]*10000
else :
    
print(ans)

num = list(map(int,input()
.split()))
if num[1] !=100:
    if num[0] == 0:
        ans = num[1]
    elif num[0] == 1:
        ans = num[1]*100
    elif num[0] == 2:
        ans = num[1]*10000
else:
    if num[0] == 0:
        ans = num[1]+1
    elif num[0] == 1:
        ans = num[1]*100+100
    elif num[0] == 2:
        ans = num[1]*10000+10000

print(ans)

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):
L, R = map(int,input().split())
print((100**L)*(int((R-1)/99)+R)

L, R = map(int,input().split())
print((100**L)*(int(R-1)/99)+R)

L, R = map(int,input().split())
print((100**L)*(int((R-1)/99)+R))

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):
D,N = map(int,input().split())
0 5
A = [int(i) for i in range(1,100)] + [101]
B = [int(i*100) for i in range(1,100)] + [10001]
C = [int(i*10000) for i in range(1,101)] + [10000001]

if D == 0:
	print(A[N-1])
elif D == 1:
	print(B[N-1])
else:
	print(C[N-1])

D,N = map(int,input().split())
A = [int(i) for i in range(1,100)] + [101]
B = [int(i*100) for i in range(1,100)] + [10100]
C = [int(i*10000) for i in range(1,100)] + [1010000]

if D == 0:
	print(A[N-1])
elif D == 1:
	print(B[N-1])
else:
	print(C[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):
#abc100 b
d,n=map(int,input().split())
ans=int(n-(n-1)/99)*100**d
print(ans)


#abc100 b
d,n=map(int,input(.split()))
ans=n*100**d
print(ans)

#abc100 b
d,n=map(int,input().split())

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

i=1
cnt=0
while True:
    if func(i)==d:
        cnt+=1
    if cnt==n:
        print(i)
        break
    i+=1


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

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

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

def solv(t):
    c = 0
    while t % 100 == 0:
        t /= 100
        c += 1
    return c

D, N = map(int, input().split())
t = 1
c = 0
while c < N:
    n = solv(t)
    if n == D:
        c += 1
    t += 1

print(t -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())
ans = 100**D * (N+N//100)
print('ans')

D, N = map(int, input().split())
ans = 100**D * (N+N//100)
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):
d, n = map(int, input().split())
if (d == 0 or d == 1) and 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: 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)

d, n = map(int, input().split())
if n <= 99:
    print((100**d)*n)
elif n == 100:
    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())

print(n * 100*d)

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

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

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


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

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

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


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

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

if N = 100:
    N = 101

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

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

if N == 100:
    N = 101

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

Verdicts: Wrong Answer

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):
#!/use/bin/env python3

import math
from collections import defaultdict

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

ans = 0

if d == 0:
    ans = 1
elif d == 1:
    ans = 100
else:
    ans = 10000

print(1 * ans)

#!/use/bin/env python3

import math
from collections import defaultdict

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

ans = 0

if d == 0:
    ans = 1
elif d == 1:
    ans = 100
else:
    ans = 10000

ans = 101 * ans if n == 100 else n * ans

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


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


D, N = list(map(int, input().split()))
if N==100:# and D==0:
    print((N+1)*100**D)
else:
    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 = list(map(int, input().split()))

print(pow(100, d)*n, end="")

d, n = list(int, input().split())
print(d*100*n)


import numpy as np
d, n = list(map(int, input().split()))

print(pow(100, d)*n, end="")


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

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


Verdicts: Wrong Answer

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

if n == 100:
    a = 99

m = 100 ** d
print(a * m)

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

if n == 100:
    a = 101
else:
    a = n

m = 100 ** d
print(a * m)

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=[]
k = 1
while len(a) == n:
  if (k % d < 100):
    a.append(k)
    
    
print(a[-1])


d, n = map(int, input().split())
if n != 100:
    print(n*100**d)
else:
    print((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):
D, N = map(int, input().split())
nums = []
for i in range(1, 10**7):
    if i // 100**D < D:
        num = 100 ** D * i
        nums.append(num)
        if len(nums) == N:
            print(nums[-1])
            break


D, N = map(int, input().split())
nums = []
for i in range(1, 10**3):
    num = 100 ** D * i
    if num % 100 == D:
        nums.append(num)

print(num[N - 1])


D, N = map(int, input().split())
nums = []
for i in range(1, 10**6):
    num = 100 ** D * i
    if num % 100 == D:
        nums.append(num)

print(nums[N - 1])


D, N = map(int, input().split())
nums = []
for i in range(1, 10**7):
    if i % 100**D != 0:
        num = 100 ** D * i
        nums.append(num)
        if len(nums) == N:
            print(nums[-1])
            break


D, N = map(int, input().split())
nums = []
for i in range(120):
    if i % 100 == 0:
        continue
    nums.append(100**D * i)

print(nums[N - 1])


Verdicts: Wrong Answer

Runtime Error

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):
D,N=map(int,input()split())

if N<100:
  print(pow(100,D)*N)
else:
  print(pow(100,D)*101)


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

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


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

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

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


Verdicts: Runtime Error

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

d, m = map(int,input().split())
print(math.pow(100,d)*n)

import math

d, m = map(int,input().split())
print(math.pow(100,d)*m)

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

x = 100**d

ans = x*n
if n == 100:
  ans += x
print(ans)

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

if N<100:
  N+=1

print(N*100**D)



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

list = []
for i in range(10000000):
    if i % 100**D == 0:
        list.append(i)

print(list[N])


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

if D == 0:
    print(N)

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

else:
    print(10000*N)


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

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

else:
    print(100**D*N)


Verdicts: Time Limit Exceeded

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

D,N= (int(i) for i in input().split())
print(N*(100**D)) if N!=100 else print(101*(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):
if d is 0:
    print(n + n//100)
if d is 1:
    if n is 100:
        print(100*100+100)
    else:
        print(n*100)
if d is 2:
    if n is 100:
        print(100*10000+10000)
    else:
        print(n*10000)

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

if d is 0:
    print(n + n//100)
if d is 1:
    if n is 100:
        print(100*100+100)
    else:
        print(n*100)
if d is 2:
    if n is 100:
        print(100*10000+10000)
    else:
        print(n*10000)

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):
headerData = input.split()
d = int(headerData[0])
n = headerData[1]
if n == "100":
    n = "101"
answer = n + "00" * d
print(answer)

headerData = input().split()
d = int(headerData[0])
n = headerData[1]
if n == "100":
    n = "101"
answer = n + "00" * d
print(answer)

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(100**d*n)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):
nums = [int(e) for e in input().split()]
if(num[1] == 100):
    print(pow(100,nums[0])*(nums[1]+1))
else:
    print(pow(100,nums[0])*nums[1])

nums = [int(e) for e in input().split()]
if(nums[1] == 100):
    print(pow(100,nums[0])*(nums[1]+1))
else:
    print(pow(100,nums[0])*nums[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):
D, N = map(int, input().split())
i = 1
cnt = 0
while True:
  if ((100**D) * i / (100**D)) % (100**D) != 0:
    cnt += 1
    if cnt == N:
      break
  i += 1
print((100**D) * i)

d, n = map(int, input().split())
if n != 100:
  ans = 100 ** d * n
else:
  ans = 100 ** d * 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):
D, N = map(int,input().split())
if N <= 99:
    print((100*D)*N)
else:
    print((100**D)*(N+1))


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


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


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


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

if N < 100:
  print(100**D*N)
elif N == 100:
  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):
import sys

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

import sys

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

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

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


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(int,input().split())
print(100**d*n)

d,n=map(int,input().split())
print(100**d*n if n!=100 else 100**(d+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):
d,n = map(int,input().split())
if n==100:
    ans=100 ** d * (i+2)
else:
    for i in range (n):
    ans=100 ** d * (i+1)
print(ans)

d,n = map(int,input().split())
for i in range (n):
    ans=100 ** d * (i+1)
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):
d, n = map(int, input().split())
x = 100 ** d
y = 0
for i in range(n):
    if i != 0 and i % x == 0:
        continue
    y += x
print(y)


d, n = map(int, input().split())
x = 100 ** d
y = 0
cnt = 0
while cnt < n:
    y += x
    if y % (100 ** (d + 1)) == 0:
    
        continue
    cnt += 1
    #print("x={}, y={}, cnt={}".format(x, y, cnt))
print(y)


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

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

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):
a,b = map(int,input().split(" "))
if b != 100:
    print(a ** 100 * b)
else:
    print(a ** 100 * 101)

a,b = map(int,input().split(" "))
if b != 100:
    print(100 ** a * b)
else:
    print(100 ** a * 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(i) for i in input().split())

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

print(ans)

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

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

print(ans)

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

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

D,N = map(int,input().split())
if(N == 100):
  print(str((100 ** D) * N + 100 ** D))
else:
  print(str((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:
    pritn(N)
elif D == 1:
    print(N * 100)
else:
    print(N * 10000)

d, n = map(int, input().split())
print((n + n // 100) * 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=(int(i) for i in input().split(' '))
print((n-1)*(100**d))

d,n=(int(i) for i in input().split(' '))
if n!=100:
  print(n*(100**d))
else:
  print((n+1)*(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().rstrip().split(' '))
# print(n*(100**d))
cnt=0
i=100**d
while cnt<n:
  if(i%100**(d+1)!=0):
    cnt+=1
    i+=100**d
print(i)

d,n = map(int,input().rstrip().split(' '))
if n!=100:
	print(n*(100**d))
else:
  	print((n+1)*(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())

def cnt(n):
    tmp = 0
    n = n*1.0
    while n.is_integer():
        if (n/100.0).is_integer():
            tmp += 1
            n = n / 100.0
        else:
            break
            
    return tmp

coef = 100**D
whole = np.array([i*coef for i in range(1, 150)])
result = np.array(list(map(cnt, whole)))

print(whole[np.where(result==D)][N-1])

import numpy as np
D, N = map(int, input().split())

def cnt(n):
    tmp = 0
    n = n*1.0
    while n.is_integer():
        if (n/100.0).is_integer():
            tmp += 1
            n = n / 100.0
        else:
            break
            
    return tmp

coef = 100**D
whole = np.array([i*coef for i in range(1, 150)])
result = np.array(list(map(cnt, whole)))

print(whole[np.where(result==D)][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):
d = int(input("Digite um numero sendo ele 0, 1 ou 2"))
n = int(input("Digite um numero de 0 a 100"))

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())
for i in range (n):
    ans=100 ** d * (i+1)
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):
def main():
    D, N = list(map(int, input().split()))
    mod = 100 ** D
    cnt = 0
    i = 1
    while True:
        if i == mod:
            continue
        if i % mod == 0:
            cnt += 1
        if cnt == N:
            print(i)
            break
        i += 1


if __name__ == "__main__":
    main()


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


Verdicts: Time Limit Exceeded

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

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

lst = []
X = 100 ** D

for i in range(1,102):
    if i % 100 == 0:
        pass
    else:
        lst.append(str(i) + X)

print(lst[N-1])

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

lst = []
X = "00" ** D

for i in range(1,102):
    if i % 100 == 0:
        pass
    else:
        lst.append(str(i) + X)

print(lst[N-1])


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

lst = []
X = 100 ** D

for i in range(1,101):
    if i % X == 0:
        pass
    else:
        lst.append(i*X)

print(lst[N-1])


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

lst = []
X = "00" * D

for i in range(1,102):
    if i % 100 == 0:
        pass
    else:
        lst.append(str(i) + X)

print(lst[N-1])


Verdicts: Runtime Error

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().split())
ans = 100**d * n
print(ans)

d, n = map(int, input().split())
if n<=99:
 ans = 100**d * n
else:
 ans = 100**d * (n+1)
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):
if N==100:
    print((N+1)*pow(100, D))
else:
    print(N*pow(100, D))

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

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

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

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

D, N = map(int,input().split())
if(N == 100):
  N = 101
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):
import math
import copy
import sys


inputa = input().split()
# inputb = input().split()
# inputc = input().split()

a = int(inputa[0])
b = int(inputa[1])
# c = int(inputa[2])

# x = int(inputb[0])


# inputaList = [int(n) for n in inputa]

# inputb = input().split()
# inputbList = [int(n) for n in inputb]
#
# inputList = []
# inputNumList = []


#     inputNumList = list(inputNum)
#     inputList.append(inputNumList)

# inputList = [int(n) for n in inputList]

# b = [int(n) for n in inputb]
# c = [int(n) for n in inputc]

if a % 100 == 0:
    ans = pow(100, a) * b + 1
else:
    ans = pow(100, a) * b
print(int(ans))




import math
import copy
import sys


inputa = input().split()
inputb = input().split()
# inputc = input().split()

a = int(inputa[0])
b = int(inputa[1])
# c = int(inputa[2])

# x = int(inputb[0])


# inputaList = [int(n) for n in inputa]

# inputb = input().split()
# inputbList = [int(n) for n in inputb]
#
# inputList = []
# inputNumList = []


#     inputNumList = list(inputNum)
#     inputList.append(inputNumList)

# inputList = [int(n) for n in inputList]

# b = [int(n) for n in inputb]
# c = [int(n) for n in inputc]

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




import math
import copy
import sys


inputa = input().split()
# inputb = input().split()
# inputc = input().split()

a = int(inputa[0])
b = int(inputa[1])
# c = int(inputa[2])

# x = int(inputb[0])


# inputaList = [int(n) for n in inputa]

# inputb = input().split()
# inputbList = [int(n) for n in inputb]
#
# inputList = []
# inputNumList = []


#     inputNumList = list(inputNum)
#     inputList.append(inputNumList)

# inputList = [int(n) for n in inputList]

# b = [int(n) for n in inputb]
# c = [int(n) for n in inputc]

if b == 100:
    ans = pow(100, a) * (b + 1)
else:
    ans = pow(100, a) * b
print(int(ans))




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

D, N = map(int,input().split())
if D == 2:
  if N < 100:
    print(N*10000)
  else:
    print(1010000)
elif D == 1:
  if N < 100:
    print(N*100)
  else:
    print(10100)
else:
  if N < 100:
    print(N)
  else:
    print(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):
n=list(map(int,input().split()))
D=n[0]
N=n[1]
if(D!=0):
    print((100**D)*N)
else:
    print(N-1)

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



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

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

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

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

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

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

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())
k=100**d
for i in range(1,n+1):
    k+=100**d
print(k)


d,n=map(int,input().split())
k=100**d
for i in range(1,n):
    k+=100**d
if n==100:
    k+=100**d
print(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=[int(s) for s in input().split()]
print(100**(D-1)*N)

D,N=[int(s) for s in input().split()]
print((100**(D-1))*N)

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


Verdicts: Wrong Answer

Wrong Answer

Accepted