Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

HS08ANCP - Ancient Ciphers

Barbara is interested in ancient history. While reading about scytale, Caesar's cipher, and related concepts, she discovered a nice puzzle. Some Latin sentences have been encrypted by methods similar to those used ages ago. Deciphering the hidden messages took Barbara many long autumn evenings before she was able to solve the puzzle.

Would you be able to solve the puzzle faster, as a programmer having a computer at your disposal?

As the solution to the problem, send a plain text file containing the decrypted text of the following sentences:

1: xzrnhxnijfynaijxjfqtmhxsts
2: yjosxtrfswoemjsrxidclsqiddbihaykmkwaozsraidcrhbeqmmbbarltwnu
3: znawzlqrebfbhmuqdbuhfcudyaqrdzqoewgkpkaydhqiyd
4: asuxjozaxyzksgyzukzozovkxk
5: xnwlrbibmqbhqcdarztowkkyyhiddqwscdxrjjmowfyrxsjykbldbemfsarcxbynec

Submission format: Your text file should consist of five lines. Each line consists of the number of the sentence, a colon, a space, and either the decrypted sentence, or a question mark (in case you are unable to discover the plain text).

Each of the decrypted messages consist of lower case letters, spaces, and commas, only.

Example 1: Cipher text:
epdfoepejtdjnvt

Plain text:
docendo discimus

Example 2: Cipher text:
ttirqakhoupnltdebxmenmmprlwaadcoyclehnhtivaesrubxa

Plain text:
verba docent, exempla trahunt

Example 3: Suppose that the sentences from Examples 1 and 2 are given as the third and fifth sentences of the puzzle, and that the other sentences are left unsolved. In this case the correct solution would be:

1: ?
2: ?
3: verba docent, exempla trahunt
4: ?
5: docendo discimus

Scoring

For each solved sentence you will score 2 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.


Added by:kuszi
Date:2008-10-18
Time limit:1s
Source limit:500B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ADA95 ASM32 BASH BF C CSHARP CPP C99 CLPS CLOJURE LISP sbcl LISP clisp D ERL FORTRAN HASK ICON ICK JAVA JS-RHINO LUA NEM NICE NODEJS OCAML PAS-GPC PAS-FPC PERL PERL6 PHP PIKE PRLG-swi PYTHON RUBY SCM guile SCM qobi ST VB.NET WHITESPACE
Resource:High School Programming League 2008/2009

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.