From 65eec53c27f9b66c86cd5d8a01c9103cc4d16e69 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Mike=20Schw=C3=B6rer?= Date: Sat, 3 Feb 2018 18:49:23 +0100 Subject: [PATCH] more broken links --- www/statics/blog/funupdate.md | 2 +- www/statics/blog/more_euler.md | 2 +- www/statics/blog/spammers.md | 2 +- www/statics/euler/Euler_Problem-044_explanation.md | 2 +- www/statics/euler/Euler_Problem-086_description.md | 2 +- 5 files changed, 5 insertions(+), 5 deletions(-) diff --git a/www/statics/blog/funupdate.md b/www/statics/blog/funupdate.md index 8a6a2e0..fb2c32d 100644 --- a/www/statics/blog/funupdate.md +++ b/www/statics/blog/funupdate.md @@ -1,4 +1,4 @@ -After a lot of requests i come to update the [Fun-Page](/fun/fun.php). +After a lot of requests i come to update the Fun-Page. The flying parts are now a good amount slower and the colors not *that* bright ... Complaints can go into the guestbook. diff --git a/www/statics/blog/more_euler.md b/www/statics/blog/more_euler.md index a09f336..617fe6a 100644 --- a/www/statics/blog/more_euler.md +++ b/www/statics/blog/more_euler.md @@ -1,4 +1,4 @@ -A lot of you probably have seen [various](/programs/view/BefunUtils) [befunge](/programs/view/BefunZ) [stuff](https://github.com/Mikescher/BefunUtils) on this site. +A lot of you probably have seen [various](/programs/view/BefunUtils) [befunge](/programs/view/BefunUtils) [stuff](https://github.com/Mikescher/BefunUtils) on this site. But a thing I do now for a while is solving the **[Project Euler](https://projecteuler.net/)** problems in befunge. To celebrate fifty solved levels I want to rally you again to my **[blogpost about this project](/blog/1/Project_Euler_with_Befunge)** and the [table](/blog/1/Project_Euler_with_Befunge) with all my solved problems. diff --git a/www/statics/blog/spammers.md b/www/statics/blog/spammers.md index 744ee02..49455fd 100644 --- a/www/statics/blog/spammers.md +++ b/www/statics/blog/spammers.md @@ -6,4 +6,4 @@ Btw, i took the "fun" path and tried writing my own captcha code, here you can s ![Captcha][1] - [1]: /images/log/captcha_img.png \ No newline at end of file + [1]: /data/images/log/captcha_img.png \ No newline at end of file diff --git a/www/statics/euler/Euler_Problem-044_explanation.md b/www/statics/euler/Euler_Problem-044_explanation.md index 2acf217..a4a2a04 100644 --- a/www/statics/euler/Euler_Problem-044_explanation.md +++ b/www/statics/euler/Euler_Problem-044_explanation.md @@ -4,5 +4,5 @@ The problem is that you need a square root to inverse the pentagonal formula and So I needed to implement my own version of integer square roots in Befunge (see [wikipedia](https://en.wikipedia.org/wiki/Methods_of_computing_square_roots)). The program is still not really fast but it's good that I managed to speed it up to a time where you can execute it without waiting the whole night. -Also this program is nicely compact, by the time I'm writing this my Befunge interpreter [BefunExec](https://www.mikescher.de/programs/view/BefunUtils) has gotten a display of all possible paths a program can take. +Also this program is nicely compact, by the time I'm writing this my Befunge interpreter [BefunExec](https://www.mikescher.com/programs/view/BefunUtils) has gotten a display of all possible paths a program can take. And if you look at the graph of this program, it looks pretty interesting... \ No newline at end of file diff --git a/www/statics/euler/Euler_Problem-086_description.md b/www/statics/euler/Euler_Problem-086_description.md index 0403457..b0abd98 100644 --- a/www/statics/euler/Euler_Problem-086_description.md +++ b/www/statics/euler/Euler_Problem-086_description.md @@ -3,7 +3,7 @@ and a fly, **F**, sits in the opposite corner. By travelling on the surfaces of the room the shortest "straight line" distance from **S** to **F** is 10 and the path is shown on the diagram. -![img](/data/blog/Befunge/p086.gif) +![img](/data/images/blog/p085.gif) However, there are up to three "shortest" path candidates for any given cuboid and the shortest route doesn't always have integer length.