In cryptarithmetic puzzles, mathematical equations are written by using letters. Each letter can be digit from 0 to 9, but no two letters can be same. Here is sample problem: SEND + MORE = MONEY. A solution to puzzle is S=9, R=8, O=0, M=1, Y=2, E=5, N=6, D=7
Write down a java program which finds solution to cryptarithmetic puzzle of:
TOO + TOO + TOO + TOO = GOOD
Simplest technique is to use nested loop for each unique letter (in this case T, O, G, D). Loops would systematically allot digits from 0 to 9 to each letter. For instance, it might first try T=0, O=0, G=0, D=0, then T=0, O=0, G=0, D=1, then T=0, O=0, G=0, D=2, etc., up to T=9, O=9, G=9, D=9. In loop body, test that each variable is unique and that equation is satisfied. Output values for letters which satisfy the equation.