Problem 1804. Fangs of a vampire number
- at most one of x and y is 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).
Solution Stats
Problem Comments
-
4 Comments
Sorry for all the false positives. I have added more test cases.
It turns out that the difference in meaning between "not both" and "both not" is critical to this problem. Do'h! Took me a while to figure out where I was going wrong. :P
Exactly what I like in Cody. Interesting and modular problem, with good explanations.
What else ?
Thank you, Jean-Marie! If I have time, I might extend the problem even further.
Solution Comments
Show commentsProblem Recent Solvers89
Suggested Problems
-
Determine Whether an array is empty
763 Solvers
-
Find a subset that divides the vector into equal halves
384 Solvers
-
Find the maximum number of decimal places in a set of numbers
2634 Solvers
-
Is this triangle right-angled?
5500 Solvers
-
Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock.
933 Solvers
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!