Problem 663. Crypto Addition - v01

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Crypto addition is solving for the numeric values of the characters given in an addition equation:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[   abc       756\n  +def       342\n  ----      ----\n  ghij      1098]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Input [ 'abc' , 'def' , 'ghij' ] Output [ 756 342 1098 ] or [ ] if no solution</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>All characters have unique values.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Leading zeros are not allowed.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This Crypto Addition v01 is limited to two addends and a sum.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The output is the number values [anum bnum cnum] given [astr, bstr,cstr].</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>If there is no solution the output should be [ ], empty set.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>I am planning v02 thru v05 with additional complications.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>v02 will have embedded numbers.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>v03 will allow up to ten addends vs the current two.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>A solid recursive routine can crack each test case in under 75 msec.</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

31 Solutions
6 Solvers

Last Solution submitted on Nov 12, 2018

Last 200 Solutions

Solution Comments

Solution 345393

1 Comment

1 Comment

Alfonso Nieto-Castanon on 4 Nov 2013

All right! This is officially the longest cody problem i've solved from my phone :)

Problem Recent Solvers6

Problem Tags

recursion crypto vector string math

Community Treasure Hunt

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

Start Hunting!

Problem 663. Crypto Addition - v01

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers6

Suggested Problems

More from this Author255

Problem Tags

Community Treasure Hunt

Problem 663. Crypto Addition - v01

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers6

Suggested Problems

More from this Author255

Problem Tags

Community Treasure Hunt

Players