Write a program (Crypta.java) that finds a solution to the cryparithmetic puzzle:
TOO + TOO + TOO+ TOO = GOOD
The simplest technique is to use a series of nested loops, each representing the value of one letter (T, O, G, D). The loops systematically assign a value from 0 to 9 to each of the letters. In the body of the innermost of these loops, all 10,000 possible combinations of values of T, O, G and D will be tried. In that innermost loop, if each of these values is distinct from the others and the equation is satisfied, output the value assigned to each letter.
You will have to consider how to calculate the value of "GOOD" and "TOO" for given values of T, O, G and D.