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

#include<stdio.h>
int main()
{
    int a, b;

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

    if(a==b)
    {
        int ar[10];

        for(int i=0; i<a; i++)
        {
            ar[i]=a;
        }

        for(int i=0; i<b; i++)
        {
            printf("%d", ar[i]);
        }

        printf("\n");
    }

    else
    {
        if(a>b)
        {
            for(int i=0; i<a; i++)
            {
                printf("%d", b);
            }
        }

        else if(b>a)
        {
            for(int i=0; i<b; i++)
            {
                printf("%d", a);
            }
        }

        printf("\n");
    }

    return 0;
}