AtCoder Beginner Contest 152
翻译中…
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.)
翻译中…
样例
Input #1
4 3
Output #1
3333
We have two strings `444` and `3333`. Between them, `3333` is the lexicographically smaller.
Input #2
7 7
Output #2
7777777
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。