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

ans = 0
if a >= b:
    for i in range(a):
        ans += b*(10**i)
else:
    for i in range(b):
        ans += a*(10**i)
print(ans)

Submission status: Accepted

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

if t < q:
    print(t)
else:
    print(q)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=input().split()
c=""
i=0
if int(a)>=int(b):
  while i<int(a):
    c=c+b
    i=i+1
  print(c)
else:
  while i<int(b):
    c=c+a
    i=i+1
  print(c)

Submission status: Accepted

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

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_str, b_str = input().split()
a = int(a_str)
b = int(b_str)

A = a_str*b
B = b_str*a
 
print(min(A, B))

Submission status: Accepted

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

else:
    l = [str(b)]*a
    print("".join(l))

Submission status: Accepted

Solution code:
r=input().split()
a=int(r[0])
b=int(r[1])
if a>=b:
    ans=""
    for i in range(a):
        ans+=str(b)
    print(int(ans))
else:
    ans=""
    for i in range(b):
        ans+=str(a)
    print(int(ans))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
n,m=input().split()
a=n*int(m)
b=m*int(n)
nlist=[a,b]
nlist.sort()
print(nlist[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

x = a
y = b

if int(a) >= int(b):
  for i in range(int(a)-1):
    y += b
  print(int(y))

else:
  for i in range(int(b)-1):
    x += a
  print(int(x))

Submission status: Accepted

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

Submission status: Accepted

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

if min(A,B) == A:
    for a in range(int(B)):
        A_ans += A
    print(A_ans)
else:
    for b in range(int(A)):
        B_ans += B
    print(B_ans)

Submission status: Accepted

Solution code:
a,b=input().split()
A=int(a)
B=int(b)
aa=a
bb=b
for i in range(B-1):
    aa+=a
for j in range(A-1):
    bb+=b
if aa >= bb:
    print(bb)
else:
    print(aa)

Submission status: Accepted

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

sa = a * nb
sb = b * na

print(sa if sa < sb else sb)

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

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

Submission status: Accepted

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

print(a*int(b))

Submission status: Accepted

Solution code:
  # coding: utf-8

a, b = input().split()
aaa = ""
bbb = ""
for i in range(int(b)):
    aaa += a

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

if aaa > bbb:
    print(bbb)
else:
    print(aaa)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

    print(ans)


if __name__ == "__main__":
    main()

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 = list(map(int,input().split()))
b = sorted(a)
x = b[0]
y = b[1]
for i in range(y):
  print(x, end = '')
print()

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

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:
a=sorted(input().split())
print(a[0]*int(a[1]))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    A, B = map(int, input().split())
    a = str(A) * B
    b = str(B) * A
    print(min(a, b))
    

def main():
    solve()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = list(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(b)*a)
else:
  print(str(a)*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = list(input().rstrip().split())
ar = a * int(b)
br = b * int(a)
r = ar if ar < br else br
print(r)

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())
x = str(min(A, B))
y = max(A, B)
print(x * y)

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()
c = a
a = a*int(b)

b = b*int(c)


for i in range(len(a)):
  if a[i]<b[i]:
    print(a)
    break
  elif a==b:
    print(a)
    break
  else:
    print(b)
    break

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(max(a, b)):
    print(str(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 int(str(a)*b) <= int(str(b)*a):
    print(str(b)*a)
else:
    print(int(str(a)*b))

Submission status: Accepted

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

print(ans)

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

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())
minnum = min(a,b)
maxnum = max(a,b)

print(str(minnum)*maxnum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a, b = map(int, next(sys.stdin.buffer).split())
if a > b:
    a, b = b, a
print(str(a) * b)

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
mn = min(m,n)
mx = max(m,n)
print(str(mn)*mx)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

v=0
for i in range(max(a,b)):
    v = v*10+min(a,b)    

print( v )

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
new_a=str(a)*b
new_b=str(b)*a
if new_a < new_b:
    print(new_a)
else:
    print(new_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:
li = input().split()
li.sort()
print(li[0]*int(li[1]))

Submission status: Accepted

Solution code:
def main():

    a, b = map(int, input().split())
    s = str(a) * b
    t = str(b) * a
    if s < t:
        return s
    return t


if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print(b*str(a) if a<=b else a*str(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:
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

a,b = inpm()

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

def main():
    a,b = LI()
    a_b = str(a)*b
    b_a = str(b)*a
    print(sorted([a_b,b_a])[0])

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

Submission status: Accepted

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

s=[''.join([str(a)]*b),''.join([str(b)]*a)]

print(sorted(s)[0])

Submission status: Accepted

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

Submission status: Accepted

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

if a_str < b_str:
  print(a_str)
else:
  print(b_str)

Submission status: Accepted

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

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

print(min(A,B))

Submission status: Accepted

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

x = str(a) * b
y = str(b) * a
print(min(sorted([x,y])))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

l=[x,y]

l.sort()

print(l[0])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


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


def main():

    sys.setrecursionlimit(10 ** 6)

    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(f'{solve(a, b)}')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

As = a * int(b)

Bs = b * int(a)

if As<Bs:
  print(As)
else:
  print(Bs)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os, sys, re, math

(a, b) = [int(n) for n in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# Comparing Strings
a, b = map(int, input().split())
a, b = min(a, b), max(a, b)
ans = ''.join([str(a) for e in range(b)])
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 = map(int, input().split())
alpha = str(b)
beta = str(a)
if a >= b:
  for k in range(a - 1):
    alpha = alpha + str(b)
  print(int(alpha))
else:
  for k in range(b - 1):
    beta = beta + str(a)
  print(beta)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

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

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

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

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

lis = [A, B]

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

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

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

print(min(l))

Submission status: Accepted

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

print(min(str(n)*m, str(m)*n))

Submission status: Accepted

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

if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
MM = input().split()
a = int(MM[0])
b = int(MM[1])
list1 = [str(a)*b,str(b)*a]
list1.sort()
print(list1[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 = list(map(int, input().split()))
arr = [str(a) * b, str(b) * a]
arr.sort()
print(arr[0])

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
num_a = ''
num_b = ''
lst = []
for i in range(b):
    num_a += str(a)
for i in range(a):
    num_b += str(b)
lst.append(num_a)
lst.append(num_b)
lst.sort()
print(lst[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 = input().split()
c = [a*int(b), b*int(a)]
print(sorted(c)[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    a,b = [int(i) for i in input().split()]
    smaller = min(a, b)
    bigger = max(a, b)
    print(''.join([str(smaller)]*bigger))

if __name__ == "__main__":
    solve()

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

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

print(a_list[0])

Submission status: Accepted

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

if a < b:
    a, b = b, a

b = str(b)

print(b*a)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():

    a, b = input().split()
    s = a * int(b)
    t = b * int(a)

    if s < t:
        return s
    return t

if __name__ == '__main__':
    print(main())

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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:
ab = list(map(int,input().split()))
ab.sort()
print(str(ab[0])*ab[1])

Submission status: Accepted

Solution code:
def main():
  a,b= list(map(int,input().split()))
  a_str=""
  b_str=""
  for i in range(0,b):
    a_str+=str(a)
  for i in range(0,a):
    b_str+=str(b)
  
  if a_str<b_str:
    print(a_str)
  else:
    print(b_str)
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:
a,b = map(str,input().split())
c=a*int(b)
d=b*int(a)
print(min(c,d))

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

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

Submission status: Accepted

Solution code:
def comparing_strings():
    # 入力
    a, b = input().split()
    # 初期処理
    str_a = ''
    str_b = ''
    # 文字列作成
    for _ in range(int(b)):
        str_a = str_a + a
    for _ in range(int(a)):
        str_b = str_b + b
    # 大小比較
    if str_a <= str_b:
        return str_a
    else:
        return str_b

result = comparing_strings()
print(result)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
num = min(A,B)
num1 = max(A,B)
count=0
for i in range(num1):
  count += num*(10**i)
print(count)

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

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

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

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()
ab, ba = a*int(b), b*int(a)
print(ab if ab < ba else 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:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

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="")
print("")

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
# !/usr/bin/python3

"""
https://atcoder.jp/contests/abc152/tasks/abc152_b
Comparing starings.
"""

def solve(n, m):
    if n > m: print(f"{m}"*n)
    elif m >= n: print(f"{n}"*m)

    return

if __name__ == "__main__":
    n, m = list(map(int, input().split()))

    solve(n, m)

Submission status: Accepted

Solution code:
# abc152_b.py
# https://atcoder.jp/contests/abc152/tasks/abc152_b

# B - Comparing Strings /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 200点

# 問題文
# 1桁の正整数 a ,b が与えられます。
# 整数 a を b 回繰り返してできる文字列と 整数 b を a回繰り返してできる文字列のうち、辞書順で小さい方を答えてください。

# 制約
#     1≤a≤9
#     1≤b≤9
#     a,bは整数

# 入力
# 入力は以下の形式で標準入力から与えられる。
# a b

# 出力
# 2つの文字列のうち辞書順で小さい方を出力せよ。(2つの文字列が等しいときは、そのうちどちらかを出力せよ。)

# 入力例 1
# 4 3

# 出力例 1
# 3333

# できる 2つの文字列は、444 と 3333 です。このうち辞書順で小さい文字列は 3333 です。

# 入力例 2
# 7 7

# 出力例 2
# 7777777


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    # N = int(lines[0])
    a, b = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    result = min(str(a)*b, str(b)*a)

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['4 3']
        lines_export = ['3333']
    if pattern == 2:
        lines_input = ['7 7']
        lines_export = ['7777777']
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

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

def solve(a,b):
  str1 = str(a)*b
  str2 = str(b)*a
  if str1 < str2:
    return str1
  else:
    return str2



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

if __name__ == '__main__':
  main()

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:
list1=input().split()
A=(list1[0])*(int(list1[1]))
B=(list1[1])*(int(list1[0]))
list2=[A,B]
list2.sort()
print(list2[0])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


def MI():
    return map(int, sys.stdin.readline().split())


def LI():
    return list(map(int, sys.stdin.readline().split()))


def main():
    _a, _b = input().split()

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


main()

Submission status: Accepted

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