High School Programming League 2008/2009

After his previous success with paying the bills, Adam has been given a more responsible assignment: he has been asked to prepare a system for encrypting text information. Adam had no previous knowledge of ciphers, so he started work by visiting his favorite bookstore, and still on the same day he learned some crucial facts about substitution ciphers.

One of the most important things he read was that substitution ciphers are easy to decrypt using frequency analysis. But Adam has an idea for a new cipher, and he believes that it will be safer.

Please help us convince him that he is wrong!

The following file has been generated using a three-step process:

• From a classical work, written in English, all non-letter characters have been removed.
• All of the remaining characters have been capitalized.
• The resulting character sequence has been encrypted.

Cryptogram

As a solution to this problem, please send the first and the last words of the encrypted text. The words should be separated by a space and all letters should be in uppercase.

Example:

If the plain text begins with: One and finishes with forever, then as a solution please submit: ONE FOREVER.

Scoring

By solving this problem you score 10 points.

Important note

All registered contestants are required to submit all source code and helper files written and used when solving the problem here (in ZIP format, max. 1 MB). If you did not write any source code, submit instead a concise description of how you obtained a solution.

Solutions which are not sufficiently motivated are subject to disqualification.