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>
#include<set>
#define ll long long 
#include <string>
using namespace std;
int main()

{
    
	
	int  n,m;
	int i;
	cin>>n>>m;
	string s1="",s2="";
	for(i=0;i<n;i++)
	{
		s1+=m+'0';
	}
	for(i=0;i<m;i++)
	{
		s2+=n+'0';
	}
	if (s1<s2)
	cout<<s1<<endl;
	else
	cout<<s2<<endl;
	
	
}