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: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t,a,p,b,q,i;
    string str,str1;
    cin>>a>>b;
    for(i=0;i<a;i++)
    {
        str+=to_string(b);
    }
    for(i=0;i<b;i++)
    {
        str1+=to_string(a);
    }
    if(a<b)
    {
        p=b;
        q=a;
    }
    else
    {
        p=a;
        q=b;
    }
    for(i=0;i<q;i++)
    {
        int x=str[i]-'0';
        int y=str1[i]-'0';
        if(x<y)
        {
            cout<<str<<endl;
            return 0;
        }
        else
        {
            if(a!=b && i==q-1)
            {
                if(str.size()==q)
                {
                    cout<<str<<endl;
                    return 0;
                }
                else
                {
                    cout<<str1<<endl;
                    return 0;
                }
            }
            else if(a==b && i==q-1)
            {
                cout<<str<<endl;
            }
        }
    }

    return 0;
}