Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions

Fixed problems in Euler-028 (relied on pop-empty-stack)

Browse Source
This commit is contained in:
Mike Schwörer 2019-09-26 16:47:06 +02:00
parent 42dacb8ce6
commit 355178c74d
Signed by: Mikescher
GPG Key ID: D3C7172E0A70F8CF
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
www/statics/euler/Euler_Problem-028.b93
View File

@ -1,2 +1,2 @@
"d"55+*1+::1-01p*>:01g-:01g-:01g-:01g-:1-#v_>+\:#<_$.@ 0"d"55+*1+::1-01p*>:01g-:01g-:01g-:01g-:1-#v_>\# :#+_+.@
X ^p10-2g10 < X ^p10-2g10 <

2
www/statics/euler/Euler_Problem-028_explanation.md
View File

@ -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: I have this little code to calculate the sum of stack values until a zero is encountered:
```befunge ```befunge
>+\:#<_$ >\# :#+_+
``` ```
Perhaps it's useful for someone else. Perhaps it's useful for someone else.