Clean-Up heading levels

Signed-off-by: Peter Wieland <[email protected]>

Author: mr-kaffee

day00/rust/mr-kaffee/README.adoc

@@ -1,13 +1,21 @@
-= Day 0 =
-
-I'll try to solve this year's edition with https://rust-lang.org[Rust].
+== Day 0: Hello World ==
 
 All days should run using `cargo run`.
+
+My hello world prints Ferris:
+....
+This year I became a Rustacian!
+    _~^~^~_
+\) /  o o  \ (/
+  '_   ¬   _'
+  \ '-----' /
+....
+
 I also plan to add some simple tests based on the example data from the puzzle descriptions which can be executed using `cargo test`.
 
 Tests are implemented in the same source file with the code in a separate `tests` module which is excluded from the regular binary:
 
-[sourc,rust,numbered]
+[source,rust,numbered]
 ....
 include::src/main.rs[tags=test]
 ....

day01/rust/mr-kaffee/README.adoc

@@ -1,4 +1,4 @@
-= Day 1: Report Repair =
+== Day 1: Report Repair ==
 
 Run solution with `cargo run`
 

day02/rust/mr-kaffee/README.adoc

@@ -1,4 +1,4 @@
-= Day 2: Password Philosophy =
+== Day 2: Password Philosophy ==
 
 Run solution with `cargo run`
 

day03/rust/mr-kaffee/README.adoc

@@ -1,4 +1,4 @@
-= Day 3: Toboggan Trajectory =
+== Day 3: Toboggan Trajectory ==
 
 Run solution with `cargo run`
 

day04/rust/mr-kaffee/README.adoc

@@ -1,4 +1,4 @@
-= Day 4: Passport Processing =
+== Day 4: Passport Processing ==
 
 Run solution with `cargo run`
 

day05/rust/mr-kaffee/README.adoc

@@ -1,4 +1,4 @@
-= Day 5: Binary Boarding =
+== Day 5: Binary Boarding ==
 
 Run solution with `cargo run`
 

day06/rust/mr-kaffee/README.adoc

@@ -1,4 +1,4 @@
-= Day 6: Custom Customs =
+== Day 6: Custom Customs ==
 
 Run solution with `cargo run`
 

day07/rust/mr-kaffee/README.adoc

@@ -1,10 +1,10 @@
-= Day 7: Handy Haversacks =
+== Day 7: Handy Haversacks ==
 
 Run solution with `cargo run`
 
 Run tests on example data with `cargo test`
 
-== Part 1 ==
+=== Part 1 ===
 
 Part 1 is solved with a breadth first search:
 
@@ -13,7 +13,7 @@ Part 1 is solved with a breadth first search:
 include::src/main.rs[tags=explore_parents]
 ....
 
-== Part 2 ==
+=== Part 2 ===
 
 Part 2 is solved with a recursive algorithm:
 

day08/rust/mr-kaffee/README.adoc

@@ -1,4 +1,4 @@
-= Day 8: Handheld Halting =
+== Day 8: Handheld Halting ==
 
 Rust solution for https://https://adventofcode.com/2020/day/8[AoC 2020, day 8].
 
@@ -8,7 +8,7 @@ Run some tests based on example data from
 https://https://adventofcode.com/2020/day/8[puzzle description]
 with `cargo test`
 
-== Part 1 ==
+=== Part 1 ===
 
 Instructions are modeled as an enum type with some derived traits:
 
@@ -24,7 +24,7 @@ Run program and store positions visited in a set until position repeats:
 include::src/main.rs[tags=run]
 ....
 
-== Part 2 ==
+=== Part 2 ===
 
 Alter instructions `nop <--> jmp` one by one until the program terminates without repetition: