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 = str(a) * b
y = str(b) * a
ans = min(x, y)

print(ans)

Submission status: Accepted

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

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 = input().split()
sa = a * int(b)
sb = b * int(a)
print(sa if sa < sb else sb)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if a<b:
    print(c*b)
else:
    print(d*a)

Submission status: Accepted

Solution code:
l = list(input().split())
N = int(l[0])
M = int(l[1])
str1 = ''
if (N <= M) :
    for i in range (M) :
        str1 = str1 + str(N)
    print (str1)
else :
    for i in range (N) :
        str1 = str1 + str(M)
    print (str1)

Submission status: Accepted

Solution code:
r = list (map (int, input ().split ()))
if (r[0] > r[1]) :
    r[0] ^= r[1]
    r[1] ^= r[0]
    r[0] ^= r[1]

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

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 = input().split()
x = a*int(b)
y = b*int(a)

print(min(x, 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())

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
hai1=[]
hai2=[]
for k in range(0,a):
  hai1.append(str(b))
for i in range(0,b):
  hai2.append(str(a))
ak="".join(hai1)
bk="".join(hai2)
c=[0]*2
c[0]=ak
c[1]=bk
c.sort()
print(int(c[0]))

Submission status: Accepted

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

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

for i in range(a) :
  sb += str(b)
  
print(min(sa,sb))

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 i in range(a):
    s_b += str(b)
if s_a < s_b:
    print(s_a)
else:
    print(s_b)

Submission status: Accepted

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

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()
l,r='',''
for i in range(int(b)): l+=a
for i in range(int(a)): r+=b
print(min(l,r))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = input().split()
Aint = ''
Bint = ''

for i in range(int(B)):
  Aint += A
for i in range(int(A)):
  Bint += B
if Aint <= Bint:
  print(Aint)
else:
  print(Bint)

Submission status: Accepted

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

aa = a * int(b)
bb = b * int(a)
print(min(aa,bb))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A_list=[str(a)]*b
B_list=[str(b)]*a

C=[]
C.append("".join(A_list))
C.append("".join(B_list))

C.sort()

print(C[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())
A = int(str(a)*b)
B = int(str(b)*a)

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

Submission status: Accepted

Solution code:
A, B = map(str, input().split())
print(A * int(B) if A < B else 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 = '')
else :
  for i in range(A):
    print(B, end = '')

Submission status: Accepted

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

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

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

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 = 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,raw_input().split())
# a = map(int,raw_input().split())
if  str(a)*b > str(b)*a:
    print str(b)*a
else:
    print str(a)*b

Submission status: Accepted

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

Submission status: Accepted

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

if a == b:
    print(str(a) * b)
    sys.exit()
print(str(min(a, b)) * max(a, b))

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

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 = str(b) * a
B = str(a) * b
list = [A, B]
list = sorted(list)
print(list[0])

Submission status: Accepted

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

Submission status: Accepted

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

if A < B:
    aList = [str(A) for i in range(B)]
    print(''.join(aList))
else:
    bList = [str(B) for i in range(A)]
    print(''.join(bList))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/bin/python3
a, b = [int(i) for i in input().split(' ')]
a_b = str(a) * b
b_a = str(b) * a
if a_b < b_a:
    print(a_b)
else:
    print(b_a)

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 = input().split()
c = a * int(b)
d = b * int(a)
if int(c) >= int(d):
  print(int(c))
else:
  print(int(d))

Submission status: Accepted

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

Submission status: Accepted

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

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:
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 = input().split()

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

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())
ans = ""
if(a>b):
    for i in range(a):
        ans += str(b)
    print(ans)
elif(a<b):
    for i in range(b):
        ans += str(a)
    print(ans)
else:
    for i in range(a):
        ans += str(a)
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def get_ints():
    return map(int, input().split())

a, b = get_ints()
s = str(a) * b
t = str(b) * a
print(min(s, t))

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

def solve():
    a, b = list(map(int, input().split()))
    ans1 = str(a)*b
    ans2 = str(b)*a

    ans = ans1 if ans1 < ans2 else ans2
    print(ans)


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

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

Submission status: Accepted

Solution code:
#スペース区切りの整数の入力
A, B = map(int, input().split())

ans = ""
if(A>B):
  for i in range(A):
    ans = ans + str(B)
else:
  for i in range(B):
    ans = ans + str(A)
    
    
    
print(ans)

Submission status: Accepted

Solution code:
import sys
import itertools
input = sys.stdin.readline
sys.setrecursionlimit(100000)
mod = 10 ** 9 + 7


def read_values():
    return map(int, input().split())


def read_index():
    return map(lambda x: x - 1, map(int, input().split()))


def read_list():
    return list(read_values())


def read_lists(N):
    return [read_list() for n in range(N)]


def functional(N, mod):
    F = [1] * (N + 1)
    for i in range(N):
        F[i + 1] = (i + 1) * F[i] % mod
    return F


def main():
    a, b = read_values()
    print(str(min(a, b)) * max(a, b))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#coding:utf-8
import sys,os
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
    input = lambda: given().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    XLMIIS = lambda x: [LMIIS() for _ in range(x)]
    YN = lambda c : print('Yes') if c else print('No')
    MOD = 10**9+7

    a,b = LMIIS()
    if a < b:
        for i in range(b):
            write(str(a))
        print()
    else:
        for i in range(a):
            write(str(b))
        print()


    

if __name__ == '__main__':
    main()

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:
from __future__ import print_function

import sys

import re
import array
import copy
import functools
import operator

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd
# fractions.gcd() を用いること
# math.log2()はatcoderでは対応していない．留意せよ．

import collections
import itertools
import bisect

import random
import time

import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue

from itertools import accumulate

from collections import deque
from collections import Counter

from operator import mul
from functools import reduce

input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return


def lcm(n, m):
    return int(n * m / gcd(n, m))


def coprimize(p, q):
    common = fractions.gcd(p, q)
    return (p // common, q // common)


def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8

# 標準入力 <int><int>
a, b = map(int, input().split())

A = ""
B = ""

for _a in range(a):
    A += str(b)
for _b in range(b):
    B += str(a)

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

print(d[0])

Submission status: Accepted

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

string1 = str(a) * b
string2 = str(b) * a

if string1 <= string2:
    print(string1)
else:
    print(string2)

Submission status: Accepted

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

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

aa = 0
bb = 0

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

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

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

Submission status: Accepted

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

print(out)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

lista = [str(a)]*b

listb = [str(b)]*a


if int(''.join(lista))>=int(''.join(listb)):
    print(int(''.join(lista)))
else:
    print(''.join(listb))

Submission status: Accepted

Solution code:

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = [int(i) for i in input().split()]
print(min("{}".format(a) * b, "{}".format(b) * a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces


a, b = na()
n1 = ''
n2 = ''
for i in range(a):
    n1 += str(b)
for i in range(b):
    n2 += str(a)

print(min(n1, n2))

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:
input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]

p =""
for i in range(max(Line)):
    p += str(min(Line))

print(p)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def linput():
    return list(map(int, input().split()))

def main():
    # N = int(input())
    A,B = linput()
    # vA = linput()
    # S = input()
    # mX = [linput() for _ in [0,]*N]

    # res = 0
    # res = -(-N//M)
    vA = [str(A)*B, str(B)*A]
    vA.sort()
    res = vA[0]

    print(res)

main()

Submission status: Accepted

Solution code:
ii=lambda:int(input())
miis=lambda:map(int,input().split())
lmiis=lambda:list(map(int,input().split()))

a,b=input().split()
print(min(a*int(b),b*int(a)))

Submission status: Accepted

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

    

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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()
x = a * int(b)
y = b * int(a)
print(sorted([x, y])[0])

Submission status: Accepted

Solution code:
# import math
# import bisect
# import heapq
# from collections import deque
# import numpy as np

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

li=[a*int(b),b*int(a)]

li.sort()

print(li[0])

Submission status: Accepted

Solution code:
a_str, b_str = input().split()
strings = [a_str * int(b_str)] + [b_str * int(a_str)]
strings.sort()
print(strings[0])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Problem B - Comparing Strings

# input process
a, b = input().split()

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

# output process
if str_a>=str_b:
    print(str_b)
else:
    print(str_a)

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())
ans = min(str(a) * b, str(b) * a)
print(ans)

Submission status: Accepted

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


def solve(a: int, b: int):
    return str(a) * b if a < b else str(b) * a


# 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
    print(solve(a, b))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A,B = map(str,input().split())
AB = A * int(B)
BA = B * int(A)

if A <= B:
    print(AB)
elif A > B:
    print(BA)

Submission status: Accepted

Solution code:
A,B = map(str,input().split())
AB = A * int(B)
BA = B * int(A)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
def compare(a, b):
    a_str = ''
    b_str = ''
    for _ in range(a):
        a_str += str(b)
    for _ in range(b):
        b_str += str(a)

    if int(a_str) > int(b_str):
        return a_str
    else:
        return b_str

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

a_int = int(a)
b_int = int(b)

ans = []
sa = ''
sb = ''
for _ in range(b_int):
	sa += a
for _ in range(a_int):
	sb += b

ans.append(sa)
ans.append(sb)

ans.sort()

print(ans[0])

Submission status: Accepted

Solution code:
_, a, b = sorted(input())
print(a * int(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())
lista = [a for i in range(b)]
listb = [b for i in range(a)]
a2 = ''.join(map(str,lista))
b2 = ''.join(map(str,listb))
list =sorted([a2, b2])
print(list[0])

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())
ans = []
for _ in range(max(a,b)):
    ans.append(str(min(a,b)))
print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = [int(x) for x in input().split()]
roop = A
ans = 0
if A < B:
    roop = B
    B = A
    
for i in range(roop):
    print(B, end ="")

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

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

Submission status: Accepted

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

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

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

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:
import math
a, b = input().split()
P = a*int(b)
Q = b*int(a)
if int(a)<int(b):
  print(P)
else:
  print(Q)

Submission status: Accepted

Solution code:
from sys import stdin
a,b=map(int,input().split())

if a <= b:
    n=a
    m=b
else:
    n=b
    m=a

print(str(n)*m)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if a>b:
     print(''.join(['{}'.format(b) for i in range(a)]))
else:
     print(''.join(['{}'.format(a) for i in range(b)]))

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:
m, n = map(int, input().split())
a = "".join([str(m)]*n)
b = "".join([str(n)]*m)

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

Submission status: Accepted

Solution code:
def solve():
    N, M = map(int, input().split())
    n = str(N)
    m = str(M)
    l = [n*M, m*N]
    l.sort()
    return l[0]

print(solve())

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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


if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

A = ""
B = ""
for i in range(int(b)):
    A += a

for k in range(int(a)):
    B += b

if A[0] < B[0]:
    print(A)
else:
    print(B)

Submission status: Accepted

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

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

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

if a >= b:
    print(n*b)
else:
    print(m*a)

Submission status: Accepted

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

S = []

S.append(a*B)
S.append(b*A)
S.sort()

print(S[0])

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(str, input().split())

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

keta=min(len(x),len(y))

if int(x[:keta]) > int(y[:keta]):
    print(y)
elif int(x[:keta]) < int(y[:keta]):
    print(x)
else:
    print(x)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

fi = str(a)*b
se = str(b)*a

num = max(a, b)

for i in range(num):
    ff = int(fi[i])
    ss = int(se[i])
    if ff<ss:
        print(fi)
        break
    elif ss<ff:
        print(se)
        break
    else:
        pass

    if i==num-1:
        print(fi)

Submission status: Accepted

Solution code:
#! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
# Copyright © 2020 itachi <itachi@itachi-Z510>
#
# Distributed under terms of the MIT license.

"""

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

Submission status: Accepted

Solution code:
i_a, i_b = map(str, input().split())

a = i_a * int(i_b)
b = i_b * int(i_a)

l = sorted([a, b])

print(l[0])

Submission status: Accepted

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

ans=sorted([a*int(b), b*int(a)])
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:
n,m=map(int,input().split())
nn=''
mm=''
for i in range(m):
  nn=nn+str(n)
for i in range(n):
  mm=mm+str(m)
mm=int(mm)
nn=int(nn)
if nn>mm:
  print(nn)
else:
  print(mm)

Submission status: Accepted

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

ab = ""
ba = ""
for i in range(b):
    ab += str(a)
for i in range(a):
    ba += str(b)
l = [ab, ba]
l.sort()
print(l[0])

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

ab = 0
ba = 0

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

ans = ab

if a > b:
    ans = ba
if a == b and ab > ba:
    ans = ba

print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c = str(min(a, b))
print(c*(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:
a,b = map(int,input().split())
c = min(a,b)
d = max(a,b)
str1 = str(c)
for i in range(d-1):
    str1 = str1 + str(c)
print(str1)

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())
c=""
if a>=b:
    for i in range(a):
        c+=str(b)
else:
    for j in range(b):
        c+=str(a)
print(c)

Submission status: Accepted

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

a_copy = int(a)
b_copy = int(b)

a = a * b_copy
b = b * a_copy

ans = sorted([a, b])[0]

print(ans)

Submission status: Accepted

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

ab.sort()
txt = ab[0] * int(ab[1])
print(txt)

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

Submission status: Accepted

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

if a == b:
    print(a*int(b))

else:
    l=[]
    l.append(a*int(b))
    l.append(b*int(a))
    l.sort()
    print(l[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())
if a < b:
    print(str(a)*b)
else:
    print(str(b)*a)