Problem 1826. Find vampire numbers

Created byAndrew Newell

Like (9)

Solve Later

{“关系”：[{“ RelativeType”：“ http：//schemas.mathworks.com/matlab/matlab/code/2013/relationships/document'“：” /matlab/document.xml“}，{“ RelatessType”：“ http：//schemas.mathworks.com/matlab/matlab/code/2013/relationships/outputs/output”，“ targetMode”，“ targetMode”：“ targetMode”：“：”“ RID2”，“ TARGET”：“/MATLAB/output.xml”}]，“ parts”：[{“ parturi”：“/matlab/document.xml”，“关系”：[]：[]，“ contentType”：“：”：“”application/vnd.mathworks.matlab.code.document+xml“，” content“：” <？xml版本= \“ 1.0 \” encoding = \“ utf-8 \”？> \ n <w：document xmlns：w documn xmlns：w= \“ http：//schemas.openxmlformats.org/wordprocessingml/2006/main \”> <w：body> <w：p> <w：p> <w：ppr> <w：pstyle w：pstyle w：pstyle w：val = \ \ v \ \'> </w：ppr> <w：r> <w：t> a </w：t> </w：r> <w：r> <w：t> </w：t> </w：t> </w：r> <w：超链接w：doclocation = \“ http：//en.wikipedia.org/wiki/wiki/vampire_number \”> <w：r> <w：t>吸血鬼号</w：t> </w：t> </w：r> </w：超链接> <w：r> <w：t>是一个数字v，是两个数字x和y的乘积，因此满足以下条件：</w：t> </w：r> </w：p> <w：p> <w：ppr> <w：pstyle w：val = \“ ListParagraph \”/> <w：numpr> <w：numId w：val = \“ 2 \”/> </w：numpr> </w：ppr> <w：r> <w：t>x和y之一由10; </w：t> </w：r> </w：p> <w：p> <w：ppr> <w：pstyle w：val = \'listParagraph \“/> <w：numpr> <w：numId w：val = \“ 2 \”/> </w：numpr> </w：ppr> <w：r> <w：t> x和y相同数量的数字；and </w：t> </w：r> </w：p> <w：p> <w：ppr> <w：pstyle w：val = \“ listParagraph \”/> <w：numpr> <w：numpr> <w：numid w：val = \“ 2 \”/> </w：numpr> </w：ppr> <w：r> <w：t> v中的数字由x和y的数字组成（包括AnyRepetitions）。</w：t> </w：r> </w：p> <w：p> <w：ppr> <w：pstyle w：val = \“ text \”/> </w：pPr><w:r><w:t>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.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Write a function that returns all the vampire numbers in a given array. The output is a vector.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Example: disp(find_vampire(1000:2000) 1260 1395 1435 1530 1827</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>See also: </w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"//www.tatmou.com/matlabcentral/cody/problems/1825-find-all-vampire-fangs\"><w:r><w:t>Problem 1825. Find all vampire fangs</w:t></w:r></w:hyperlink><w:r><w:t> and</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"//www.tatmou.com/matlabcentral/cody/problems/1804-fangs-of-a-vampire-number\"><w:r><w:t>Problem 1804. Fangs of a vampire number</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

1061 Solutions
262 Solvers

LastSolutionsubmitted on Apr 27, 2022

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Rafael S.T. Vieira2020年7月16日

您确定第一条规则吗？根据https://oeis.org/a014575，这似乎没有必要。

Adibon 27 Jul 2020

The problem is really fun.

Solution Comments

Solution 1937166

1 Comment

1 Comment

Serhii Tetoraon 24 Sep 2020

作弊

Solution 1183879

2 Comments

2 Comments

Andrew Newellon 9 May 2017

由于我创建了问题系列并想要我徽章的功能，因此我认为我会提供结合Vampire_Factor和ARE_FANG的解决方案。不是很好的分数，但可读！

Andrew Newellon 9 May 2017

Sorry, I mean the Magic Numbers badge.

Solution 678164

1 Comment

1 Comment

danteliujieon 7 Apr 2019

喜欢它

Problem Recent Solvers262

建议的问题

Pattern matching
2074 Solvers
What is the distance from point P(x,y) to the line Ax + By + C = 0?
317求解器
Is X a Fibonacci Matrix?
355 Solvers
Count up then down
解决328
Is this triangle right-angled?
4128 Solvers

来自作者的更多9

Multivariate polynomials - overload multiplication
8个求解器
Find all vampire fangs
51个求解器
Multivariate polynomials - convert monomial form to array
8个求解器
Product of two multivariate polynomials
14个求解器
多向量的外产物
50 Solvers

Problem Tags

Community Treasure Hunt

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

开始狩猎！