This program tests all possible combinations of letter values of the alphabet. the values go from 1 , 2 ,3 ,4 ,5 ,6, 7, 8, 9, 10, 20, 30, 40 ,50 ,60 ,70, 80 ,90, 100, 200, 300, 400, 500 ,600 ,700 ,800. There are 26 letters in the English alphabet. Thus, 26 possible values. No two letters may have the same value. The program should be able to take words, such as the word "one", for example, and find all possible combinations of values where the sum of o + n + e is divisible by 19. In the case of multiple words, such as "one" and "gatherer", the values from both words must apply to eachother, in this case the value of e from the word one must apply to the e values in the word gatherer and the sum of one must be divisible by 19 and the sum of gatherer must be divisible by 19 as well. The program must list all possible combinations that produce the 19 divisibility effect which is easily accessed by the user. A prototype program is already available. The coder must simply add the extra features listed here.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done as described in the description. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.
All windows. C or C++. Preferably compilable in Borland 5.5