WEEKLY CHALLENGE

/prog/'s weekly challenge

Write a solution to Project Euler's first problem (http://projecteuler.net/index.php?section=problems&id=1)
using the befunge93 language (http://catseye.tc/projects/befunge93/doc/befunge93.html).

Translation: Do this semi-obscure thing I just heard of with this other semi-obscure thing I just heard of. Welcome to fucking years ago son.

82*94+*92*1+*427**3+*.@

>>2
years ago
so what is contemporary?

>>2
Go fuck yourself, you wannabe-elitist cunt.

>>5
So a priest, a rabbi and a used car salesman walk into a bar. They sit down and order drinks. The priest orders a tall milk. The rabbi orders a Shirley Temple. The used car salesman orders a double shot of Jack.

The priest and rabbi quickly get into pedantry over the finer points of a certain passage in the Torah, however they're discussing it amicably enough. The used car salemsan is bored by this and turns to start a conversation with the patron on his left. The man is scribbling notes in a notebook, which catches the salesman's eye. It reminds him something from his time spent in college. After a moment, he musters his wit and says "HAVE YOU READ YOUR SICP TODAY?" It is apparent the other patron recognizes the meaning, but he says nothing, only shaking his head in disappointment.

Put off by his fellow patron's attitude, the salesman calls him out as a wannabe elitist and storms off.

And that is why I do not talk to used car salesmen in bars.
             -- Gerald GJS Jay Süßmann Sussman

>>5
Congratulations on finding the Mathematical Alphanumeric Symbols block.

>>5
YOU WANNA FIGHT HUH

WELL LET ME TELL YOU

^{I'LL INDENT YOU LIKE PYTHON}

I'LL SLAP YOU LIKE MY MOM

000pv
v0  <                     >v
>00g+00g3+00p00g5558***1-`|
^                         <
v                          >000p
                          >  v
>00g+00g5+00p00g5558***1-`|
^                         <
v                            >000p
                            >.@
>00g-00g35*+00p00g5558***1-`|
^                           <

main = print $ sum $ filter (\x -> x `mod` 3 == 0 || x `mod` 5 == 0) [1 .. 1000]

HASKAL > BEFUNGE LOL

Not befunge, but here's one simple CL solution:
(loop for i from 1 to 1000 when (or (zerop (mod i 3)) (zerop (mod i 5))) sum i)

Fine then, Perl 6 confirmed for toy language:
[+] ( for ^1000 { $^a %% any(3,5) ?? $a !! 0 } )

My fist stab at golfing this made it return (and sum) junctions, which is a not so subtle clue to stop. In other news, Rakudo Star will happily reduce junctions in the least-efficient-yet-technically-correct manner plausible.

>>6
You've got way too much time to spare. Maybe you should try getting a job.

>>7
Thanks!

>>8
You should really reconsider the normality of your relationship with your mother.

It's odd that there's a "challenge" that involves finding multiples of 5 and 3.

>>10-14
I'm the only one who won without cheating so far and all you people care about is non-Befunge solutions and shitposts?

Actually, here's some more esolangs, this is sorta fun.

Golfscript:
1000,.3%\5%|{+}*

J:
+/t#~+./0=3 5|,:~t=.i.1000

FALSE:
0a:
0s:[s;3+ 999>~][s;3+s: a;s;+a:]#
0s:[s;5+ 999>~][s;5+s: a;s;+a:]#
0s:[s;15+999>~][s;15+s:a;s;-a:]#a;.

Codan (haven't tested this, same pseudocode though):
0 ← 0
1 ← 0
«
    2 ← 3
    Α ← 1 Β ← 2 + → α
    Α ← 0 Β ← 1 + → α
    β < 1000
»
1 ← 0
«
    2 ← 5
    Α ← 1 Β ← 2 + → α
    Α ← 0 Β ← 1 + → α
    β < 1000
»
1 ← 0
«
    2 ← 15
    Α ← 1 Β ← 2 + → α
    Α ← 0 Β ← 1 - → Α
    β < 1000
»
α → Λ

>>15
I'm the only one who won without cheating
Yeah, it's weird how everyone didn't jump on such a tough challenge, right?  Congratulations.

>>15,16
Personally I only ever post Befunge code when it's unexpected/undesired.

LISP