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 M,N;
  	int i;
  	int array1[10]={0};
  	int array2[10]={0} ;
  	int count1=0;
  	int count2=0;
  	scanf("%d",&M);
  	scanf("%d",&N);
  
  for(i=0;i<N;i++){
    array1[i]=M;
  }
  
  for(i=0;i<M;i++){
    array2[i]=N;
  }
  
  for(i=0;i<10;i++){
    if(array1[i] != 0){
      count1++;
    } else {
      break;
    }
  }
  
  for(i=0;i<10;i++){
    if(array2[i] != 0){
      count2++;
    } else {
      break;
    }
  }
  
  if(count1 > count2){
    for(i=0;i<count1;i++){
      printf("%d",array1[i]);
    }
  } else if (count1 < count2){
    for(i=0;i<count2;i++){
      printf("%d",array2[i]);
    }
  } else {
    for(i=0;i<count1;i++){
      printf("%d",array1[i]);
    }
  }
  
  return 0;
}