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