Find all vampire fangs - MATLAB Cody - MATLAB Central

Problem 1825. Find all vampire fangs

Difficulty:Rate
A vampire number is a number v that is the product of two numbers x and y such that the following conditions are satisfied:
  1. at most one of x and y are divisible by 10;
  2. x and y have the same number of digits; and
  3. The digits in v consist of the digits of x and y (including anyrepetitions).
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 pairs of fangs for a given number. The output is a matrix in which each row is a pair; the values in the first row should be in increasing order. If it is not a vampire number, it will return empty arrays.
Example:
disp(vampire_factor(125460))
204 615
246 510

Solution Stats

39.15% Correct | 60.85% Incorrect
Last Solution submitted on Dec 07, 2024

Problem Comments

Solution Comments

Show comments
R2025a Pre-release highlights
This topic is for discussing highlights to the current R2025a Pre-release.
13
5

Problem Recent Solvers69

Suggested Problems

More from this Author9

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Go to top of page