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

// which is larger, a...a (b times) or b...b (a times) 

use proconio::input;

fn main() {
  input! {
    a: usize,
    b: usize,
  };
  let s: String = (0..b).map(|_| std::char::from_digit(a as u32, 10).unwrap()).collect();
  let t: String = (0..a).map(|_| std::char::from_digit(b as u32, 10).unwrap()).collect();
  if s < t {
    println!("{}", s);
  } else {
    println!("{}", t);
  }
}