« first day (1807 days earlier)      last day (1784 days later) » 

6:00 AM
Darndest halo pools
Lo, those planar odds
 
Lean past Lord Hoods
 
Anonymous
@FlagAsSpam I've been on the internet too long. I expected something terrible.
 
Who here knows Ruby? I'm trying to write a version of Ell's answer to Martin's question here and I'm running into a wall
 
@Doorknob These are not the droids you're looking for?
 
6:03 AM
@Sherlock9 I know what Ruby is but not how to use it
 
f=->x,y{x.is_a?(Array)?(x==y[0...x.size]?y[x.size..-1].map{|m|["SE","SW",?N][m]}:x.min_by{|m|[["NW","NE",?S][m],*f[x[0...x.rindex(m)],y]].size}):f[a[x],a[y]]}
 
@Sherlock9 I find that walking around solid objects usually helps me not crash into them
 
Anonymous
@AlexA. Did you miss the part where that was Doorknob's answer?
 
Fair enough
 
What do you need help with?
 
6:05 AM
@Mego ( ಠ ͜ʖಠ) What?
 
The min_by part keeps returning Fixnums for no good reason
Or at least none that I can see
 
Anonymous
@AlexA. Look at the gist again. Look who uploaded it.
 
@Sherlock9 Well it ends in size, so I would be surprised if it didn't
 
Anonymous
Now you're trying to hide the evidence :P
 
@Mego BRO I DONT HAVE TIME 2 READ ALL THE THINGS YOU GUYS POST
 
6:06 AM
I was trying to write x.min_by{|m|*foo*.size}
 
Right, and size returns a fixnum
 
Fantastic
Wonderful
Help
 
haha
What do you expect it to return?
 
The smallest array
 
oh, yeah, it's min_by, not map; I'm an idiot
 
6:08 AM
I figured it would be like, map everything in x then return the smallest array
 
@Calvin'sHobbies I don't know if you're the downvote on my Meta answer, but the OP stated that the goal would in fact just be "Recreate the mona lisa" which is too broad. Either way your answer's better (at least for an alternative other than not doing the challenge)
 
@Sherlock9 That's what it should be doing
 
Well, I'm the one running into walls, so
YEAH it really should be doing that! ಠ_ಠ
 
Hmm. Okay, first I'm trying to comprehend what exactly the code is supposed to be doing
btw standard loopholes anagrams to donated OP's rash, LOL
 
Isn't there a meta page for all the open-ended bounties offered by various users?
or am I dreaming
 
6:11 AM
@ZachGates There is.
 
@Sherlock9 So, the function recursively calls itself until it returns an array?
 
Yep
 
30
Q: List of bounties with no deadlines

randomraThis is a list of unofficial, deadline-less (hence not searchable) bounties offered by users on various challenges on the main site. Disclaimer: There is no guarantee that the user will award the bounty for you in case you fulfill its requirement. Especially if the user isn't an active member an...

 
@FlagAsSpam Sweet, thanks!
Anyone can add to this, yes?
 
Of course. xD
 
6:12 AM
@Doorknob Ell's answer should be clearer, since I'm essentially porting that. I'm only porting that because Martin, many weeks ago, asked me to try to answer his question
 
@FlagAsSpam :P
 
And it turned out that the best way to answer it was already pretty close to what Ell posted, so I'm transpiling it wholesale
@Dennis Which question?
 
@Dennis the proper state of affairs is "quartata: I can't outgolf @Dennis help"
 
@Dennis hehe
the tables have turned
 
6:13 AM
@Sherlock9 Long story.
 
26
A: Halloween Golf: The 2spooky4me Challenge!

quartataGS2, 17 bytes 40 27 27 04 73 70 6F 6F 6B 79 05 42 04 6D 65 05 I CAN'T OUTGOLF DENNIS HELP

 
@Doorknob If things were in the proper state of affairs, @Dennis wouldn't be crying for help now, would he?
 
@Sherlock9 If things were in the proper state of affairs, I'd be playing fallout.
 
1
A: Halloween Golf: The 2spooky4me Challenge!

quartatapl, 12 bytes _spooky_2┼me Try it online. Non-competing since pl was invented after this challenge.

 
@Sherlock9 What is the a variable in your code supposed to mean? It's only referenced twice, and both times before it's defined O_o
 
6:15 AM
Unless I take the GS2 approach and implement a 2spooky4me built-in, I don't see how that could be beatable.
 
@Doorknob Oh horf I didn't post the whole code
a=->n{n<1?[]:a[~-n/3]+[-n%3]}
f=->x,y{x.is_a?(Array)?(x==y[0...x.size]?y[x.size..-1].map{|m|["SE","SW",?N][m]}:x.min_by{|m|[["NW","NE",?S][m],*f[x[0...x.rindex(m)],y]].size}):f[a[x],a[y]]}
 
oh, ok
 
@Dennis Hmm when you said you had a three-byte "spooky" that wasn't what I had in mind :/ I thought you had <get-word-from-dict> <index in base 256 in two bytes>
Assuming 65k most common words are in the dict
 
Yeah, it's a bit more complicated that that. There are 248,298 words in the dictionary.
 
@Sherlock9 I still don't really understand what either the Python or the Ruby means, but I think I can figure out why the min_by portion is returning fixnums
 
6:17 AM
Well, basically I mean I didn't expect delimiters :P
 
First, you call f with two fixnums (initial input)
Then those both get passed to a
 
(also where does the "me" come from?)
 
a returns an array of fixnums
Then these arrays of fixnums get passed to f
And then you call min_by on the array of fixnums
Therefore, min_by returns a fixnum
 
@Sp3000 Ooh, now I get it. That's a brilliant idea!
 
@Doorknob But I'm calling min_by on the size of each array of fixnums
I think
 
6:21 AM
@Sp3000 “×¥X“ŀ`» yields the array ['spooky, 'me']. ×¥X encodes spooky, ŀ encodes me.
 
Yeah... my general reasoning is that get-word-from-dict should be useful if you only need a single word or two, e.g. adding "meters" to the end or something.
 
@Sherlock9 You're calling x.min_by; therefore, some element of x will always be returned
It's basically x.min with a custom predicate for defining min-ness
 
Well, hell
 
me is 1 byte? Hmm nice
 
That's a good point
 
6:22 AM
What are you trying to get it to return?
 
ಠ_ಠ Hang on it's really now sinking in
 
I'm going to literally run into a wall now ಠ_ಠ ಠ_ಠ ಠ_ಠ ಠ_ಠ
 
Are you trying to do something like x.map{|m|...}.min?
 
@Doorknob The [["NW","NE",?S][m],*f[x[0...x.rindex(m)],y]] I was trying to create
Which I now flipping realize. That if I wanted to create it. I . REAAALLY should have placed it better
 
6:24 AM
Oh, so you're trying to find the [[...]] with the minimum size?
 
yep
 
x.map{|m|...}.min_by(&:size)
 
@Sp3000 Not quite. (Stupid mini markdown.) It's ŀ`​.
 
Ah.
 
@Doorknob Ooh that &:size is a cool trick
 
6:25 AM
@Sherlock9 Yeah, prefixing a Symbol with & calls to_proc on it, so foo.min_by(&:size) is basically foo.min_by{|x|x.size}
 
@Dennis Any ordering of commonality of words? Trying a few random two-bytes and I don't know most of these words o_O
 
@Doorknob I should use that more often. BRB checking all my old Ruby answers. And thanks a bunch
 
@Sherlock9 Glad I could help!
@Dennis Haha, this is fun. Doorknob becomes bladingcerule clonk"
 
Clonk?
 
LOL
 
6:29 AM
ae is " Bacon", so at least that's short :P
 
hahaha Dennis -> DPechinococcus abandonedly. What??
@AlexA. becomes multisense bacteriosis-*
 
What
 
And Martin becomes Ad32jaggywoolgrowerprolonge abacist
 
I just
what
 
jaggywoolgrower
Anyway, based on experimenting with 1-character strings looks like it's alphabetically ordered @Sp3000.
 
6:31 AM
Seems to me like that's only half of it, length seems to matter too
 
Anonymous
@Sp3000 ಠ_ಠ
 
2 hours ago, by Dennis
My new method uses an English dictionary. It encodes 2-5 letter words, with an optional leading space in 2.12 - 2.32 bytes, and longer words in 2.56 - 2.76 bytes.
xxx becomes -T aarrghh
 
@Sp3000 Words are ordered alphabetically and split into dictionaries of short (5 letters or less) and long words. For example, doorknob is at index 56926 in long, so we can encode it as 6 × 56926 + 1, convert to bijective base 250 and look up the corresponding chars of Jelly's code page. For Doorknob, we need to change case, so it's 18 × 56926 + 2.
 
Hmm k...
 
gnibbler becomes elmoreloaned bletherskates!, complete with exclamation point
 
6:37 AM
AlexA. -> semilustrous%2Abba
 
I like to ride my bletherskates!
bletherskates!
 
@Dennis I like the version with the space better. :P
 
Oh! Haha.
 
Jelly becomes yipee]z aahs. It's like it's saying "when you first discover Jelly, you will think 'Yipee!', but when you first try to program in it, you will think 'Ahh!'" :P
 
@Mego I don't think my submission for your challenge is working correctly
 
@Dennis Hahaha, what? O_o
 
That's a Welsh city, and therefore a dictionary word.
 
Blame Wales
 
... if we see a brand new 1-rep user post a kolmogorov-complexity challenge to output Llanfairpwllgwyngyllgogerychwyrndrobwllllantysiliogogogoch!, now we'll know why.
 
hahaha
 
6:45 AM
What are you guys even saying
 
I'm having way too much fun with Dennis's string compressor thingy
 
such confusion amaze
 
Anonymous
@AlexA. Try not using MS Paint
 
@Doorknob Where would one find that?
@Mego I used the pixmap package in R.
It's my first time using it, in case you couldn't tell.
 
Anonymous
Close enough
 
6:46 AM
I guess I'll just go ahead and post it then.
 
Anonymous
I meant it's close enough to MS Paint :P
 
Anonymous
Not close enough to be a valid solution
 
I know
@Doorknob Jalapeno poppers => fZ Imshy quartation| monadnockslMunsAdoptianists
> monadnocks
 
@Doorknob Geez, can I post that :D
 
6:48 AM
¯\_(ツ)_/¯ -> OverrunnerHurt4
 
Anonymous
After one hour: +10/-0, no comments, no answers
 
I was going to answer in Bash/ImageMagick but ImageMagick is stupid and can only blend images via transparency, not RGB. To be fair, it would have been a semi-evil thing to do anyway because ImageMagick would have done all the parsing and flipping for me anyway >:D
 
@Dennis this is so fun, thank you for providing me with an incredible source of amusement.
 
I just used the word "anyway" twice in the same sentence. Probably a sign that I should go to sleep now.
 
lel
 
Anonymous
6:51 AM
@Doorknob I actually originally tried using ImageMagick to generate the test cases. I couldn't figure it out, so I went for good old Python.
 
paifon
 
Anonymous
Python is bae
 
vim -> exile Aahing. Is this suggesting that vim should go into exile, while screaming "Ahh"? ಠ_ಠ
 
I should probably write a Pyth solution
but I'm feeling lazy
 
Anonymous
Mego -> x Anuses Aachen
 
Anonymous
6:52 AM
Umm
 
Anonymous
What are you trying to say?
 
@Doorknob Sounds appropriate for something Dennis made
@Mego We need to have a talk
The talk
 
I've modified the formatting of the List of bounties with no deadlines (and added 2). Please let me know if I've changed something I shouldn't have.
 
Anonymous
@AlexA. :(
 
TNB -> ¶ chirp
 
6:53 AM
is the paragraph symbol a dictionary word?
 
That's a good question :P
 
Anonymous
@ZachGates HOW COULD YOU it looks ok
 
@Doorknob That also seems oddly Dennis.
 
@Mego Good :P
 
Anonymous
perl -> destabilizesP AA
 
6:54 AM
@AlexA. I dunno, "chirp" seems like something a bird would say
 
@Doorknob But sometimes when I enter a chat room Dennis will say, "chirp."
 
destabilizing certainly is an appropriate adjective for perl
 
Anonymous
Alex A. -> multisense bacteriosis-*
 
@Mego TOO SLOW
@Doorknob :D
 
6:55 AM
26 mins ago, by Doorknob
@AlexA. becomes multisense bacteriosis-*
 
Anonymous
In my frame of reference, I posted it first :P
 
2 hours ago, by New Meta Posts
PLZ SEND TEH BAGELZ
 
ninja'd -> portapaks amicabilities ANZUS
 
@Mego I don't think that's how it works
 
@Mego what's all this about dictionary words?
 
Anonymous
6:57 AM
@Maltysen Special relativity breaks simultaneity
 
2 hours ago, by Dennis
My new method uses an English dictionary. It encodes 2-5 letter words, with an optional leading space in 2.12 - 2.32 bytes, and longer words in 2.56 - 2.76 bytes.
Dennis's compression algorithm for Jelly
 
@Mego but only if you're going faster than c
 
The YouTube ID thing for the rickroll becomes thatO sneezy scratchcards¶]aA
"that sneezy scratchcards"
 
Anonymous
@Maltysen Wrong.
 
Anonymous
In physics, the relativity of simultaneity is the concept that distant simultaneity – whether two spatially separated events occur at the same time – is not absolute, but depends on the observer's reference frame. == ExplanationEdit == According to the special theory of relativity, it is impossible to say in an absolute sense that two distinct events occur at the same time if those events are separated in space. For example, a car crash in London and another in New York, which appear to happen at the same time to an observer on the earth, will appear to have occurred at slightly different times...
 
6:57 AM
@Mego err sorry, was thinking of casualty
which is what's relevant here
 
Adding a period makes it become I chela beflecked HatlessbBromal
I'm gonna chela befleck you just like I did to HatlessbBromal
 
Anonymous
@Maltysen It's not relevant, the two events were independent
 
... yeah, I'm going to go to sleep now. :P
 
Anonymous
And it's causality
 
@Doorknob Ah. Hooray for compression algorithms!
 
6:58 AM
oh I see what you mean
 
@Doorknob Goodnight, sweet prince
 
Anonymous
Causality only matters if you have two events A and B such that A -> B
 
but you both have to be moving in respect to the observer
 
@AlexA. not even posting the image anymore? psh, lazy :P
 
Goodnight @Doorknob
 
6:59 AM
@Doorknob Jeez, fine. Give me a sec.
 
cya Doorknob
 
o/
 
@Doorknob ^
 
>< -> Aerobomb
 
7:00 AM
Doorknob is pulling a @CᴏɴᴏʀO'Bʀɪᴇɴ ... lurking in the shadowy corners ... beware
 
why is aachen appearing so often
 
Anonymous
Dennis really loves Germany?
 
@AlexA. Post us a giraffe having problems
 
@Mego Well, he's from Germany.
 
Anonymous
 
7:06 AM
O____O
 
Anonymous
 
o_________o
 
Anonymous
I'll give a cookie to anyone who throws together a heroku site for doing the image blending
 
Anonymous
 
7:08 AM
@Mego You've got a Python script for this, right?
 
@Mego I might make a fiddle
 
...welp. Ninja'd.
 
Anonymous
Write the site, make a pull request, and I'll merge
 
what is ninja
 
@Mego Not sure how that'd work. It'd be more like it goes in the other direction. I write the site and pull from your repo.
Unless you were talking to Calvin...
 
Anonymous
7:10 AM
Either or
 
@Mego What about a Stack Snippet
 
Anonymous
I have a heroku site ready for it, I just cba to deal with the imgur api
 
Anonymous
Or learning canvas
 
I really should go to bed right now, or else I'm gonna start on it and wind up getting three hours of sleep before church. :P
That said, if I do work on it tomorrow, where ought I get pnmtopng and pngtopnm (for Linux)?
 
do you guys operate any bots here?
 
7:17 AM
Not this room in particular.

  Beep Boop Maggot

Bot testing
 
@Quill We explicitly discourage bots in this room, though we have a dedicated bot testing room.
(which El'endia ninja linked)
 
Anonymous
@El'endiaStarman The netpbm package
 
Anonymous
Alternatively, netpbm.sourceforge.net
 
> Netpbm is basic graphics software that ought to be supplied by any web hosting service.
ssh-ing now to check.
YES Webfaction has it already installed! Excellent.
 
in Beep Boop Maggot, 36 secs ago, by Santa's Helper
 wow
so ppcg
            very code
                            such golf
many king of the hill
               much  code golf
                       such  19 bytes
very  lol
               so  dorknoob
                        much  cjam
many  pyth
2
 
How are there so few?
 
lol this bot lets you play hangman
 
@Mego: Isn't your grouper function essentially [tuple(list(iterable) + [fillvalue for i in range(len(iterable)-1)])]?
 
in Beep Boop Maggot, 12 secs ago, by Santa's Helper
@Quill D̿ͨ̅͊̄͛ͧ͘͏͉̩̜͍̜̙o̎͒ͨ́̚r̓ͪ̄̈̎͗͂k̂̍ͮ̀n̏̈́̿ͬ͏̸̡̙͙o̓̈́̾͂ͧ҉̷̧̱̟̻ǫ̸̧̡̩̣̜͛͂b̞͉̪̥͆͊ͩͤͦ͢͝
 
@ZachGates Sorry, I meant n-len(iterable) not len(iterable)-1
 
7:39 AM
@Mego Here's Fiddle. Except My images are looking different than yours
The grid in the post becomes
for me
Hmm, those blues can't be right (57, 0, 133)
 
Anonymous
The blues in the original image may not be exactly (0, 0, 255)
 
Yeah just realized, neither is the red (255, 0, 0). That's misleading
 
Anonymous
@ZachGates My brain isn't working well enough right now to answer that definitively. I got it from the Python itertools recipes.
 
Anonymous
@Calvin'sHobbies Gimme a sec and I'll fix it
 
@Mego Basically it's just adding n-len(iterable) of the fillvalue to the iterable. (Sorry if you're too tired for this :P)
 
Anonymous
7:49 AM
@ZachGates It also splits the iterable up into n-length tuples
 
@Mego I think your implementation is messed up too, unless I'm misunderstanding something. All my averages are much smoother, e.g.
Which seems more natural
For each of the rgb values I'm just adding the 4 pixels and dividing by 4
 
@Mego No, I've been looking at it. If the iterable,n,fillvalue=[1, 2, 3],5,0 then you end up with [(1, 2, 3, 0, 0)]
 
Anonymous
@ZachGates But if it's iterable,n,fillvalue=[1,2,3,4],2,0, you get [(1, 2), (3, 4)]
 
@Mego All of my output is black
 
Anonymous
@AlexA. I think you definitely did something wrong
 
7:58 AM
I got the shape right this time at least
 
i like when i get to put fun animations in my answers
0
A: Build ASCII ladders

undergroundmonorailpb - 147 bytes ^t[B]>>[B]vw[T!0]{b[43]<[X]b[43]>w[B=0]{b[45]>}v[X-1]w[B=0]{b[124]^}v[X]t[T-1]}t[111]b[T]<w[X!0]{b[45]<}b[T]w[Y!0]{w[B!0]{^}b[124]^}b[T]^>>[B]vb[T] This is the kind of challenge that, by rights, pb should be really good at. Drawing simple pictures with characters is exactly what...

 
@Mego I'm averaging the wrong values ;-;
 
Anonymous
@Calvin'sHobbies Are you sure it's 24-bit RGB data, and not RGBA or HSL?
 
Well, now I'm averaging the correct ones and they're still all just black smudges
 
8:07 AM
@Mego Take the fins on your penguin (52, 73, 94), averaged with the white mirroring them (255, 255, 255) twice. You should get R=(52+52+255+255)/4, G=(73+73+255+255)/4, B=(94+94+255+255)/4, right? That's (153, 164, 174), which is what my image has. Your image has (154, 36, 174), a weird purple
So probably your green is off
That's kinda creepy...
 
Anonymous
s/kinda/very/
 
hey guys!
what is this s/[some word here]/[another word here] business?
 
i had a feeling...
 
@undergroundmonorail You beat me to it!
 
8:16 AM
i really do not know regex...
 
it just means "find the first instance of [some word here] and substitute it with [another word here]"
 
@zyabin101 that is what we call being ninja'd!
@undergroundmonorail oh!
 
@TanMath too bad I can't edit my talk on mobile
 
regex gets a lot more complicated than that but people don't often bother to whip out advanced regex knowledge for the sake of a joke in chat
 
8:17 AM
@Calvin'sHobbies Wow, a graph?
If so, of what?
 
Anonymous
@undergroundmonorail Challenge accepted
 
oh boy
i can't wait until people start correcting each other with 500 byte retina programs
 
Anonymous
8:32 AM
Fixed the bug \o/
 
s/Retina/Retina (Perl variant)/i
 
@Mego There was a problem with your bin_to_rgb (and rgb_to_bin)
maybe still is
 
Anonymous
There isn't now
 
yep
 
Anonymous
I nuked those functions
 
8:34 AM
yeah i saw :P nice
 
Anonymous
 
Anonymous
 
Anonymous
 
That one is awesome
 
Anonymous
Fixed everything
 
Anonymous
8:41 AM
Fixed quintopia:
 
Anonymous
 
The new quintopia evolves into nothing. :(
 
@Mego a non square image is probably a good test case
 
Anonymous
@Calvin'sHobbies I'm uploading a bunch of stuff right now
 
Anonymous
For example:
 
Anonymous
8:51 AM
 
@Mego: What does the function pnm_to_bin expect?
 
Anonymous
 
Anonymous
Nice, big album (warning: don't click if you pay per byte): imgur.com/a/Um68Z
 
@Mego Don't worry, I pay per month Kappa
 
Anonymous
The one image without a partner is Conor's avatar. Somehow the original got left out
 
9:00 AM
@Mego: function main expects an image filename as fname?
 
Anonymous
@ZachGates It expects a .pnm filename, in the format produced by pngtopnm -plain <pngfile> > <fname>
 
Anonymous
So you run it as python imageblender.py test.pnm
 
Anonymous
Or if starting from a png, pngtopnm test.png -plain > test.pnm && python imageblender.py test.pnm
 
Anonymous
The doall.py script runs the blender on all png images in the current directory, outputting them with the same filename, followed by an underscore
 
Anonymous
And also produces PNM files for the input and output
 
Anonymous
9:05 AM
Now I need to turn off notifications from the SE app so I can go to sleep
 
9:15 AM
@Mego Quiet mode allows you to go to sleep by shutting down notifications from any time of the day.
Also, I like @quartata's new stackexchangemulticollidermicroavatar. Is he wearing a evolve-into-nothing hat or something?
 
9:50 AM
all right you number geeks
I have a new challenge for you
 
1
Q: Partitioning reciprocals

orlpGiven a number n > 77, write a program or function that finds a set of distinct numbers such that the sum of the set equals n, and the sum of the reciprocals of the set equals 1. Example for 80: 80 = 2 + 4 + 10 + 15 + 21 + 28    ⟶     1/2 + 1/4 + 1/10 + 1/15 + 1/21 + 1/28 = 1 Your progra...

 
 
1 hour later…
11:00 AM
@orlp Did you read a certain paper by R. L. Graham? ;)
 
@MartinBüttner I may or may not have :)
 
That leaves the question how to compute the initial table efficiently...
 
@MartinBüttner I intentionally don't mention it, though.
@MartinBüttner It spoils the puzzle, can be found with some google-fu anyway, and it limits otherwise inspiring approaches.
If there is a pathway to the solution right there, why come up with your own?
 
@NewMainPosts There's always a human to thank bots, so THANK YOU!
 
@zyabin101 Have you seen the message with 16 stars on the right? ;)
@orlp Agreed (not that I would have ever come up with that myself)
Plus, generating the initial table efficiently still seems highly nontrivial.
 
11:07 AM
@MartinBüttner hence my requirement of fast :)
 
@MartinBüttner No, @Dennis sent it.
 
@MartinBüttner I just find the fact that for every n > 77 this is possible fascinating.
As well as that it's possible to find a solution in log(n).
 
Could someone take a look at this and see what's wrong (if anything)
It seems like the output image is the same as the input image, but I can't be certain
The output image is slightly different. There are a two little dark spots on either side
 
11:36 AM
In the menu of a starred message. "unstar as interesting" EleGiggle
 
11:58 AM
there's definitely something wrong
 
@MartinBüttner I have made a formal request to my school to have a filmed run of the "Hello, World!" program in Mornington Crescent.
 
12:17 PM
@Timwi How do I run your Esoteric IDE?
 
12:58 PM
@FlagAsSpam Which IDE?
 

« first day (1807 days earlier)      last day (1784 days later) »