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: Wrong Answer

Solution code:
def ketanowa(p):
    ans = 0
    p = str(p)
    for i in p:
        ans += int(i)
    return ans


def main():
    temp1 = input()
    temp1 = temp1.split(" ")
    n1 = int(temp1[0])
    n2 = int(temp1[1])
    print((100**n1) * n2)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python
# -*- coding: utf-8 -*-
import sys,collections,itertools,re,math,fractions,decimal,random,array,bisect,heapq

# decimal.getcontext().prec = 50
# sys.setrecursionlimit(10000)
# MOD = 10**9 + 7

def solve(f):
    d, n = f.read_int_list()
    return n * 100**d


class Reader(object):
    def __init__(self, filename=None):
        self.file = open(filename) if filename is not None else None
        self.case = 1

    def __readline(self):
        return self.file.next().strip() if self.file else raw_input()

    def next_case(self):
        self.file.next()
        self.case += 1

    def read_int(self): return int(self.__readline())
    def read_float(self): return float(self.__readline())
    def read_long(self): return long(self.__readline())
    def read_decimal(self): return decimal.Decimal(self.__readline())
    def read_str(self): return self.__readline()

    def read_int_list(self): return map(int, self.__readline().split())
    def read_float_list(self): return map(float, self.__readline().split())
    def read_long_list(self): return map(long, self.__readline().split())
    def read_decimal_list(self): return map(decimal.Decimal, self.__readline().split())
    def read_str_list(self): return self.__readline().split()

if __name__ == '__main__':
    filename = sys.argv[1] if len(sys.argv) > 1 else None
    f = Reader(filename)
    if f.file:
        while True:
            print "Case #%d\n"%f.case, solve(f)
            try:
                f.next_case()
            except StopIteration:
                break
    else:
        print solve(f)

Submission status: Wrong Answer

Solution code:
d,n = map(int,raw_input().split())
x = 100**d
ans = 0
for a in range(n):
  ans += x
print ans

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

zero = ''
for _ in range(D):
    zero += '00'
    
print(str(N) + zero)

Submission status: Wrong Answer

Solution code:


def main():
    a, b = list(map(int, raw_input().split()))
    print(100 ** a * b)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(N * (100 ** D))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


print(main())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(pow(100,D)*N)

Submission status: Wrong Answer

Solution code:
d,n = (int(i) for i in input().split())
print(int(str(n)+"0"*(2*d)))

Submission status: Wrong Answer

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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)%waru!=0:
      cnt+=1
    if cnt==n:
      print(i)
      exit()
    i+=1

Submission status: Time Limit Exceeded

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, 10000000):
    if func(i):
        a.append(i)
print(a[n-1])

Submission status: Time Limit Exceeded

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

result = 0
for i in range(1,n+1):
  if i // 100 == 0:
    result = i*(100**d)
  else:
    j = 0
    while not(((i+j) //100 == 0)):
      j += 1

    result = (i+j)*(100**d)

print(result)

Submission status: Time Limit Exceeded

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

result = 0
for i in range(1,n+1):
  if (i*100**d) // (100**d) // 100 == 0:
    result = i*(100**d)
  else:
    j = 0
    while not(((i+j)*(100**d) // (100**d) //100 == 0)):
      j += 1

    result = (i+j)*(100**d)

print(result)

Submission status: Time Limit Exceeded

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

result = 0
for i in range(1,n+1):
  if (i*100**d) // (100**d) // 100 == 0:
    result = i*100**d
  else:
    j = 0
    while not(((i+j)*100**d) // (100**d) //100 == 0):
      j += 1
      result = (i+j)*(100**d)

print(result)

Submission status: Time Limit Exceeded

Solution code:
D,N = map(int,input().split())
K = 1
count = 0
while(True):
    A = K
    cnt = 0
    while(A>0):
        if(A % 100 == 0):
            cnt += 1
        A /= 100
    if(cnt == D):
        count +=1
    if(count == N):
        print(K)
        break
    K += 1

Submission status: Time Limit Exceeded

Solution code:
D, N = map(int, input().split())
cnt = 0
n = 1
a = 10**D
while True:
  if n % a == 0 and n % (a * 100) == 0:
    cnt += 1
    if cnt == N:
      print(n)
      exit()

Submission status: Time Limit Exceeded

Solution code:
def main():
    D, N = list(map(int, input().split()))
    mod = 100 ** D
    cnt = 0
    i = 1
    while True:
        if i % 100 == 0:
            continue
        if i % mod == 0:
            cnt += 1
        if cnt == N:
            print(i)
            break
        i += 1


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
def main():
    D, N = list(map(int, input().split()))
    mod = 100 ** D
    cnt = 0
    i = 1
    while True:
        if i == mod:
            continue
        if i % mod == 0:
            cnt += 1
        if cnt == N:
            print(i)
            break
        i += 1


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

print(list[N])

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

def main():
    d,n = map(int,input().split())

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

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
def answer(d: int, n: int) -> int:
    if n == 100:
        n += 1
    return 100 ** d * n


def main():
    d, n = map(int, input().split())
    print(answer(d, n))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

def main():
    D, N = map(int, input().split())
    if D == 0:
        if N <= 99:
            print(N)
        else:
            print(N+1)
    elif D == 1:
        if N <= 99:
            print(100*N)
        else:
            print(101*N)
    else:
        if N <= 99:
            print(10000*N)
        else:
            print(10100*N)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
if l[1] != 100:
    print(l[1]*100**l[0])
else:
    print(101*100**l[0])

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:
n,m = [int(x) for x in input().split()]
if m != 100:
  print((100**n) * m) 
else:
  print((100**n) * (m+1))

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
for i in range(1, 10**7+1):
    if i%(100**d) == 0:
        cnt += 1
    if n == 100:
        if cnt == n+1:
            print(i)
            exit()
    else:
        if cnt == n:
            print(i)
            exit()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D,N = map(int,input().split())
base = pow(100,D)
cnt = 0
now = 0
while cnt < N:
  now += base
  if now%(base*100) != 0:
    cnt += 1
  if cnt == N:
    print(now);exit()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

Solution code:
def solve(D, N):
    if N < 100:
        ans = 100**D * N
    else:
        ans = 100**D*101

    return ans


if __name__ == "__main__":
    D, N = map(int, input().split())
    print(solve(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())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

cnt = 0
tmp = 1
while True:
  if cal(tmp) == d:
    cnt += 1
  if cnt == n:
    break
  tmp += 1
print(tmp)

Submission status: Accepted

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

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:
def solve():
    D, N = [int(i) for i in input().split()]
    print(f"{N if N != 100 else N + 1}{'00' * D}")

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# row = [int(x) for x in input().rstrip().split(" ")]
# n = int(input().rstrip())
# s = input().rstrip()

def resolve():
    import sys
    input = sys.stdin.readline

    d, n = [int(x) for x in input().rstrip().split(" ")]

    if n == 100:
        n = 101

    print(n * (100 ** d))


if __name__ == "__main__":
    resolve()

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

Submission status: Accepted

Solution code:
D, N = map(int, input().split())
if D > 0:
  if N < 100:
    print( N * 100**D )
  else:
    print( 101 * 100**D )
if D == 0:
  if N < 100:
    print(N)
  else:
    print(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())
'''
q = (N-1)//99
print((100*q + N - 99*q)* 100**D)
'''

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

Submission status: Accepted

Solution code:
import sys
lines = [s.rstrip("\n") for s in sys.stdin.readlines()]
d, n = [int(num) for num in lines.pop(0).split(" ")]
if n == 100:
    n += 1
ans = (100 ** d) * n
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

def get_input() -> tuple:
    """
    標準入力を取得する.

    Returns:\n
        tuple: 標準入力
    """
    # 標準入力を取得
    D, N = list(map(int, input().split()))

    return D, N


def main(D: int, N: int) -> None:
    """
    メイン処理.

    Args:\n
        D (int): 0, 1, or 2
        N (int): 整数(1 <= N <= 100)
    """
    # 求解処理
    ans = (N + (N // 100)) * 100**D

    # 結果出力
    print(ans)


if __name__ == "__main__":
    # 標準入力を取得
    D, N = get_input()

    # メイン処理
    main(D, N)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 標準入力を取得
D, N = list(map(int, input().split()))

# 求解処理
ans = (N + (N // 100)) * 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:
a,b=map(int,input().split())
if b==100:
  b+=1
for i in range(a):
  b*=100
print(b)

Submission status: Accepted

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

ans = (100 ** D) * (N if N < 100 else 101)

print(ans)

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

Submission status: Accepted

Solution code:
D, N = map(int,input().split())
if N % 100 == 0: N += 1
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:
def main():
    d, n = map(int, input().split())

    ans = 100 ** d * n
    if n == 100:
        ans += 100 ** d

    print(ans)


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

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

print(X)

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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


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

Submission status: Accepted

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

Submission status: Accepted

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

if b != 100:
  ans = 100 ** a * b
else:
  ans = 100 ** a * (b+1)

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
#!/usr/bin/env python3
import sys
def input():
    return sys.stdin.readline()[:-1]

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

    if D == 0:
        ans = 0
        c = 0
        for i in range(1, 10**5, 1):
            if i % 100 != 0:
                c += 1
                ans = i
                if c == N:
                    print(ans)
                    exit()

    elif D == 1:
        ans = 0
        c = 0
        for i in range(100, 10**5, 100):
            if i % 100 == 0 and i % 10000 != 0:
                c += 1
                ans = i
                if c == N:
                    print(ans)
                    exit()

    elif D == 2:
        ans = 0
        c = 0
        for i in range(1, 10**5):
            if (i * 100**D) % 1000000 != 0:
                c += 1
                ans = i * 100**D
                if c == N:
                    print(ans)
                    exit()

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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 = map(int, input().split())
if N==100:
    N=101
if D==0:
    print(N*1)
    exit()
if D==1:
    print(N*100)
    exit()
if D==2:
    print(N*10000)
    exit()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if D == 0 and N != 100:
    print(N)
if D == 0 and N == 100:
    print(101)
if D == 1 and N != 100:
    print(N*100)
if D == 1 and N == 100:
    print(10100)
if D == 2 and N != 100:
    print(N*10000)
if D == 2 and N == 100:
    print(1010000)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rf = lambda: map(float, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

d, n = rm()
if n != 100:
    print((n - (n-1)//99)*100**d)
else:
    print(101 * 100**d)

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

count = 0
i = 1
while count<N:
    if (i%(100**(D+1)) != 0) and (i%(100**(D+2)) != 0) and (i%(100**D)) == 0:
        count += 1
    i += 1
print(i-1)

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
start = 100 ** d
counter = 0
while True:
    if start % (100 ** d) == 0 and start % (100 ** (d + 1)) != 0:
        counter += 1
    if counter == n:
        print(start)
        break
    start += 100 ** d

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
start = 100 ** d
counter = 0
while True:
    if start % (100 ** d) == 0 and start % (100 ** (d + 1)) != 0:
        counter += 1
    if counter == n:
        print(start)
        break
    start += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = a.split()
d = int(b[0])
n = int(b[1])

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

Submission status: Accepted

Solution code:
a = input()
b = a.split()
d = int(b[0])
n = int(b[1])
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:
  N+=1
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(100*n)
else:
    if n==100:
        print(1010000)
    else:
        print(10000*n)

Submission status: Accepted

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

for i in range(1,1100000):
    if i%100**D==0 and i%100**(D+1)!=0:
        l.append(i)
print(l[N-1])

Submission status: Accepted

Solution code:
D,N = map(int, input().split())
ans = (N+N//100)*100**D
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=100**(D)
A=[]
for i in range(1,101):
    A.append(i*a)
if D==0:
    A.remove(100)
    A.append(101)
elif D==1:
    A.remove(10000)
    A.append(10100)
elif D==2:
    A.remove(1000000)
    A.append(1010000)
print(A[N-1])

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

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