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<bits/stdc++.h>

long long pow(long long base,long long exp){
    long long res = 1;
    while(exp>0){
        if(exp & 1)res = res * base;
        base = base * base;
        exp >>= 1;
    }
    return res;
}

int main()
{
    long long a,b;
    std::cin >> a >> b;
    char aa = a + '0';
    char bb = b + '0';
    std::string res1,res2;
    for(int i = 0; i < b; i++){
        res1 += aa;
    }
    for(int i = 0; i < a; i++){
        res2 += bb;
    }
    std::cout << std::min(res1,res2) << std::endl;

}