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>
#include <stdlib.h>
#include <string.h>

int str_cmp(const void *a, const void *b) {
    return strcmp(*(char **)a, *(char **)b);
}

int main(void) {
    int a, b;
    scanf("%d %d", &a, &b);
    char *str_a = calloc(b + 1, 1);
    char *str_b = calloc(a + 1, 1);
    char *strtable[2] = {str_a, str_b};

    memset(str_a, '0' + a, b);
    memset(str_b, '0' + b, a);

    qsort(strtable, 2, sizeof(char *), str_cmp);

    printf("%s\n", strtable[0]);
}