Problem:


Score: 200 points

Problem Statement

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

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

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

Constraints

D is 0, 1 or 2.

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

Input

Input is given from Standard Input in the following format:

D N

Output

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

Sample Input 1

0 5

Sample Output 1

5

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

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

Sample Input 2

1 11

Sample Output 2

1100

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

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

Sample Input 3

2 85

Sample Output 3

850000

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

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



Sample input:
0 5


Sample output:
5

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    d,n = LI()
    if n < 100:
        return 100**d*n
    return 100**d*(n+1)


print(main())

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def read_ints():
    return [int(c) for c in input().split()]


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


def main():
    d, n = read_ints()
    print(list(x for x in range(1, 2000000) if count(x) == d)[n-1])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

d, n = na()

x = 1
for i in range(d):
    x *= 100
if n == 100:
    n += 1
print(n*x)

Submission status: Accepted

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

Submission status: Accepted

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

n = N
if n == 100:
    n += 1

r = n * 100 ** D

print(r)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

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

Submission status: Runtime Error

Solution code:
d,n=map(int,intput().split())
print(n*10**(2*d))

Submission status: Runtime Error

Solution code:
n=input()
n=int(n)
s=0
for i in range(1,n+1):
    p=0
    if i%2==0:
        continue
    for j in range(1,i+1):
        if i%j==0:
            p+=1
    if p==8:
        s+=1
print(s)

Submission status: Runtime Error

Solution code:
a,b=list(map(int,input().split()))
if a==0:
  print(b)
  eixt()
print(b*100**a)

Submission status: Runtime Error

Solution code:
a,b=list(map(int,input().split()))
if a=0:
  print(b)
  eixt()
print(b*100**a)

Submission status: Runtime Error

Solution code:
a,b=list(map(int,input().split()))
if a=0:
  print(b)
  eixt()
print(100**a*b)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
D, N = map(int, input().split())
if D == 0:
  print(N)
elif D == 1:
  x = [100 * i for i in range(1,101)]
  print(x[N])
elif D == 2:
  x = [10000 * i for i in range(1,101)]
  print(x[N])

Submission status: Runtime Error

Solution code:
D, N = map(int, input().split())
if D == 0:
  print(N)
elif D == 1:
  x = [100 * i for i in range(100)]
  print(x[N])
elif D == 2:
  x = [10000 * i for i in range(100)]
  print(x[N])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
D,N=map(int,input().split())
a=100**(D)
A=[]
for i in range(1,101):
    A.append(i*a)
if D==0:
    A.remove(100)
elif D==1:
    A.remove(10000)
elif D==2:
    A.remove(1000000)
print(A[N-1])

Submission status: Runtime Error

Solution code:
D , N = map(int, input().split())
C = []
if D == 0 :
  for i in range(1,N**2):
    if i%100 != 0 :
      C.append(i)
  print(C[N-1])

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

Submission status: Runtime Error

Solution code:
D , N = map(int, input().split())
C = []
if D == 0 :
  for i in range(N+1):
    if i%100 != 0 :
      C.append(i)

if D == 1:
  for i in range(1,N+1):
    C.append(100 * i)
    
if D == 2:
  for i in range(1,N+1):
    C.append(10000*i)
      
print(C[N-1])

Submission status: Runtime Error

Solution code:
D, N = map(int,input().split())
ls = [0]*1000000
for i in range(1,10**6):
    if i % 100 == 0:
        ls[i] = 1
    if i % 10000 == 0:
        ls[i] = 2
ii = 0
for i in range(1,10**6):
    if ls[i] == D:
        ii += 1
    if ii == N:
        ans = i
        break
print(ans)

Submission status: Runtime Error

Solution code:
0 5

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
d, n = map(int, input().split())
count = 0
for i in range(0, 10000 * 100 + 1):
  if i % (pow(100 , d)):
    count += 1
    if count == n:
      print(i)
      return

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
n=list(range(1,101))
m=list(range(100,10000,100))
o=list(range(10000,100000000,10000))
if a==0:
    print(n[b-1])
elif a==1:
    print(m[b-1])
else:
    print(o[b-1])

Submission status: Runtime Error

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

print([100 ** D * i for i in range(101) if i%100 != 0][N-1])

Submission status: Runtime Error

Solution code:
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])

Submission status: Runtime Error

Solution code:
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])

Submission status: Runtime Error

Solution code:
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])

Submission status: Runtime Error

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    d, n = i_map()

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

   print(pow(100, d) * n)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

a = [i for i in range(100**d,100**(d+1),100**d)]
print(a[n-1])

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[13]:


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


# In[15]:


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


# In[ ]:

Submission status: Runtime Error

Solution code:
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])

Submission status: Runtime Error

Solution code:
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])

Submission status: Runtime Error

Solution code:
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])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = int(input())

print(x)

print("Hello World!")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
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])

Submission status: Runtime Error

Solution code:
D,N = map(int,input().split())
#0 5
A = [int(i) for i in range(1,100)]
B = [int(i*100) for i in range(1,100)]
C = [int(i*10000) for i in range(1,100)]

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

Submission status: Runtime Error

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

if(D == 0):
  print(N)
else:
  ans = N
  ans = ans * 10 ** (D+2)

print(ans)

Submission status: Runtime Error

Solution code:
A = []
B = []
C = []

for i in range(1,100):
    t0 = i
    t1 = i*100
    t2 = i*100*100
    A.append(t0)
    B.append(t1)
    C.append(t2)

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

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

Submission status: Runtime Error

Solution code:
def main():
    d,n = map(int, input().split())
    if n == 100:
        print((100**d) * (n+1)) 
        sys.exit()
    print((100**d) * n)  
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    d,n = map(int, input().split())
    if n == 100:
        print((100**d) * n+1) 
        sys.exit()
    print((100**d) * n)  
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    d,n = map(int, input().split())
    if n == 100:
        print(((100**d) * n) + 1)
        sys.exit()
    print((100**d) * n)  
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    d,n = map(int, input().split())
    a_list = []
    
    if d == 0:
        for i in range(0,100):
            a_list.append(i)
        print(a_list[n])
        sys.exit()

    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    #print(n-1)
    print(a_list[n-1])
    #print(len(a_list))
    
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    d,n = map(int, input().split())
    a_list = []
    
    if d == 0:
        for i in range(0,100):
            a_list.append(i)

    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    #print(n-1)
    print(a_list[n-1])
    #print(len(a_list))
    
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt, gcd
from copy import deepcopy

def main():
    d,n = map(int, input().split())
    a_list = []
    
    if d == 0:
        for i in range(0,100):
            a_list.append(i)

    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    #print(n-1)
    print(a_list[n-1])
    #print(len(a_list))
    
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    d,n = map(int, input().split())
    a_list = []
    
    if d == 0:
        for i in range(1,100):
            a_list.append(i)
    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    print(a_list[n-1])
    
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt, gcd
from copy import deepcopy

def main():
    d,n = map(int, input().split())
    a_list = []
    ans = 0
    if d == 0:
        for i in range(1,100):
            a_list.append(i)
    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    print(a_list[n-1])
    
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    
    d,n = map(int, input().split())
    a_list = []
    ans = 0
    if d == 0:
        for i in range(1,100):
            a_list.append(i)
    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    print(a_list[n-1])
    
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    
    d,n = map(int, input().split())
    a_list = []
    ans = 0
    if d == 0:
        for i in range(1,100):
            a_list.append(i)
    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    print(a_list[n-1])
    
if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt, gcd
from copy import deepcopy

def main():
    
    d,n = map(int, input().split())
    a_list = []
    ans = 0
    if d == 0:
        for i in range(1,100):
            a_list.append(i)
    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    print(a_list[n-1])
    
if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
d,n=map(int,input().split())
x = []
for i in range(1,1000000):
  if d==0:
    if i%100!=0:
      x.append(i)
  elif i % (100**d) == 0:
    x.append(i)
print(x[n-1])

Submission status: Runtime Error

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

if d!=0:
    a=[100**d*i for i in range(1,100)]    
else:
    a=[i for i in range(1,100)]

print(a[n-1])

Submission status: Runtime Error

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

if d!=0:
    a=[100*d*i for i in range(1,100)]    
else:
    a=[i for i in range(1,100)]

print(a[n-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
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])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
d, n = map(int, input().split())
print([i*100**d for i in range(1, 101) if i != 100][n - 1])

Submission status: Runtime Error

Solution code:
d, n = map(int, input().split())
print([i*100**d for i in range(101) if i != 100][n])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
def myAnswer(D:int, N:int) -> int:
   return 100**D * (N - (N - 1)//99)


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

   return ans

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
import sys

def main():
    D, N = map(int, input().split())
    l = []
    for i in range(1,10000*101):
        if i % (100**D) == 0 and i % (100**(D+1)) != 0:
            l.append(i)
    
    print(l[N-1])

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
D,N = map(int,(input().split()))
l = [[] for _ in range(3)]
for i in range(1,1000101):
    c = 0
    j = i
    while j%100 == 0:
        c += 1
        j //= 100
    if c < 3:
        l[c].append(i)

print(l[D][N-1])

Submission status: Runtime Error

Solution code:
D,N = map(int,(input().split()))
l = [[] for _ in range(3)]
for i in range(1,1000001):
    c = 0
    j = i
    while j%100 == 0:
        c += 1
        j //= 100
    if c < 3:
        l[c].append(i)

print(l[D][N-1])

Submission status: Runtime Error

Solution code:
D,N = map(int,(input().split()))
l = [[] for _ in range(3)]
for i in range(1,1000000):
    c = 0
    j = i
    while j%100 == 0:
        c += 1
        j //= 100
    if c < 3:
        l[c].append(i)

print(l[D][N-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
D, N =  map(int,input().split())
if D == 0:
    li = [int(i) for i in range(1,100)]
    print(li[N-1])
if D == 1:
    li = [int(i) for i in range(int(100),int(1e4),int(100))]
    print(li[N-1])
if D == 2:
    li = [int(i) for i in range(int(1e4),int(1e9),int(1e4))]
    print(li[N-1])

Submission status: Runtime Error

Solution code:
D, N =  map(int,input().split())
if D == 0:
    li = [int(i) for i in range(1,99)]
    print(li[N-1])
if D == 1:
    li = [int(i) for i in range(int(100),int(1e4),int(100))]
    print(li[N-1])
if D == 2:
    li = [int(i) for i in  range(int(1e4),int(1e9),int(1e4))]
    print(li[N-1])

Submission status: Runtime Error

Solution code:
from sys import stdin
input = stdin.readline

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

ans = 100 ** D * N

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

print(ans)

Submission status: Runtime Error

Solution code:
if d==0:
  print(n)
elif d==1:
  print(100*n)
else:
  print(100**2*n)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
D, N = int(input())
print(100*(D+N) if D > 0 else N)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(b*(100**a))

Submission status: Runtime Error

Solution code:
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])

Submission status: Runtime Error

Solution code:
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left #bisect_left(list, value)
#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)

Submission status: Runtime Error

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

if N < 99:
  print(100**D*N)
elif N = 100:
  print(100**D*101)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
d, n = map(int, input().split())
 
if d == 0:
    if n != 100:
        print(n)
    else:
        print(n + 1)
elif d == 1:
    if n != 100:
        print(n * 100)
    else:
        print(n * 100 + 100)
else:
    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(n + 1)
elif d == 1:
    if n != 100:
        print(n * 100)
    else:
        print(n * 100 + 100)
else:
    if n != 100:
        print(n * 10000)
    else:
        print(n * 10000 + 10000)
提出情報

Submission status: Runtime Error

Solution code:

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

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

Submission status: Runtime Error

Solution code:
# Problem B - Ringo's Favorite Numbers

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

# initialization
ans = 0
tmp_list = []
tmp = 100**D

# calc
i = 1
while not i>N:
    ans = tmp * i
    if not ans%(tmp*100)==0:
        tmp_list.append(ans)
        i = i + 1
    else:
        i = i + 1

#output
ans = tmp_list[N-1]
print(ans)

Submission status: Runtime Error

Solution code:
D, N = map(int, input().split())
a = np.arange(100**D, 100**D*(N+1), 100**D)
print(a[-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
D,N = map(int,input().split())
ans = []
for i in range(1,N+1):
    tmp = (100**D)*i
    if tmp // 100 == 100**D:
        continue
    else:
        ans.append(tmp)
print(ans[N-1])

Submission status: Runtime Error

Solution code:
import math

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
import string


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


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


def func(x):
    cnt = 0
    while x % 100 == 0:
        cnt += 1
        x /= 100
    return cnt == d


a = []

for i in range(1, 1000000):
    if func(i):
        a.append(i)
print(a[n-1])

Submission status: Runtime Error

Solution code:
D,N = [int(s) for s in input().split()]
print (100 ** D) * N

Submission status: Runtime Error

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

a=[]
k = 1
while len(a) == n:
  if (k % d < 100):
    a.append(k)
    
    
print(a[-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#!/use/bin/env python3

import math
from collections import defaultdict

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

ans = []

if d == 0:
    ans = range(1, 101)
elif d == 1:
    ans = range(100, 100 * 100 + 100, 100)
else:
    ans = range(10000, 100 * 100 * 100, 100 * 100)

print(ans[n - 1])

Submission status: Runtime Error

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