some examples for the lem-in project

subjects/lem-in/lem-in-example.md

@@ -0,0 +1,253 @@
+## lem-in-examples
+
+- Create your file and copy the examples into it.
+
+### example00
+
+```console
+4
+##start
+0 0 3
+2 2 5
+3 4 0
+##end
+1 8 3
+0-2
+2-3
+3-1
+```
+
+### example01
+
+```console
+10
+##start
+start 1 6
+0 4 8
+o 6 8
+n 6 6
+e 8 4
+t 1 9
+E 5 9
+a 8 9
+m 8 6
+h 4 6
+A 5 2
+c 8 1
+k 11 2
+##end
+end 11 6
+start-t
+n-e
+a-m
+A-c
+0-o
+E-a
+k-end
+start-h
+o-n
+m-end
+t-E
+start-0
+h-A
+e-end
+c-k
+n-m
+h-n
+```
+
+### example02
+
+```console
+30
+##start
+0 2 0
+1 4 1
+2 6 0
+##end
+3 4 1
+0-1
+0-3
+1-2
+3-2
+```
+
+### example03
+
+```console
+4
+4 5 4
+##start
+0 1 4
+1 3 6
+##end
+5 6 4
+2 3 4
+3 3 1
+0-1
+2-4
+1-4
+0-2
+4-5
+3-0
+4-3
+```
+
+### example03
+
+```
+9
+##start
+richard 0 6
+gilfoyle 6 3
+erlich 9 6
+dinish 6 9
+jimYoung 11 7
+##end
+peter 14 6
+richard-dinish
+dinish-jimYoung
+richard-gilfoyle
+gilfoyle-peter
+gilfoyle-erlich
+richard-erlich
+erlich-jimYoung
+jimYoung-peter
+```
+
+### example04
+
+```
+9
+#rooms
+##start
+start 0 3
+##end
+end 10 1
+C0 1 0
+C1 2 0
+C2 3 0
+C3 4 0
+I4 5 0
+I5 6 0
+A0 1 2
+A1 2 1
+A2 4 1
+B0 1 4
+B1 2 4
+E2 6 4
+D1 6 3
+D2 7 3
+D3 8 3
+H4 4 2
+H3 5 2
+F2 6 2
+F3 7 2
+F4 8 2
+G0 1 5
+G1 2 5
+G2 3 5
+G3 4 5
+G4 6 5
+H3-F2
+H3-H4
+H4-A2
+start-G0
+G0-G1
+G1-G2
+G2-G3
+G3-G4
+G4-D3
+start-A0
+A0-A1
+A0-D1
+A1-A2
+A1-B1
+A2-end
+A2-C3
+start-B0
+B0-B1
+B1-E2
+start-C0
+C0-C1
+C1-C2
+C2-C3
+C3-I4
+D1-D2
+D1-F2
+D2-E2
+D2-D3
+D2-F3
+D3-end
+F2-F3
+F3-F4
+F4-end
+I4-I5
+I5-end
+```
+
+### example05(err)
+
+```
+0
+4 5 4
+##start
+0 1 4
+1 3 6
+##end
+5 6 4
+2 3 4
+3 3 1
+0-1
+2-4
+1-4
+0-2
+4-5
+3-0
+4-3
+```
+
+### example06(err)
+
+```
+20
+##start
+0 2 0
+1 7 0
+2 13 0
+3 18 0
+##end
+4 23 0
+5 7 6
+6 10 6
+7 13 6
+8 16 6
+9 7 2
+10 7 4
+11 13 2
+12 15 2
+13 17 2
+14 19 2
+15 21 2
+16 9 4
+0-1
+0-5
+0-9
+0-10
+1-2
+2-3
+3-3
+5-6
+6-7
+7-8
+8-7
+9-2
+10-16
+1-11
+11-12
+12-13
+13-14
+14-15
+15-1
+16-7
+```

subjects/lem-in/lem-in.en.md

@@ -18,7 +18,7 @@ You need to find the quickest way to get `n` ants across a colony (composed of r
 - At the beginning of the game, all the ants are in the room `##start`. The goal is to bring them to the room `##end` with as few moves as possible.
 - The shortest path is not necessarily the simplest.
 - Some colonies  will have many rooms and many links, but no path between `##start` and `##end`.
-Some will have rooms that link to themselves, sending your path-search spinning in circles, and some will have too many/too few ants, no `##start` or `##end`, duplicated rooms, links to unknown rooms, rooms with invalid coordinates, and a variety of other invalid or poorly-formatted input. In this cases the program will return an error message `ERROR: invalid data format`.
+- Some will have rooms that link to themselves, sending your path-search spinning in circles, and some will have too many/too few ants, no `##start` or `##end`, duplicated rooms, links to unknown rooms, rooms with invalid coordinates, and a variety of other invalid or poorly-formatted input. In this cases the program will return an error message `ERROR: invalid data format`.
 
 You must display your results on the standard output in the following format :