« first day (1954 days earlier)      last day (2883 days later) » 

3:03 AM
I have to go.. I might look into it later
 
@Maltysen I think saying that the green check mark is just 15 rep is disingenuous. It's that, plus the claim that the answer beats all the others, plus the permanent top spot no matter the rep, plus the extra upvotes that come from being on top.
2
 
3:17 AM
@xnor I'm not sure disingenuous is the right word, since I don't have evidence to suggest that Maltysen was being deliberately misleading, but I definitely agree that the tick mark makes much more difference than might be expected.
(starred anyway since Maltysen's name doesn't show up on the starboard and it's a very good point)
 
Yeah, it looks like I won't get the checkmark. :(
Oh well, it was fun anyway, and I'm really proud of my answer.
 
My pet tick mark hate is that the accepted answer still sticks to the top of the list even if sorted by activity or age.
 
1
Q: Generate a "GitHub" Avatar

MCMasteryBackground / Description Note: for this challenge we will ignore the space that encloses the GitHub avatars The default GitHub avatar is a 5x5-pixel image. A color is picked randomly, and then random pixels are filled in on one side (right or left, 2x5 size) using that color. Then that side is ...

 
@AlexA. your bird friend needs some help.
 
I don't think it's going to load.
 
3:24 AM
 
@LeakyNun I stared at that waiting for it to load for too long.
 
Apr 21 '15 at 23:34, by Martin Büttner
user image
 
@LeakyNun That joke is so old: chat.stackexchange.com/…
 
The transcript after that was full of variations on that theme...
 
Wow, @flawr posted that 3 times.
 
3:27 AM
Apr 21 '15 at 23:57, by PhiNotPi
user image
 
Which fills you with more dread?
This:
or
 
Neither - don't seem them enough :P
 
0
Q: Should questions include the algorithm used to find the answer?

MCMasteryShould questions (code-golf) include an algorithm used to find the answer in its description? I feel like that whole point of code-golf is to come up with your own algorithm of solving a problem, something shorter-to-write than others, which is the hardest (and most fun part) IMO. If you are give...

 
I just pasted one of those swirlies into a comment on a challenge instead of a link to meta. Time to sleep methinks...
 
@trichoplax you're right, i didn't mean disingenous
what i meant is that the claim is true, but i think imcomplete
 
3:40 AM
@xnor I assumed you didn't mean it that way, but I wanted to state it explicitly in case anyone read it literally
 
@HelkaHomba reading "Helka Homba" sent that instead of "Calvin's Hobbies".
 
@EᴀsᴛᴇʀʟʏIʀᴋ When Dennis surpasses Martin in rep I'll consider changing back.
 
ooh
wait that isn't happening
and do you remember your other promise?
 
yes
 
@HelkaHomba @MartinEnder quick give dennis all your rep
 
3:51 AM
we need calvin back
 
Who needs Calvin? We have Helka
 
Sorry to bring you into this MarDen :I
@trichoplax Thank you :)
 
@aditsu I raised that from 0.63 to 2/3. In 1 to 10000 only n=10 has ratio=2/3
 
@trichoplax Me.
 
@EᴀsᴛᴇʀʟʏIʀᴋ How did you cope with losing Opal Fruits and Marathon bars?
 
3:57 AM
not to mention Martin's Butter
 
Who's due for a name change next?
 
I need to change my name.
 
An anagram or a real name change?
 
I picked the suess-name as a joke, didn't realize it would stick for atleast 30 days.
Is an anagram not a real name change?
 
I guess it is, but I always expect it to eventually revert
Although some of them seem to be sticking around for the long term...
 
4:00 AM
cough @EᴀsᴛᴇʀʟʏIʀᴋ cough
 
Me changing my username to "PiNotPhi" would be the Eighth Sign of the Apocalypse.
 
I vote for that ^
 
@DrGreenEggsandHamDJ Yes, the irony had not escaped me ;)
 
@PhiNotPi ok magnanimous_phi
 
@DrGreenEggsandHamDJ yep, sticking.
@trichoplax I binged on poptarts.
 
4:02 AM
@HelkaHomba You should change your name on some other SE site you don't care about to something containing "calvin" and then come in TNB and blow everybodies minds for a couple minutes.
 
@aditsu Here's my code:
isqrt=0
n=0
o=1
imin = 1
while n<10000:
    n = o
    isqrt += 1
    o = n + (isqrt<<1) + 1
    for i in range(n-1,o-1):
        m = min(range(1,isqrt+2),key=lambda x:abs(1+i/x-x)+(1+i/x)*x)
        p = m/(isqrt+0.)
        if p<imin:
            print i+1,m,p
            imin = p
 
@trichoplax Sp3000 -> Sp3001
 
@DrGreenEggsandHamDJ ehhh, to much work
 
@HelkaHomba not Sp2999?
 
4:03 AM
@EᴀsᴛᴇʀʟʏIʀᴋ I thought everyone around here googled...
 
binged
 
@DrGreenEggsandHamDJ lol
@DrGreenEggsandHamDJ haha! I have introduced someone to the glory of reddit comment chains
 
@HelkaHomba I'm glad someone got it :)
 
4:04 AM
Haha, I occasionally browse reddit. It's pretty entertaining at times.
 
> Pouring bees into my pants
 
> You say that now but you'll change your mind when you get a bit older.
 
rofl
I gtg bed finish watching firefly, buy-eh!
 
4:10 AM
@DrGreenEggsandHamDJ indeed
 
@DrGreenEggsandHamDJ have you tried /r/tifu
 
yeah
Confuzzled bird: (cc. @AlexA.)
 
0
Q: Faro shuffle an array

Dr Green Eggs and Ham DJA Faro shuffle is a technique frequently used by magicians to "shuffle" a deck. To perform a Faro shuffle you first cut the deck into 2 equal halves then you interleave the two halves. For example [1 2 3 4 5 6 7 8] Faro shuffled is [1 5 2 6 3 7 4 8] This can be repeated any number of times...

 
4:24 AM
@NewMainPosts That was fast.
 
Is 5 minutes faster than normal?
 
That was quicker than 5 minutes, and yes. :P
 
Oh, Ok. I don't know anything about how NMP works.
@Doorknob YU DEL?
 
because I didn't notice @Maltysen was faster than me
again :P
 
FGITW
Clearly, the solution is to golf it down further to 7 bytes.
 
4:35 AM
Hmm have we not had riffle questions? o_O
 
I searched for both "faro" and "perfect shuffle" for a while, couldn't find any.
I did find this:
9
Q: Cycle lengths for Perfect shuffles of decks of any size

Todd LehmanChallenge In the shortest amount of code: Compute the length of the permutation cycle of a perfect shuffle on a deck of cards of any size n (where n ≥ 2 and n is even). Output a table of all cycle lengths for 2 ≤ n ≤ 1000 (n even). Note that there are two basic ways of defining a perfect shu...

Which was almost what I posted.
 
There's one for 52 cards and 8 shuffles which is a kolmog: link o_O
Hmm yeah, surprisingly not as far as I can find either, despite so many similar
 
@DrGreenEggsandHamDJ ma50%mbqqj:m'a<cr>jma'b@qq@q
Now just to figure out how to do that <n> times...
 
@Doorknob Record, and then N@q
 
Shot in the dark: anyone here have experience in asynchronous CPU design?
 
4:46 AM
@LeakyNun Problem with that is N can be 0
 
The GoL computer is going async.
 
@Sp3000 I know it is even.
 
Then why the question?
 
@Sp3000 I was trying the craziest things to golf off a byte or two and missed the most obvious optimization. >_>
 
4:56 AM
@Sp3000 It means can the array contain nothing
 
Might be better to phrase the question that way then, i.e. can the array contain zero elements
 
@Sp3000 Done
 
@Dennis I have a 64 with a different approach, not sure I can golf it :/
Might be interesting to post anyway, will see
 
I bet it is.
 
@Dennis You know, I think it will fail if the array is empty?
 
5:01 AM
What will?
 
Your solution
 
Nope. Empty tuple returns empty tuple.
Anyway, the OP has clarified. The input will be a non-empty array.
 
@DrGreenEggsandHamDJ What's wrong?
 
5:04 AM
@Doorknob I don't understand. How is the input shaped?
 
@DrGreenEggsandHamDJ One number per line
 
@LeakyNun Oh, it fails indeed in Python 3. It works in Python 2 though.
 
@Doorknob Ah, I was trying it with array notation, e.g. [1, 2, 3, 4, ...]
 
@LeakyNun Nothing, I just thought it was funny to enter the room and see you guys talking about me.
 
5:05 AM
ARGH why does wrapping the whole thing in a macro and then running the macro break it?! I even tried :nmap x [...]<cr>x which also failed
 
@Doorknob Isn't map recursive?
 
Doesn't matter, since I'm not using x anywhere else.
 
but you basically just made it infinity
 
No, as in :nmap x ggma50%mbqqqqqjdd'apjma'b@qq@q<cr>x.
Which should do the exact same thing as ggma50%mbqqqqqjdd'apjma'b@qq@q but inexplicably doesn't
 
@Doorknob Holy shit, how does that even work?
What does 50% do?
 
5:08 AM
move halfway down the file :)
 
Oh, duh. I was thinking jump to matching bracket 50 times.
Which is why I was so confused.
OK, 2nd question, what's up with :m'a? Why not just 'a?
 
:m'a<cr> moves the current line to mark a
I replaced it with dd'ap later to avoid the <cr> which I thought might have been messing things up, but it didn't make a difference
Okay, apparently recording and playing back recursive macroes doesn't work in nmaps for whatever arcane reason.
Nor does it work when run within another macro, apparently.
 
If you want to use recursive macros, you should switch to V. :)
Although porting your solution isn't working for me in V either. :(
 
Wait, what?! Recording/playing back macroes does not work at all in nmaps O_o
@DrGreenEggsandHamDJ heh, still haven't gotten around to learning that :P
 
Hey, you can get in on the ground floor while I'm still making it.
Recursive macros are great.
 
5:13 AM
Right now I'm just trying to figure out this bizarre behavior.
Macro playback in maps seems to work, just not recording.
I guess I'll manually set the contents of the inner macro or something, then...
 
Nice :)
Well, the qqq is unnecessary
@Doorknob IT WORKS!
 
Well, sure, I suppose.
@Doorknob Did you just ping yourself?
 
@Doorknob yes
 
@DrGreenEggsandHamDJ Wait, why is there an arrow? Who did you reply to?
 
5:18 AM
I replied to the same message :D
 
@DrGreenEggsandHamDJ Oooooh nvmd I figured it out.
 
Aw, come on. Now since the inner recursive macro is terminating, it's also terminating the outer macro, which means 100@r does the same thing as @r. :/
Oh, I can get around it with :norm @q
This is a mess, haha
 
How many bytes is it at now?
 
too many
... 2@r still isn't working
But putting iTEST at the end of the macro is
... why is the trailing newline in the macro being doubled?
Okay, WHAT?! If I add a no-op 0 at the end of the macro it works.
 
Well shit. I got it working in vim in not that many keystrokes, but it does it backwards.
 
5:32 AM
Ojdd'apjma'b@q<esc>0"qCma50%mb:norm@q<cr>gg<esc>vgg"rdddA@r<esc>dd@"
yuck.
Now the only problem is that 0@r is not "run r 0 times" but "go to beginning of line and run r once."
 
Lol.
How about increment r before running, then undo the last one?
 
oh, that could work
I'll try it
 
Or, do it in V which supports 0@r :P
 
:P
 
I will not give you the satisfaction of ninja'ing me.
 
5:34 AM
Hmm, that doesn't work. Undo isn't granular enough.
Maybe I can have it repeat @r N times and then eval that?
This is quite possibly the hackiest code I've ever written for PPCG, and that's saying something.
 
V does not support 0@r. It should though.
 
Awww wait, 0A@r is 0 and then A@r -___-
 
I had this:
qq:%norm J
ggwG$dGopquuuu<n>@q
 
That makes it even worse. Increment, append A@r, eval, delete 2 chars, eval again.
@DrGreenEggsandHamDJ What O_o
 
That's almost right, but not quite. It does it in reverse.
 
5:39 AM
Where even is the interleaving?
 
J
I thought.
Try it! Running it once gives the correct output for 2, and running it twice gives the correct output for 1.
Atleast, with len == 8
Oh, <C-v> is unprintable.
And <esc>
 
:%norm J -> WOAH
 
qq:%norm J
ggw<C-v>G$dGo<esc>pquuuu<n>@q
That's what it should be.
 
Well, that breaks for numbers longer than others :(
100000 2
3 4
5 6
7 8
9 10
 
Yeah, it does.
 
5:42 AM
Ojdd'apjma'b@q<esc>0"qCma50%mb:norm@q<cr>gg<esc>vgg"rddd<C-a>AA@r<C-v><esc><esc>0D@"xxdd@"
Here's what I have and it's soooo bad
 
Ew.
Does it work?
 
This is way harder than it should be haha
yes
It's almost 1 so I think I'm just going to post it now
 
Wait, I should probably make sure it works on inputs of length 0 never mind, you said it wouldn't be in a comment
 
You two make nice primary colors
 
5:54 AM
Orange and purple?
I don't think either of those are primary colors.
 
lol, I'm still browsing domain names, this time on ebay.
I've found stuff like ᎫᎪᏙᎪ.com for sale.
Notice the difference between "ᎫᎪᏙᎪ" and "JAVA"
 
6:09 AM
@PhiNotPi ᎫᎪᏙᎪ.com = xn--g9dab9p.com O_o
 
@Upgoat yeah :)
 
0
A: Faro shuffle an array

Doorknobvim, 63 Oma50%mb:norm@q<cr>gg<esc>vgg"rcjdd'apjma'b@q<esc>0"qDdd<C-a>AA@r<C-v><esc><esc>0D@"xxdd@" Wow. This is possibly the hackiest thing I've written for PPCG, and that's saying something. Input is taken as N on the first line followed by the elements of the array, each on its own line. O...

omg time to sleep
 
6:40 AM
@LeakyNun yeah, I had already tested it up to 10000 before I wrote that; also, I used the exact sqrt, so ratio for 10 is 0.6324555320336759
the question is if it holds up to infinity, and more importantly, if we can find a function that limits p more closely
as I said, sqrt(n)-p seems to be sublinear.. so maybe another sqrt or a log might work
btw, after n=1410, the ratio seems to be above 0.8
 
                                                                                               ****
                                                                            ****       **      ****
                                                           ****      **     ****   ****** **********
                                            ****     **    ****  ***********************************
                               ****    **   **** ***************************************************
Seems to be sqrt(n) to me
 
Should I allow fors without parens in Cheddar? e.g. should for var i := 1; i < 10; i++ {} be allowed?
 
^ looks unreadable to me
 
@Fatalize okay
 
the for doesn't get "highlighted" so it's hard to see in a glimpse that this line is a for loop
 
6:54 AM
I'd be wary anyway, because that looks like three separate statements to me, the first of which is for var i := 1
 
@aditsu Using the first 100 items: p = sqrt(0.8447304938849824 n)
 
7:08 AM
Hello
 
@zʏᴀʙiɴ101 Hello. I'm almost done with Cheddar :D
like 99% there
 
@Upgoat \o/
 
@Fatalize Unchecked boxes = Downgoat is lazy, not Cheddar is not finished :P
 
if you finish and there are still unchecked boxes, then if you check afterwards them what have you done? overfinish?
 
7:12 AM
@Fatalize Well I would't say I've finished Cheddar. More of I've just reached a v0.1-alpha version of Cheddar. As soon as I make it turing complete (add fors) I'll make the first release
 
cool
@Upgoat any reason why you chose Javascript btw?
 
@LeakyNun I'm not talking about the average
 
@Fatalize Making a language like Cheddar is a rather large project so I decided to choose a language I am very familiar with, which is JS. If I chose Python or something, I'd be spending too much time googling how to do things in it, whereas in JS I really only have to think about the functionality, rather than the syntax, etc.
 
@aditsu Well, then what are you talking about?
 
a limit to how low p can go relative to sqrt(n)
worst case
 
7:18 AM
@Upgoat "The language that works for you " how does that reflect on the way the language works?
 
@Fatalize As in, Cheddar uses a blend of syntax from various popular language to make it very familiar to most people. Additionally, it is very compliant so when coding in Cheddar, meaning you can focus on the actual workings of the code, rather than figuring out how the language works
 
7:39 AM
 
@Doorknob♦ On your chat summary, it still says "Moderator Pro Tempore". :-/
 
Ohhh, Glitchr is cool.
 
@zʏᴀʙiɴ101 What did you DO to that PNG?
 
@wizzwizz4 Glitched my profile pic. ^_^
 
@zʏᴀʙiɴ101 Why?
 
7:40 AM
@wizzwizz4 I just wished to try Glitchr on something.
I took my own profile pic.
 
@zʏᴀʙiɴ101 But you broke your profile pic.
 
@wizzwizz4 That was just a copy of the pic.
2
 
@zʏᴀʙiɴ101 Phew!
 
8:33 AM
I've finally finished it:
0
Q: Preserve the Code Golf challenges!

wizzwizz4Stack Overflow is no longer the place for code-golf challenges. However, those that were asked and answered here on Stack Overflow are part of our history, not to mention very, very interesting. The historical lock was created for this purpose; to preserve historical, off-topic questions. And it...

 
Anonymous
8:47 AM
Does anybody have any more feedback on this challenge before I post it to main (probably in about 10 hours)?
 
@wizzwizz4 Bad news: it appears that 3 people want to keep them deleted.
I think some of them want to delete all the code golf challenges on Stack Overflow.
ohelkahomba @HelkaHomba
 
@zʏᴀʙiɴ101 But we want them back, right?
 
@wizzwizz4 Yes.
 
@zʏᴀʙiɴ101 So +1 it!
 
I'd join the community just for that :P
whoops
 
8:56 AM
Should I pin it on chat?
Just to get it some attention for a day.
 
@wizzwizz4 -._(._.)_.-
Maybe discuss it with the room owners before this.
 
@roomowners
 
Ping them separately.
But not all of them at the same time >_>
 
Anonymous
9:09 AM
There are 92 locked, non-deleted code golf questions on SO. What more, exactly, do you want?
 
@Mego I want the deleted ones to be accessible.
The ones that were deleted after the historical lock.
I can't remember where the comment was, but I'm working on the SEDE query.
 
Anonymous
I don't see any posts about deleting code golf questions after Shog did the lock. Granted, I can't see deleted posts on SO.
 
That's why it's not a duplicate
 
Anonymous
And I'm not convinced that, in the year since Shog added the locks, that there are any deleted questions remaining that are worthy of undeletion and locking.
 
Anonymous
You're claiming that code golf questions got deleted after Shog added the locks to all the >=10 ones. That doesn't make sense, because the MSO question states that all of the code golf questions got deleted. If what you're saying is true, then one of the locked questions must have gotten re-deleted, in which case there's probably a good reason for it.
 
9:21 AM
By the way, do you know how to check for a tag in the tag list?
 
Anonymous
In SEDE? Not a clue.
 
:-(
I can't use my query to show it then.
 
Anonymous
I think Doorknob is our resident SEDE guru, but he's almost certainly asleep (like I should be)
 
9:59 AM
@Mego I'll work out how to do it. T-SQL documentation on MSDN to the rescue!
 
10:34 AM
0
Q: python - How to generate a unique code

Eko WijayantoDescription In a city called "Stalls City", every tourist who visit will be given a unique code based on the figures of the tourist favorite. When a tourist favorite number is already used as a unique code, then the tourists will be given a unique code with the smallest value that is not used an...

 
Hey
 
Hello!
Does anyone here have >10k on Stack Overflow?
 
@Optimizer Does that affect SEDE results?
 
10:49 AM
no
i think
 
:-(
Oh well, that does mean that no...
Oh.
Just a sec.
How does the data explorer tag thingy work?
 
Can someone here help me with Blender?
I beg you its urgent!
 
@JeffTeoh Blender can!
 
Thanks!
I posted on there but no one has replied yet and I'm getting very nervous.
 
@JeffTeoh -.(o.o).- It takes time for people to see your question.
And this isn't peak time.
If a good question it is, lots of answers you will get. --Yoda
2
 
11:02 AM
Ok.
I'll guess I'll stay here till someone replies
So how's it going??
 
Fine, fine.
 
That's good.
 
I've been promoted to Moderator on Retrocomputing, and have done some programming.
 
Intresting, what kind of programming language?
 
PHP, with a bit of SQL.
Oh, the neighbour's dog's escaped! Got to go.
 
11:06 AM
Cya
GoodLuck!
 
11:36 AM
Welcome to kleptomaniac club. I see you already took a brochure.
3
 
12:05 PM
0
A: Sandbox for Proposed Challenges

trichoplaxLight black box: generate mirror processors code-challenge [ WORK IN PROGRESS - LOTS OF OUTSTANDING QUESTIONS ] Input The list of black box output values for all black box input values from 0 to 255 (inclusive), in any reasonable format. Each value is also in the range 0 to 255. Output A...

 
12:35 PM
@JeffTeoh Finally. Caught. The dog. *pant* *gasp*
 
@wizzwizz4 How long did that took?.lol
 
@JeffTeoh Fast dog.
 
You must be runnning quite fast then!
Last time when I tried to chase a dog, it thought I was playing with him. The dog was turning back and staring at me when I suddenly stopped running..lol
 
@JeffTeoh I know some Blender.
 
I'm preparing to make a roguelike in JavaScript :D
 
@El'endiaStarman Please help.
 
I'm looking at your Blender.SE question now.
 
@El'endiaStarman Thanks!
 
12:53 PM
The easiest way to catch a non-scared dog is to jump, crouch, then run up to the dog and back to where you want the dog to be. They think you're playing, and follow.
A scared dog however...
 
@JeffTeoh Hrm, sorry. I haven't done any smoke in Blender, so I have no idea how to help you. If I had the .blend, I'd just fiddle around and google questions.
 
@El'endiaStarman I'm uploading the .blend file to the question right now.
@wizzwizz4 I often get so worried because sometimes my dog keeps bumping into trees and people while running.
I better go to sleep is 12:00 am here
Nite everybody.
 
@JeffTeoh Welp, looks like I need to download a newer Blender version. I opened it up and everything was black.
 
1:08 PM
Oglaf has a strip about avocados: oglaf.com/incubus
2
 
1:26 PM
@ZachGates @EᴀsᴛᴇʀʟʏIʀᴋ That edit suggestion actually did make it better. :P
@EᴀsᴛᴇʀʟʏIʀᴋ @CᴏɴᴏʀO'Bʀɪᴇɴ REFTD (random ELECTRO)
 
@VTCAKAVSMoACE You switched dubstep for electro? o_O
 
@zʏᴀʙiɴ101 Ye, I found a good song, this isn't a permanent change.
 
 
1 hour later…
2:39 PM
@Community♦ Hello Community!
 
@wizzwizz4 The Community spirit is in the room? o_O
 
@zʏᴀʙiɴ101 I've been using mod-pings to talk to it.
 
@wizzwizz4 Mod pings? o_O
 
@zʏᴀʙiɴ101 Just a sec, I'm checking the documentation...
@o@ @o@ @o@ Show yourself @o@ @o@ @o@
♦.♦ ♦.♦ ♦.♦ I summon @Community♦ ♦.♦ ♦.♦ ♦.♦
@@@{id:-1,location:"On the server farm"}@@@
It's not working!
 
The Community spirit is a bot >_>
 
2:47 PM
@zʏᴀʙiɴ101 Ah.
 
He has no access to chat from the Stack Exchange datacenters.
 
@zʏᴀʙiɴ101 I should've known. I'll try from SEDE.
 
The Community spirit doesn't exist on SEDE. >_>
It has separate logins.
 
@zʏᴀʙiɴ101 Huh. I got this output from SEDE:
SExMICBNIEJUIEZEIE0gQlRUUg0KRU8gSSBBIE8gRUUgRSBVRQ==
I think Community wants JUIEZE.
 
@wizzwizz4 You can obtain Base 64 output from SEDE? o_O
 
2:59 PM
@zʏᴀʙiɴ101 That's Base 64?
 
@wizzwizz4 Yes.
 
Hmm. When I try the query again, it throws errors.
 
Also, you can only get CSV output.
 
I'll refresh the page.
I've been redirected to the main page.
 

« first day (1954 days earlier)      last day (2883 days later) »