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 <string.h>

int main(void)
{
    int a, b;
    int num_a = 0, num_b = 0;
    char buf_a[12], buf_b[12];

    scanf("%d%d", &a, &b);

    for(int i = 0; i < b; i++){
        num_a = num_a * 10 + a;
    }

    for(int j = 0; j < a; j++){
        num_b = num_b * 10 + b;
    }

    snprintf(buf_a, 12, "%d", num_a);
    snprintf(buf_b, 12, "%d", num_b);

    if (strcmp(buf_a, buf_b) <= 0 ){
        printf("%d", num_a);
    }
    else if (strcmp(buf_a, buf_b) > 0 ){
        printf("%d", num_b);
    }

    return 0;
}