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 C (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>

int main(void){
  int a, b, i;
  char a_by_b[9+1], b_by_a[9+1];
  scanf("%d %d", &a, &b);
  
  for(i=0; i<b; i++){
    sprintf(&a_by_b[i], "%d", a);
  }
  sprintf(&a_by_b[i+1], "%c", '\0');

  for(i=0; i<a; i++){
    sprintf(&b_by_a[i], "%d", b);
  }
  sprintf(&b_by_a[i+1], "%c", '\0');

  i=0;
  while(1){
      if(a_by_b[i] == '\0' || b_by_a[i] == '\0'){
          printf("%s", a_by_b);
          break;
      }
    //   printf("a_by_b[%d]=%c", i, a_by_b[i]);
    if(a_by_b[i] < b_by_a[i]){
        printf("%s", a_by_b);
        break;
    }else{
        printf("%s", b_by_a);
        break;
    }
      i++;
  }
  
  return 0;
}