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

if a[0] == 0:
    wk = 1 * a[1]
    print(wk)
elif a[0] == 1:
    wk = pow(100,1) * a[1]
    print(wk)
elif a[0] == 2:
    wk = pow(100,2) * a[1]
    print(wk)
else:
    wk = pow(100,a[1])
    print(wk)

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:
# -*- coding: utf-8 -*-
multi_0 = [a for a in range(1,100)]
multi_100 = [a for a in range(100,10000) if a % 100 == 0]
multi_10000 = [a for a in range(10000, 1000000) if a % 10000 == 0]

multi_0 += [101]
multi_100 += [10001]
multi_10000 += [1000001]

D, N = map(int, input().split())
if D == 0:
    print(multi_0[N-1])
elif D == 1:
    print(multi_100[N-1])
elif D == 2:
    print(multi_10000[N-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# https://abc100.contest.atcoder.jp/tasks/abc100_b
# B - Ringos Favorite Numbers

# B_Ringos_Favorite_Numbers.py

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

if D == 0:
    #n = N
    #order_100 = -1
    #while n >= 1:
    #    n = n / 100
    #    order_100 += 1

    #if order_100 == 0:
    if N <= 99:
        print(N)
    else:
        print(101)

elif D == 1:
    #if N <= 99:
    #    print(N)
    #else:
    #    print("~")
    print(N*100)
elif D == 2:
    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:
inp = input()
inp2 = inp.split()
A=int(inp2[0])
B=int(inp2[1])
C = B*(100**A)
if B == 10:
	C = (100**A)
if B == 100:
	C = 100**(A-1)

print(C)

Submission status: Wrong Answer

Solution code:
d, n = map(int,input().split())
if d==0:
    print(n)
elif d==1:
    print(str(n)+"00")
else:
    print(str(n)+"0000")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 100 ** d * n
if n == 100:
    ans = 100
print(int(ans))

Submission status: Wrong Answer

Solution code:
import re

inp = re.split(" ",input())

D = int(inp[0])
N = int(inp[1])

print(N,end="")
for i in range(D):
    print("00",end="")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin, stdout
input = lambda: stdin.readline().rstrip()
println = stdout.write

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

    if not D:
        ans = N if N < 100 else 101
    elif D == 1:
        ans = 100 * N if N < 100 else 10100
    else:
        ans = 10000 * N if N < 10000 else 1010000
    print(ans)

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = map(int, input().split())


def get_ans(a, b):
    if a == 0:
        return b
    if a == 1:
        ans = 1000 / 100 * b * 10
        return int(ans)
    if a == 2:
        ans = b * 10000
        return int(ans)


# 出力
print(get_ans(a, b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N=input().split()
#for i in range(int(D)):
if int(D)==0:
    print(N)
elif int(D)==1:
    print(N+"00")
else:
    print(N+"0000")

Submission status: Wrong Answer

Solution code:
from sys import stdin, stdout
input = lambda: stdin.readline().rstrip()
println = stdout.write

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

    if not D:
        ans = N if N < 100 else 101
    elif D == 1:
        ans = 100 * N if N < 100 else 10100
    else:
        ans = 10000 * N if N < 10000 else 101000
    print(ans)

main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
number = input()
a = number.split()

D=int(a[0])
N=int(a[1])

if D==0:
    print(N)
elif D==1:
    answer = 100*N
    print(answer)
elif D==2:
    answer = 10000*N
    print(answer)

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split(" "))
if( b < (100**(a+1))):
    print((100**a)*b)
else:
    a_plus = 1
    n = 0
    while b >= 100**(a+a_plus):
        n = n + int(b / (100**(a+a_plus)))
        a_plus = a_plus + 1
    print((100 ** a) * (b + n))

Submission status: Wrong Answer

Solution code:
dn = input()
d , n = dn.split()
d = int(d)
n = int(n)
ringo = 100**0
res = ringo * n
print(res)

Submission status: Wrong Answer

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

ans = 100 ** d * n
if n == 100:
    ans = ans * 100
print(int(ans))

Submission status: Wrong Answer

Solution code:
#-*- coding: utf-8 -*-
# １００でちょうどD回割り切れる正の整数のうちN番目に小さいものを求める
D, N = map(int, input().split())
# D = 0, 1, 2のいずれか
# N は1以上100以下の整数
print(100 ** D * N)

Submission status: Wrong Answer

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

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

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 == 0 and N == 100:
    print(pow(100,D)*N+1)
else:
    print(pow(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((100**D)*N)
    elif D == 2:
        print((100**D)*N)

Submission status: Wrong Answer

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

if a[0] == 0:
    wk = 1 * a[1]
    print(wk)
elif a[0] == 1:
    wk = 100 * a[1]
    print(wk)
elif a[0] == 2:
    wk = 10000 * a[1]
    print(wk)

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split(" "))
if( b <= (100**(a+1))):
    print((100**a)*b)
else:
    a_plus = 1
    n = 0
    while b >= 100**(a+a_plus):
        n = n +  int (b / (100**(a+a_plus)))
        a_plus = a_plus + 1
    print((100 ** a) * (b + 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 * 10000)
else:
    pass

Submission status: Wrong Answer

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


if x[1]==100:
    x[0]-=1
print(x[1],end='')
for _ in range(0,x[0]):
    print('00', end='')

Submission status: Wrong Answer

Solution code:
n, m = map(int, input().split())
cnt = 0
for i in range(100**n, 100**n*1000, 100**n):
    if i // 100**n < 100:
        cnt += 1
    if cnt == m:
        print(i)
        break

Submission status: Wrong Answer

Solution code:
# https://abc100.contest.atcoder.jp/tasks/abc100_b
# B - Ringos Favorite Numbers

# B_Ringos_Favorite_Numbers.py

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
D,N = [int(i) for i in input().split(' ')]
"""
ans = 100**D
ans *= N
print(ans)
"""
if D >= 100:
    D +=1
print(N,end="")
for i in range(D):
    print("00",end ="")

print()

Submission status: Wrong Answer

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

print(n * (100 ** d))

Submission status: Wrong Answer

Solution code:

a = input().split()

b = int(a[0])
c = int(a[1])

if 0 <= b <= 2:
    print(c*(100**(b)))

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

def check(d,n):
    nums = []
    r = 100 ** d
    # if r == 0: r = 1
    # for i in range(1,n+1):
    #     nums.append(r * i)

    count = r
    while True:
        count = count + r
        r2 = (r*100)
        if r2 >= 100 * 100 * 100:
            r2 = 100 * 100
        if count % r2 != 0:
            nums.append(count)
        if len(nums) >= n-1:
            break

    return nums[-1]

if __name__ == "__main__":
    d,n = map(int, input().split(" "))
    result = []

    print(check(d,n))

Submission status: Wrong Answer

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

if 0 <= d and d <= 2 and 1 <=n and n <= 100:
    print(str(100 ** d * n))

Submission status: Wrong Answer

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

print((100**D)*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import re

inp = re.split(" ",input())

D = int(inp[0])
N = int(inp[1])

ans = int(100 ** D * N)

print(ans)

Submission status: Wrong Answer

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


print(x[1],end='')
for _ in range(0,x[0]):
    print('00', end='')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

a = input().split()

b = int(a[0])
c = int(a[1])

if 0 < b < 2:
    print(c*(100**(b)))

Submission status: Wrong Answer

Solution code:
#coding: utf-8

def check(d,n):
    nums = []
    r = 100 ** d
    # if r == 0: r = 1
    # for i in range(1,n+1):
    #     nums.append(r * i)

    count = r
    while True:
        count = count + r
        r2 = (r*100)
        if r2 >= 100 * 100 * 100:
            r2 = 100 * 100
        if count % (r*100) != 0:
            nums.append(count)
        if len(nums) >= n-1:
            break

    return nums[-1]

if __name__ == "__main__":
    d,n = map(int, input().split(" "))
    result = []

    print(check(d,n))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
if D < 0 or D > 2:
    exit()
if N < 1 or N > 100:
    exit()

p = pow(100,D)
num = 0
for i in range(N):
    num += p
print(num)

Submission status: Wrong Answer

Solution code:
input_line = map(int, raw_input().split())
D = input_line[0]
N = input_line[1]
gift = 100 ** D * N
print gift

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())
res = 0

if D == 0:
    for i in range(N):
        res += 1
elif D == 1:
    for i in range(N):
        res += 100
elif D == 2:
    for i in range(N):
        res += 10000    

print(res)

Submission status: Wrong Answer

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


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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-
if __name__ == "__main__":
    d, n = map(int, input().split())
    core = 100**d
    factors = [ core*tmp for tmp in range(1,101) ]
    if d == 0 and n == 100:
        ans = factors[n-1]+1
    else:
        ans = factors[n-1]
    print(ans)

Submission status: Wrong Answer

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

a = N 
if D == 0:
    pass
elif D == 1:
    a = a * 100 
elif D == 2:
    a = a * 10000
print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if N == 100 and D == 0:
    print(101)
elif N == 100 and D == 1:
    print(10001)
elif N == 100 and D == 2:
    print(1000001)
    
elif 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)
elif D==1:
    A=100*N
    print(A)
elif D==2:
    A=10000*N
    print(A)

Submission status: Wrong Answer

Solution code:
import math
line = input().split()

d = int(line[0])
n = int(line[1])

print(int(math.pow(100, d) * n))

Submission status: Wrong Answer

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

out =( 100 ** a ) * b

if a == 0:
    print(b)
elif a == 1:
    print(100 * b)
else:
    print(10000 * b)

Submission status: Wrong Answer

Solution code:
D,N=input().split()
answer=N
for i in range(int(D)):
    answer=answer+"00"
print(answer)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

r=(100**d)*n

print(r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int, raw_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:
    tmp = 1
elif D == 1:
    tmp = 100
else:
    tmp = 10000
    
print(tmp*N)

Submission status: Wrong Answer

Solution code:
input_line = map(int, raw_input().split())
D = input_line[0]
N = input_line[1]
gift = 1 if D == 0 else 100 ** D
print gift * N

Submission status: Wrong Answer

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

if D in [1, 2]:
    print(N * (100 ** D))
else:
    print(N if N != 100 else 101)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(100**d*n)

Submission status: Wrong Answer

Solution code:
from sys import stdin, stdout
input = lambda: stdin.readline().rstrip()
println = stdout.write

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

    if not D:
        ans = N if N < 100 else 101
    elif D == 1:
        ans = 100 * N
    else:
        ans = 10000 * N
    print(ans)

main()

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:
import sys
if __name__ == "__main__":
    D, N = list(map(int, (input().split(' '))))
    print(pow(100, 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)
else:
    print(100 ** d * n)

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
D,N = (int(i) for i in 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:
D,N = [int(i) for i in input().split(' ')]
"""
ans = 100**D
ans *= N
print(ans)
"""

print(N,end="")
for i in range(D):
    print("00",end ="")

print()

Submission status: Wrong Answer

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

ans = []
for x in range(100**d, (100**d)*200, 100**d):
    if x % (100**d) == 0:
        ans.append(x)
    if len(ans) == n:
        break

print(ans[-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#coding: utf-8

def check(d,n):
    nums = []
    r = 100 ** d
    # if r == 0: r = 1
    # for i in range(1,n+1):
    #     nums.append(r * i)

    count = r
    while True:
        count = count + r
        if count % (r*100) != 0:
            nums.append(count)
        if len(nums) >= n-1:
            break

    return nums[-1]

if __name__ == "__main__":
    d,n = map(int, input().split(" "))
    result = []

    print(check(d,n))

Submission status: Wrong Answer

Solution code:
#encoding:utf-8

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

r=(100**d)*n

print(r)

Submission status: Wrong Answer

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

import calendar as cal

i = input().split(' ')
d = int(i[0])
n = int(i[1])

z = 1
c = 0
while True:
    if z%(100**2)==0:
        if d==2:
            c = c+1
    elif z%100==0:
        if d==1:
            c = c+1
    else:
        if d==0:
            c = c+1
    if c == n:
        print(z)
        break
    z = z+1

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:
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(100010000)
    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(N)
elif D == 1:
    print(N * 100)
elif D == 2:
    print(N * 100 * 100)
else:
    pass

Submission status: Wrong Answer

Solution code:

a =input().split()

b = int(a[0])
c = int(a[1])


print(c*(100**(b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
array = []
if(d == 0):
    tmp = 1
    for i in range(0,n):
        array.append(tmp)
        tmp+=1
    print(array[n-1])
elif(d == 1):
    tmp = 100
    for i in range(0,n):
        array.append(tmp)
        tmp+=100
    print(array[n-1])
else:
    tmp = 10000
    for i in range(0,n):
        array.append(tmp)
        tmp+=10000
    print(array[n-1])

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
from heapq import heapify, heappop, heappush
from sys import stdin, stdout, setrecursionlimit
from bisect import bisect, bisect_left, bisect_right
from collections import defaultdict, deque


# d = defaultdict(lambda: 0)
# setrecursionlimit(10**7)
# inf = float("inf")


##### stdin ####
def LM(t, r): return list(map(t, r))
def R(): return stdin.readline()
def RS(): return R().split()
def I(): return int(R())
def F(): return float(R())
def LI(): return LM(int,RS())
def LF(): return LM(float,RS())
def ONE_SL(): return list(input())
def ONE_IL(): return LM(int, ONE_SL())
def ALL_IL(): return LM(int,stdin)


##### tools #####
def ap(f): return f.append
def pll(li): print('\n'.join(LM(str,li)))
def pljoin(li, s): print(s.join(li))


##### Library ####


##### main #####
def main():
    
    D, N = LI()
    a = (100**D) 
    b = a * N
    
    if (b // a) != a and b%100 == 0:
        b += 1

    print(b)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
input_line = map(int, raw_input().split())
D = input_line[0]
N = input_line[1]
gift = 1 if D == 0 else 100 * D
print gift * N

Submission status: Wrong Answer

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

if N == 100:
    print(pow(100, D) * 100 + 1)
    exit()
print(pow(100, D) * N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import deque
import sys

def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [D, N] = [int(input_raw[0]), int(input_raw[1])]
    if N != 100:
        print (100**D)*N
    else:
        print ((100**D) + 1)*N

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:
import sys

tmp = [int(i) for i in input().split()]

a = tmp[0]
b = tmp[1]

number = 100 ** a * b
print(number)
sys.stdout.flush()

Submission status: Wrong Answer

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

print (100**D) * N

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
d, n = (int(x) for x in input().split())
if n == 100:
    n == 101
print('{0}{1}'.format(n, '00' * d))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


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

    n = 0
    if D == 0:
        n = 1
    elif D == 1:
        n = 100
    else:
        n = 10000
    ANS = n * N
    print(ANS)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
s=input().split()
a,b=int(s[0]),int(s[1])
print(100**a*b)

Submission status: Wrong Answer

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

print([i for i in range(1, n+1) if i % 100 != 0][-1] * (100**(d)))

Submission status: Wrong Answer

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

ans = 100 ** d * n
if n == 100:
    ans = ans / 100
print(int(ans))

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:
#coding : utf8

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = input().split()
D=int(l[0])
N=int(l[1])
if D==0:
    print(N)
elif D==1:
    print(N*100)
else:
    print(N*10000)