This problem is the next step up from Problem 156. Rather than determining if an input is a parasitic number, you will be asked to generate one. You will be given the last digit of the number (k), and the number you're using to multiply to shift the parasitic number one digit (n). Both n and k will always be between 1 and 9.
For example, if n=4 and k=7:
4x7=2*8* 4x87=3*48* 4x487=1*948* 4x9487=3*7948* 4x79487=3*17948* 4x179487=717948.
So 179487 is a 4-parasitic number with units digit 7.
We are looking for the smallest possible number that meets these criteria, so while 179487, 179487179487, and 179487179487179487 are all valid answers for n=4 and k=7, the correct output for this function is 179487.
Because some of the values that are generated by this function are very large, the output should be a string rather than an integer. Please bear in mind that some of these values will have leading zeros. This will occur when n>k.
As per the wiki page provided in problem 156 "leading zeros are not allowed". Thus the solution set here is flawed.
Chris, you are correct. The definition of a parasitic number does state "No Leading Zeros." That's why I explicitly stated that some of these values would have a leading zero, and when they would occur. While these numbers are technically not parasitic, the method for generating them is the same.
Matrix indexing with two vectors of indices
426 Solvers
Create a vector whose elements depend on the previous element
383 Solvers
271 Solvers
Sum the elements in either diagonal of a square matrix
148 Solvers
1077 Solvers