### Subversion checkout URL

You can clone with HTTPS or Subversion.

Fetching contributors…

Cannot retrieve contributors at this time

57 lines (50 sloc) 2.733 kb

# Here will be all of ε/2's code for lambdaheads meeting

## 2012-02-19: Crop:

from the ccc2010: the task to solve is to get numbers of an array according to a path.

are just some finger exercises for not loosing grasp of haskell

## Coding Challenges

inspired by hop I want to introduce coding challenges to Lambdaheads

### Cryptoanalysis 101:

Inspired by a question I answered on stackoverflow.com: One knows the easiest of cryptographic ciphers to break is the "Ceasar-Cipher" it works just by transposition of letters. The way to break it is to analyze the number of occurences of a letter in a text and compare it to a frequency table of the guessed language the text is written in. write a function to decipher the following text by use of frequency analysis

• the following text is written in english:
```LIVITCSWPIYVEWHEVSRIQMXLEYVEOIEWHRXEXIPFEMVEWHKVSTYLXZIXLIKI
IXPIJVSZEYPERRGERIMWQLMGLMXQERIWGPSRIHMXQEREKIETXMJTPRGEVEKE
ITREWHEXXLEXXMZITWAWSQWXSWEXTVEPMRXRSJGSTVRIEYVIEXCVMUIMWERG
MIWXMJMGCSMWXSJOMIQXLIVIQIVIXQSVSTWHKPEGARCSXRWIEVSWIIBXVIZM
XFSJXLIKEGAEWHEPSWYSWIWIEVXLISXLIVXLIRGEPIRQIVIIBGIIHMWYPFLE
VHEWHYPSRRFQMXLEPPXLIECCIEVEWGISJKTVWMRLIHYSPHXLIQIMYLXSJXLI
MWRIGXQEROIVFVIZEVAEKPIEWHXEAMWYEPPXLMWYRMWXSGSWRMHIVEXMSWMG
STPHLEVHPFKPEZINTCMXIVJSVLMRSCMWMSWVIRCIGXMWYMX
```
• the frequency table for the english language is given by:
```['E', 'T', 'A', 'O', 'I', 'N', 'S', 'H', 'R', 'D', 'L', 'C', 'U'
,'M', 'W', 'F', 'G', 'Y', 'P', 'B', 'V', 'K', 'X', 'J', 'Q', 'Z']
```
• the result should be - as frequency analysis is not a real good tool:
```RENEMYSODEUNTOLTNSHEWIARTUNTKETOLHATAEDBTINTOLFNSMURAPEAREFE