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>

int kai(int x)
{
    if(x==1) 
    {
        return 1;
    }

    else
    {
        return 10*kai(x-1);
    }
    
}

int main()
{
   
   int a,b;
   scanf("%d %d",&a,&b);

   int p,q;

   p=a;
   q=b;

   int A=0;
   int B=0;

   while (p>0)
   {
       A+=b*kai(p);
       p--;
   }

   while (q>0)
   {
       B+=a*kai(q);
       q--;
   }

   if(A>B) printf("%d",A);
   else printf("%d",B);

   int k;

   
    return 0;

}