Product of DigitsProblem code: DIGITS |
All submissions for this problem are available.
The chef may be losing his mind. He has demanded you solve the following task: given an integer P, find the smallest positive integer whose product of digits, modulo 1000000007, is P. You can't imagine what this has to do with cooking, but you'd better do what he says or you won't get to sample his culinary delights.
Input:
Input will begin with a positive integer T<=15, the number of test cases. T lines follow, each containing an integer P between 0 and 1000000006, inclusive.
Output:
For each test case, print on a single line the smallest positive integer whose product of digits, modulo 1000000007, is P. It is guaranteed that such an integer exists with fewer than 700 digits.
Sample input:
4 16 486 220703118 0
Sample output:
28 699 5555555555555 10
| Author: | pieguy |
| Date Added: | 25-09-2010 |
| Time Limit: | 15 sec |
| Source Limit: | 50000 Bytes |
| Languages: | ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, ERL, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TEXT, WSPC |
Comments
SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:
Fetching successful submissions
HELP
Program should read from standard input and write to standard output. After you submit a solution you can see your results by clicking on the [My Submissions] tab on the problem page. Below are the possible results:
- Accepted
Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark. - Time Limit Exceeded
Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach. - Wrong Answer
Your program compiled and ran succesfully but the output did not match the expected output. - Runtime Error
Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section. - Compilation Error
Your code was unable to compile. When you see this icon, click on it for more information.
If you are still having problems, see a sample solution here.
for tset case 486 smallest
for tset case 486 smallest integer will be 681, as 81*6=486, Please Clarify
hey its not working for
hey its not working for 220703118
5555555555555 is too long ...
its not even in d range of long int
first of all digits r frm
i got 2 answer for this