The Mad Calulation
All submissions for this problem are available.
This is just an insane task where all u need to do is calculate the number whose multiplication of digits gives the number which has been entered as input.
The input begins with an integer T<=15 where T is the number of test cases. This is followed ny T numbers where each number is greater than 0 and less than 1000000007.
For each test case output on a single line the smallest positive integer whose product ofdigits,modulo 1000000007, is the above mentioned numbers. It is gauranteed that such a number exists within less than 700 digits.
Input: 3 16 486 0 Output: 28 699 10
|Time Limit:||0.223492 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, JAVA, PYTH, PYTH 3.6, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, JAR, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, CLOJ, FS|
Fetching successful submissions