YES, DECODING is harder than CODING.
Let's assign integer numbers to letters according to their place in the English ABC (a=1, b=2,...,z=26.)
We then "code" a given word by 2 parameters, e.g:
YES SIR⇒(49,2375)(46,3078)
NO WAY⇒(29,210)(49,575)
Once you find how the coding was done, you will understand that
a) There is no one-to-one-correspondence between the word
and the ordered couple, so STAR, ARTS and RATS produce identical couples.
b) The correct decoding of a meaningful phrase might be possible.
NOW DECODE THE FOLLOWING PHRASES
(only one 5-letter word - all other words less than that):
a. (26,100)(39,1620)(58,6900)
b. (49,2375)(28,115)(18,42)
c. (46,2760)(19,60)(61,7875)(19,60)
d. (52,3680)(18,65)(99,2794500)
(In reply to
re: political reply to b by brianjn)
I would recommend copying my program and pasting into .BAS file to load into QB64. But change the size (number of factors) limit to 7:
IF sb < 5 THEN
factorIt sb + 1
END IF
change to
IF sb < 7 THEN
factorIt sb + 1
END IF
for the pundit's last name (not a comedian but an American consumer reporter turned libertarian pundit), as it has 7 letters.
If you don't have a word list available to OPEN, you could eliminate the word lookup and just find the factors, that the program assures add up to the sum and no factor exceeds 26.
The introductory word is an abbreviation, so will not show up. Unfortunately the program comes up with a lot of choices of factors (if you changed the factor limit to 7), but is an example of how it will look if no words are found (or no word lookup used):
? 64,46200
1 1 1 10 14 15 22
1 1 2 6 7 22 25
1 1 10 11 20 21
1 1 11 12 14 25
1 2 2 2 11 21 25
1 2 4 11 21 25
1 10 10 21 22
7 15 20 22
but I'll tell you it's the last (only 4-factor) set. In fact, except for the author's last name no word is more than 4 factors.
The words after this intro word and before the author's last name should not be too hard.
Edited on March 30, 2013, 9:19 am
|
|
Posted by Charlie
on 2013-03-30 09:13:43 |
re(2): political reply to b
