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:
def pow100(n):
	a = 1
	for i in range(0, n):
		a = a * 100
	return a

D, N = map(int, raw_input().split())
ans = pow100(D) * N
if N == 100: ans = pow100(D+1)+pow100(D)
print ans

Submission status: Accepted

Solution code:
headerData = input().split()
d = int(headerData[0])
n = headerData[1]
if n == "100":
    n = "101"
answer = n + "00" * d
print(answer)

Submission status: Accepted

Solution code:
D, N = (int(i) for i in input().split())
A = 100 * N
B = 10000 * N
if N == 100:
  if D == 0:
    print(101)
  if D == 1:
    print(10100)
  if D == 2:
    print(1010000)
elif D == 0:
    print(N)
elif D == 1:
    print(A)
else:
    print(B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#100b
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:
    N = 101

print(100**D*N)

Submission status: Accepted

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

Submission status: Accepted

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

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(100**D*N)
else:
  print(100**D*101)

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

Submission status: Accepted

Solution code:
d,n=map(int, 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 N == 100:
    N = 101
print((100 ** D) * N)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#B
D,N=map(int,input().split())
i=0
n=0
if N%100!=0:
    C=(100**D)*(N)
else:
    C=(100**D)*(N+1)
print(C)

Submission status: Accepted

Solution code:
# coding: utf-8

def solve(D, N):
    return pow(100, D) * (N + (N//100))

if __name__ == "__main__":
    D, N = map(int, input().split())
    print(solve(D,N))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

k=n*100**d

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

Submission status: Accepted

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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
ans = 0

while cnt < n:
    ans += 100**d
    if ans % 100**(d+1):
        cnt+=1

print(ans)

Submission status: Accepted

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

if N < 100:
	print pow(100,D)*N

else:
	print (N+1)*pow(100,D)

Submission status: Accepted

Solution code:
#!/usr/bin/python3

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#入力数列配列
A = list(map(int, input().split()))

if A[1] == 100:
    print(100**(A[0]+1)+100**(A[0])*1)
else:
    print(100**A[0]*A[1])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

print(ans)

Submission status: Accepted

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

print(100**d * (n + n//100))

Submission status: Accepted

Solution code:
import sys 
import math

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

Submission status: Accepted

Solution code:
A,B = map(int,input().rstrip().split())

for i in range(B):
    if i !=99:
        a = (i+1)*100**A
    else:
        a = 101*100**A
print(a)

Submission status: Accepted

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

a = (100**ringo[0])*ringo[1]

if ringo[1] is 100:	
	a = (100**ringo[0])*(ringo[1]+1)

print(a)

Submission status: Accepted

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

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())
output = 1
for i in range(D):
	output *= 100
if N == 100:
	N = 101
output *= N
print(output)

Submission status: Accepted

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

temp = 100 ** d
res = temp * n 

if n != 100:
    print(res)
else:
    print(101 * temp)

Submission status: Accepted

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

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

    ans = 0
    #D=0の場合
    if D == 0:
        if N == 100:
            ans = 101
        else:
            ans = N

    #D=1の場合
    elif D == 1:
        if N == 100:
            ans = 10100
        else:
            ans = 100 * N

    #D=2の場合
    elif D == 2:
        if N == 100:
            ans = 1010000
        else:
            ans = 10000 * N
    
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

# Binary converter
def to_bin(x):
    return bin(x)[2:]

# --------------------------------------------

dp = None

def main():
    D, N = [int(_) for _ in input().split()]

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

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

    else:
        if N != 100:
            print(10000 * N)
        else:
            print(1010000)

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

D, W = map(int, input().split())
if W == 100:
    print(101*(100**D))
else:
    print(W*(100**D))

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

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

print(100 ** d * n + n // 100 * 100 ** d)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
"""
https://abc100.contest.atcoder.jp/tasks/abc100_b
"""
[d,n]=[int(i) for i in input().split()]
if n==100:
    a=(n+1)*(100**d)
else:
    a=n*(100**d)

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def getinputdata():

    array_result = []    
    array_result.append(input().split(" "))

    flg = True

    try:
        while flg:

            data = input()

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = True

            else:

                flg = False
    finally:

        return array_result

arr_data = getinputdata()

#0 or 1 or 2
d = int(arr_data[0][0])

#1<=n<=100
n = int(arr_data[0][1])


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

i=N
if N==100:
    i=101
if D==0:
    print(str(i))
elif D==1:
    print(str(i)+"00")
else:
    print(str(i)+"0000")

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:
import math
print((lambda x: int(math.pow(100,x[0])*(x[1] if x[1]!=100 else 101)))(list(map(int, input().split()))))

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

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

lis = []
for i in range(1,101):
    if i == 100:
        lis.append(101*(100**D))
    else:
        lis.append((100**D)*i)

print(lis[N-1])

Submission status: Accepted

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

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

Submission status: Accepted

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

number = 0

if D == 0:
    for i in range(N):
        number += 1
        if (number % 100 == 0):
            number += 1

elif D == 1:
    for i in range(N):
        number += 100
        
        if (number % 100**2) == 0:
            number += 100

else: ## in case D == 2
    for i in range(N):
        number += 100 ** 2
        
        if (number % 100**3) == 0:
            number += 100 ** 2


print(number)

Submission status: Accepted

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

if k==100:
   k+=1
if n==0:
   sum=k
else:
   sum=(100**n)*k

print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    d, n = [int(i) for i in input().split(' ')]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
d,n = (int(i) for i in 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(100**D*101)

else:
    print(100**D*N)

Submission status: Accepted

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

answer = N * (100 ** D)

if N == 100:
    answer = answer + 100 ** D

print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if N>=100:
  N+=1

print(N*100**D)

Submission status: Accepted

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

    if N < 100:
        print(N * 10**(2*D))
    else:
        print((N+1) * 10**(2*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:
import math

D, N = map(int,input().split())
C = 0
if(N == 100):
	C = math.pow(100,D) * 101
else:
	for i in range(1,N+1):
		C = math.pow(100,D) * i

print(int(C))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def f(d, n):
    add = pow(100, d)
    total = 0
    c = 0
    while True:
        total += add
        if total % pow(100, (d + 1)) == 0:
            pass
        else:
            c += 1
        if c == n:
            print(total)
            exit()


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def process(d, n):
    if n < 100:
        return n * (100 ** d)
    else:
        return 101 * (100 ** d)

def main():
    d, n = [int(i) for i in raw_input().strip().split()]
    print process(d, n)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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:
# 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:
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:
    b += 1
print(b*100**a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

cnt = 0
Z = 0

while (cnt < N):
    Z += 100 ** D
    if (Z % (100 ** (D + 1)) != 0):
        cnt += 1

print(Z)

Submission status: Accepted

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

cnt = 0
index = 0
while cnt < N:
    index += 1
    if pow(100,D)*index % pow(100,D+1) == 0:
        continue
    cnt += 1

print(str(pow(100,D)*index))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if a ==0:
    c = str(b)
elif a ==1:
    c = str(b) + '00'
else:
    c = str(b) + '0000'
print(c)

Submission status: Accepted

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

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

Submission status: Accepted

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

# if D = 0, any positive integer *NOT* divisible by 100, pick the N-th one
# if D = 1, any positive integer divisible by 100 exactly once, i.e. 100*range(N+1)
# if D = 2, any positive integer divisible by 100 exactly twice, i.e. 100*100*range(N+1)
def count_divisions(n):
    factors = 0
    while n%100 == 0:
        factors += 1
        n = n/100
    return factors
    
index = 0
number = 0
while index != N:
    number += 1
    if count_divisions(number) == D:
        index += 1
print(number)

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

base = 100**d
ans = base*n
if (d==0 and ans%100==0)or(d ==1 and ans%10000==0)or(d ==2 and ans%1000000==0):
    ans +=100**d
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(d,n):
    if  n != 100 :
        return (100**d)*n
    elif n == 100:
         return (100**d)*101 
    else:
        return n

# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

def solve(a,b):
    if a == 0 and b<=99:
        return(b)
    elif a == 1 and b<=99:
        return(100*b)
    elif a == 2 and b<=99:
        return(10000*b)
    elif a == 0:
        return(101)
    elif a == 1:
        return(10100)
    else:
        return(1010000)

def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
x = sys.stdin.readline()

[d,n] = x.split(' ')
if int(d) == 0:
    if int(n) == 100:
        print(101)
    else:
        print(n)
elif int(d)==1 or int(d)==2:
    if int(n) == 100:
        print((100**int(d))*(int(n)+1))
    else:
        print((100**int(d))*int(n))

Submission status: Accepted

Solution code:
import sys

def solve(a, b):
    if a == 0 or a==1 or a==2:
        if b==100:
            answer=100**a*b+(100**a)
        else:
            answer=100**a*b
    return answer

def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:



# import configparser
# import time


# class GetTime():
#     now = time.ctime()

    
#     def debug(self):
#         print('-------debug-begin---------------')
#         print(self.now)
#         parsed = time.strptime(self.now)
#         print(time.strftime("%a %b %d %H:%M:%S %Y", parsed))
#         print('-------debug-end---------------')


# class Person():
#     def __init__(self, name, id):
#         self.name = name
#         self.id = id


# class Greet(Person):
#     def morning(self):
#         print('Good morning ' + self.name)

#     def night(self):
#         print('Good night ' + self.name)


# hunter = Person('Hoge Fugo', 1)

# print('name:%s   id:%s' % (hunter.name, hunter.id))

# o = Greet('Bob', 4)
# o.morning()


# t = GetTime()
# t.debug()

# ##

# poem = 'Hello,friends'
# fout = open('relavity','wt')
# # print(poem, file=fout)
# fout.close()

# ##





# # config.read('exe.ini')
# # print(MySQL_setting['Port'])
# # config.read('exe.ini')
# # print(MySQL_setting['Port'])

# class init_setting():
#     def input(self):
#         print('input port number:')
#         port=input()
#         print('input user name:')
#         user=input()

#         print(port,user)

        
#         with open('example.ini','w') as conf:
#             config.write(conf)

#         config=configparser.ConfigParser()
#         config['MySQL_setting']={}
#         MySQL_setting=config['MySQL_setting']


#         MySQL_setting['Port']=port
#         MySQL_setting['user']=user

#         config.sections()


# MakeSetting=init_setting()
# MakeSetting.input()


# MySQL_setting['Port']=port
# # MySQL_setting['user']=user

# empty_list = []
# print(empty_list)

# weekdays=['monday','Tuesday','Wednesday','Thursday','Friday']

# for i in weekdays:
#     print(weekdays)

# print(weekdays[0])

# for i in weekdays:
# 	print(i)

# a_tuple=('ready','fire','class')


# list('cat')


#! bin/env/python python3
# -*- coding:utf-8 -*-

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


# print(d)
# print(n)

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


elif d == 2:
	if(n == 100):
		print(1010000)
	else:
		print(n*10000)

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 = input().split()
if int(a[0]) == 0:
    if int(a[1]) != 100:
        print(int(a[1]))
    else:
        print(101)
elif int(a[0]) == 1:
    if int(a[1]) != 100:
        print(int(a[1]) * 100)
    else:
        print(10100)
else:
    if int(a[1]) != 100:
        print(int(a[1]) * 10000)
    else:
        print(1010000)

Submission status: Accepted

Solution code:
# coding: utf-8
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())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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 = [int(i) for i in input().split()]
base = pow(100, D)
print(N * base if N != 100 else 101 * base)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
D,N = map(int, raw_input().split())
print (100**D)*(N + (1 if N==100 else 0))

Submission status: Accepted

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

l=[(100**D)*x for x in range(2*N) if (100**D)*x % (100**(D+1)) != 0]
print l[N-1]

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a == 0:
  if b == 100:
    print(101)
  else:
    print(b)
else:
  if b == 100:
    print(101*100**a)
  else:
    print(b*100**a)

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())
c = 0
for i in range(1, 2000000):
    if n == 100 and i == 100**d:
        continue
    if i % (100**d) == 0:
        c += 1
    if c == n:
        print(i)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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