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

Solution in Go (1.14.1) (judge verdict: Accepted)

package main

import (
	"fmt"
	"strconv"
	"strings"
)

func main() {

	var a, b string
	fmt.Scanf("%s %s", &a, &b)

	var A, B string
	var i, j int
	i, _ = strconv.Atoi(b)
	j, _ = strconv.Atoi(a)
	A = strings.Repeat(a, i)
	B = strings.Repeat(b, j)

	if A >= B {
		fmt.Println(B)
	} else {
		fmt.Println(A)
	}

}