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

#include <stdio.h>

int main(int argc, char const *argv[]) {
  int a=0,x=0,y=0,z=0;
  int s=1;
  scanf("%d",&a);
  scanf("%d",&x);
  y=a;
  z=x;
  for (int i = 0; i < x; i++,s=s*10) {
    y=y+(a*s);
    if(i==0){
      y=y-a;
    }
  }
  s=1;
  for (int i = 0; i < a; i++,s=s*10) {
    z=z+(x*s);
    if(i==0){
      z=z-x;
    }
  }
  if (y>x) {
    printf("%d\n",z);
  }else{
    printf("%d\n",y);
  }
  return 0;
}