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>

void ushiro(char *c){
  int i;
  for(i=0; i<12; i++){
    if(c[i]=='\0'){
      break;
    }
  }
  for(int j=0; j<=i; j++){
    c[11-i+j]=c[j];
  }
  for(int j=0; j<11-i; j++){
    c[j]='0';
  }
  return;
}

int main(){
  
  int a, b;
  scanf("%d %d", &a,&b);
  char x[11], y[11];
  char x2[11], y2[11];
  
  for(int i=0; i<=a; i++){
    x[i] = (char)'0'+(char)b;
    if(i==a) x[i]='\0';
  }
  for(int i=0; i<=b; i++){
    y[i] = (char)'0'+(char)a;
    if(i==b) y[i]='\0';
  }
  if(a==0){
    x[0]='0';
    x[1]='\0';
  }
  if(b==0){
    y[0]='0';
    y[1]='\0';
  }
  strcpy(x2,x);
  strcpy(y2,y);
  ushiro(x);
  ushiro(y);
  if(strcmp(x,y)>0){
    for(int i=0; i<a; i++){
      printf("%c", x2[i]);
    }
  }else{
    //printf("a");
    for(int i=0; i<b; i++){
      printf("%c", y2[i]);
    }
  }
  
  return 0;
}