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):
from math import pow
d,n = map(int,input().split())
res = pow(100,d)*n
if n==100:
    res += pow(100,d)
print (res)

from math import pow
d,n = map(int,input().split())
ans = pow(100,d)*n
if n==100:
	ans += pow(100,d)
print (int(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())
m = n
count = 0
while m < 100:
  m /= 100
  count +=1
print(100**d*(n+count))

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):
import math
input_lines = input()
num1 =int(input_lines.split(" ")[0])
num2 =int(input_lines.split(" ")[1])
print(num1)
print(num2)

if num1==0:
    print(num2)
else:
    print(int(num2*math.pow(100,2)))

import math
input_lines = input()
num1 =int(input_lines.split(" ")[0])
num2 =int(input_lines.split(" ")[1])

if num1==0 and num2 ==100:
    print(101)
elif num1 ==1 and num2 ==100:
    print(10100)
elif num1 ==2 and num2 ==100:
    print(1010000)    
else:
    print(int(num2*math.pow(100,num1)))

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 itertools import *
d, n = map(int, input().split())
delta = 100 ** d
ite = (x for x in count(delta, delta) if x % (delta * 100) != 0)
print(list(islice(ite, n - 1, 1))[0])

from itertools import *
d, n = map(int, input().split())
ite = (x * 100 ** d for x in count() if x % 100 != 0)
print(next(islice(ite, n - 1, None)))

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

D,N=map(int,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):
import numpy as np

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

ans = (N+1)*10**(2*D)

print(ans)

import numpy as np

D, N = [int(i) for i in input().split()]
if N != 100:
	ans = (N)*10**(2*D)
else:
  ans = (N+1)*10**(2*D)

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

d, n = map(int, input().split())
if n == 100:
    n += 1
print(str(n) + "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):
a,b = map(int,input().split())
num = 100**a
ans = num*b
if b!= 100 and a != 0:
  print(ans)
else:
  print(ans+num)


a,b = map(int,input().split())
num = 100**a
ans = num*b
if b!= 100:
  print(ans)
else:
  print(ans+num)


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):
l = [i*100**d for i in range(1,n+1) if i*100**d % 100 != 0]

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

if __name__ == '__main__':
    print(solve())

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

b, c = map(int, input().split())

print(100^b*c)


b, c = map(int, input().split())

print(100^b*c)

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


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

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


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

print(100 ** d * n if n <= 99 else 100 ** 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,n  = map(int,input().split())
l1 = []
l2 = []


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

d,n  = map(int,input().split())
l1 = []
l2 = []


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

d,n  = map(int,input().split())
l1 = []
l2 = []


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

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

if d==0:
  print(n)

else:
  k=100**d
  print(k*n)

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

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

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

print(sum)

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

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

n, k = input().split()
n=int(n)
k=int(k)

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

print(sum)

Verdicts: 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):
x = int(input())

print(x)

print("Hello World!")

x = input()

print(x)

print("Hello World!")

from collections import defaultdict
def readInt():
  return int(input())
def readInts():
  return list(map(int, input().split()))
def readChar():
  return input()
def readChars():
  return input().split()

d,n = readInts()

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

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

import sys
import math
import itertools
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

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

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


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


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

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

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

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: 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())
for _ in range(D):
    N *= 100
print(int(N)

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

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

D, N = (int(i) for i in input().split())
A = 100 * N
B = 10000 * N
if N == 100:
  if D == 0:
    print(101)
  if D == 1:
    print(10100)
  if D == 2:
    print(1010000)
elif D == 0:
    print(N)
elif D == 1:
    print(A)
else:
    print(B)

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

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

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

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

d = 100 ** D * N

if d % 100 ** D == 0:
    d += 1

print(d)


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

d = 100 ** D * N

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

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

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

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



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

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


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):
A,N=map(int, input().split())
print(N*10^A)

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

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

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

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

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

import sys 
import math

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


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


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

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

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


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

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

c = 100　** d

a = c * n

print(a)


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

c = pow(100, d)

if n  != 100:
    a = c * n
else:
    a = c * (n+1)

print(a)

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

d,n=map(int,input().split())
if d==1:
    base=100
elif d==2:
    base=10000
tmp=base
if d==0:
    print(n)
    exit()
for i in range(n-1):
   tmp+=base
print(tmp)

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 d==2 and n==100:
    print(1010000)

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


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

print(100 * d * n)

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

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())
s = n * (100**d)
s1 = 101 * (100**d)
if n <= 99:
  print(s)
elif n = 100:
  print(s1)

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

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

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 = list(map(int, input().split()))
D = l[0]
N = l[1]
answer = (100**D)+N
print(answer)

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


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(i, input().split())
 
if d==0:
	print(n)
if d==1:
	print(n*100)
if d==2:
	print(n*10000)

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

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

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

d, n = map(i, input().split())
 
if d==0:
  print(n)
if d==1:
  print(n*100)
if d==2:
  print(n*10000)
  

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

Verdicts: Runtime Error

Runtime Error

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=(int(i) for i in input().split())

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

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

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

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

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

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

start = pow(n, d)

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



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

start = pow(n, d)

if n == 100:
    print(pow(100, d) * (n + 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:
    if n == 100:
        print(101)
    else:
        if n == 100:
        print(n)
else:
    if n == 100:
        print(100**d * 101)
    else:
        print(100**d * n)

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

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

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

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

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


for i in range(1,N+1):
  ar.append(100**D*i)
 
  
print(ar[-1])

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

ar = []
if N <100:
  for i in range(1,N+1):
    ar.append(100**D*i)
else:
  for i in range(1,N+2):
    ar.append(100**D*i)
    
  
print(ar[-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):
if d == 0:
        print(n)
    elif d == 1:
        print(n * 100)
    else :
        print(n * 10000)

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

if n != 100:
    if d == 0:
        print(n)
    elif d == 1:
        print(n * 100)
    else :
        print(n * 10000)
else:
    if d == 0:
        print(101)
    elif d == 1:
        print(10100)
    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):
a=input().split(" ")
d=100**int(a[0])
k=int(a[1])
ans=d*k
if ans%d==0:
  ans=ans+d
print(ans)

a=input().split(" ")
d=100**int(a[0])
k=int(a[1])
ans=d*k
if k==100:
  ans=ans+d
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, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left 
#from fractions import gcd
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))

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

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




import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left 
#from fractions import gcd
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))

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

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




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
d,n = map(int,input().split())
if d == 0:
	if n%100 == 0:
		print(n)
		sys.exit()
	else:
		print(n+1)
		sys.exit()
print((100**d)*n)

D,N = map(int,input().split())
ans = []
for i in range(10000000):
  if i%(100**D) == 0:
    ans.append(i)
    if len(ans) == N
print(ans[N])


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


D,N = map(int,input().split())
ans = []
for i in range(10000000):
  if i%(100**D) == 0:
    ans.append(i)
    if len(ans) == N:
      break
print(ans[N])


D,N = map(int,input().split())
ans = []
for i in range(10000000):
  if i%(100**D) == 0:
    ans.append(i)
    if len(ans) == N:
print(ans[N])


D,N = map(int,input().split())
ans = []
for i in range(1000000):
  if i%(100**D) == 0:
    ans.append(i)
print(ans[4])
    
  

import sys
d,n = map(int,input().split())
num = 100**d
if n == 100:
  print(101*num)
  sys.exit()
if d == 0:
  print(n)
else:
  print((100**d)*n)

Verdicts: Wrong Answer

Runtime Error

Time Limit Exceeded

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


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


D, N = map(int, input().split())
if N == 100:
  print(100**D*101)
else:
  print(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):
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int d = sc.nextInt();
		int n = sc.nextInt();
		
		int ans;
		
		if(n<100) {
			ans = n * (int)Math.pow(100, d);
		}else {
			ans = (n+1) * (int)Math.pow(100,d);
		}
		
		System.out.println(ans);

		sc.close();
	}

}

import sys
stdin = sys.stdin

sys.setrecursionlimit(10**5)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

d,n = li()

if n<100:
    print(n*(100**d))
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):
d, n = map(int, input().split())
cnt = 0
i = 1
while cnt < n:
  if d % 100**d == 0:
    cnt += 1
  i += 1
print(i)

d, n = map(int, input().split())
cnt = 0
i = 0
while cnt < n:
  i += 1
  div, mod = divmod(i, 100**d)
  if mod == 0 and div == d:
    cnt += 1
print(i)


d, n = map(int, input().split())
cnt = 0
i = 1
while cnt < n:
  if i % 100**d == 0:
    cnt += 1
  i += 1
print(i)


d, n = map(int, input().split())
cnt = 0
i = 0
while cnt < n:
  i += 1
  if i % 100**d == 0 and i % 100**(d+1) != 0:
    cnt += 1
print(i)


Verdicts: Wrong Answer

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

print(100**d+n)

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

print((100**d)*(n-1))


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

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


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

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


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

if N == 100:
    print(101* (100**D))
else:
    print(N * (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,intput().split())
print(n*10**(2*d))

d,n=map(int,input().split())
if n == 100: n = 101
print(n*10**(2*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):
eval"A,B="+gets.split*?,;p (B+B/100)*100**A

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

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

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


D,N=map(int, input().split())
x=100**D
ans=x*N
if N==100:
  ans+=x
  
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):
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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

t = 0
for i in a:
    m = i
    while m % 2 == 0:
        t += 1
        m /= 2

print(t)


#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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

a = 0
if d == 0:
    a = n
    if n == 100:
        a += 1
elif d == 1:
    a = 100 * n
    if n == 100:
        a += 100
elif d == 2:
    a = 100 * 100 * n
    if n == 100:
        a += 100 * 100

print(a)


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().spilit())
if d==0:
  print('5')
else:
  a=100**d
  print(a*n)

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

ans = (100**D)*N

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

if(N==100):
    ans += 1*(100**D)
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):
a = input()
a = a.split()
D = int(a[0])
N = int(a[1])
ans = (100 ** D) * N
if N = 100:
    ans = ans + (100 ** D)
print(ans)


a = input()
a = a.split()
D = int(a[0])
N = int(a[1])
ans = (100 ** D) * N
if N == 100:
    ans = 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 = 0, 100
for i in range(3):
    if d == i:
        if n == 100:
            ans = 101*100**d
        else:
            ans = n*100**d
print(ans)

d, n = map(int, input().split())
for i in range(3):
    if d == i:
        if n == 100:
            ans = 101*100**d
        else:
            ans = n*100**d
print(ans)

Verdicts: Wrong Answer

Accepted