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

ans = N
for i in range(D):
    ans *= 100
print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
d, n = map(int,input().split())

if d == 0:
    if n < 100:
        print(n)
    if n == 100:
        print(101)
if d == 1:
    if n < 100:
        print(n * 100)
    if n == 100:
        print(10100)
if d == 2:
    if n < 100:
        print(n * 10000)
    if n == 100:
        print(100010000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

d, n = MAP()
m = 100 ** d * n
print(m)

Submission status: Wrong Answer

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

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

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

print(ans)

Submission status: Wrong Answer

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

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# D 割る回数
# N 小さい順からN番目
i = 0
count = 0
while(True):
    i = i + 100**D
    if i % 100**D == 0:
        count = count + 1
    if count >= N:
        break
    
print(N*100**D)

Submission status: Wrong Answer

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

# D 割る回数
# N 小さい順からN番目
i = 0
count = 0
while(True):
    i = i + 100**D
    if i % 100**D == 0:
        count = count + 1
    if count >= N:
        break
    
print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# import math
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque

# import numpy as np
# import scipy as scp

# 入力の受け取り
d,n = map(int,input().split())
if d ==0:
    if n <=99:
        ans = n
    elif n==100:
        ans = 101
elif d == 1:
    if n <=99:
        ans = n*100
    elif n==100:
        ans = 100*100+1
else:
    if n <=99:
        ans = n*100**2
    elif n==100:
        ans = 100*100**2+1

print(ans)

Submission status: Wrong Answer

Solution code:
# import math
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque

# import numpy as np
# import scipy as scp

# 入力の受け取り
d,n = map(int,input().split())
if d ==0:
    if n <=99:
        ans = n
    elif n==100:
        ans = 101
elif d == 1:
    if n <=99:
        ans = n*100
    elif n==100:
        ans = 101*100
else:
    if n <=99:
        ans = n
    elif n==100:
        ans = 101*100**2

print(ans)

Submission status: Wrong Answer

Solution code:
# import math
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque

# import numpy as np
# import scipy as scp

# 入力の受け取り
d,n = map(int,input().split())
if d ==0:
    if n <=99:
        ans = n
    elif n==100:
        ans = 101
elif d == 1:
    ans = n*100
else:
    ans = n*100**2

print(ans)

Submission status: Wrong Answer

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

ite = pow(10, 7)+1
ans, cnt = 0, 1
for i in range(1, ite+1):
  if D == 0:
    if cnt == N:
      ans = i
      break
    else:
      cnt += 1
  elif D == 1:
    if i % 100 == 0 and i % 10000 != 0:
      if cnt == N:
        ans = i
        break
      else:
        cnt += 1
  elif D == 2:
    if i % 10000 == 0:
      if cnt == N:
        ans = i
        break
      else:
        cnt += 1
print(ans)

Submission status: Wrong Answer

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

ite = pow(10, 7)+1
ans, cnt = 0, 1
for i in range(1, ite+1):
  if D == 0:
    if cnt == N:
      ans = i
      break
    else:
      cnt += 1
  elif D == 1:
    if i % 100 == 0:
      if cnt == N:
        ans = i
        break
      else:
        cnt += 1
  elif D == 2:
    if i % 10000 == 0:
      if cnt == N:
        ans = i
        break
      else:
        cnt += 1
print(ans)

Submission status: Wrong Answer

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

ite = pow(10, 6)
ans, cnt = 0, 1
for i in range(1, ite+1):
  if D == 0:
    if cnt == N:
      ans = i
      break
    else:
      cnt += 1
  elif D == 1:
    if i % 100 == 0:
      if cnt == N:
        ans = i
        break
      else:
        cnt += 1
  elif D == 2:
    if i % 10000 == 0:
      if cnt == N:
        ans = i
        break
      else:
        cnt += 1
print(ans)

Submission status: Wrong Answer

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

if b == 100:
  print(c * (b-1))
else:
  print(c * b)

Submission status: Wrong Answer

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

print(c * b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():

    d,n=map(int,input().split())
    val=100**d
    if d==0 and n==100:
        print(101)
    elif d==1 and n==100:
        print(10100)
    elif d == 2 and n == 100:
        print(10010000)

    else:

        print(val*n)

resolve()

Submission status: Wrong Answer

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():

    d,n=map(int,input().split())
    val=100**d
    if d==0 and n==100:
        print(101)
    elif d==1 and n==100:
        print(10100)
    elif d == 2 and n == 100:
        print(1000100)

    else:

        print(val*n)

resolve()

Submission status: Wrong Answer

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():

    d,n=map(int,input().split())
    val=100**d
    if d==0 and n==100:
        print(101)
    if d==1 and n==100:
        print(10100)
    if d == 2 and n == 100:
        print(1000100)

    else:

        print(val*n)

resolve()

Submission status: Wrong Answer

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():

    d,n=map(int,input().split())
    val=100**d
    if d==0 and n==100:
        print(101)
    if d==1 and n==100:
        print(10001)
    if d == 2 and n == 100:
        print(1000001)

    else:

        print(val*n)

resolve()

Submission status: Wrong Answer

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():

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

resolve()

Submission status: Wrong Answer

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():

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

resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def solve():
    D, N = map(int, input().split())
    add_val = 0
    if D == 0:
        add_val = 1
    if D == 1:
        add_val = 100
    if D == 2:
        add_val = 10000
    
    print(add_val + (add_val * (N-1)))

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
# B - Ringo's Favorite Numbers
import sys
def input(): return sys.stdin.readline().rstrip()
D, N = map(int, input().split())
print(100**D*N)

Submission status: Wrong Answer

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

div = 100 ** d

print(div * n)

Submission status: Wrong Answer

Solution code:
from math import floor

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

print((N - floor((N - 1) / 99)) * pow(100, D))

Submission status: Wrong Answer

Solution code:
import itertools

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

count = 0
for i in itertools.count(1):
    if i % pow(100, D) == 0:
        count += 1
    if count == N:
        print(i)
        break

Submission status: Wrong Answer

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

print(N * pow(100, D))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(pow(100, D) * N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#ABC100

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

Submission status: Wrong Answer

Solution code:
#ABC100

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())

print((100**x)*y)

Submission status: Wrong Answer

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

print((100**D)*N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

num=100**d
mnum=n*num
if mnum%100==0:
    mnum+=1
print(mnum)

Submission status: Wrong Answer

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

num=100**d
mnum=n*num
print(mnum)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline().rstrip

N, K = map(int, input().split())
ans = 0
if N == 0:
    ans = K
elif N == 1:
    ans = 100 * K
elif N == 2:
    ans = 10000 * K

print(ans)

Submission status: Wrong Answer

Solution code:
d,n = [int(x) for x in input().split()]

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

Submission status: Wrong Answer

Solution code:
d,n = [int(x) for x in input().split()]

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

Submission status: Wrong Answer

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

print((100 ** d) * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

    print(n*100**d)


if __name__ =='__main__':
    main()

Submission status: Wrong Answer

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

print(pow(100, d)*n, end="")

Submission status: Wrong Answer

Solution code:
import numpy as np
d, n = list(map(int, input().split()))

print(pow(100, d)*n, end="")

Submission status: Wrong Answer

Solution code:
import numpy as np
d, n = list(map(int, input().split()))

print(100**d*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n = (int(x) for x in input().split())
c=1;a=1;
while c!=n:
    if a%100==0:
        a += 1
    else:
        a += 1
        c += 1
print(a*(100**d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n = (int(x) for x in input().split())

print(n*100^d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from math import floor, ceil, sqrt, factorial, log
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict
from heapq import heappop, heappush, heappushpop
from itertools import product
import sys
stdin = sys.stdin
mod = 10**9 + 7


def ns(): return stdin.readline().rstrip()


def ni(): return int(ns())


def na(): return list(map(int, stdin.readline().split()))


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

Submission status: Wrong Answer

Solution code:
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from math import floor, ceil, sqrt, factorial, log
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict
from heapq import heappop, heappush, heappushpop
from itertools import product
import sys
stdin = sys.stdin
mod = 10**9 + 7


def ns(): return stdin.readline().rstrip()


def ni(): return int(ns())


def na(): return list(map(int, stdin.readline().split()))


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
if d==0:
    if n==100:
        print(101)
        exit()
    print(n)
    exit()
if d==1:
    if n==100:
        print(10100)
        exit()
    base=100
elif d==2:
    if n==100:
        print(1010000)
    base=10000
tmp=base

for i in range(n-1):
   tmp+=base
print(tmp)

Submission status: Wrong Answer

Solution code:
import copy
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from math import floor, ceil, sqrt, factorial, log
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict
from heapq import heappop, heappush, heappushpop
from itertools import product
import sys
stdin = sys.stdin
mod = 10**9 + 7


def ns(): return stdin.readline().rstrip()


def ni(): return int(ns())


def na(): return list(map(int, stdin.readline().split()))


D, N = na()
ccnt = 0
if D == 0:
    print(N)
else:
    for num in range(100**D, N * 100**D + 1, 100**D):
        cnt = 0
        ans = copy.copy(num)
        while num:
            if num % 100**D == 0:
                cnt += 1
            num //= 100**D
        if cnt == 1:
            ccnt += 1
            if ccnt == N:
                print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
d, n = map(int,input().split())

tmp = []
if d == 0:
    for i in range(200):
        if i % 100 != 0:
            tmp.append(i)
    print(tmp[n - 1])
if d == 1:
    if n < 100:
        print(n * 100)
    if n == 100:
        print(10100)
if d == 2:
    if n < 100:
        print(n * 10000)
    if n == 100:
        print(101000)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
if d==0:
    print(n)
    exit()
if d==1:
    base=100
elif d==2:
    base=10000
tmp=base

for i in range(n-1):
   tmp+=base
print(tmp)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
d, n = map(int,input().split())

tmp = []
if d == 0:
    for i in range(200):
        if i % 100 != 0:
            tmp.append(i)
    print(tmp[n - 1])
if d == 1:
    print(n * 100)
if d == 2:
    print(n * 10000)

Submission status: Wrong Answer

Solution code:
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from math import floor, ceil, sqrt, factorial, log
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict
from heapq import heappop, heappush, heappushpop
from itertools import product
import sys
stdin = sys.stdin
mod = 10**9 + 7


def ns(): return stdin.readline().rstrip()


def ni(): return int(ns())


def na(): return list(map(int, stdin.readline().split()))


D, N = na()
print(N * 100**D)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if D==0 and N ==100:
    ans = 100**D*N+1
else:
    ans = 100**D*N

print(ans)

Submission status: Wrong Answer

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

ans = 100**D*N

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import math
from collections import defaultdict

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

ans = 0

if d == 0:
    ans = 1
elif d == 1:
    ans = 100
else:
    ans = 10000

ans = 101 * ans if n == 100 and d != 0 else n * ans

print(ans)

Submission status: Wrong Answer

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

import math
from collections import defaultdict

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

ans = 0

if d == 0:
    ans = 1
elif d == 1:
    ans = 100
else:
    ans = 10000

print(n * ans)

Submission status: Wrong Answer

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

import math
from collections import defaultdict

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

ans = 0

if d == 0:
    ans = 1
elif d == 1:
    ans = 100
else:
    ans = 10000

print(1 * ans)

Submission status: Wrong Answer

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

import math
from collections import defaultdict

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

ans = []

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

print(ans[n - 1])

Submission status: Wrong Answer

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

print((100**D)*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if d == 0:
    print(k)
elif d == 1:
    print(k * 100)
else:
    print(k * 100 ** 2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(A[-1])

Submission status: Wrong Answer

Solution code:
# ALC008 C

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

print(100 ** d * n)

Submission status: Wrong Answer

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b=INTM()
    print((100**a)*b)
if __name__ == '__main__':
    do()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if d == 0:
    ans = [int(i) for i in range(n+1)]
    print(sorted(ans)[n])
elif d == 1:
    ans = [int(i)*100 for i in range(n+1)]
    print(sorted(ans)[n])
elif d == 2:    
    ans = [int(i)*10000 for i in range(n+1)]
    print(sorted(ans)[n])

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 = pow(100, D)
print(a * N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
#%%
ans = 0
cur = 0
for i in range(1,(100**D)*N+10):
    a = i
    t = 0
    while a%100==0 and a>0:
        a//=100
        t+=1
    if t==D:
        cur += 1
    if cur == N:
        ans = i
        break
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
d, n = map(int,input().split())

if d == 0:
    ans = n
if d == 1:
    ans = 100 * n
if d == 2:
    ans = 10000 * n

#ans = pow(100, d) * n
print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
d, n = map(int,input().split())

"""
if d == 0:
    ans = n
if d == 1:
    ans = 100 * n
if d == 2:
    ans = 10000 * n
"""

ans = pow(100, d) * n
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y= map(int, input().split())
if x<=3:
  print(pow(100,x)*y)

Submission status: Wrong Answer

Solution code:
x,y= map(int, input().split())
if x==0:
  print(y)
elif x==1:
  print(y*100)
elif x==2:
  print(y*10000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    D, N = map(int, input().split(" "))
    answer = 100 ** D * N
    i = 1
    flag = True
    while flag:
        if not answer % 100 ** (D + i):
            answer += 10 ** D
        else:
            flag = False
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    D, N = map(int, input().split(" "))
    answer = 100 ** D * N
    if not answer % 100 ** (D + 1):
        answer += 10 ** D
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

hundreds = [i for i in range(1, 10001) if i % 100 == 0]
tenthousands = [i for i in range(1, 1000001) if i % 10000 == 0]

if D == 0:
    print(N)
elif D == 1:
    print(hundreds[N-1])
else :
    print(tenthousands[N-1])

Submission status: Wrong Answer

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


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

    print((100**D) * N)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(100**d*n)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
cnt = 0
for i in range(1,10**9+1):
    if D==0 and i%100!=0:
        cnt += 1
    if D!=0 and i%(100**D)==0:
        cnt += 1
    if cnt == N:
        print(i)
        exit()