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

n = []
for i in range(1,1001):
    if D == 0:
        if i % 100 !=0:
            n.append(i)
        continue
    elif D == 1:
        if i % 100 !=0:
            n.append(100*i)
        continue      
    elif D == 2:
        if i % 100 !=0:
            n.append(10000*i)
        continue
print(n[N-1])

Submission status: Accepted

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

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

base = 100**D

if N == 100:
  ans = base*N + base
else:
  ans = base*N

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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 += 1

print(N * (100 ** D))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
counter = 0
for i in range(1, 10000000000000000000000):
  warisuu = 0
  j = i
  while j % 100 == 0:
    j //= 100
    warisuu += 1
  if warisuu == d:
    counter += 1
    if counter == n:
      print(i)
      break

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:
a, b = map(int, input().split())
if a == 0:
  print(b+b//100)
elif a == 1:
  print((b+(b*100)//10000)*100)
else:
  print((b+(b*10000)//1000000)*10000)

Submission status: Accepted

Solution code:
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:
    x = (100**D)*N
else:
    x = (100**D)*(N+1)
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = [int(x) for x in input().split()]
if B!=100:
  print(100**A*B)
else:
  print(100**A*(B+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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());print(((N==100)+N)*100**D)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    d,n=map(int,input().split())
    print(n*(100**d) if n!=100 else 101*(100**d))
resolve()

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

Submission status: Accepted

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

ans = 0
for i in range(n):
    if i == 99:
        ans += 100 ** d
    ans += 100 ** d

print(ans)

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:
    N += 1
print(N * 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:
a,b = map(int, input().split())
if b ==100:
  b +=1
print(100**a*b)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(100 ** d * (n + (n // 100)))

Submission status: Accepted

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

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

print(seq[N-1])

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

if N == 100:
  N +=1

X = 100**D * N
print(int(X))

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

Submission status: Accepted

Solution code:
d, n = list(map(int, input().split()))
a = 100 ** d
ans = a * n
if ans % (a * 100) == 0:
    ans += a
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())
a=[i*(100**D) for i in range(1,1000) if i%(100)!=0]
print(a[N-1])

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline

A, B, = map(int, input().split())

def f(n):
    if n % 100 == 0:
        return f(n // 100) + 1
    else:
        return 0

c = 0
for i in range(1, 2000001):
    if A == f(i):
        c += 1

    if c == B:
        print(i)
        exit()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D,N=map(int,input().split())
if D==0 and N!=100:
    print(N)
elif D>0 and N!=100:
    print(100**D*N)
elif D>0 and N==100:
    print(100**D*101)
elif D==0 and N==100:
    print(N+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC100b
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Submission status: Accepted

Solution code:
D, N = map(int, input().strip().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:
  N+=1
print(100**D*N)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = [int(i) for i in input().split()]

if b == 100:
    print(100**a*101)
else:
    print(100**a*b)

Submission status: Accepted

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

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

Submission status: Accepted

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

if s[0] == 0:
    if s[1] == 100:
        print('101')
    else:
        print(s[1])
elif s[0] == 1:
    if s[1] == 100:
        print('10100')
    else:
        print(s[1]*100)
elif s[0] == 2:
    if s[1] == 100:
        print('1010000')
    else:
        print(s[1]*10000)

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

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

Submission status: Accepted

Solution code:
D, N = map(int, input().split())
ans = 100**D
for i in range(N - 1):
    ans += 100**D
    if ans % 100**(D + 1)==0:
        ans += 100**D
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#インポート
import sys

#入力用
def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline().rstrip()

D, N = ISI()
num = 100 ** D
if N < 100:
    print(num*N)
else:
    print(num*101)

Submission status: Accepted

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

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:
# ABC100 B - Ringo's Favorite Numbers 
d,n = map(int,input().split())
ans = 100**d * n
if n==100:
  ans +=100**d
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
(d, n) = (int(tok) for tok in 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:
  N = 101
r = N*(100**D)
print(r)

Submission status: Accepted

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

if N == 100:
    N += 1
print("{}{}".format(N, "00"*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(100*n)
elif d == 2:
  if n == 100:
    print(1010000)
  else:
    print(10000*n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if d == 0:
    print(n+n//100)
elif d == 1:
    if n == 100:
        print(100*n+100)
    else:
        print(100*n)
else:
    if n == 100:
        print(100**2*n+100**2)
    else:
        print(100**2*n)

Submission status: Accepted

Solution code:
import sys
from collections import deque
from collections import  Counter
import statistics
import math
stdin = sys.stdin

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

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

Submission status: Accepted

Solution code:
import sys
from collections import deque
from collections import  Counter
import statistics
import math
stdin = sys.stdin

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

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

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

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

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

print(100**D*N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

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

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

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

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

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

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

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
add_value = 100 ** d
value = 0
count = 0
while True:
    count+=1
    value += add_value
    if (value // add_value) % 100 == 0:
        value += add_value
    if count == n:
        break
print(value)

Submission status: Accepted

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

Submission status: Accepted

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

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:
import sys
from collections import deque
from functools import reduce
import copy
import math


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [D, n] = string_to_int(inputs[0])
    N = n + 1 if n == 100 else n
    adder = reduce(lambda acc, _: acc * 100, range(D), 1)
    count = 0
    for _ in range(N):
        count += adder
    return count


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    test()

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:
x,y = map(int,input().split())
if(y==100):
    y+=1
print((100**x)*y)

Submission status: Accepted

Solution code:


def main():

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

if __name__== "__main__":
    main()

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
d10 = 1
if d == 0 and n !=100:
    print(n)
elif d == 0 and n == 100:
    print(101)
else:
    for i in range(d):
        d10 *=100
    if n ==100:
        print(101*d10)
    else:
        print(n*d10)

Submission status: Accepted

Solution code:
def main():
    D, N = map(int, input().split())
    v = pow(100, D)
    if N != 100:
        return v * N
    else:
        return v * (N+1)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, n = (int(i) for i in input().split())
if d == 0:
    if n != 100:
        print(n)
    else:
        print(n+1)
elif d == 1:
    if n != 100:
        print(100*n)
    else:
        print(100*(n+1))
elif d == 2:
    if n != 100:
        print(10000*n)
    else:
        print(10000*(n+1))

Submission status: Accepted

Solution code:
def solve():
    d, n = map(int, input().split())
    return (n + (n - 1) // 99) * (100 ** d)


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

d, n = map(int, input().split())
if d == 0:
    start = 1
elif d == 1:
    start = 100
else:
    start = 10000

if n <= 99:
    print(start * n)
else:
    print(start * 101)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
if y==100:
  y+=1
z=y*(100**x)
print(z)

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())
dd = 100 ** d
cnt = 0
for i in range(10 ** 9):
    if i % 100 != 0:
        cnt += 1
    if cnt == n:
        print(i * dd)
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#問題の勘違い
#100以上、ex:111も割れない

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

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

Submission status: Accepted

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

    if N == 100:
        N += 1

    print(100 ** D * N)

main()

Submission status: Accepted

Solution code:
D,N = list(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 * 100 ** 2)
    else:
        print(N * 100 ** 2 + 10000)

Submission status: Accepted

Solution code:
import math
import copy
import sys


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

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

# x = int(inputb[0])
# y = int(inputb[1])

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

# inputb = input().split()
# inputbList = [int(n) for n in inputb]
#
# inputList = []
# inputNumList = []
# for i in range(a):
#     inputNum = input()
#     inputNumList = list(inputNum)
#     inputList.append(inputNumList)

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

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

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

Submission status: Accepted

Solution code:
d,n = [int(x) for x in input().split()]
print(100**d*(n+n//100))

Submission status: Accepted

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

Submission status: Accepted

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

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:
import sys
input=sys.stdin.readline

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

Submission status: Accepted

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

d,n = map(int, input().split())
ans = 100**d*n
if d == 0:
    if ans == 100:
        ans += 1
elif d == 1:
    if ans == 10000:
        ans += 100
elif d == 2:
    if ans == 1000000:
        ans += 10000

print(ans)

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

Submission status: Accepted

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

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

print(num)

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

Submission status: Accepted

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

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:
l = [int(i) for i in input().split()]
d = l[0]
n = l[1]

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

Submission status: Accepted

Solution code:
A = input().split()
D = int(A[0])
N = int(A[1])
 
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((100**d)*n)
else:
    print((100**d)*101)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A = input().split()
D = int(A[0])
N = int(A[1])

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:
    N += 1
print(N*100**D)

Submission status: Accepted

Solution code:
# ABC100-B
D, N = map(int, input().split())
if N != 100:
    if D == 0:
        print(N)
    elif D == 1:
        print(N * 100)
    elif D == 2:
        print(N * 10000)
else:
    if D == 0:
        print(N + 1)
    elif D== 1:
        print(N * 100 + 100)
    else:
        print(N * 10000 + 10000)

Submission status: Accepted

Solution code:
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())
d = 100 ** d
cnt = 0
for i in range(d, 10 ** 9, d):
    if i // d % 100 != 0:
        cnt += 1
    if cnt == n:
        print(i)
        exit()