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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(100**d * n)

Submission status: Wrong Answer

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

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

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

if d is 0:
    print(n + n//100)
if d is 1:
    if n is 100:
        print(100*100+100)
    else:
        print(n*100)
if d is 2:
    if n is 100:
        print(100*10000+100)
    else:
        print(n*10000)

Submission status: Wrong Answer

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

if d is 0:
    print(n + n//100)
if d is 1:
    print(n*100 + n//10000)
if d is 2:
    print(n*10000 + n//1000000)

Submission status: Wrong Answer

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

if d is 0:
    print(n+n//100)
if d is 1:
    print(n*100)
if d is 2:
    print(n*10000)

Submission status: Wrong Answer

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

if d is 0:
    print(n-n//100)
if d is 1:
    print(n*100)
if d is 2:
    print(n*10000)

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
d, n = map(int, input().split())

a = pow(100, d)
if n == 101:
    print(a*(n+1))
else:
    print(a*n)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
d, n = map(int, input().split())
a = pow(100, d)
print(a * n)

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

Submission status: Wrong Answer

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

print(int(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().split())
print(100**d*n if n<100 else 100**(d-1)*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import numpy as np
import statistics
from statistics import mean, median,variance,stdev
import math

def main():
	D, N = map(int, input().split(" "))
	
	tmp = str(N)
	if D == 1:
		if tmp != "100":
			tmp = tmp + "00"
		else:
			tmp = "10100"
	if D == 2:
		if tmp != "100":
			tmp = tmp + "0000"
		else:
			tmp = "1010000"
	
	print(tmp)
	
	
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import numpy as np
import statistics
from statistics import mean, median,variance,stdev
import math

def main():
	D, N = map(int, input().split(" "))
	
	tmp = str(N)
	if D == 1:
		if tmp != 100:
			tmp = tmp + "00"
		else:
			tmp = "10100"
	if D == 2:
		if tmp != 100:
			tmp = tmp + "0000"
		else:
			tmp = "1010000"
	
	print(tmp)
	
	
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import numpy as np
import statistics
from statistics import mean, median,variance,stdev
import math

def main():
	D, N = map(int, input().split(" "))
	
	tmp = str(N)
	if D == 1:
		tmp = tmp + "00"
	if D == 2:
		tmp = tmp + "0000"
	
	print(tmp)
	
	
if __name__ == "__main__":
	main()

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())
k=100**d
for i in range(1,n+1):
    k+=100**d
print(k)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n, d = map(int, input().split())
print(100 ** n * 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().split())
if d==0:
  print('5')
else:
  a=100**d
  print(a*n)

Submission status: Wrong Answer

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

ans = N * (100 ** D)

if ans % 100 == 0:
	ans += 100 ** D

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
A=1
if D!=0:
    for i in range(D):
        A=100*A
else:
    A=1
A=A*N
print(A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
x = 100 ** d
i =1
ans = 0
while ans <= n:
    if i % x == 0:
        ans += 1
        if ans == n:
            ans = i
    i += 1
print(ans)

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 and n!=100:
  print(int(n))
elif d==0 and n!=100:
  print(int(101))
  
else:
  k=100**d
  print(int(k*n))

Submission status: Wrong Answer

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

if d==0:
  print(int(n))

else:
  k=100**d
  print(int(k*n))

Submission status: Wrong Answer

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

if d==0:
  print(n)

else:
  k=100**d
  print(k*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# D（=0,1,2）の値によって場合分け
if D==0:
  # N以下の正の整数に
  # 100の倍数がいくつあるかを数える
  a=N//100

  # N-a番目が答え
  print(N-a)
elif D==1:
  print(N*100)
else:
  print(N*10000)

Submission status: Wrong Answer

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

# D（=0,1,2）の値によって場合分け
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, raw_input().split())
if D == 0:
	if N == 100: print 101
	else: print N
if D == 2:
	if N == 100: print 1010000
	else: print str(N) + '0000'
if D == 1:
	n = ((N-1)/9)*10+(N%9)+1
	print str(n)+'00'

Submission status: Wrong Answer

Solution code:
D, N = map(int, raw_input().split())
ans = str(N)
for i in range(0, D):
	ans = ans + '00'
print ans

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())
ans = (100 ** d * n) + n // 100
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 =  [ int(v) for v in input().split() ]

print(n*(100**d))

Submission status: Wrong Answer

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

if D == 0:
    for i in range(100):
        Ncnt -= 1
        if Ncnt == 0:
            print(i+1)
            exit()
elif D == 1:
    for i in range(100):
        Ncnt -= 1
        if Ncnt == 0:
            print((i+1)*100)
            exit()
elif D == 2:
    for i in range(100):
        Ncnt -= 1
        if Ncnt == 0:
            print((i+1)*10000)
            exit()
else:
    exit()

Submission status: Wrong Answer

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

if D == 0:
    for i in range(100):
        Ncnt -= 1
        if Ncnt == 0:
            print(i+1)
            exit()
elif D == 1:
    for i in range(100):
        Ncnt -= 1
        if Ncnt == 0:
            print((i+1)*100)
            exit()
elif D == 2:
    for i in range(100):
        Ncnt -= 1
        if Ncnt == 0:
            print((i+1)*10000)
else:
    exit()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
ten = N // 10
hyaku = N // 100
if D == 1:
  print(100 ** D * (N+ten+hyaku))
elif D == 2:
  print(100 ** D * (N+hyaku))
else:
  print(100 ** D * N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(N*100**D)

Submission status: Wrong Answer

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

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*1000)

Submission status: Wrong Answer

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


def solve(D: int, N: int):
    n = N
    if n == 100:
        n = 101
    print(int((100**D)*N))


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  # type: int
    N = int(next(tokens))  # type: int
    solve(D, N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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


def solve(D: int, N: int):
    if D == 0 and N == 100:
        print(101)
    else:
        print(int((100**D)*N))


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  # type: int
    N = int(next(tokens))  # type: int
    solve(D, N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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


def solve(D: int, N: int):
    print(int((100**D)*N))
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  # type: int
    N = int(next(tokens))  # type: int
    solve(D, N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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


def solve(D: int, N: int):
    print((100**D)*N)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  # type: int
    N = int(next(tokens))  # type: int
    solve(D, N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

print( str(n) + ("00" * 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())

divide = []

if d == 0:
    for i in range(1, 100):
        divide.append(i)    
    divide.append(101)
elif d == 1:
    for i in range(100, 10000, 100):
        divide.append(i)
    divide.append(10100)
    
else:
    for i in range(10000, 1000000, 10000):
        divide.append(i)
    divide.append(1010000)
    print(len(divide))
print(divide[n - 1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
D,N = map(int,input().split())
s = []
for i in range(1,101):
    s.append(i*(100**D))
print(s[N-1])

Submission status: Wrong Answer

Solution code:
D,N = (int(i) for i in input().split())
if D != 0:
    print(100*D*N)
else:
    print(N)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
ans = 1*100**D
count = 1
while (count < N):
  ans += 100**D
  count += 1

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    d,n  = f()
    print(n * 100**d)

solve()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
d, n = 0, 100
for i in range(3):
    if d == i:
        if n == 100:
            ans = 101*100**d
        else:
            ans = n*100**d
print(ans)

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
for i in range(3):
    if d == i:
        ans = n*10**(i*2)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a[0] == 0:
  num = a[1]
elif a[1] == 1:
  num = a[1] * 100
else:
  num = a[1] * 10000

print(num)

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 * 10000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=list(map(int,input().split(" ")))
i=0
while b>0:
  i+=1
  if i%(100**a)==0:
    b-=1
print(i)

Submission status: Wrong Answer

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

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/env python3
import sys


def solve(D: int, N: int):
    ret = (100 ** D) * N
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  # type: int
    N = int(next(tokens))  # type: int
    solve(D, N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


###############################################################################


def main():
    d, n = intin()
    print(n * (100**d))


if __name__ == '__main__':
    main()

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(100**A*B)

Submission status: Wrong Answer

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

print(pow(100,A)*B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N_100 , N_time = map(int , input().split())

print(N_time * 100**N_100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if (D==0):
    x=1

elif(D==1):
    x=100

elif(D==2):
    x=10000

print(x*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
dn=list(map(int,input().split()))
d=dn[0]
n=dn[1]
if n<100:
    print(n*100**d)
else:
    if d==0:
        print(100)
    elif d==1:
        print(10100)
    else:
        print(1010000)

Submission status: Wrong Answer

Solution code:
dn=list(map(int,input().split()))
d=dn[0]
n=dn[1]
if n<100:
    print(n*100**d)
else:
    if d==0:
        print(100)
    else:
        print(101*100**d)

Submission status: Wrong Answer

Solution code:
dn=list(map(int,input().split()))
d=dn[0]
n=dn[1]
print(n*100**d)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

B(input())

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 and N == 100:
    print(101)
elif D == 1 and N == 100:
    print(10100)
else:
    print(100**D*N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
from itertools import *
d, n = map(int, input().split())
delta = 100 ** d
ite = (x * delta for x in count() if x % (delta * 100) != 0)
print(next(islice(ite, n-1, n)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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


if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

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:
# -*- coding:utf-8 -*-

def solve():
    D, N = list(map(int, input().split()))
    print((100**D)*N)

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())
print(100**D*N if N!=100 else 100**D*N+100**N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if __name__=='__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

D, N = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

D, N = [int(x) for x in stdin.readline().rstrip().split()]

print(N * 100 ** D)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__ == "__main__":
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def read_input():
	d, n = map(int, input().split())
	return d, n
	
def submit():
	d, n = read_input()
	
	base = 100**d
	print(base*n)
	
submit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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