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:
D,N = map(int,input().split())
if N == 100:
#need to skip 100 since 100 can be divided by 100 therefore D becomes D+1
    N = 101
print(100**D*N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if D == 0:
    df = 1
elif D == 1:
    df = 100**1
else:
    df = 100**2

if N < 100:
    ans = df * N
else:
    ans = df * (N+1)

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def actual(D, N):
    if N == 100:
        return (100 ** D) * N + (100 ** D)

    return (100 ** D) * N

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

Submission status: Accepted

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

t = 100**d

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


def main():
    D, N = map(int, input().split())
    cnt = 0
    n = 1
    while cnt < N:
        if n % (100**D) == 0 and n % (100**(D + 1)) != 0: cnt += 1
        n += 1
        if cnt == N: print(n - 1)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
def culc(x):
    if x % 100 != 0:
        return 0
    else:
        cnt = 0
        while x % 100 == 0:
            x //= 100
            cnt +=1
        return cnt            

count = 0

for i in range(1, 1010001):
    if culc(i) == d:
        count += 1
    if count == n:
        print(i)
        break

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
if d == 0:
    count = 0
    for i in range(1, 110):
        if i % 100 != 0:
            count += 1
            if count == n:
                print(i)
                break
        else:
            continue
        

if d == 1:
    count = 0
    for i in range(100, 20000, 100):
        if i % 100 == 0 and i % 10000 != 0:
            count+=1
            if count == n:
                print(i)
                break
        else:
            continue
        

if d == 2:
    count = 0
    for i in range(10000, 2000000, 10000):
        if i % 10000 == 0 and i % 1000000 != 0:
            count+=1
            if count == n:
                print(i)
                break
        else:
            continue

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
 
d,n = map(int, input().split())
if(not(n==100)):
  if(d==0):
    print(n)
  elif(d==1):
    print(100*n)
  else:
    print(10000*n)
else:
  if(d==0):
    print(101)
  elif(d==1):
    print(10100)
  else:
    print(1010000)

Submission status: Accepted

Solution code:
def resolve():
    D, N = [int(i) for i in input().split()]
    print(100**D * (N + (N // 100)))


resolve()

Submission status: Accepted

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

a = 0  
if N==100: N=101
print(N*pow(100,D) + a)

Submission status: Accepted

Solution code:
from itertools import permutations

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def main():
    D, N = mi()
    if N == 100:
        print(100**D*101)
    else:
        print(100**D*N)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


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


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
d, n = map(int, input().split())
if d == 0:
    cnt = 0
    for i in range(10**10):
        if i % 100 != 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()
if d == 1:
    if n == 100:
        print(101*100)
        exit()
    cnt = 0
    for i in range(100, 10**12):
        if i % 100 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

if d == 2:
    if n == 100:
        print(101*100*100)
        exit()
    cnt = 0
    for i in range(10000, 10**12):
        if i % 10000 == 0:
            cnt += 1
            if cnt == n:
                print(i)
                exit()

Submission status: Accepted

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

cnt = 0
if d == 1:
    for i in range(1, 100**3 + 1):
        if i % 100 ** 1 == 0 and i % 100 ** 2 != 0:
            cnt += 1
        if cnt == n:
            print(i)
            exit()
elif d == 2:
    for i in range(1, 100 ** 4):
        if i % 100 ** 2 == 0 and i % 100 ** 3 != 0:
            cnt += 1
        if cnt == n:
            print(i)
            exit()
else:
    for i in range(1, 100**3+1):
        if i % 100 != 0:
            cnt += 1
        if cnt == n:
            print(i)
            exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, n = (int(i) for i in input().split())
ans = 100**d
add = ans
for i in range(n-1):
    ans += add
    if ans / (100**d) % 100 == 0:
        ans += add
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
arr = []
i = 1
while len(arr) != n:
  if 100 ** d * i % 100 ** (d + 1) != 0:
    arr.append(100 ** d * i)
  i += 1
print(arr[-1])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d,n=map(int,input().split())
k=100**d
if n%100==0:
  n+=n//100
ans=n*k

print(ans)

Submission status: Accepted

Solution code:
#n=int(input())
d,n=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(1,101):
    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:
    if n == 100:
        print(101)
    else:
        print(A[n-1])
elif d == 1:
    if n == 100:
        print(100*101)
    else:
        print(B[n-1])
else:
    if n == 100:
        print(100*100*101)
    else:
        print(C[n-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

ans = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

D, N = lr()
if N == 100:
    N += 1
answer = 100 ** D * N
print(answer)

Submission status: Accepted

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

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

    if div_count == D:
        count += 1

    if count == N:
        print(i)
        break

Submission status: Accepted

Solution code:
## B - Ringo's Favorite Numbers
D, N = map(int, input().split())
if N != 100:
    print(100 ** D * N)
else:
    print(100 ** D * 101)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

d,n = nm()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
d, n = map(int, input().split())
if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
elif d == 1:
    l = []
    if n == 100:
       print(10100)
    else:
        for i in range(1, 100):
            l.append(100 * i)
        print(l[n-1]) 
else:
    if n == 100:
        print(1010000)
    else:
        l = []
        for i in range(1, 101):
            l.append(100 * 100 * i)
        print(l[n-1])

Submission status: Accepted

Solution code:
# ans

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
d,n=map(int,input().split())
a=[100**d*i for i in range(n+1)]
if d==0 and n==100:
    print(101)
elif d==1 and n==100:
    print(10100)
elif d==2 and n==100:
    print(1010000)
else:
    print(a[-1])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)

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

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

Submission status: Accepted

Solution code:
D,N = list(map(int,input().split()))
count = 0
now = 1
while True:
    tmp = now*100**D
    if tmp%(100**(D+1)) != 0:
        count += 1
    if count == N:
        print(tmp)
        exit()
    now += 1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans=1
for i in range(d):
    ans*=100
ans*=n

if d==0 and n==100:
    ans+=1
if d==1 and n==100:
    ans+=100
if d==2 and n==100:
    ans+=10000

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import count


def count_div_by_100(n: int) -> int:
    for idx in range(4):
        q, r = divmod(n, 100)
        if r != 0:
            return idx
        n //= 100
    return -1


D, N = map(int, input().split())
current = 0
current_idx = 0
for n in count(start=1):
    if count_div_by_100(n) == D:
        current = n
        current_idx += 1
    if current_idx == N:
        print(current)
        break

Submission status: Accepted

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

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

Submission status: Accepted

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

d = 100 ** D

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

else:
    if n == 100:
        print(1010000)
    else:
        print(10000*n)

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    d, n = read_ints()
    print(101 * (100**d) if n == 100 else (100**d)*n)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def calc(n):
	if n % 100 != 0:
		return 0
	return calc(n/100) + 1

def resolve():
	d, n = map(int, input().split())
	n = n + calc(n)
	print(100**d*n)
resolve()

Submission status: Accepted

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

if n == 100:
    n += 1

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

Submission status: Accepted

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

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def Yes(): print("Yes"); return
def No(): print("No"); return

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count

#####ChangeBase#####
def Base_10_to_n(X, n):
  if (int(X/n)):
    return Base_10_to_n(int(X/n), n)+[X%n]
  return [X%n]


#############
# Main Code #
#############

D,N = inputIL()

if N != 100:
  print(str(N)+"00"*D)
else:
  print(str(101)+"00"*D)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18
# ----------------------------------------------------------- #

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, n = [int(x) for x in input().split()]
gap = 100 ** d
gap_check = gap * 100
count = 0
ans = 0
while True:
    ans += gap
    if ans % gap_check != 0:
        count += 1
        if count >= n:
            break
print(ans)

Submission status: Accepted

Solution code:
d, n = [int(x) for x in input().split()]
print(100 ** d * n if n < 100 else 100 ** d * 101)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

cnt = 0
val = 0

while cnt < N:
    val += 1
    if calc(val) == D:
        cnt += 1

print(val)