Problem:


Score: 200 points

Problem Statement

Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.

As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.

Find the N-th smallest integer that would make Ringo happy.

Constraints

D is 0, 1 or 2.

N is an integer between 1 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:

D N

Output

Print the N-th smallest integer that can be divided by 100 exactly D times.

Sample Input 1

0 5

Sample Output 1

5

The integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...

Thus, the 5-th smallest integer that would make Ringo happy is 5.  

Sample Input 2

1 11

Sample Output 2

1100

The integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \ 000, 1 \ 100, ...

Thus, the integer we are seeking is 1 \ 100.

Sample Input 3

2 85

Sample Output 3

850000

The integers that can be divided by 100 exactly twice are as follows: 10 \ 000, 20 \ 000, 30 \ 000, ...

Thus, the integer we are seeking is 850 \ 000.



Sample input:
0 5


Sample output:
5

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

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

print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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 += [10100]
multi_10000 += [1010000]

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: Accepted

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

Submission status: Accepted

Solution code:
#coding: utf-8

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

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

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

    print(check(d,n))

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
if (d==0)&(n!=100):
    print(n)
elif (d==0)&(n==100):
    print(101)
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: Accepted

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

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

Submission status: Accepted

Solution code:
D,N = input().split()
D = int(D)
N = int(N)
if N == 100:
    if D == 0:
        print(101)
    if D == 1:
        print(10100)
    if D == 2:
        print(1010000)
else:
    print(100 ** D * N)

Submission status: Accepted

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

Submission status: Accepted

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*100)
    else:
        print(10100)
elif D == 2:
    if N <= 99:
        print(N*10000)
    else:
        print(1010000)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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 < 100 else 1010000
    print(ans)

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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+10000)
    else:
        print(N*10000)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(tmp)

Submission status: Accepted

Solution code:
from itertools import islice

def nth(iterable, n, default=None):
        "Returns the nth item or a default value"
        return next(islice(iterable, n, None), default)

def gen_numbers(D):
        n = 100**D
        while True:
                yield n
                n += 100**D 
        

D, N = [int(i) for i in input().split()]
if N == 100:
        if D == 0:
                print(101)
        elif D == 1:
                print(10100)
        elif D == 2:
                print(1010000)
else:
        print(nth(gen_numbers(D), N-1))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

c = 0
i = 1
while True:
	if i % 100 != 0:
		c += 1
	if c == n:
		break
	i += 1

print(i * (100**(d)))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys

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

x = int(math.pow(100, D))
ret = x * N
if N == 100:
    ret += x
print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

    ans = f(D, N)
    print(ans)


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

    if D == 0:
        ans = N
        if N == 100:
            ans = 101
    elif D == 1:
        xs = range(100, 100 * 101, 100)
        ans = xs[N-1]
    else:
        # D=2
        xs = range(100**2, (100 ** 2) * 101, 100**2)
        ans = xs[N-1]

    print(ans)


def f(D, N):
    xs = range(100**D, (100 ** D) * 102, 100**D)
    ans = xs[N-1]
    a = ans // (100**D)
    if a >= 100 and a % 100 == 0:
        ans = xs[N]

    return ans


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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

a = 0
if d == 0:
    a = n
    if n == 100:
        a += 1
elif d == 1:
    a = 100 * n
    if n == 100:
        a += 100
elif d == 2:
    a = 100 * 100 * n
    if n == 100:
        a += 100 * 100

print(a)

Submission status: Accepted

Solution code:
x,y = map(int,input().split())
ans = 0
num = 100**x
for i in range(1,y+1):
    if(num*i != 100**(x+1)):
        ans = num*i
    else:
        ans = num*(i+1)
        i +=1
if(y == 0):
    ans = num
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

DN = list(int(i) for i in input().split())

if DN[1] < 100:
    ans = 100**DN[0]*DN[1]
if DN[1] == 100:
    ans = 100**DN[0]*(DN[1]+1)

print(ans)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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(1010000)
else:
    print(sol)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def m():
    d, n = map(int, input().split())
    if d == 0:
        if n == 100:
            return 101
        return n
    if n == 100:
        return (100 **d)*(n+1)
    return (100 **d)*n


print(m())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if(n==100): n+=1

print(n*(100**d))

Submission status: Accepted

Solution code:
l = map(int, raw_input().split())
d = l[0]
n = l[1]

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

Submission status: Accepted

Solution code:
input_line = input().split()
target_divide = int(input_line[0])
num_target = int(input_line[1])

if target_divide == 0:
    counter = 0
    current_num = 0
    while counter < num_target:
        current_num += 1
        if current_num % 100 == 0:
            continue
        else:
            counter += 1

    print(str(current_num))
    exit(0)

elif target_divide == 1:
    counter = 0
    current_num = 0
    while counter < num_target:
        current_num += 100
        if current_num % 10000 != 0 and current_num % 1000000 != 0:
            counter += 1

    print(str(current_num))

else:
    counter = 0
    current_num = 0
    while counter < num_target:
        current_num += 10000
        if current_num % 1000000 != 0:
            counter += 1

    print(str(current_num))

Submission status: Accepted

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

else:
	print(pow(100,d[0])*d[1])

Submission status: Accepted

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

list_ = []
for k in range(1, 101):
    str_ = str(k) + "00"*D
    int_ = int(str_)
    list_.append(int_)

if N == 100 and D == 0:
    print(101)
elif N == 100 and D == 1:
    print(10100)
elif N == 100 and D == 2:
    print(1010000)
else:
    print(list_[N-1])

Submission status: Accepted

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

Submission status: Accepted

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

ans = 100 ** d * n

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout
from math import sqrt
from collections import defaultdict
#t = int(stdin.readline().strip())
#R, L, C, Vin = [float(x) for x in stdin.readline().strip().split()]
D, N = [int(x) for x in stdin.readline().strip().split()]
D = 100 ** D
print(D * (N + (N//100)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, n = map(int, input().split())
ex = [101, 10100, 1010000]
if n == 100:
    print(ex[d])
else:
    print(pow(100, d) * n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d,n=map(int,input().split())
s=str(n)
if n!=100:
  s+="0"*(2*d)
  print(int(s))
else:
  t="101"+"0"*(2*d)
  print(int(t))

Submission status: Accepted

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

ans = [pow(100, D) * i for i in range(1,200) if pow(100, D) * i % pow(100, D+1) != 0]
print(ans[N-1])

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
D,N = map(int,input().split())
cnt = 0
res = 0
dif = 100 ** D
while 1:
    res += dif
    if res % 100**(D+1):
        cnt += 1
    if cnt == N:
        print(res)
        break

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
[a, b] = map(int, input().split())
if b == 100:
    print(int(101 * math.pow(100,a)))
else:
    print(int(b * math.pow(100, a)))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if d==0:
    if n<100:
        print(n)
    elif n==100:
        print(n+1)
if d==1:
    if n<100:
        sub=n*100
    elif n==100:
        sub=(n+1)*100
    print(sub)
if d==2:
    if n<100:
        sub2=n*10000
    elif n==100:
        sub2=(n+1)*10000
    print(sub2)

Submission status: Accepted

Solution code:
list=input().rstrip().split() 
D=int(list[0]) 
N=int(list[1])
if N!=100:
    print((100**D)*N)
else:
    print(101*(100**D))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

if A == 0:
    if B == 100:
        print(101)
    else:
     print(B)
elif B == 100:
    print(101*100**A)

else:
    print(B * 100 ** A)

Submission status: Accepted

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

Submission status: Accepted

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

print(100**D*(N+N//100))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://abc100.contest.atcoder.jp/tasks/abc100_b

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if N == 100:
  N = 101

print(str(N) + '00'*D)

Submission status: Accepted

Solution code:
d,n=map(int,input().split())
if d==0:
    c=0
    a=0
    while c<n:
        a+=1
        if a%100!=0:
            c+=1
elif d==1:
    c=0
    a=0
    while c<n:
        a+=100
        if a%10000!=0:
            c+=1
else:
    c=0
    a=0
    while c<n:
        a+=10000
        if a%1000000!=0:
            c+=1
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

D, N = map(int, stdin.readline().rstrip().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D, N = map(int, input().split())
base = 1
for j in range(D):
    base *= 100
if N%100 == 0:
    N += 1
if(D!=0):
    num = base * N
    print(str(num))
else:
    print(str(N))

Submission status: Accepted

Solution code:
Data = input()

import re

Shift = re.split(" ",Data)
D = int(Shift[0])
N = int(Shift[1])

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Jun 16 20:49:48 2018
ABC100B
@author: maezawa
"""

#a = int(input())
#b = int(input())
d, n = list(map(int, input().split()))

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

Submission status: Accepted

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

if D==0: a=1
else: a=100**D

if N==100:
	print a*N+a
else:
	print a*N

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = list(map(int,input().split()))
if B == 100:
    B = 101
print((100 ** A)  * B )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input().split()

for i in range(len(inp)):
    inp[i] = int(inp[i])

d = inp[0]
n = inp[1]

ds = 100**d

if n<100:
    print(ds*n)
elif n==100:
    print(ds*101)

Submission status: Accepted

Solution code:
# 整数の入力
D, N = list(map(int, input().split(" ")))

if N == 100:
    if D == 0:
        print(101)

    elif D == 1:
        print(100 * 101)

    else:
        print(10000 * 101)

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

    elif D == 1:
        print(100*N)

    else:
        print(10000*N)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = map(int,input().split(" "))
if(B==100):
    print(100**A*(B+1))
else:
    print(100**A*B)

Submission status: Accepted

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