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.IO;
using System.Linq;
using System.Collections.Generic;
using System.Numerics;

namespace abc152
{
    class Program
    {
        static void Main(string[] args)
        {
            //Console.SetIn(new StreamReader("input.txt"));
            solve_abc152B();
        }

        public static void solve_abc152B()
        {
            int[] ab = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
            int a = ab[0];
            int b = ab[1];
            string a1s = String.Empty;
            string b1s = string.Empty;
            for (int i = 0; i < b; i++)
            {
                a1s += a.ToString();
            }
            for (int i = 0; i < a; i++)
            {
                b1s += b.ToString();
            }

            if (Convert.ToInt64(a1s) > Convert.ToInt64(b1s))
            {
                Console.WriteLine(a1s);
            }
            else
            {
                Console.WriteLine(b1s);

            }
        }

        public static void solve_abc152A()
        {
            int[] nm = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
            Console.WriteLine(nm[0] == nm[1] ? "Yes" : "No");            
        }
    }
}