From 355178c74d361a38029fd4bd606b3b2baa0432ec Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Mike=20Schw=C3=B6rer?= Date: Thu, 26 Sep 2019 16:47:06 +0200 Subject: [PATCH] Fixed problems in Euler-028 (relied on pop-empty-stack) --- www/statics/euler/Euler_Problem-028.b93 | 4 ++-- www/statics/euler/Euler_Problem-028_explanation.md | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/www/statics/euler/Euler_Problem-028.b93 b/www/statics/euler/Euler_Problem-028.b93 index 34fe9ff..ff439cf 100644 --- a/www/statics/euler/Euler_Problem-028.b93 +++ b/www/statics/euler/Euler_Problem-028.b93 @@ -1,2 +1,2 @@ -"d"55+*1+::1-01p*>:01g-:01g-:01g-:01g-:1-#v_>+\:#<_$.@ -X ^p10-2g10 < \ No newline at end of file +0"d"55+*1+::1-01p*>:01g-:01g-:01g-:01g-:1-#v_>\# :#+_+.@ +X ^p10-2g10 < \ No newline at end of file diff --git a/www/statics/euler/Euler_Problem-028_explanation.md b/www/statics/euler/Euler_Problem-028_explanation.md index c5f9039..5e04b92 100644 --- a/www/statics/euler/Euler_Problem-028_explanation.md +++ b/www/statics/euler/Euler_Problem-028_explanation.md @@ -17,7 +17,7 @@ You can probably see the pattern here. The rest of the algorithm is simply loop I have this little code to calculate the sum of stack values until a zero is encountered: ```befunge ->+\:#<_$ +>\# :#+_+ ``` Perhaps it's useful for someone else. \ No newline at end of file