Problem 621. Cryptomath: Addition
The problem is to find the number-to-string matching that results in a + b = 3, right?
Test case needs to be changed,thre can be more than 1 solution to the problem.
e.g. in question for example,[afgilstw = 74062195] is also one correct solution.
Suresh, Which test case? Please be more explicit. These were all taken from a list of known problems, so I need more info to understand if one is flawed.
I am saying in general there can be more than one solution e.g. the one in the question, Wait+All = GIFTS , for that[afgilstw = 74062195] is also valid solution. i.e.[ 5769 +722 = 6491]
Note in the instructions: "No left hand zeros"
Difficult to solve in time.
I saw the note regarding "No left hand zeros", but did not put it together until later that it's really a hint regarding the sum; the 'G' in gifts cannot be mapped to a 0. It's clear now, but initially I thought the remark was referring to 'ALL' not having a blank character to the left (e.g. '\ ALL') that would be 0 when mapped to digits (e.g. 0677).
No leading zeros or repeating numbers. Be careful.
% 4956 911 05867
% 9707 766 10473
% wait all gifts
The problem with randomness is that we can't be sure about the time one experiment will take. Sometimes my solution founds the mapping in less than one second, but, in others, it can take 25 seconds: blowing the time limit.
Solution CommentsShow comments
Problem Recent Solvers30
Count from 0 to N^M in base N.
Make a random, non-repeating vector.
Set the array elements whose value is 13 to 0
More from this Author51
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!