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=raw_input().split()
A = int(a * int(b))
B = int(b * int(a))
if A>=B:
    print(A)
else:
    print(B)

Submission status: Accepted

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

ansA = ""
ansB = ""
for countA in range(B):
    ansA = ansA + str(A)
for countB in range(A):
    ansB = ansB + str(B)

list = [str(ansA),str(ansB)]
list.sort()

print(list[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())
AB = int(str(a) * b)
BA = int(str(b) * a)
if AB <= BA:
    print(BA)
else:
    print(AB)

Submission status: Accepted

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

a_con = str(a) * b
b_con = str(b) * a

l = [a_con, b_con]
l.sort()

print(l[0])

Submission status: Accepted

Solution code:
lis = list(map(int,input().split()))
lis = sorted(lis)
output = ''
for _ in range(lis[1]):
  output += str(lis[0])
print(output)

Submission status: Accepted

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

tmp = [int(a) * b, a * int(b)]
tmp.sort()

print(tmp[0])

Submission status: Accepted

Solution code:
import sys
import math
a,b= map(int,input().split())
#li= [int(x) for x in 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:
  ans = str(a) * b
else:
  ans = str(b) * a
  
print(ans)

Submission status: Accepted

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

if x>y:print(x)
else:print(y)

Submission status: Accepted

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

Submission status: Accepted

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

if x>y:print(x)
else:print(y)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Tue Mar  3 23:58:11 2020

@author: Kanaru Sato
"""

a,b = input().split()

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

list = [A,B]
list.sort()

print(list[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

an = a * int(b)
bn = b * int(a)
print(an if an <= bn else bn)

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

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

if a > b:
  ans = [str(b)] * a
else:
  ans = [str(a)] * b
  
print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = [int(i) for i in input().split(" ")]
ans = []
ans.append(str(a)*b)
ans.append(str(b)*a)
ans = sorted(ans)
print(ans[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,M=map(int,input().split())
ans=str(N)*M
if N>M:
  ans=str(M)*N
print(ans)

Submission status: Accepted

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

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

a2 = int(str(a)*b)
b2 = int(str(b)*a)

print(max(a2,b2))

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:
input_numbers = list(map(int,input().split()))
a = input_numbers[0]
b = input_numbers[1]
A = a
B = b
x = 0
y = 0
while A > 0:
  x += 10 ** (A-1) * b
  A -= 1
while B > 0:
  y += 10 ** (B-1) * a
  B -= 1
if x > y:
  print(x)
else:
  print(y)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

l.append(str(a)*b)
l.append(str(b)*a)

l_new = sorted(l)
print(l_new[0])

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
tmp1, tmp2 = '', ''
for _ in range(b):
    tmp1 += str(a)
for _ in range(a):
    tmp2 += str(b)

tmp3 = [tmp1, tmp2]
tmp3.sort()
print(tmp3[0])

Submission status: Accepted

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

Submission status: Accepted

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

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

print(min(aa, bb))

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

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
a = sorted(a)
num = []
for i in range(a[1]):
  num.append(a[0])
  num = list(map(str,num))
num = "".join(num)
print(num)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a<b:
  min = a
  max = b
else:
  min = b
  max = a
c =[min for i in range(max)]
d = map(str,c)
l = "".join(d)
print(l)

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())
aa = [min(a, b)] * max(a, b)
print("".join(map(str, aa)))

Submission status: Accepted

Solution code:
# import math
# from fractions import gcd

import numpy as np
# import scipy as scp

# 入力の受け取り
a,b = map(int,input().split())

stra = str(a)*b
strb = str(b)*a

ans = min(stra,strb)

print(ans)

Submission status: Accepted

Solution code:
Ns = list(map(int,input().split()))  #Numbers

L=[]
for i in range(max(Ns)):
    L.append(min(Ns))
result = ''.join([str(n) for n in L])
print(int(result))

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:
a, b = map(int, input().split())
if a == b:
  for i in range(a):
    print("{}".format(b), end="")
elif a > b:
  for i in range(a):
    print("{}".format(b), end="")
else:
  for i in range(b):
    print("{}".format(a), end="")

Submission status: Accepted

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

Submission status: Accepted

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

if int((str(a)*b)[0])>=int((str(b)*a)[0]):
    print(str(b)*a)
else:
    print(str(a)*b)

Submission status: Accepted

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

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

list = [A,B]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=sorted(list(map(int,input().split())))
print(a*(10**b-1)//9)

Submission status: Accepted

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

print(ans)

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:
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')

def main():
    a, b = list(map(int,input().split()))
    if a > b:
        a, b = b, a

    print(str(a)*b)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

str1 = a * int(b)
str2 = b * int(a)

print( min(str1, str2))

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())
ans=""
if a<=b:
    ans+=str(a)*b
else:
    ans+=str(b)*a
print(ans)

Submission status: Accepted

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

ans = ['', '']
for i in range(b):
    ans[0] += str(a)

b_ans = ''
for i in range(a):
    ans[1] += str(b)

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

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    a, b = list(map(str, readline().rstrip().decode('utf-8').split()))
    if a * int(b) < b * int(a):
        print(a * int(b))
    else:
        print(b * int(a))


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read 
input = sys.stdin.buffer.readline
def inputS(): return input().rstrip().decode()
readlines = sys.stdin.buffer.readlines 

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

ans = sorted([str(A)*B, str(B)*A])
print(ans[0])

Submission status: Accepted

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

    array = []
    array.append(str(a)*b)
    array.append(str(b)*a)
    array = sorted(array)
    print(array[0])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

aa = ""
bb = ""

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

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

aaa = int(aa)
bbb = int(bb)

if aaa <= bbb:
    print(bbb)
else:
    print(aaa)

Submission status: Accepted

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

aa = str(a)*b

bb = str(b)*a

print(min(aa,bb))

Submission status: Accepted

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

print(lista[0])

Submission status: Accepted

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

ab =[]
ba = []

for i in range(b):
  ab.append(str(a))
  
for i in range(a):
  ba.append(str(b))

ab.sort()
ba.sort()

if ab < ba:
  print("".join(ab))
else: 
  print("".join(ba))

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())
aa=str(a)*b
bb=str(b)*a
print(aa) if aa<=bb else print(bb)

Submission status: Accepted

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

Submission status: Accepted

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

if int(a) < int(b):
    A = ''
    for _ in range(b):
        A += str(a)
    print(A)
else:
    B = ''
    for _ in range(a):
        B += str(b)
    print(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 str(a)*b > str(b)*a:
    print(str(b)*a)
else:
    print(str(a)*b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#/usr/bin/python3
if __name__ == '__main__':
    a, b = [int(x) for x in input().split(' ')]
    if a < b:
        a, b = b, a
    print(str(b) * a)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
x = []
y = []
for i in range(a):
    x.append(str(b))
for i in range(b):
    y.append(str(a))
x = "".join(x)
y = "".join(y)
dic = [x, y]
dic.sort()
print(dic[0])

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split(' ')))
print_val = min(a,b)
count_val = max(a,b)
S = ''
for i in range(count_val):
    S += str(print_val)
print(S)

Submission status: Accepted

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

S = [a * int(b), b * int(a)]
S.sort()

print(S[0])

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
s = 0
if a <= b:
    for i in range(0,b):
        s += a*(10**i)

else:
    for i in range(0,a):
        s += b*(10**i)

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

#############
# Libraries #
#############

import math

#############
# Constants #
#############

MOD = 10**9 +7
INF = float('inf')

#############
# Functions #
#############

kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

#############
# Main 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())
result = ''
if a > b:
  for i in range(a):
    result+=str(b)
elif a <= b:
  for i in range(b):
    result+=str(a)
print(result)

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(b)*a)
else:
    print(str(a)*b)

Submission status: Accepted

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

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

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

if aStr > bStr:
    print(bStr)
else:
    print(aStr)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
x=0
if a>b:
    temp=a
    a=b
    b=temp
for i in range(b):
    x+=(10**i)*a
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

if M > N:
  body = N
  numm = M
else:
  body = M
  numm = N

ret = ''
for i in range(numm):
  ret += str(body)
print(ret)

Submission status: Accepted

Solution code:
a,b=input().split()
c=[0]*2
c[0],c[1]=a*int(b),b*int(a)
c.sort()
print(c[0])

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(1000000)
input = lambda: sys.stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
# ANSHUL GAUTAM
# IIIT-D

from math import *
from copy import *
from string import *				# alpha = ascii_lowercase
from random import *				# l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from sys import stdin
from sys import maxsize
from operator import *				# d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter		# d = dict(Counter(l))
from collections import defaultdict # d = defaultdict(list)

'''

'''

def solve(l):
	n = len(l)
	

a,b = list(map(int, stdin.readline().rstrip().split()))
aa = str(a)*b
ab = str(b)*a
print(min(aa,ab))

Submission status: Accepted

Solution code:
ab = input().split(' ')
print(min(ab[0]*int(ab[1]), ab[1]*int(ab[0])))

Submission status: Accepted

Solution code:
a, b = list(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())

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

Submission status: Accepted

Solution code:
a, b = [int(n) for n in input().split()]
sa = str(a)*b
sb = str(b)*a
print(min(sa, sb))

Submission status: Accepted

Solution code:
data = list(input().split(' '))
a = data[0]
b = data[1]
if a <= b :
  s = str(a) * int(b)
else :
  s = str(b) * int(a)
print(s)

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

input = sys.stdin.readline

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

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

Submission status: Accepted

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

Submission status: Accepted

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

A=str(a)*int(b)
B=str(b)*int(a)
ans=sorted([A,B])

print(ans[0])

Submission status: Accepted

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

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

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

a_b = ""
b_a = ""

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

for ii in range(b):
    a_b = str(a_b) + str(a)
    
if a==b:
    print(a_b)
elif a>b:
    print(b_a)
else:
    print(a_b)

Submission status: Accepted

Solution code:
import numpy as np

num = np.array(list(map(int, input().split())))
num_1 = 0

if num[0] > num[1]:
  for i in range(0,num[0]) :
    num_1 = num_1 + num[1]*(10**i)
else:
  for i in range(0,num[1]) :
    num_1 = num_1 + num[0]*(10**i)
    
print(num_1)

Submission status: Accepted

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

a1 = ''
b1 = ''

for i in range(b):
    a1 = a1 + str(a)
for i in range(a):
    b1 = b1 + str(b)

if a1 < b1:
    print(a1)
else:
    print(b1)

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

l = sorted([a * int(b), b * int(a)])

print(l[0])

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
x, y = 0, 0
for i in range(b):
    x += a * (10 ** i)
for i in range(a):
    y += b * (10 ** i)
if a <= b:
    print(x)
else:
    print(y)

Submission status: Accepted

Solution code:
x=input().split()
a=int(x[0])
b=int(x[1])
res=''
c=min(a,b)
d=max(a,b)
for k in range(d):
  res+=str(c)
print(res)

Submission status: Accepted

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

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 = 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(b)*a)
else:
  print(str(a)*b)

Submission status: Accepted

Solution code:
a,b = sorted(input().split())
print(a*int(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:
a, b = map(int, input().split())

str1_list = []
str2_list = []

for i in range(b):
    str1_list.append(str(a))

for i in range(a):
    str2_list.append(str(b))

str1 = ''.join(str1_list)
str2 = ''.join(str2_list)

if(str1 < str2):
    print(str1)
else:
    print(str2)

Submission status: Accepted

Solution code:
a, b = input().split(' ')
if str(a) >= str(b):
  print( str(b) * int(a))
else:
  print( str(a) * int(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 = input().split()

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
s,t=min(a,b),max(a,b)
ans=''
for i in range(t):
  ans+=str(s)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = input().split()
A = a*int(b)
B = b*int(a)

if A > B:
    print(B)
elif A < B:
    print(A)
else:
    print(A)

Submission status: Accepted

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


a = N[0]*int(N[1])
b = N[1]*int(N[0])
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:
    print(str(B) * A)

Submission status: Accepted

Solution code:
a, b = [x for x in input().split()]
a, b = int(a * int(b)), int(b * int(a))
if a > b:
  print(a)
else:
  print(b)

Submission status: Accepted

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


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

print(output)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
a,b=map(int,input().split())
if a>b:
    a,b=b,a
print(str(a)*b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str1,str2=input().split()

if str1 >= str2:
    n = str1
    m = str2
else:
    n = str2
    m = str1

str3=""
i = 1
while i <= int(n):
    str3=str3+m
    i+=1

print(str3)

Submission status: Accepted

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

Submission status: Accepted

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

l = []
l.append(a*int(b))
l.append(b*int(a))

l.sort()

print(l[0])

Submission status: Accepted

Solution code:
number = input().split(" ")
ans = []
a = number[0]*int(number[1])
b = number[1]*int(number[0])
ans.append(a)
ans.append(b)
ans.sort()
print(ans[0])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc152/tasks/abc152_b

a, b = [int(x) for x in 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())
if a==b:
    print(str(a)*b)
elif 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 = str(b)
if a > b:
    print(B*a)
elif b > a:
    print(A*b)
else:
    print(A*b)

Submission status: Accepted

Solution code:
def get(text,n):
    ans = [""]*n
    i = 0
    for x in text:
        if x==" ":
            i = i + 1
        else:
            ans[i] = ans[i]+x
    return ans

ab = input()

a = get(ab,2)[0]
b = get(ab,2)[1]

t1 = a * int(b)
t2 = b * int(a)

dic = [t1,t2]
dic.sort()
print(dic[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(str(b)*a) if a > b else int(str(a)*b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
a1=str(a)
b1=str(b)
if a<=b:
    print(a1*b)
else:
    print(b1*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 = input().split()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

N.sort()

print(str(N[0])*N[1])

Submission status: Accepted

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

a = N.sort()

print(str(N[0])*N[1])

Submission status: Accepted

Solution code:
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:
a,b=map(str, input().split()) 
box = [a*int(b),b*int(a)]
print(sorted(box)[0])

Submission status: Accepted

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

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())
if a > b:
    print(str(b)*a)
else: 
    print(str(a)*b)

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

for i in range(b):
    A = A+(10**i)*a
i=0
for i in range(a):
    B = B+(10**i)*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)
elif a>b:
  print(str(b)*a)
elif a<b:
  print(str(a)*b)

Submission status: Accepted

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

s = a*(int(b))
t = b*(int(a))
print(min(s, 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:
inp = input().split()
a, b = int(inp[0]), int(inp[1])
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())
if a>b:
  for i in range(a):
    print(b,end="")
else:
  for h in range(b):
    print(a,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 = input().split()
print(min(a*int(b),b*int(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 = map(int, input().split())

aa = str(a) * b
bb = str(b) * a
l = [aa,bb]
l.sort()
print(l[0])

Submission status: Accepted

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

a="";b=""
a=str(A)*B;b=str(B)*A
if A<=B:
    print(a)
elif A>B:
    print(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())#整数を複数の変数に格納

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

Submission status: Accepted

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