Problem:


Score : 200 points

Problem Statement

Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?

Constraints

1 \leq a \leq 9

1 \leq b \leq 9

a and b are integers.

Input

Input is given from Standard Input in the following format:

a b

Output

Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)

Sample Input 1

4 3

Sample Output 1

3333

We have two strings 444 and 3333. Between them, 3333 is the lexicographically smaller.

Sample Input 2

7 7

Sample Output 2

7777777



Sample input:
4 3


Sample output:
3333

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
x= min(a,b)
y= max(a,b)

print(str(x)*y)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a < b:
        print("{}".format(a)*b)
else:
        print("{}".format(b)*a)

Submission status: Accepted

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

if a < b:
    for i in range(b):
        print(a, end = "")
else:
    for i in range(a):
        print(b, end = "")

Submission status: Accepted

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

if a < b :
    print(str(a)*b)
else :
    print(str(b)*a)
'''
a , b =input().split()
#print(a,b)

if a < b :
    print(a*int(b))
else :
    print(b*int(a))
'''

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a<b:
    for i in range(b):
        print(a,end="")
elif a==b:
    for i in range(b):
        print(a,end="")
elif a>b:
    for i in range(a):
        print(b,end="")

Submission status: Accepted

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

if a == b:
    print(str(a) * b)
elif a > b:
    print(str(b) * a)
else:
    print(str(a) * b)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
s = ''
if a < b:
    for i in range(b):
        s += str(a)
else:
    for i in range(a):
        s += str(b)
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

A = a * int(b)
B = b * int(a)

print(min(A, B))

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

a, b = map(int, readline().split())
if a < b:
    print(str(a) * b)
else:
    print(str(b) * a)

Submission status: Accepted

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

A = 0
B = 0

for i in range(b):
	A = A*10 + a

for i in range(a):
	B = B*10 +b

if a <= b:
	print(A)
else:
	print(B)

Submission status: Accepted

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

Submission status: Accepted

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

one=str(a)*b
two=str(b)*a

print(min(one,two))

Submission status: Accepted

Solution code:
a,b=map(str,input().split())
print(a*int(b) if int(a[0])<int(b[0]) else b*int(a))

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
for i in range(max(a,b)):
	print(min(a,b),end="")

Submission status: Accepted

Solution code:
a, b = input().split()
ans = a * int(b) if a < b else b * int(a)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = input().split()
s = a*int(b)
t = b*int(a)
print(s if s<t else t)

Submission status: Accepted

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

print(str(min(a, b))*max(a, b))

Submission status: Accepted

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

if a <= b :
    print(str(a)*b)
else:
    print(str(b)*a)

Submission status: Accepted

Solution code:
base = input().split()
a = int(base[0])
b = int(base[1])
if a>b:
    for i in range(a):
        print(b,end = "")
elif a==b:
    for i in range(a):
        print(b,end = "")
else:
    for i in range(b):
        print(a,end = "")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print('{}'.format(a)*b if a <= b else '{}'.format(b)*a)

Submission status: Accepted

Solution code:
#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))


a,b=input2()


str_a=str(a)*b
str_b=str(b)*a

print(min(str_a,str_b))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a > b:
    for i in range(a):
        print(b, end="")
else:
    for i in range(b):
        print(a, end="")

Submission status: Accepted

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

c = sorted([a, b])
print(c[0]*int(c[1]))

Submission status: Accepted

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

s1 = str(a) * b
s2 = str(b) * a
if s1 < s2:
    print(s1)
else:
    print(s2)

Submission status: Accepted

Solution code:
import os

def main():
	num_strings = ""
	a,b = map(int, input().split())
	if a <= b:
		for i in range(b):
			num_strings += str(a) 
	else:
		for i in range(a):
			num_strings += str(b)
	
	print(num_strings)

if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
for i in range(max(a, b)):
    print((min(a, b)), end='')
print()

Submission status: Accepted

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

print(min(str(a)*b, str(b)*a))

Submission status: Accepted

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

print(min(str(a)*b,str(b)*a))

Submission status: Accepted

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

a1 = 0
for i in range(b):
  a1 = a1*10 + a
  
b1 = 0
for i in range(a):
  b1 = b1*10 + b
  
print(max(a1,b1))

Submission status: Accepted

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

if a>b:
    for i in range(a):
        print(b,end='')
else:
    for i in range(b):
        print(a,end='')

Submission status: Accepted

Solution code:
a,b=list(map(int,input().split()))
if a<b:
  for i in range(b):
    print(a, end="")
else:
  for i in range(a):
    print(b, end="")

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))
print(sorted([str(a)*b, str(b)*a])[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
c = min(a,b)
d = max(a,b)
A=[str(c)]*d
print("".join(A))

Submission status: Accepted

Solution code:
import io
import math

alpha, beta = map(int, input().split())
 
if str(alpha) * beta < str(beta) * alpha:
    print(str(alpha) * beta)
    
else:
    print(str(beta) * alpha)

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
if n > m:
    print(str(m)*n)
else:
    print(str(n)*m)

Submission status: Accepted

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

Submission status: Accepted

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

astr = str(a) * b
bstr = str(b) * a

if astr < bstr:
  print(astr)
else:
  print(bstr)

Submission status: Accepted

Solution code:
#B
ab = input().split(' ')
a = int(ab[0]) ; b = int(ab[1])
if a < b:
    print(str(a) * b)
else:
    print(str(b) * a)

Submission status: Accepted

Solution code:
a,b=[str(s) for s in input().split(" ")]

A=a*int(b)
B=b*int(a)

Ans=[]
Ans.append(A)
Ans.append(B)

Ans.sort()

print(Ans[0])

Submission status: Accepted

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

Submission status: Accepted

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

A = str(a)*b
B = str(b)*a

if A <= B:
    print(A)
else:
    print(B)

Submission status: Accepted

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

if M>N:
    print(str(N)*M)
else:
    print(str(M)*N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


string = ""
if a > b:
  b = str(b)
  for i in range(a):
    string += b
else:
  a = str(a)
  for i in range(b):
    string += a
print(string)

Submission status: Accepted

Solution code:
str=list(input().split())
cal=[int(s) for s in str]

str[0]+=str[0]*(cal[1]-1)
str[1]+=str[1]*(cal[0]-1)

str.sort()
print(str[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
x = []
if a >= b:
    for i in range(a):
        x.append(b)
else:
    for i in range(b):
        x.append(a)
# print(x)
print("".join(map(str, x)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputted = input().split()
a = inputted[0]
b = inputted[1]

ab = a * int(b)
ba = b * int(a)

answer = ab if a <= b else ba

print(answer)

Submission status: Accepted

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

lst = list()

lst.append(a * int(b))
lst.append(b * int(a))

print(sorted(lst)[0])

Submission status: Accepted

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

s = str(min(a,b)) * max(a, b);

print(s);

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
S=[]

for i in range(max(A,B)):
    S.append(min(A,B))

print(*S,sep="")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
s_a = ''.join([str(a) for _ in range(b)])
s_b = ''.join([str(b) for _ in range(a)])
if a < b:
    print(s_a)
else:
    print(s_b)

Submission status: Accepted

Solution code:
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B = sl()
    AB = ''
    BA = ''
    for _ in range(int(B)):
        AB += A
    for _ in range(int(A)):
        BA += B
    print(AB if AB < BA else BA)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
a = str(x) * y
b = str(y) * x
li = [a, b]
li.sort()
print(li[0])

Submission status: Accepted

Solution code:
lis= list(map(str,input().split()))

lis.sort()
slist = [lis[0] for i in range(int(lis[1]))]
print("".join(slist))

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A, B = lr()
if B < A:
    A, B = B, A
answer = str(A) * B
print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b=INTM()
    print(str(min(a,b))*max(a,b))
if __name__ == '__main__':
    do()

Submission status: Accepted

Solution code:
p,q= input().split()
a,b =(int(p), int(q))
if a <= b:
    print(p *b)
else:
    print(q * a)

Submission status: Accepted

Solution code:
[a,b] = [int(x) for x in input().split()]

if a <= b:
    print('{}'.format(a)*b) 
else:
    print('{}'.format(b)*a)

Submission status: Accepted

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

aa = int(a*int(b))
bb = int(b*int(a))

if aa >= bb:
  print(str(aa))
else:
  print(str(bb))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = list(map(str,input().split()))
a = int(A)
b = int(B)

S = A * b
T = B * a
s = int(S)
t = int(T)

if s<t:
    print(t)
if s>=t:
    print(s)

Submission status: Accepted

Solution code:
a=input().split();print(min(a)*int(max(a)))

Submission status: Accepted

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

if x==y:
    print(str(x)*y)
else:
    print(str(min(x,y)) * max(x,y))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=input().split()
x=a*int(b)
y=b*int(a)

if int(a)<=int(b):
    print(x)
else:
    print(y)

Submission status: Accepted

Solution code:
a,b=input().split()
x=a*int(b)
y=b*int(a)

if int(a)<=int(b):
    print(x)
elif int(a)>int(b):
    print(y)

Submission status: Accepted

Solution code:
A,B=map(int,input().split());print(str(min(A,B))*max(A,B))

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
print(sorted([''.join([str(a)]*b), ''.join([str(b)]*a)])[0])

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
A=str(a)*b
B=str(b)*a
l=[A,B]

l.sort()

print(l[0])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b = map(int, input().split())
print(str(b) * a) if a > b else print(str(a) * b)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a == b:
	print(str(a)*a)
elif a>b:
	print(str(b)*a)
else:
	print(str(a)*b)

Submission status: Accepted

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

if a < b:
    small = a
    large = b
else:
    small = b
    large = a

for i in range(large):
    print(small, end="")
print()

Submission status: Accepted

Solution code:
def solve():
    a,b = input().split()
    cnt_a = int(a)
    cnt_b = int(b)
    tmpa = a*cnt_b
    tmpb=b*cnt_a
    res = min(tmpa,tmpb)
    print(res)
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c = str(a) * b
d = str(b) * a
print(min(c,d))

Submission status: Accepted

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

c = min(a,b)
d = max(a,b)
s= ''
for i in range(d):
  s+=str(c)
  
print(s)

Submission status: Accepted

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

mojia = list([a]*b)
mojib = list([b]*a)

if a <= b:
    ma = map(str, mojia)
    print("".join(ma))
else:
    mb = map(str, mojib)
    print("".join(mb))

Submission status: Accepted

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

Submission status: Accepted

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

if a>b:
  B=0
  c=1
  for i in range(a):
    B+=b*c
    c=c*10
  print(B)
else:
  A=0
  c=1
  for i in range(b):
    A+=a*c
    c=c*10
  print(A)

Submission status: Accepted

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

if a<b:
  print(str(a)*b)
if a>=b:
  print(str(b)*a)

Submission status: Accepted

Solution code:
ab=list(map(int,input().strip().split()))
a=ab[0]
b=ab[1]

if a<=b:
    print(int(str(a)*b))
else:
    print(int(str(b)*a))

Submission status: Accepted

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

Submission status: Accepted

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

if min(a, b) == a:
    print(a * int(b))
else:
    print(b * int(a))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
a, b = sorted([a, b])
ans = [str(a)] * b
print(''.join(ans))

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a < b:
    print(str(a)*b)
    
if a >=  b:
    print(str(b)*a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(*[min(a, b)] * max(a, b), sep='')

Submission status: Accepted

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

Submission status: Accepted

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

sa=""
for i in range(b):
    sa+=str(a)

sb=""
for i in range(a):
    sb+=str(b)

L=[sa,sb]
L=sorted(L)
print(L[0])

Submission status: Accepted

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


def solve(a: int, b: int):
    print(sorted([a*int(b), b*int(a)])[0])
    return


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a < b:
  print(''.join([str(a) for _ in range(b)]))
else:
  print(''.join([str(b) for _ in range(a)]))

Submission status: Accepted

Solution code:
N, M = input().split()
if N*int(M) < M*int(N):
  print(N*int(M))
else:
  print(M*int(N))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a == b:
    print(a*str(a))
elif a>b:
    print(a*str(b))
else:
    print(b*str(a))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
l=[]
l.append(str(a)*b)
l.append(str(b)*a)
l.sort()
print(l[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    s = ""
    if a > b:
        for i in range(a):
            s += str(b)
    else:
        for i in range(b):
            s += str(a)
    print(s)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
A=str(a)
B=str(b)
x=A*b
y=B*a
print(min(x,y))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ab = str(a)*b
ba = str(b)*a
if ab > ba:
    print(ba)
else:
    print(ab)

Submission status: Accepted

Solution code:
a, b = input().split()
tempa = a * int(b)
tempb = b * int(a)
test = [tempa, tempb]
test = sorted(test)
print(test[0])

Submission status: Accepted

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

aa = ''
bb = ''
for i in range(b):
    aa += sa
for i in range(a):
    bb += sb

if aa <= bb:
    print(aa)
else:
    print(bb)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
A = str(a) * b
B = str(b) * a
print(A if A < B else B)

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    A = ""
    B = ""
    for _ in range(b):
        A += str(a)

    for _ in range(a):
        B += str(b)

    if int(A) >= int(B):
        print(A)
    else:
        print(B)

main()

Submission status: Accepted

Solution code:
def resolve():

    a,b=map(int,input().split())
    if a>b:
        a,b=b,a
    for i in range(b):
        print(a,end='')
    print()

resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = input().split()
ast = a * int(b)
bst = b * int(a)
print(ast if ast < bst else bst)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def solve():
    a, b = input().split()
    D = [a * int(b), b * int(a)]
    D.sort()
    print(D[0])

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
L = [str(a)*b, str(b)*a]
L.sort()
print(L[0])

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print(''.join(map(str,[min(a,b) for i in range(max(a,b))])))

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
C=int(str(A)*B)
D=int(str(B)*A)
E=[C,D]
F=sorted(E)
print(int(F[1]))

Submission status: Accepted

Solution code:
# Problem B - Comparing Strings

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

# initialization
a_str = str(a) * b
b_str = str(b) * a

# output
if a_str<=b_str:
    print(a_str)
else:
    print(b_str)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
l=["",""]
for i in range(a):
    l[0]=l[0]+str(b)
for i in range(b):
    l[1]=l[1]+str(a)
l.sort()
print(l[0])

Submission status: Accepted

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

if a <= b:
    print(str(a) * b)
else:
    print(str(b) * a)

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
c=str(a)*b
d=str(b)*a
print(c if c<d else d)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

a, b = MAP()
ans1 = ''
ans2 = ''
for i in range(b):
    ans1 += str(a)
for i in range(a):
    ans2 += str(b)
print(min(ans1, ans2))

Submission status: Accepted

Solution code:
a=sorted(list(map(int,input().split())))
print(str(a[0])*a[1])

Submission status: Accepted

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


S = [str(a) * b, str(b) * a]
S.sort()
print(S[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
x = str(a)*b
y = str(b)*a
print(min(x,y))

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
a,b=map(int,input().split())
x=str(a)*b
y=str(b)*a
if x<y:
    print(x)
else:
    print(y)

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

a,b = iim()
print(str(min(a,b))*max(a,b))

Submission status: Accepted

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

Submission status: Accepted

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

    str_ba = str(b) * a
    str_ab = str(a) * b

    if str_ab > str_ba:
        print(str_ba)
    else:
        print(str_ab)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m =list(map(int,input().split()))
if n>m:
    for i in range (n):print(m,end="")
else:
    for i in range(m):print(n,end="")

Submission status: Accepted

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

if a <= b:
    print(str(a)*b)
else:
    print(str(b)*a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 初期入力
a,b = (x for x in input().split(" "))

#
S = [ a*int(b) , b*int(a) ]

S.sort()
print(S[0])

Submission status: Accepted

Solution code:
a, b = input().split()
list = sorted([a * int(b), b * int(a)])
print(list[0])

Submission status: Accepted

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

for i in range(a):
  c+=b*(10**i)

d=0
for j in range(b):
  d+=a*(10**j)

e=c if b<a else d
print(e)

Submission status: Accepted

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

s_a = str(a) * b
s_b = str(b) * a

if s_a < s_b:
    print(s_a)
else:
    print(s_b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':

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

	A = []
	A.append(str(n) * m)
	A.append(str(m) * n)

	A = sorted(A)
	print(A[0])

Submission status: Accepted

Solution code:
ab=input().rstrip().split(" ")
a=int(ab[0])
b=int(ab[1])
string=""
if a>b:
    for i in range(a):
        string=string+str(b)
elif a==b:
    for i in range(a):
        string=string+str(a)
elif a<b:
    for i in range(b):
        string=string+str(a)
print(string)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ab = str(a) * b
ba = str(b) * a
if ab > ba:
  print(ba)
else:
  print(ab)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
a, b = min(a, b), max(a, b)
for i in range(b):
    print(a, end = '')

Submission status: Accepted

Solution code:
a, b = list(map(int,input().split()))
A = [a for _ in range(b)]
B = [b for _ in range(a)]
m = ''.join(map(str,A))
n = ''.join(map(str,B))
list = [m,n]
L = sorted(list)
print(L[0])

Submission status: Accepted

Solution code:
a, b = input().split()
a_b = a * int(b)
b_a = b * int(a)
ans = [a_b, b_a]
ans.sort()
print(ans[0])

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
min_num = min(a,b)
max_num = max(a,b)
str_num = ""
for i in range(max_num):
  str_num = str_num + str(min_num)
print(str_num)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
A = str(a)*b
B = str(b)*a
if A < B:
    print(A)
else:
    print(B)

Submission status: Accepted

Solution code:
#ABC152.B
a,b = map(int,input().split())
a1 = []
b1 = []
if a <= b:
    for i in range(b):
        a1.append(a)
    a1 = [str(m) for m in a1]
    print(''.join(a1))
elif b < a:
    for i in range(a):
        b1.append(b)
    b1 = [str(m) for m in b1]
    print(''.join(b1))

Submission status: Accepted

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

Submission status: Accepted

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

if a == b:
    print(str(a)*b)
elif a > b:
    print(str(b)*a)
else:
    print(str(a)*b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a<b:
  for _ in range(b):
    print(a,end="")
else:
  for _ in range(a):
    print(b,end="")

Submission status: Accepted

Solution code:
n,m=input().split()
if int(n)>int(m):
    print(m*int(n))
else:
    print(n*int(m))

Submission status: Accepted

Solution code:
a,b=[int(s) for s in input().split()]
m=min([a,b])
M=max([a,b])
print(m*(10**M-1)//9)

Submission status: Accepted

Solution code:
a,b = input().split()
 
a_ = a * int(b)
b_ = b * int(a)
 
moji = sorted([a_ ,b_])
 
print(moji[0])

Submission status: Accepted

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


def resolve():
    a, b = map(int, input().split())
    str_a = str(a)
    str_b = str(b)

    ans = ""
    if a <= b:
        for i in range(b):
            ans += str_a
    else:
        for i in range(a):
            ans += str_b

    print(ans)



if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
a,b = [int(i) for i in input().split()]
if (a > b) :
    a,b = b,a

print(str(a) * b)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

a, b = map(int, input().split())

if a >= b : 
    num_large = a
    num_small = str(b)
else : 
    num_large = b
    num_small = str(a)

print(num_small * num_large)

Submission status: Accepted

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

if n > m:
    for i in range(n):
        print(str(m),end="")
elif n <= m:
    for i in range(m):
        print(str(n),end="")

Submission status: Accepted

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

if a>=b:
  small=b
  large=a
else:
  small=a
  large=b
  
print(str(small)*large)

Submission status: Accepted

Solution code:
data = input().split()
 
a = data[0]
b = data[1]
 
ans = min(a, b) * int(max(a, b))
 
print(ans)

Submission status: Accepted

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

if a>=b:
  for i in range(a):
    ans+=str(b)

else:
  for i in range(b):
    ans+=str(a)
    
print(ans)

Submission status: Accepted

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

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

if a < b:
	print(str(a) * b)
else:
	print(str(b) * a)

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))
aaa = str(a) * b
bbb = str(b) * a
if aaa > bbb:
  print(bbb)
else:
  print(aaa)

Submission status: Accepted

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

Min = min(a, b)
Max = max(a, b)

print(str(Min)*Max)

Submission status: Accepted

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

a_s = str(a) * b
b_s = str(b) * a

ls = [a_s,b_s]
ls.sort()

print(ls[0])

Submission status: Accepted

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

if a <= b:
    a = str(a)
    print(a*b)
else:
    b = str(b)
    print(b*a)

Submission status: Accepted

Solution code:
a, b = input().split()
l = [a * int(b), b * int(a)]

print(sorted(l)[0])

Submission status: Accepted

Solution code:
a,b = input().split()
aa = ''
bb = ''
for i in range(int(b)):aa+=a
for i in range(int(a)):bb+=b
if ord(a) < ord(b):
    print(int(aa))
else:
    print(int(bb))

Submission status: Accepted

Solution code:
n, m = input().split()
if n*int(m) < m*int(n):
  print(n*int(m))
else:
  print(m*int(n))

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
	res = list(sys.stdin.readline())
	if res[-1] == "\n":
		return res[:-1]
	return res


def IR(n):
	return [I() for i in range(n)]


def LIR(n):
	return [LI() for i in range(n)]


def SR(n):
	return [S() for i in range(n)]


def LSR(n):
	return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
	a, b = LI()
	ansa = str(a) * b
	ansb = str(b) * a
	print(min(ansa,ansb))
	return


# Solve
if __name__ == "__main__":
	solve()

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
s = ''
if a < b:
    for i in range(b):
        s = s + str(a)
    print(int(s))
else:
    for i in range(a):
        s = s + str(b)
    print(int(s))