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 9.2.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
int main()
{
	ios_base :: sync_with_stdio(0);
	cin.tie(0);
	int i, a, b;
	cin >> a >> b;
	char s1[a], s2[b];
	//cin >> s1 >> s2;
	for(i=0; i<a; i++){
		s1[i] = b+'0';
	}
	
	for(i=0; i<b; i++){
		s2[i] = a+'0';
	}
	 if(strcmp(s1, s2)>0){
		 printf("%s\n", s2);
	 }
	 else{
		 printf("%s\n", s1);
	 }
	 return 0;
 }