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::cmp::Ordering;
fn main() {
    let mut buf = String::new();
    std::io::stdin().read_line(&mut buf).unwrap();
    buf.pop();
    let mut split = buf.split(" ");
    let a_raw = split.next().unwrap();
    let b_raw = split.next().unwrap();
    let a_num: i32 = a_raw.parse().unwrap();
    let b_num: i32 = b_raw.parse().unwrap();

    let mut a_by_b = String::new();
    for _ in 0..b_num {
        a_by_b.push_str(a_raw);
    }
    let mut b_by_a = String::new();
    for _ in 0..a_num {
        b_by_a.push_str(b_raw);
    }

    if a_by_b.cmp(&b_by_a) == Ordering::Less {
        println!("{}", a_by_b);
    } else {
        println!("{}", b_by_a);
    }
}