A vampire number is a number v that is the product of two numbers x and y such that the following conditions are satisfied:
- at most one of x and y are divisible by 10;
- x and y have the same number of digits; and
- The digits in v consist of the digits of x and y (including any repetitions).
If these conditions are met, x and y are known as "fangs" of v. For example, 1260 is a vampire number because 1260 = 21*60, so 21 and 60 are the fangs.
Write a function that returns all the vampire numbers in a given array. The output is a vector.
Example: disp(find_vampire(1000:2000) 1260 1395 1435 1530 1827
See also: Problem 1825. Find all vampire fangs and Problem 1804. Fangs of a vampire number.
Solution Stats
Problem Comments
Solution Comments
2 Comments
Andrew Newell
on 9 May 2017 at 0:53
Since I created the problem series and want the Functions I badge, I thought I'd provide the solution that incorporates vampire_factor and are_fangs. Not a great score, but readable!
Andrew Newell
on 9 May 2017 at 0:56
Sorry, I mean the Magic Numbers badge.
Tags
Discover what MATLAB® can do for your career.
Opportunities for recent engineering grads.
Apply Today
5 players like this problem
5 players like this problem