Jalea , 18 13 10 bytes
×⁵RDP$€io-
Pruébalo en línea!
Solución de 13 bytes:
×⁵RDP$€iµ’¹¬?
Pruébalo en línea!
Explicación con entrada N
:
׳R create a range from 1 to N * 100 (replace ³ with ⁵ for a faster execution time)
DP$ define a function ($) to get the product of the digits of a number,
€ apply that function to each element in the list,
iµ get the index of the input N in the list (or 0 if it's not there), and yeild it as the input to the next link,
’¹¬? conditional: if the answer is 0, then subtract one to make it -1, otherwise, yeild the answer
Solución de 18 bytes:
D×/
×⁵RÇ€i
Ç⁾-1¹¬?
Pruébalo en línea!
D×/ product of digits function, takes input M
D split M into digits,
×/ reduce by multiplication (return product of digits)
×⁵RÇ€i range / index function
×⁵R make a range from 1 to N*10,
Ç€ run the above function on each of the range elements,
i get the index of N in the result, or 0 if it's not there
Ç⁾-1¹¬? main function:
Ç ¬? run the line above and check if the answer is null (0)
⁾-1 if it is, return "-1",
¹ otherwise, return the answer (identity function).
El último enlace es solo para reemplazar 0 (el valor de falsey predeterminado de Jelly, ya que todas las listas tienen un índice) con -1. Si considera que 0 es un valor correcto de falsey, el programa es de 8 bytes .
1
dar1
es un caso de prueba importante.