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 Rust (1.15.1) (judge verdict: Accepted)

use std::io::stdin;

fn main() {
    let mut s = String::new();
    stdin().read_line(&mut s).unwrap();

    let words: Vec<char> = s
        .trim()
        .chars()
        .filter(|&x| x != ' ')
        .collect();

    let mut ans: [String; 2] = [String::new(), String::new()];

    for _ in 0..words[1].to_digit(10).unwrap() {
        ans[0].push(words[0]);
    }
    for _ in 0..words[0].to_digit(10).unwrap() {
        ans[1].push(words[1]);
    }
    ans.sort();

    println!("{}", ans[0]);
}