|
||||||||||
Bigger is BetterTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1384 Accepted Submission(s): 343 Problem Description Bob has n matches. He wants to compose numbers using the following scheme (that is, digit 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 needs 6, 2, 5, 5, 4, 5, 6, 3, 7, 6 matches): Write a program to make a non-negative integer which is a multiple of m. The integer should be as big as possible. Input The input consists of several test cases. Each case is described by two positive integers n (n ¡Ü 100) and m (m ¡Ü 3000), as described above. The last test case is followed by a single zero, which should not be processed. Output For each test case, print the case number and the biggest number that can be made. If there is no solution, output -1.Note that Bob don't have to use all his matches. Sample Input
Sample Output
Source | ||||||||||
|