changed readme

README.md

@@ -1,13 +1,13 @@
-#Here will be all of ε/2's code for lambdaheads meeting
+# Here will be all of ε/2's code for lambdaheads meeting
 ---
 ## 2012-02-19: Crop:
 
 from the [ccc2010](http://catcoder.catalyst.cc): the task to solve is to
 get numbers of an array according to a path.
-- [instructions and level1](http://www.unet.univie.ac.at/~a0307893/downloads/description-level1.pdf)
-- [level2](http://www.unet.univie.ac.at/~a0307893/downloads/description-level2.pdf)
-- [level3](http://www.unet.univie.ac.at/~a0307893/downloads/description-level3.pdf)
-- [level4](http://www.unet.univie.ac.at/~a0307893/downloads/description-level4.pdf)
-- [level5](http://www.unet.univie.ac.at/~a0307893/downloads/description-level5.pdf)
+ * [instructions and level1](http://www.unet.univie.ac.at/~a0307893/downloads/description-level1.pdf)
+ * [level2](http://www.unet.univie.ac.at/~a0307893/downloads/description-level2.pdf)
+ * [level3](http://www.unet.univie.ac.at/~a0307893/downloads/description-level3.pdf)
+ * [level4](http://www.unet.univie.ac.at/~a0307893/downloads/description-level4.pdf)
+ * [level5](http://www.unet.univie.ac.at/~a0307893/downloads/description-level5.pdf)
 I tried to solve this in Haskell - by generating a path and turning the array
 and always collecting the first row.