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>
#include<string.h>
#include<math.h>


int main() {
	int A, B, C;
	int NextA = 0;
	int NextB = 0;

	scanf("%d %d", &A, &B);
	
	for (int i = (B - 1); i > 0; i--) {
		C = pow(10, i);
		C = A * C;	
		NextA += C;
	}

	NextA += A;

	for (int i = (A - 1); i > 1; i--) {
		C = pow(10, i);
		C = B * C;
		NextB += C;
	}

	NextB += B;

	if (A < B) {
		printf("%d", NextA);
	}
	else {
		printf("%d", NextB);
	}

	return 0;
	
}