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::{self, BufRead};

fn main() {
    let stdin = io::stdin();
    let mut lines = stdin.lock().lines();
    let ab = lines.next().unwrap().unwrap();
    let mut ab = ab.split_whitespace();
    let a: usize = ab.next().unwrap().parse().unwrap();
    let b: usize = ab.next().unwrap().parse().unwrap();
    let ans: String = if a < b {
        (0..b).map(|_| a.to_string()).collect()
    } else {
        (0..a).map(|_| b.to_string()).collect()
    };
    println!("{}", ans);
}