« first day (1940 days earlier)      last day (2902 days later) » 

12:10 AM
@QPaysTaxes A quick Google found this
"forth stack effect"
Forth is the SBL that I know it's a convention in
 
I wish SMBC oneboxed :(
 
Well yeah, with the direct image link
 
But it's too small to read
like XKCD images
 
Also missing the hovertext and red button as a direct link.
 
12:27 AM
@Doorknob Red button?
 
At the bottom of the SMBC page.
Here, I gotchu
 
Dammit, I just spent a good chunk of 2 hours working on writing a nice little micspam program for TF2. Then I googled a problem I was having and inadvertently stumbled upon a bash script that does literally everything I was trying to do exactly the way I was doing it
Well, not exactly. It used sox. I was using a Pulseaudio monitor.
 
Hey @Doorknob Hypothetically, if there was a vim-inspired golfing language, and <M-s> and <M-S> were shortcuts for :s/foo/bar and :s/foo/bar/g respectively, what should the shortcuts for :%s/foo/bar and :%s/foo/bar/g be?
 
I use it on a friendly server, people usually ask for someone to play music
Yeah, I hate people who micspam on an actual server
Oh, no no. Micspam as in playing music over your microphone.
 
12:42 AM
my favourite type of micspam is to groan really loudly during conversations
 
For the last few months, it's been more surprising for me to not hear the CPU fan running
 
hey
o_O my message went from 1 star to 5.
damnit
>_>
 
1:04 AM
I can't read
 
@quartata Why'd you remove that? It was a good suggestion.
 
Nah. I thought you said <M-s> and <M-S> were :s/foo/bar and :%s/foo/bar
 
@CᴏɴᴏʀO'Bʀɪᴇɴ wherefore art thou?
I wisheth to watch you play more nethack.
 
@DrGreenEggsandHamDJ 183640220196933542170474132021013586 in decimal
 
1:07 AM
@quartata I could do that. The only downside is that it would also be useful to have a shortcut for :g/foo/norm something
 
@EᴀsᴛᴇʀʟʏIʀᴋ 0/10 only use -eth on third person
 
0/10 but im speeking the way i want to, not enligsh
 
\x12$(\x16\x01`]#*\x11\x04J\r\x14\x15\x01#V in ASCII. No super 1337 secret message :/
Oh wait oops I did it wrong
 
Hey
 
1:17 AM
"6282131410000allthecoolkidsusebase6"
?????
I think I did it wrong
 
2
A: Output the alphabet using the alphabet

Leaky NunBrainfuck, 67 - 26 + 26 (comment) = 41 67 bytes golfabcdehijkmnpqrstuvwxyz++++++++[>++++++++++++>+++<<-]>>++[-<+.>] Try it online!

comment or no-op?
 
@LeakyNun 1. Nice name. 2. Comment, because a no-op could mean something like -+.
No-op more specifically means a command that has no effect, the letters aren't even read.
 
Or []/<>/></+- etc
 
[] is not a no-op
 
@LeakyNun please don't post so many answers on one question.
Other people might disagree, but imho it looks like rep-hoarding and is frustrating to people who want to answer themselves.
 
1:21 AM
ok
 
Dammit, Kenny... all the good solutions, gone like that. — DerpfacePython 20 hours ago
 
I'll not do that next time
 
He means it.
@LeakyNun thank you.
@LeakyNun yeah, that counts as a comment.
 
I think it's the problem of the question
 
Leaderboard (evaluated):
Jelly:       !¡
05AB1E:      sF!
Actually:    `!`n
MATL:        :":p
CJam:        q~{m!}*
Pyth:        u.!GEQ
Pyth:        Mem=.!GH
Mathematica: #!&~Nest~##&
J:           4 :0\n(!^:y)x\n)
J:           ".@($&'!'@[,":@])
UGL:         iilRc%l$d:_l*%:%rd:_o
Haskell:     f 0 y=y\nf x y=product[1..f(x-1)y]
Julia:       x->y->eval(parse("$x"*repeat("|>factorial",y)))
Python:      f=lambda a,b,k=1:b and(a and f(a-1,b,k*a)or f(k,b-1))or a

Leaderboard (without evaluation):
Julia:       x->y->"$x"*repeat("|>factorial",y)
 
1:23 AM
All the answers are almost identical
 
Chat mini-challenge: given positive integers x and y, output the result of the application of factorial to x for y times
For example, 3,2 -> (3!)!
 
Wow Haskell did pretty good :P
 
0
A: Sandbox for Proposed Challenges

xnorString covering Given a target string and a list of fragment strings, determine whether the target string can be formed by concatenating fragments, allowing overlaps. Each fragment can be used any number of times. Example: cataract, [tar, car, tar, act, rat] -> True cataract cat tar ac...

 
1:32 AM
@EᴀsᴛᴇʀʟʏIʀᴋ I amst here
 
HAIeth to thou
I am still here?
 
damnit
dinner, bye!
 
@LeakyNun btw, 4 :'(!^:y)x' in J for 12 bytes
@EᴀsᴛᴇʀʟʏIʀᴋ bai
 
1:35 AM
Leaderboard (evaluated):
Jelly:       !¡
05AB1E:      sF!
Actually:    `!`n
MATL:        :":p
CJam:        q~{m!}*
Pyth:        u.!GEQ
Pyth:        Mem=.!GH
Mathematica: #!&~Nest~##&
J:           4 :'(!^:y)x'
J:           4 :0\n(!^:y)x\n)
J:           ".@($&'!'@[,":@])
UGL:         iilRc%l$d:_l*%:%rd:_o
Haskell:     f 0 y=y\nf x y=product[1..f(x-1)y]
Julia:       x->y->eval(parse("$x"*repeat("|>factorial",y)))
Python:      f=lambda a,b,k=1:b and(a and f(a-1,b,k*a)or f(k,b-1))or a

Leaderboard (without evaluation):
 
@EᴀsᴛᴇʀʟʏIʀᴋ try my challenge xd
 
I did.
i did julia
 
1:35 AM
   j=:4 :'(!^:y)x'
   3 j 2
720
   j=:4:'(!^:y)x'
   3 j 2
|syntax error
|       3 j 2
 
yeah, it's like the second longest
 
>_>
opens jolf
 
^^^^ anyone knows why that happens?
 
@CᴏɴᴏʀO'Bʀɪᴇɴ standby for help requests
 
@EᴀsᴛᴇʀʟʏIʀᴋ the conor is standing by
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Because 4: is a noun
 
4: is a constant
 
@CᴏɴᴏʀO'Bʀɪᴇɴ how to apply a function n times?
 
1:37 AM
the constant functions
@EᴀsᴛᴇʀʟʏIʀᴋ I don't think I have a builtin for that
 
something like 1:`(]*$:@<:)@.*, used in recursive functions (this is factorial)
 
okay
@CᴏɴᴏʀO'Bʀɪᴇɴ ... you haven't done factorial?
 
how do factorial jolf wait nvm
 
JS (one is a port of the Python one)
f=(a,b,k=1)=>b&&(a&&f(a-1,b,k*a)||f(k,b-1))||a
g=_=>_-1?_*g(_-1):1;f=a=>b=>--b?f(g(a))(b):g(a)
 
1:38 AM
damnit, ununbai
 
@MarsUltor You've been awarded the "not even long" award
 
@EᴀsᴛᴇʀʟʏIʀᴋ UNUNBAI
@LeakyNun btw what's the different between eval'd and without eval?"
 
@LeakyNun wat that's two
 
1:39 AM
The thing without eval outputs something like (3!)!
 
two different, equivalent submissions
 
@CᴏɴᴏʀO'Bʀɪᴇɴ One makes a string to eval
 
only that the parser can read it
 
@aditsu Better would be [[0]*x for x in [b]*b]. No nasty eval stuff. :P
 
1:39 AM
@LeakyNun Each line is one solution
 
UNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNUNBAI!!!!!!!!
the number of UN is even.
 
Leaderboard (evaluated):
Jelly:       !¡
05AB1E:      sF!
Actually:    `!`n
MATL:        :":p
CJam:        q~{m!}*
Pyth:        u.!GEQ
Pyth:        Mem=.!GH
Mathematica: #!&~Nest~##&
J:           4 :'(!^:y)x'
J:           4 :0\n(!^:y)x\n)
J:           ".@($&'!'@[,":@])
UGL:         iilRc%l$d:_l*%:%rd:_o
Haskell:     f 0 y=y\nf x y=product[1..f(x-1)y]
Javascript:  f=(a,b,k=1)=>b&&(a&&f(a-1,b,k*a)||f(k,b-1))||a
Julia:       x->y->eval(parse("$x"*repeat("|>factorial",y)))
Javascript:  g=_=>_-1?_*g(_-1):1;f=a=>b=>--b?f(g(a))(b):g(a)
 
@LeakyNun what is this for?
 
Chat mini-challenge: given positive integers x and y, output the result of the application of factorial to x for y times
For example, 3,2 -> (3!)!
 
@LeakyNun Haha, i thought of your username in a naughty way
 
1:41 AM
...
@CᴏɴᴏʀO'Bʀɪᴇɴ obtw: junethack.net
a nethack tournament
 
interesting
I'll lose >_>
 
dNethack works also, so you can try it.
@CᴏɴᴏʀO'Bʀɪᴇɴ so will I.
 
last and second places? :3
 
I haven't ascended in a couple months of playing.
 
1:42 AM
v better description
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Beat the game.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Why doesn't this work? e*"!YX
 
@CᴏɴᴏʀO'Bʀɪᴇɴ though it can take a year or so to win.
 
It consumes the first piece of input but not the second
 
1:43 AM
@EᴀsᴛᴇʀʟʏIʀᴋ holy crud
@quartata it should only take one input
wait
 
+ implicit right?
 
well, eval is unary, and * is binary. you give one arg to to *, and e gets its arg, so one arg is consumed
 
e*j"!Yj doesn't work either so
@CᴏɴᴏʀO'Bʀɪᴇɴ It parses totally correctly (* gets input added to it)
 
try {
    var x = eval(prompt("x = "));
} catch (e) {
    var x = 42;
}
jolf(mul("!YX", x));
 
1:45 AM
jolf is typically unary, you need to increase its arity
 
But I want it to be unary.
I want to multiply "!YX" by input then eval it
 
no you don't. jolf is its own function, and takes input as a second argument to the function
 
Oh, I see the problem now
@CᴏɴᴏʀO'Bʀɪᴇɴ OK
 
@CᴏɴᴏʀO'Bʀɪᴇɴ How to implement this in J? f=:reduce(lambda a,b:a*b,1+range(n))
 
@LeakyNun eh? what does map do?
oh
 
1:47 AM
f=:*/1+@:i. doesn't seem to work
 
Idk python. what does unary range do?
 
e;*"!Y"jj doesn't work either :/
 
@LeakyNun replace 1+ with >:
 
Does implicit input not work in e?
 
it doesn't iirc
 
1:48 AM
@CᴏɴᴏʀO'Bʀɪᴇɴ Doesn't work
 
Nope.
 
gimme a sec
2 mins ago, by Cᴏɴᴏʀ O'Bʀɪᴇɴ
Idk python. what does unary range do?
 
change that to atop
*/@:>:@:i.
this worked
range(n) -> [0,1,...,n-1]
same as "i." in J
 
so... you're implementing factorial?
@QPaysTaxes not really
 
1:49 AM
Yes
 
@DrGreenEggsandHamDJ How would you enter foo and bar?
 
and it worked
because >:@:i. is a dyad, so you need to use @: instead of @
 
shave a byte: */@:>:@i.
 
oh
I originally wanted it to be on the left hand side
 
I used to not be able to
 
1:51 AM
that's why I used @:
 
@QPaysTaxes define words
 
@CᴏɴᴏʀO'Bʀɪᴇɴ e+*"!Y"ii doesn't work either
var i = prompt("i = ");
jolf(add(mul("!Y", i), i));
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Then I don't get it. >:@i. isn't a dyad, why do I need @: instead of @?
 
@LeakyNun I'm not too solid on @ and @:.
@quartata e;+*j"!Y'X
 
Oh, I'm dumb
 
1:54 AM
@QPaysTaxes I'm on the first page. I'm not pressing next until I know what I'm submitting >_>
@QPaysTaxes ?
 
Leaderboard (evaluated):
Jelly:       !¡
05AB1E:      sF!
Actually:    `!`n
MATL:        :":p
CJam:        q~{m!}*
Pyth:        u.!GEQ
Pyth:        Mem=.!GH
Jolf:        e;+*j"!Y'X
Mathematica: #!&~Nest~##&
J:           4 :'(!^:y)x'
J:           4 :0\n(!^:y)x\n)
J:           ".@($&'!'@[,":@])
UGL:         iilRc%l$d:_l*%:%rd:_o
Haskell:     f 0 y=y\nf x y=product[1..f(x-1)y]
Javascript:  f=(a,b,k=1)=>b&&(a&&f(a-1,b,k*a)||f(k,b-1))||a
Julia:       x->y->eval(parse("$x"*repeat("|>factorial",y)))
Javascript:  g=_=>_-1?_*g(_-1):1;f=a=>b=>--b?f(g(a))(b):g(a)
 
@QPaysTaxes I'm so so so so ... so (720 times) sorry. I'm running on 3 hours of sleep
 
@LeakyNun e+*j"!Y is shorter
It takes arguments in the reverse order though.
 
rejected
 
Why?
 
1:57 AM
I don't like taking arguments in the reverse order
 
Uhh... why? It's not like it matters that much in this case.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Is i.@:[a monad or a dyad?
well...
 
@LeakyNun both?
 
okay
@CᴏɴᴏʀO'Bʀɪᴇɴ Why?
 
My Haskell solution takes them in the reverse order too.
 
1:59 AM
because defined verbs have both cases...?
 
Leaderboard (evaluated):
Jelly:       !¡
05AB1E:      F!                (swaps order)
Actually:    `!`n
MATL:        :":p
CJam:        q~{m!}*
Pyth:        u.!GEQ
Pyth:        Mem=.!GH
Jolf:        e+*j"!Y                (swaps order)
Mathematica: #!&~Nest~##&
J:           4 :'(!^:y)x'
J:           4 :0\n(!^:y)x\n)
J:           ".@($&'!'@[,":@])
UGL:         iilRc%l$d:_l*%:%rd:_o
Haskell:     f 0 y=y\nf x y=product[1..f(x-1)y]                (swaps order)
Javascript:  f=(a,b,k=1)=>b&&(a&&f(a-1,b,k*a)||f(k,b-1))||a
 
@LeakyNun no ruby? ->a,b{eval'a=(1..a).inject:*;'*b}
 
@CᴏɴᴏʀO'Bʀɪᴇɴ let me rephrase my question
 
There's 3 J solutions lol
 
Leaderboard (evaluated):
Jelly:       !¡
05AB1E:      F!                (swaps order)
Actually:    `!`n
MATL:        :":p
CJam:        q~{m!}*
Pyth:        u.!GEQ
Pyth:        Mem=.!GH
Jolf:        e+*j"!Y                (swaps order)
Mathematica: #!&~Nest~##&
J:           4 :'(!^:y)x'
J:           4 :0\n(!^:y)x\n)
J:           ".@($&'!'@[,":@])
UGL:         iilRc%l$d:_l*%:%rd:_o
Haskell:     f 0 y=y\nf x y=product[1..f(x-1)y]                (swaps order)
Ruby:        ->a,b{eval'a=(1..a).inject:*;'*b}
 

« first day (1940 days earlier)      last day (2902 days later) »