Problem Statement

Maximum Lucky Number Problem Description Amazon.com is distributing coupons in the form of a lottery system for loyal customers. The coupons are called "lucky numbers" and the customer with the largest lucky number gets the best discount. Devise a method to determine the maximum possible lucky number. A positive integer is a lucky number if its decimal representation contains only digits x and y. For example, if x = 2 and y = 5, then 2, 552, and 5225 are lucky numbers, and 3, 24, 57 and 389 are not. Given two different digits x and y and a positive integer n, determine the maximum possible lucky number, the sum of whose digits is n. It is guaranteed that at least one lucky number exists for the given x, y, and n. Examples Example 1: Input: x = 3, y = 4, n = 13 Output: 4333 Explanation: The lucky numbers formed using digits 3 and 4 whose digits sum to 13 are 3334, 3343, 3433, 4333. The maximum among these is 4333. Example 2: Input: x = 7, y = 5, n = 22 Output: 7555 Explanation: The luck