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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace app152
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] str = Console.ReadLine().Split(' ');
            decimal a = decimal.Parse(str[0]);
            decimal b = decimal.Parse(str[1]);

            decimal A = 0;
            if (b == 1)
            {
                A = a;
            }
            else
            {
                for (int i = 0; i < b; i++)
                {
                    A = 10 * A;
                    A += a;
                }
            }

            decimal B = 0;
            if (a == 1)
            {
                B = b;
            }
            else
            {
                for (int i = 0; i < a; i++)
                {
                    B = 10 * B;
                    B += b;
                }
            }

            if (a < b)
            {
                Console.Write(A);
            }
            else
            {
                Console.Write(B);
            }
        }
    }
}