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: Runtime Error

Solution code:
a, b = map(int, input(" "))
if b == 0:
  print(a)
elif b == 1:
  print(a*100)
else:
  print(a*10000)

Submission status: Runtime Error

Solution code:
#coding:utf-8

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

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

print(lis[N-1])

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

assert N<100

print(N*100**D)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
if N==100:
    print((N+1)*pow(100, D))
else:
    print(N*pow(100, D))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
 def solve(d,n):
    if  n != 100 :
        return (100**d)*n
    elif n == 100:
         return (d**100)*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: Runtime Error

Solution code:
[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: Runtime Error

Solution code:
import sys

def solve(a, b):
    def solve(d, n):
    return (100**d)*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: Runtime Error

Solution code:

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

d,n = map(int, raw_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:
	print(n*10000)

Submission status: Runtime Error

Solution code:

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


# print(d)
# print(n)

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


elif d == 2:
	print(n*10000)

Submission status: Runtime Error

Solution code:

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

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



print(d)
print(n)


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

Submission status: Runtime Error

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

l = map(int, raw_input().split())
# print(d)
# print(n)
d = l[0]
n = l[1]

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

Submission status: Runtime Error

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(a, b):
    if a==0:
        answer = atr(range(b))
    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: Runtime Error

Solution code:

l = map(int, raw_input().split())
# print(d)
# print(n)
d = l[0]
n = l[1]

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

Submission status: Runtime Error

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 10001
    else:
        print(100 * n)
if d == 2:
    if n == 100:
        print 1000001
    else:
        print(10000 * n)

Submission status: Runtime Error

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: Runtime Error

Solution code:
print(100**int(input() * int(input())))

Submission status: Runtime Error

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*10**a)
  else:
    printe(b*10**a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = raw_input()
L = S.split(" ")
if L[0] == "0":
    print 1 * int(L[1])
elif L[1] == "1":
    print 100 * int(L[1])
elif L[2] == "2":
    print 10000 * int(L[1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print((100 ** D) * N)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
D = input()
N = input()
sum = 1
for i in range(int(D)):
    sum=sum*100
if(int(D)==0):
    ans=int(N)
    print(ans)
else:
    ans=sum*int(N)
    print(ans)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
dn = input()
d, n = dn.split()
d = int(d)
n = int(n)
list = []
for i in range(1, 1000001):
    if i% 100**d:
        list.append(i)

print(list[n+1])

Submission status: Runtime Error

Solution code:
from sys import stdin


def main():
    D, N = [int(x) for x in stdin.readline().rstrip().split()]
    result = 100 ** D * 100
    if D == 0 and N == 100:
        result += 1
    if D == 1 and N == 100:
        resutl += 100
    print(result)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import sys

get = sys.stdin.readline()
a, b = get.split(" ")
a2 = long(a)
b2 = long(b)
ans = b2 * (10 ** (a2*2))
print(ans)

Submission status: Runtime Error

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

ans = []
if d == 0:
    x = 1
    while True:
        if x % 100 != 0 and x % 10000 != 0:
            ans.append(x)
        x += 1
        if len(ans) == n:
            break
elif d == 1:
    x = 100
    while True:
        if x % 10000 != 0:
            ans.append(x)
        x += 100
        if len(ans) == n:
            break
else:
    x = 10000
    while True:
       if x % 100000000 != 0:
       ans.append(x)
        x += 10000
        if len(ans) == n:
            break

print(ans[-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
line = input()
liststr = line.split()
list = []

for i in liststr:
    i = int(i)
    list.append(i)


cc = 0
for r in list:
    while r%2 == 0:
        r = r / 2
        cc = cc + 1


print(cc)

Submission status: Runtime Error

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


if D==2:
    dp = [10000*i for i in range(1,10010)]
    print(dp[N-1] N!=100 else dp[N])
elif D==1:
    dp = [100*i for i in range(1,10010)]
    print(dp[N-1] N!=100 else dp[N])
else:
    print(N if N!=100 else 101)

Submission status: Runtime Error

Solution code:
inp = input()
inp2 = inp.split()
A=int(inp2[0])
B=int(inp2[1])
C = B*(100**A)
if B == 100:
	if A = 0:
		C = 101
	elif A = 1:
		C = 10001
	elif A = 2:
		C = 1000001
print(C)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
D,N=map(int,input().split())
def gcd(a,b):
    c=np.floor(a/b)
    return a-b*c
if gcd(N,100)==0:
    print(N*100**(D-1))
else:
    print(N*100**D)

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

Solution code:
eval"A,B="+gets.split*?,;p (B+B/100)*100**A

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input().split()
D = int(S[0])
N = int(S[1])
if N <> 100:
    Ans = N*(100**D)
else:
    Ans = (N-1)*(100**D)
print(Ans)

Submission status: Runtime Error

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

    
 
print(answer)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
package main

import (
	"bufio"
	"fmt"
	"log"
	"math"
	"math/rand"
	"os"
	"strconv"
	"time"
)

// const abcd = "abcdefghijklmnopqrstuvwxyz"
// const ABCD = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
var dx = [...]int{0, 1, 1, 1, 0, -1, -1, -1, 0}
var dy = [...]int{1, 1, 0, -1, -1, -1, 0, 1, 0}

var inf = math.MaxInt64

// var mod = 1000000007
var next = newScanner()

// ---------------------------------------------------------
func init() {
	log.SetFlags(log.Lshortfile)
	rand.Seed(time.Now().UnixNano())
}

func main() {
	D := next.Int()
	N := next.Int()
	if D == 0 {
		fmt.Println(N / D)
	} else {
		d := 100
		if D == 2 {
			d *= 100
		}
		fmt.Println(d * N)
	}
}

// ---------------------------------------------------------

// Pair is...
type Pair struct {
	a, b int
}

// Pairs is sorted by []Pair struct
type Pairs []Pair

func (p Pairs) Len() int {
	return len(p)
}
func (p Pairs) Swap(i, j int) {
	p[i], p[j] = p[j], p[i]
}

func (p Pairs) Less(i, j int) bool {
	return p[i].b < p[i].b
}

// func (p Pairs) Less(i, j int) bool {
// 	if p[i].a < p[j].a {
// 		return true
// 	} else if p[i].a == p[j].a {
// 		return p[i].b < p[j].b
// 	}
// 	return false
// }

// ------int method-------------------------
func in(c, a, z int) bool {
	return c >= a && c < z
}
func out(c, a, z int) bool {
	return !in(c, a, z)
}
func btoi(b bool) int {
	if b {
		return 1
	}
	return 0
}
func itob(a int) bool {
	return a != 0
}
func max(a ...int) int {
	r := a[0]
	for i := 0; i < len(a); i++ {
		if r < a[i] {
			r = a[i]
		}
	}
	return r
}
func min(a ...int) int {
	r := a[0]
	for i := 0; i < len(a); i++ {
		if r > a[i] {
			r = a[i]
		}
	}
	return r
}
func sum(a []int) (r int) {
	for i := range a {
		r += a[i]
	}
	return r
}
func pro(a []int) int {
	r := a[0]
	for i := 1; i < len(a); i++ {
		r *= a[i]
	}
	return r
}

func fill(a []int, n int) []int {
	for i := range a {
		a[i] = n
	}
	return a
}
func minmax(a, b int) (int, int) {
	if a > b {
		return b, a
	}
	return a, b
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

//
//func abs(a int) int {
//	mask := a >> 63
//	return (a ^ mask) - mask
//}

func ceil(a, b int) int {
	if a%b != 0 {
		return 1
	}
	return 0
}

func printStrings(out []string) {
	for i := range out {
		fmt.Print(out[i])
		if i != len(out)-1 {
			fmt.Print(" ")
		}
	}
	fmt.Print("\n")
}
func printInts(out []int) {
	for i := range out {
		fmt.Print(out[i])
		if i != len(out)-1 {
			fmt.Print(" ")
		}
	}
	fmt.Print("\n")
}

// ---------- buffered scanner -----------------------------------------
type scanner struct {
	r   *bufio.Reader
	buf []byte
	p   int
}

func newScanner() *scanner {
	rdr := bufio.NewReaderSize(os.Stdin, 10000)
	return &scanner{r: rdr}
}
func (s *scanner) next() string {
	s.pre()
	start := s.p
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			break
		}
	}
	result := string(s.buf[start:s.p])
	s.p++
	return result
}
func (s *scanner) Line() string {
	s.pre()
	start := s.p
	s.p = len(s.buf)
	return string(s.buf[start:])
}
func (s *scanner) String() string {
	return s.next()
}
func (s *scanner) Int() int {
	v, err := strconv.Atoi(s.next())
	if err != nil {
		log.Fatal(err)
	}
	return v
}
func (s *scanner) Ints(n int) []int {
	r := make([]int, n)
	for i := 0; i < n; i++ {
		r[i] = s.Int()
	}
	return r
}
func (s *scanner) Int64() int64 {
	v, err := strconv.ParseInt(s.next(), 10, 64)
	if err != nil {
		log.Fatal(err)
	}
	return v
}
func (s *scanner) Uint64() uint64 {
	v, err := strconv.ParseUint(s.next(), 10, 64)
	if err != nil {
		log.Fatal(err)
	}
	return v
}
func (s *scanner) Float64() float64 {
	v, err := strconv.ParseFloat(s.next(), 64)
	if err != nil {
		log.Fatal(err)
	}
	return v
}
func (s *scanner) pre() {
	if s.p >= len(s.buf) {
		s.readLine()
		s.p = 0
	}
}
func (s *scanner) readLine() {
	s.buf = make([]byte, 0)
	for {
		l, p, err := s.r.ReadLine()
		if err != nil {
			log.Fatal(err)
		}
		s.buf = append(s.buf, l...)
		if !p {
			break
		}
	}
}

Submission status: Runtime Error

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: Runtime Error

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

elif D == 2 and N <100:
    print(10000*N)
elif D == 2 and N==100:
    print(N+1)*100

Submission status: Runtime Error

Solution code:
d,n=map(int,input().split())
li=[]
for i in range(1,101):
  if i*100**d%100**(d+1)==1:
    continue
  else:
  	li.append(i*(100**d))
print(li[n-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
d,n=map(int,input().split())
li=[]
for i in range(1,101):
  if i*100**d%100**(d+1)!=0:
    continue
  else:
  	li.append(i*(100**d))
print(li[n-1])

Submission status: Runtime Error

Solution code:
for i in range(1,101):
    for j in range(1,11):
        tmp = pow(i, j)
        a.append(tmp)
a.sort()

Submission status: Runtime Error

Solution code:
d,n  = (int(i) for i in input().split())
 
int answer = 0
 
if d == 0 :
    answer = n
elif d == 1:
    answer = 100*n
elif d == 2:
    answer = 10000*n
    
 
print(answer)

Submission status: Runtime Error

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

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

t = 0
for i in a:
    m = i
    while m % 2 == 0:
        t += 1
        m /= 2

print(t)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
multi_0 = [a for a in range(1,100)]
multi_100 = [a for a in range(100,10001) if a % 100 == 0]
multi_10000 = [a for a in range(10000, 1000001) if a % 10000 == 0]

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: Runtime Error

Solution code:
#Ringo's Favorite Numbers
D, N = map(int, input().split())
m = []
for i in range(N):
	m.append(i*100**D)
print(m[N])

Submission status: Runtime Error

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)
else:
    if D == 1:
        n = [i*100 for i in range(1, 100)]
    else:
        n = [i*10000 for i in range(1, 100)]
    print(n[N-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
d=int(input())

n=int(input())

r=(100**d)*n

print(r)

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

Solution code:
#
# B - Ringo's Favorite Numbers

# B_Ringos_Favorite_Numbers.py

m = 100

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


if D == 0:
    print(N)
else:
    if D == 1:
        n = [i*100 for i in range(1, 100)]
    else:
        n = [i*10000 for i in range(1, 100)]
    print(n[N-1])

Submission status: Runtime Error

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

start = pow(n, d)

elif n == 100:
    print(pow(100, d) * (n + 1))
else:
    print(pow(100, d) * n)

Submission status: Runtime Error

Solution code:
D, N = map(int, raw_input().split())
if N == 100
 if D == 0:
    print(101)
 elif D == 1:
    print(10001)
 elif D == 2:
    print(1000001)
elif D == 0:
  print(N)
elif D == 1:
  print(N*100)
elif D == 2:
  print(N*10000)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
D, N = map(int, raw_input().split())
if N == 100
 if D == 0:
    print(101)
  elif D == 1:
    print(10001)
  elif D == 2:
    print(1000001)
elif D == 0:
  print(N)
elif D == 1:
  print(N*100)
elif D == 2:
  print(N*10000)

Submission status: Runtime Error

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


        
if d == 0:
    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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
using namespace __gnu_pbds;
using ll = int64_t;
using ld = long double;
using ull = uint64_t;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

ll a, b;

int main() {
  ios::sync_with_stdio(0);
  cout.precision(10);

  cin >> a >> b;
  ll x = 1;
  while(a > 0) {
    x *= 100;
    a--;
  }

  if (b != 100) {
    cout << x * b << endl;
  } else {
    cout << x * 101 << endl;
  }
}

Submission status: Runtime Error

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

int answer = 0

if d = 0 :
    answer = n
elif d = 1:
    answer = 100*n
elif d = 2:
    answer = 10000*n
    

print(answer)

Submission status: Runtime Error

Solution code:
l=input().split()
d=int(l[0])
n=int(l[1])
print(100^d)*n

Submission status: Runtime Error

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

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

print(list_[N-1])

Submission status: Runtime Error

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

print(pow(100, d)*n)

Submission status: Runtime Error

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

print(N * (100**D))

Submission status: Runtime Error

Solution code:
#encoding:utf-8

d=int(input())

n=int(input())

r=(100**d)*n

print(r)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#input one int
#a = int(input())

#input some val
#a, b, c = (int(i) for i in input().split())
#val = [[int(i) for i in input().split()] for i in range(N)]

#input matrix
#a = [input().split() for i in range()]

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

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

Submission status: Runtime Error

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

for i in range(1,100000):
    if i % 100 == 0 and i % 10000!= 0:
        l1.append(i)
    if i % 10000 == 0 and i % 1000000!= 0:
        l2.append(i)
        
if d == 0:
    print(n)
elif d == 1:
    print(l1[n-1])
else:
    print(l2[n-1])

Submission status: Runtime Error

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

for i in range(1,1000000):
    if i % 100 == 0 and i % 10000!= 0:
        l1.append(i)
    if i % 10000 == 0 and i % 1000000!= 0:
        l2.append(i)
        
if d == 0:
    print(n)
elif d == 1:
    print(l1[n-1])
else:
    print(l2[n-1])

Submission status: Runtime Error

Solution code:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<(n);i++)
#define loop(i,a,n) for(i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;

int main(void) {
    int i,j;
    int n,d;
    cin >> d >> n;
    cout << n;
    rep(i,d){
        cout << "00";
    }
    cout << endl;
}

Submission status: Runtime Error

Solution code:
#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <queue>
#include <stack>
#include <list>
#include <functional>
#include <numeric>
#include <iostream>

using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)

int D,N;

int main() {

	scanf("%d%d", &D, &N);

	printf("%d", N);
	rep(i, D) printf("00");
	printf("\n");

	return 0;
}