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:
import sys
import fractions
import math
MAX_INT = int(10e12)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

a,b = IL()

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

a, b = input().split()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

else:
    print(str(b) * a)

Submission status: Accepted

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

ans = sorted([ans1, ans2])
print(ans[0])

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  a,b=LS()

  _a=a*int(b)
  _b=b*int(a)

  if _a<_b:
    return _a
  return _b

# main()
print(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = input().split()
print(min(n * int(m), m * int(n)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(min(ab, ba))

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


print(min(N*int(M),M*int(N)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[] for _ in range(num)]
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))

#################

a,b = II()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    A,B=ST().split()
    if A<B:
        print(A*int(B))
    else:
        print(B*int(A))
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
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 LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

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

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

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

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

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

a, b = list(map(int, sys.stdin.buffer.readline().split()))
aa = str(a) * b
bb = str(b) * a
ans = min(aa, bb)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Runtime Error

Solution code:
input_line=input().rstrip().slpit()
num1 = int(input_line[0])
num2 = int(input_line[1])

if (num1 > num2):
  print(str(num2)*num1)
elif (num1 < num2):
  print(str(num1)*num2)
elif (num1 == num2):
  print(str(num1)*num2)

Submission status: Runtime Error

Solution code:
input_line=input().rstrip().slpit()
num1 = int(input_line[0])
num2 = int(input_line[1])
list1 = []
list2 = []
if (num1 > num2):
  for i in range(num1):
    list1.append(num2)
  list_num1 = join(map(str, list1))
  list_int_num1 = int(list_num1)
  print(list_num_num1)
elif (num1 < num2):
  for j in range(num2):
    list1.append(num1)
  list_num2 = join(map(str, list2))
  list_int_num2 = int(list_num2)
  print(list_num_num2)
elif (num1 == num2):
  for k in range(num2):
    list1.append(num1)
  list_num2 = join(map(str, list2))
  list_int_num2 = int(list_num2)
  print(list_num_num2)

Submission status: Runtime Error

Solution code:
input_line=input().rstrip().slpit()
num1 = int(input_line[0])
num2 = int(input_line[1])
list1 = []
list2 = []
for i in range (num2):
  list1.append(num1)
list_num1 = join(map(str, list1))
list_int_num1 = int(list_num1)

for i in range (num1):
  list2.append(num2)
list_num2 = join(map(str, list2))
list_int_num2 = int(list_num2)

if (list_int_num1 > list_int_num2):
  print(list_int_num2)
elif(list_int_num1 < list_int_num2):
  print(list_int_num1)
elif(list_int_num1 == list_int_num2):
  print(list_int_num1)

Submission status: Runtime Error

Solution code:
input_line=input().rstrip().slpit()
num1 = int(input_line[0])
num2 = int(input_line[1])
if (num1>num2):
  num = num2
elif(num1<num2):
  num = num1
elif(num1=num2):
  num = num1
count = num
for i in range(count):
  print(num)

Submission status: Runtime Error

Solution code:
input_line=input().rstrip().slpit()
num1 = int(input_line[0])
num2 = int(input_line[1])
if (num1>num2):
  num = num2
elif(num<num2):
  num = num1
elif(num1=num2):
  num = num1
count = num
for i in range(count):
  print(num)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

A = a_str*b
B = b_str*a

print(min(A, B))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
P=list(map(int,input().split()))
ans=0
min=P[0]
for i in P:
    if i==1:
        ans+=1
        break
    if min>=i:
        min=i
        ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
#include "bits/stdc++.h"

using namespace std;

#define ll           long long int 
#define endl         '\n'

static const int maxn = 2e5 + 5;

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	
	int a, b;
	cin >> a >> b;
	string s, t;
	while (s.size() < b) {
		s.push_back(static_cast <char> (a + '0'));
	}
	while (t.size() < a) {
		t.push_back(static_cast <char> (b + '0'));
	}
	cout << min(s, t) << endl;
}

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=map(str,input().split())
if a<=b:
  s=a
  for _ in range(b-1):
    s+=a
  print (s)
else:
  s=b
  for _ in range(a-1):
    s+=b
  print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if num_a < num_b:
  print(a*num_b)
else:
  print(b*num_a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A, B = input()
print(min(A*int(B), B*int(A)))

Submission status: Runtime Error

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


# 入力を整数に変換して受け取る
def input_int():
    return int(input())


# マイナス1した値を返却
def int1(x):
    return int(x) - 1


# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
    return map(int, input().split())


# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
    return tuple(map(int, input().split()))


# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    a, b = input_to_int_map()
    import itertools
    _a = itertools.repeat(str(a), b)
    _b = itertools.repeat(str(b), a)
    ret = _b
    if _a < _b:
        ret = _a

    return ret


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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May  9 01:31:32 2020

@author: shinba
"""
a,b = map(int,input().split())

if a >= b:
    print(f'{b}'*a)
else:
    print(f'{a}'*b)

Submission status: Runtime Error

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

ans=1
for i in range(1,N):
  p_prev = sorted(p[0:i])
  if p[i] < p_prev[0]:
    ans += 1
    
print(ans)

Submission status: Runtime Error

Solution code:
a,b = (int(x) for x in input().split())
l = [1,9,5,3,7,2,8,6,4]

if a==1 | b==1:
    if a==3 | b==3:
        if a==1:
            print(b)
        else:
            print(a)
            
if l[a]<=l[b]:
    for i in range(b-1):
        print(a, end="")
    print(a)
else:
    for i in range(a-1):
        print(b, end="")
    print(b)

Submission status: Runtime Error

Solution code:
a,b = (int(x) for x in input().split())
l = [1,9,5,3,7,2,8,6,4]

if l[a]<=l[b]:
    for i in range(b-1):
        print(a, end="")
    print(a)
else:
    for i in range(a-1):
        print(b, end="")
    print(b)

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a, b = map(int, raw_input() .split())
x = []
for i in range(a):
  x += b
  print x

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b = (int(x) for x in input().split())
a = str(a)*b
b = str(b)*a
lis = [a, b]
new_lis = soted(lis)
print(new_lis[1])

Submission status: Runtime Error

Solution code:
a=input()
b=input()
pre=a*int(b)
post=b*int(a)
print(pre if pre<=post else post)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

a_ = a * int(a)
b_ = b * int(b)

moji = sorted([a_ ,b_])

print(mojj[0])

Submission status: Runtime Error

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

a = data[0]
b = data[1]

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

print(ans)

Submission status: Runtime Error

Solution code:
for k in range (10):
    n = list(map(int,input().split()))
    a,b = n
    fb = 0
    fa = 0
    for i in range (a):
        tmp = b * (10 ** i)
        fb += tmp

    for i in range (b):
        tmp = a * (10 ** i)
        fa += tmp
    if fa > fb:
        print (fb)
    else:
        print (fa)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;

class Main {
  FastScanner in = new FastScanner(System.in);
  PrintWriter out = new PrintWriter(System.out);
  public static void main(String[] args) {
    new Main().calc();
  }

  public void calc() {
    int[] a = in.nextIntArray(2);
    String ans = "";
    if (a[0] >= a[1]) {
      for (var i = 0; i < a[0]; i++) {
        ans = ans.concat(String.valueOf(a[1]));
      }
    } else {
      for (var i = 0; i < a[1]; i++) {
        ans = ans.concat(String.valueOf(a[0]));
      }
    }
    out.println(ans);
    out.close();
  }

  class FastScanner {
    private InputStream stream;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;
  
    public FastScanner(InputStream stream) {
      this.stream = stream;
    }
  
    int read() {
      if (numChars == -1)
        throw new InputMismatchException();
      if (curChar >= numChars) {
        curChar = 0;
        try {
          numChars = stream.read(buf);
        } catch (IOException e) {
          throw new InputMismatchException();
        }
        if (numChars <= 0) 
          return 1;
      }
      return buf[curChar++];
    }
  
    boolean isSpaceChar(int c) {
      return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }
  
    boolean isEndline(int c) {
        return c == '\n' || c == '\r' || c == -1;
    }
  
    String next() {
      int c = read();
      while(isSpaceChar(c)) {
        c = read();
      }
      StringBuilder res = new StringBuilder();
      do {
        res.appendCodePoint(c);
        c = read();
      } while (!isSpaceChar(c));
      return res.toString();
    }
  
    int nextInt() {
      return Integer.parseInt(next());
    }
  
    int[] nextIntArray(int n) {
      int[] arr = new int[n];
      for (int i = 0; i < n; i++) {
        arr[i] = nextInt();
      }
      return arr;
    }
  
    int[][] nextIntMap(int n, int m) {
      int[][] map = new int[n][m];
      for (int i = 0; i < n; i++) {
          map[i] = in.nextIntArray(m);
      }
      return map;
    }
  
    long nextLong() {
        return Long.parseLong(next());
    }
  
    long[] nextLongArray(int n) {
        long[] array = new long[n];
        for (int i = 0; i < n; i++)
            array[i] = nextLong();
  
        return array;
    }
  
    long[][] nextLongMap(int n, int m) {
        long[][] map = new long[n][m];
        for (int i = 0; i < n; i++) {
            map[i] = in.nextLongArray(m);
        }
        return map;
    }
  
    double nextDouble() {
        return Double.parseDouble(next());
    }
  
    double[] nextDoubleArray(int n) {
        double[] array = new double[n];
        for (int i = 0; i < n; i++)
            array[i] = nextDouble();
  
        return array;
    }
  
    double[][] nextDoubleMap(int n, int m) {
        double[][] map = new double[n][m];
        for (int i = 0; i < n; i++) {
            map[i] = in.nextDoubleArray(m);
        }
        return map;
    }
  
    String[] nextStringArray(int n) {
      String[] array = new String[n];
      for (int i = 0; i < n; i++)
          array[i] = next();
  
      return array;
    }
  
    String nextLine() {
        int c = read();
        while (isEndline(c))
            c = read();
        StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isEndline(c));
        return res.toString();
    }
  }
}

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

lis=[A,B]
true_list = lis.sort()
print(str(true_list[0]))

Submission status: Runtime Error

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

lis=[A,B]
true_list = lis.sort(reverse=True)
print(true_list[0])

Submission status: Runtime Error

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

lis=[A,B]
true_list = lis.sort()
print(true_list[0])

Submission status: Runtime Error

Solution code:
input_numbers = list(map(int,input().split()))
a = input_numbers[0]
b = input_numbers[1]
A = a
B = b
x = 0
y = 0
while A >= 0:
  x += 10 ** A * b
  A -= 1
while B >= 0:
  y += 10 ** B * a
  B -= 1
if x > y:
  ptint(x)
else:
  print(y)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(s)

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
import sys
ab = sys.stdin.readline().split(' ')
print(max(ab[0]*int(ab[1]), ab[1]*int(ab[0]))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a,b=map(int,open(0));print(str(min(a,b))*max(a,b))

Submission status: Runtime Error

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

if a < b:	print(str(a+'0') * b )
else:	print(str(b+'0') * a )

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

if a<b:
    ans=f"{a}"*b
else:
    ans=f"{b}"*a
print(ans)

Submission status: Runtime Error

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

for i in range
if a > b:
    print(str(b)*a)
else:
    print(str(a)*b)

Submission status: Runtime Error

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

axb_text = ''
for i in range(b):
    axb_text = f"{axb_text}{a}"

bxa_text = ''
for i in range(a):
    bxa_text = f"{bxa_text}{b}"

print(axb_text if axb_text < bxa_text else bxa_text)

Submission status: Runtime Error

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

axb_text = ''
for _ in range(b):
    axb_text = f"{axb_text}{a}"

bxa_text = ''
for _ in range(a):
    bxa_text = f"{bxa_text}{b}"

print(axb_text if axb_text < bxa_text else bxa_text)

Submission status: Runtime Error

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

if a < b:
    print(a)
else:
    print(b)
# p = list(map(int,input().split()))

# count = 0
# val = sum(p[0:k])
# val_lis = [val]
# mx_val = val
# index = 0
# mx_index = 0
# for i,j in enumerate(p[k:]):
#     val = val - p[index] + j
#     val_lis.append(val)
#     index +=1
#     if val > mx_val:
#         mx_index = index
#         mx_val = val 
    
# ans = 0
# for i in range(k):
#     ans += ((p[mx_index + i]+1.0)*(p[mx_index+i]))/ (p[mx_index+i] *2.0)
# print(ans)  




# h = sorted(h,reverse = True)
# print(sum(h[k:]))

# s,t= map(str, input().split())
# a,b= map(int, input().split())
# u = input()
# print("x"*len(u))

# if(u == s):
#     print(a-1,b)
# else:
#     print(a,b-1)

Submission status: Runtime Error

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

la = ''
lb = ''

for i in range(b):
    la += a
    lb += b

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

Submission status: Runtime Error

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