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

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:
L=list(map(int,input().split()))
print(str(min(L))*max(L))

Submission status: Accepted

Solution code:
na, nb = map(int,input().split())
astr = str(na)*nb
bstr = str(nb)*na

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

Submission status: Accepted

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

a = int(a)
b = int(b)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

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


print(''.join([str(min(a, b))] * max(a, b)))

Submission status: Accepted

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


def solve(a: int, b: int):
    a = str(a)
    b = str(b)

    r = a * int(b)
    r2 = b * int(a)

    result = sorted([r, r2])[0]
    print(result)
    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 = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    solve(a, b)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x,y = map(int,input().split())
word = ""
if x < y:
  for i in range(y):
    word += str(x)
else:
  for i in range(x):
    word += str(y)

print(word)

Submission status: Accepted

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

Submission status: Accepted

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

if a != 1:
    for i in range(int(b)-1):
        aa = aa + a
if b != 1:
    for j in range(int(a)-1):
        bb = bb + b

if a < b:
    print(aa)
else:
    print(bb)

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):
  out = str(a)
  for i in range(1, b):
    out += str(a)
  print(out)
else:
  out = str(b)
  for i in range(1, a):
    out += str(b)
  print(out)

Submission status: Accepted

Solution code:
import sys

a, b = map(int, input().split())
a_ = int(str(a)*b)
b_ = int(str(b)*a)
la = len(str(a_))
lb = len(str(b_))
if a_ == b_:
    print(a_)
    sys.exit()
for i in range(min(la, lb)):
    ai = str(a_)[i]
    bi = str(b_)[i]
    if ai > bi:
        print(b_)
        sys.exit()
    elif ai < bi:
        print(a_)
        sys.exit()

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 = map(int,input().split())
x = ''
if a > b :
    for i in range(a):
        x =  x + str(b)
    print(x)
else:
    for i in range(b):
        x =  x + str(a)
    print(x)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

s=str(min(a,b))
m=max(a,b)
print(s*m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(str, input().split())
x = ''
y = ''
for i in range(int(b)):
  x += a
for i in range(int(a)):
  y += b

if str(x) < str(y):
  print(x)
else:
  print(y)

Submission status: Accepted

Solution code:
def main():
    a, b = [int(_) for _ in input().split()]
    x1 = int(str(a) * b)
    x2 = int(str(b) * a)
    print(max(x1, x2))
main()

Submission status: Accepted

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

list = []

c = a*int(b)
d = b*int(a)

list.append(c)
list.append(d)

list = sorted(list)

print(list[0])

Submission status: Accepted

Solution code:
#python3
a, b = map(int, input().split())
seq =''
sa = seq.join([str(a)]*b)
sb = seq.join([str(b)*a])

ans = min(sa, sb)

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = ""



if a < b:
    for i in range(b):
        ans = ans + aa
elif a == b:
    for i in range(a):
        ans = ans + bb
else:
    for i in range(a):
        ans = ans + bb
print(ans)

Submission status: Accepted

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

A = "{}".format(a)
A_ = A * b

B = "{}".format(b)
B_ = B * a

List = [B_, A_]
sorted_List = List.sort()

print(List[0])

Submission status: Accepted

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

c = a
d = b

for i in range(int(b) - 1):
    c += a
    
for j in range(int(a) - 1):
    d += b

if int(c) > int(d):
    print(int(c))
else:
    print(int(d))

Submission status: Accepted

Solution code:
import math,sys
from collections import Counter, defaultdict, deque
from sys import stdin, stdout
input = stdin.readline
lili=lambda:list(map(int,sys.stdin.readlines()))
li = lambda:list(map(int,input().split()))
#for deque append(),pop(),appendleft(),popleft(),count()
I=lambda:int(input())
S=lambda:input().strip()
mod = 1000000007

a,b=li()
s=""
t=""
for i in range(0,b):
    s=s+str(a)
for i in range(0,a):
    t=t+str(b)
s=int(s)
t=int(t)

print(max(s,t))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
c=[]
d=[]
if a<=b:
  for i in range(b):
    c.append(a)
else:
  for i in range(a):
    c.append(b)

print(''.join([str(n) for n in c]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(str(sm)*bg)

Submission status: Accepted

Solution code:
arr = [int(x) for x in raw_input().split()] 

a, b = arr[0], arr[1]

sa = str(a) * b
sb = str(b) * a

if sa < sb:
	print sa
else:
	print sb

Submission status: Accepted

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

if a_s == b_s:
  print(a_s)
elif a_s < b_s:
  print(a_s)
else:
  print(b_s)

Submission status: Accepted

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

Submission status: Accepted

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


ab_str = str(a) * b
ba_str = str(b) * a

#print(ab_str)
#print(ba_str)

if ab_str >= ba_str:
    print(ba_str)
else:
    print(ab_str)

Submission status: Accepted

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

Submission status: Accepted

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

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

if a_s > b_s:
  print(b_s)
else:
  print(a_s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = [int(i) for i in input().split()]
print(str(min(n)) * max(n))

Submission status: Accepted

Solution code:
u = input()

a = u[0];
b = u[2];
at = int(a)
bt = int(b)

x = b*at
y = a*bt

if x <= y:
  print(x)

else:
 print(y)

Submission status: Accepted

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

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

print(min(a_str, b_str))

Submission status: Accepted

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

s1 = ''
s2 = ''

for i in range(0, a):
    s1 += str(b)
for i in range(0, b):
    s2 += str(a)

if s1 <= s2:
    print(s1)
else:
    print(s2)

Submission status: Accepted

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

small = min(a, b)
large = max(a, b)

ans = ''

for i in range(large):
    ans += str(small)

print(ans)

Submission status: Accepted

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

x = a * int(b)
y = b * int(a)

print(sorted([x, y])[0])

Submission status: Accepted

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

Dic = [a * int(b), b * int(a)]
Dic.sort()
ans = Dic[0]
print(ans)

Submission status: Accepted

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

m = 0


if a[1] <= a[0]:
  for i in range(a[0]):
    m += a[1]*(10**i)
else:
  for i in range(a[1]):
    m += a[0]*(10**i)

  
print(m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
count = 1
a_s = 0
b_s = 0
for i in range(b):
    a_s += a*count
    count = 10**(i+1)
count = 1
for i in range(a):
    b_s += b*count
    count = 10**(i+1)
if a > b:
    print(str(b_s))
else:
    print(str(a_s))

Submission status: Accepted

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

a_b = a * str(b)
b_a = b * str(a)

if (a_b < b_a):
    print(a_b)
else:
    print(b_a)

Submission status: Accepted

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

u = max(a,b)
s = str(max(a,b))
t = str(min(a,b))

ans = t
for i in range(u-1):
    ans = ans + t

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

#print(A)
#print(B)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().rstrip().split()
A = int(a[0])
B = int(a[1])
if A > B:
  print(str(B)*A)
else:
  print(str(A)*B)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# B - Comparing Strings
import  sys

def solve152B(a, b):
	minI, maxI = a, b
	if a > b:
		maxI, minI = a, b
	
	st = ""
	for i in range(maxI):
		st += str(minI)
	
	print(st)


if __name__ == "__main__":
	a, b = list(map(int, input().split()))

	solve152B(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:
from sys import stdin


def fetch_one_line():
    return stdin.readline().rstrip()


def fetch_int_input():
    return [int(s) for s in fetch_one_line().split()]


def fetch_inputs(times):
    return [fetch_one_line() for _ in range(times)]


def fetch_int_inputs(times):
    return [[int(s) for s in fetch_one_line()] for _ in range(times)]


def fetch_ints_inputs(times):
    return [fetch_int_input() for _ in range(times)]

a, b = fetch_int_input()

strs = []
strs.append("".join([str(a) for _ in range(b)]))
strs.append("".join([str(b) for _ in range(a)]))

print(sorted(strs)[0])

Submission status: Accepted

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

if N>M:
  for i in range(N):
    a+=M*(10**i)
else:
   for i in range(M):
    a+=N*(10**i)
print(a)

Submission status: Accepted

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

c = 0
d = 0

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

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(str, input().lower().split())
str1 = ""
str2 = ""
for i in range(int(b)):
    str1 = str1 + a

for i in range(int(a)):
    str2 = str2 + b

if str1 < str2:
    print(str1)
elif str1 > str2:
    print(str2)
elif str1 == str2:
    print(str1)

Submission status: Accepted

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

myans = ''
if a > b:
    for i in range(a):
        myans += str(b)
elif b > a:
    for i in range(b):
        myans += str(a)
else:
    for i in range(a):
        myans += str(a)
    
print(myans)

Submission status: Accepted

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

strA = str(a) * b
strB = str(b) * a

print(min(strA, strB))

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:
a, b = [int(x) for x in input().split()]
print(str(a)*a) if a == b else print(str(min(a, b))*max(a, b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ab = input().split()
a, b = ab[0], ab[1]
if a*int(b) > b*int(a):
  print(b*int(a))
else:
  print(a*int(b))

Submission status: Accepted

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

Submission status: Accepted

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

print(min(s1,s2))

Submission status: Accepted

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

output_str = ""
if a < b:
  for s in range(0,b):
    output_str = output_str + str(a)
else:
  for s in range(0,a):
    output_str = output_str + str(b)

print(output_str)

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
    l = [str(b) for i in range(a)]
    print(''.join(l))
else:
    l = [str(a) for i in range(b)]
    print(''.join(l))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    b, c = map(int, input().split())
    b1 =""
    c1 = ""
    for i in range(c):
        b1 = b1 + str(b)

    for i in range(b):
        c1 = c1 + str(c)

    if int(b) < int(c):
        print(b1)
    else:
        print(c1)

Submission status: Accepted

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

Submission status: Accepted

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

	l = []
	l.append(str(a)*b)
	l.append(str(b)*a)
	l.sort()
	print(l[0])

	

if __name__ == '__main__':
	main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

m = max(ab, ba)

print(str(m))

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
c=min([a,b])
d=max([a,b])
ans=0
for i in range(d):
    ans=ans+c*(10**i)
print(ans)

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0): # 四捨五入
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def round_up(a): # 切り上げ
    return int(a + 0.9)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    a,b = map(int,input().split())
    ans = []
    if a < b:
        for i in range(b):
            ans.append(str(a))
    else:
        for i in range(a):
            ans.append(str(b))
    print(''.join(ans))
    return

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
ansa = ""
ansb = ""
for i in range(a):
    ansb +=str(b)
for i in range(b):
    ansa +=str(a)
print(min(ansa,ansb))

Submission status: Accepted

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

txt1 = a * int(b)
txt2 = b * int(a)

print(sorted([txt1, txt2])[0])

Submission status: Accepted

Solution code:

ab=input().split(" ")
a=ab[0]
b=ab[1]

c1=""
for n in range(int(b)):
    c1=c1+a

c2=""
for n in range(int(a)):
    c2=c2+b

print(min(c1,c2))

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

if int_a>=int_b:
    print(str(int_b)*int_a)
else :
    print(str(int_a)*int_b)

Submission status: Accepted

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

ans_a = ""
ans_b =""
for i in range(a):
    ans_a += str(b)
for j in range(b):
    ans_b += str(a)
    
ans_list = [ans_a,ans_b]
ans_list.sort()

print(ans_list[0])

Submission status: Accepted

Solution code:
def LI():
  return [int(s) for s in input().split()]
a,b = LI()

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

Submission status: Accepted

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

repetitionA = ""
repetitionB = ""

for i in range(int(ab[1])):
    repetitionA += ab[0]

for j in range(int(ab[0])):
    repetitionB += ab[1]

if (int(repetitionA) > int(repetitionB)):
    print(repetitionA)
else:
    print(repetitionB)

Submission status: Accepted

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

def main():
    a, b = input().split()

    aa = "".join([a] * int(b))
    bb = "".join([b] * int(a))

    if int(aa) > int(bb):
        print(aa)
    else:
        print(bb)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

alist = str(a)*b
blist = str(b)*a
result=[alist, blist]
print(min(result))

Submission status: Accepted

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

Submission status: Accepted

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

P = A*int(B)
Q = B*int(A)

if A<B:
    print(P)

else:
    print(Q)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 19 20:54:58 2020

@author: over-
"""

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

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

Submission status: Accepted

Solution code:
N,M = map(int,input().split())
N_str = ""
M_str = ""
for m in range(M):
    N_str += str(N)
for n in range(N):
    M_str += str(M)
print(min(N_str,M_str))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(str(x) * y)

Submission status: Accepted

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

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

Submission status: Accepted

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

an = int(a)
bn = int(b)

print(sorted([a*bn, b*an])[0])

Submission status: Accepted

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

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

if a >= b:
    print(s_b)

else:
    print(s_a)

Submission status: Accepted

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

for i in range(int(a)):
    s2.append(b)
s1 = "".join(s1)
s2 = "".join(s2)

if s1 > s2:
    print(s2)
else:
    print(s1)

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

Submission status: Accepted

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

aa=[]
bb=[]

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

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

str1="".join(aa)
str2="".join(bb)

result=[str1,str2]

result=sorted(result)

print(result[0])

Submission status: Accepted

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

ans = min(a * int(b), b * int(a))
print(ans)

Submission status: Accepted

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

if a<=b:
    A = "".join([str(a)]*b)
    print(A)
else:
    B = "".join([str(b)]*a)
    print(B)

Submission status: Accepted

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

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:
ab = input().split(' ');
a = int(ab[0]);
b = int(ab[1]);

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

print('');

Submission status: Accepted

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

Submission status: Accepted

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

newa = str(a)*b
newb = str(b)*a

list = newa,newb
list = sorted(list)
print(list[0])

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=(int(x) for x in input().split())
ab=str(str(a)*b)
ba=str(str(b)*a)
print(min(ab,ba))

Submission status: Accepted

Solution code:
def mainFunc():
    a, b = list(map(int, input().split(" ")))
    if a <= b:
        mn = a
        mx = b
    else:
        mn = b
        mx = a
    
    ans = ""
    for i in range(mx):
        ans += str(mn)
    
    print(ans)

mainFunc()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t = []
t = list(map(int, input().split()))

b = t.pop()
a = t.pop()

if a < b:
    print("{}".format(str(a)*b))
else:
    print("{}".format(str(b)*a))

Submission status: Accepted

Solution code:
a, b = (int(x) for x in 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())
s = ""
t = ""
for i in range(b):
    s += str(a)
for i in range(a):
    t += str(b)

if a >= b:
    print(t)
else:
    print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if (a <= b):
    print("".join([str(a) for i in range(b)]))
else:
    print("".join([str(b) for i in range(a)]))

Submission status: Accepted

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

lis = [A, B]
new_lis = sorted(lis)
print(new_lis[0])

Submission status: Accepted

Solution code:
n=list(map(int,input().split()))
ans=0
m=max(n)
s=min(n)
for i in range(m):
  ans+=s*10**i
print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def print_ans(a, b):
    """Test Case
    >>> print_ans(4, 3)
    3333
    >>> print_ans(7, 7)
    7777777
    """
    if a > b:
        print(str(b) * a)
    else:
        print(str(a) * b)


if __name__ == '__main__':
    a, b = map(int, input().rstrip().split())
    print_ans(a, b)

Submission status: Accepted

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

strA = ''
strB = ''

for i in range(intB):
    strA += a

for j in range(intA):
    strB += b

if strA < strB:
    print(strA)
elif strB <= strA:
    print(strB)

Submission status: Accepted

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

ans1 = str()
for i in range(0,b):
  ans1 += str(a)
ans2 = str()
for i in range(0,a):
  ans2 += str(b)

#print(ans1)
if ans1<ans2:
  print(ans1)
else:
  print(ans2)

Submission status: Accepted

Solution code:
a, b=input().split()
sa=''
sb=''
for i in range(int(b)):
  sa+=a
for i in range(int(a)):
  sb+=b
#print(sa, sb)
if sa < sb: print(sa)
else: print(sb)

Submission status: Accepted

Solution code:
a,b= map(int, input().split())
MIN = min(a,b)
MAX = max(a,b)
answer = [MIN] * MAX
# print(answer)
# map(str,answer)
"".join(map(str,answer))
print(int("".join(map(str,answer))))
# print(''.join(map(str, answer)))

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(B):
	A_t += str(A)
for i in range(A):
	B_t += str(B)

if A_t < B_t:
	print(A_t)
else:
	print(B_t)

Submission status: Accepted

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

for i in range(b-1):
  stra = stra +str(a)
for i in range(a-1):
  strb = strb +str(b)

print(sorted([stra, strb])[0])

Submission status: Accepted

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

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

for i in range(a):
  ans2= ans2 + str(b)
  
list = []
list.append(ans1)
list.append(ans2)

list.sort()

print(list[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = raw_input().split(" ")

a = int(a)
b = int(b)

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

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc152/tasks/abc152_b
# -*- coding: utf-8 -*-
a,b = map(int, input().split())
X = [str(a)*b,str(b)*a]
print(sorted(X)[0])

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
S_a = S_b = ""
for i in range(b):
    S_a += str(a)
for j in range(a):
    S_b += str(b)

if a>b:
    print(S_b)
else:
    print(S_a)

Submission status: Accepted

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

Submission status: Accepted

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

if(a > b):
#    for j in range (a):
    print(str(b)*a)

elif(a <= b):
    #for k in range (b):
    print(str(a)*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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