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)

fn main() {
  let mut s = String::new();
  std::io::stdin().read_line(&mut s).ok();
  let nm = s.trim().split_whitespace().map(|e| e.parse::<u32>().unwrap()).collect::<Vec<u32>>();
  let left = *nm.first().unwrap();
  let right = *nm.last().unwrap();
  let str1 = make_str(std::char::from_digit(left, 10).unwrap(), right);
  let str2 = make_str(std::char::from_digit(right, 10).unwrap(), left);
  let mut for_sort = vec!(str1, str2);
  for_sort.sort();
  println!("{}",for_sort.first().unwrap().as_str());
}

fn make_str(c: char, num: u32) -> String {
  let mut chars = vec!();
  for i in 0..num {
    chars.push(c)
  }
  use std::iter::FromIterator;
  
  String::from_iter(chars)
}