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.6) (judge verdict: Accepted)

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var sc = bufio.NewScanner(os.Stdin)

func nextLine() string {
	sc.Scan()
	return sc.Text()
}

func main() {
	var headTmp = nextLine()
	var head = strings.Split(headTmp, " ")

	// fmt.Println(head[0])
	// fmt.Println(head[1])
	n0, _ := strconv.Atoi(head[0])
	n1, _ := strconv.Atoi(head[1])

	var i int
	var m string

	if head[0] > head[1] {
		for i = 0; i < n0; i++ {
			m = m + head[1]
		}
		fmt.Println(m)

	} else {
		for i = 0; i < n1; i++ {
			m = m + head[0]
		}
		fmt.Println(m)

	}
}