« first day (1420 days earlier)      last day (3430 days later) » 

1:05 PM
I have 275 answers vote, How do I not have Sportsmanship badge ? :/
 
@Optimizer Because you probably haven't voted on 100 answers on questions where you have an answer with a positive score.
 
I have.
at least for last 5 days I did on 60+ such answers.
 
There is some delay before you get badges.
 
not a day delay.
and there is no progress meter. So i dont even know how close I am or not.
:(
 
@Optimizer In that case, you probably haven't yet voted for 100 such answers.
 
1:08 PM
I think I will have to just vote on one answer per 10 minute then :/
because I know I am close
 
@Optimizer data.SE
 
is it simple to write custom queries ?
 
wow
people are awesome
wait, this is weird.
I run that query, it gives this output:
Post Link User Link body

-------------------------------------------------- ---------- -----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
 
see the comment in the query
it's impossible to get the actual progress, but this is a list of answers you can upvote to get it
 
1:11 PM
@Optimizer You have set the site to Meta PPCG.
 
(sorry should have read that before posting the link)
 
@ProgramFOX no, it shows normal blue one only.
 
@Optimizer Yeah. That means "click here to switch to the main site". If you see the black one, it means that you are executing it on the main site.
 
:/
nice UX
I think data on upvotes per user should be present, as it is available to use when we visit that answer, the blue upvote thing appears telling us that we upvoted
so data is present somewhere.
fiddles with data.SE
 
it can't be publicly available
 
1:15 PM
yes, but at least I should be able to see it. is there no way to do that ?
like authenticated data.SE
 
I doubt it
 
hmm. I'll just wait and see then.
 
1:33 PM
just the string is 742 bytes... :/
(magic spell checker)
 
there's a lot of duplication though
 
2:05 PM
@MartinBüttner Figured. It matched every example.
It'd be neat to ask "What could you cast if you could make any gesture next?" but that would be too close of a dupe.
 
@Rainbolt yes, I realised that later, but I think the question is already complicated enough ^^
 
@MartinBüttner "It would be neat to ask" not "It would be neat to replace your question with"
I wasn't suggesting you could have changed your question to be the way I want it to be.
 
@MartinBüttner can I have "Dispel Magic" (M capital) ?
 
@Rainbolt I didn't mean to imply that.
 
@MartinBüttner I didn't say that you implied that.
 
2:16 PM
I meant to say that the question as is is already complicated enough, so asking the other variant (independently of mine) might be just too much for PPCG.
@Optimizer oh, is the capitalisation inconsistent?
hm no it isn't, it's all sentence case
so no, sorry
 
@MartinBüttner I didn't check that, but can I just have that ?
it facilitates repeated word shrinkage
 
yeah I know
but no (and I don't think it matters if no one can use it)
 
depends what kind of compression they are going after
740 -> 550 using base conversion.
 
have you replaced the spaces with some sort unused letter?
 
no
 
2:26 PM
if you use x for space, you can pack the letters into base 26 (there's no z either)
of course, you'd have to capitalise the first letter again manually, but that might be worth the savings
or maybe use z to delimit names instead
 
i packed in base 60 right now.
plus, how will I know which spell combination character was capital or small ?
 
oh I was thinking for the spell names
 
this is everything in 742
 
manual word shrinkage gives 710 bytes :/
 
2:30 PM
the names need 311 bytes plus decoding with my technique
 
hmm, that might give overall smaller than 550
 
I need 30 bytes for decoding, but that might be golfable
encode with:
"stabzdispelxmagiczsummonxelementalzmagicxmirrorzlightningxboltzcurexheavyxwoundszcurexlightxwoundszamnesiazconfusionzdiseasezblindnesszdelayedxeffectzraisexdeadzpoisonzparalysiszsummonxtrollzfireballzshieldzsurrenderzremovexenchantmentzinvisibilityzcharmxmonsterzcharmxpersonzsummonxogrezfingerxofxdeathzhastezmissilezsummonxgoblinzantispellzpermanencyztimexstopzresistxcoldzfearzfirexstormzlightningxboltzcausexlightxwoundszsummonxgiantzcausexheavyxwoundszcounterspellzicexstormzresistxheatzprotectionxfromxevilzcounterspell":i
decode with 256b26b97f+:c'xsSer'z/{(eu\+}%
 
you dont need :i
 
@Optimizer I won't golf the encoding snippet :P
 
:D
 
2:34 PM
(I had :i in there to look at the code points)
 
gotta go for now. will be back and continue on the double hand cases.
 
to encode the gestures, you can probably map them to an alphabet of 14 characters or so, use that as a base and look them up in a string
12 actually
96 bytes to store the gestures:
"B cDPW cSWWS cw DFFDD DFPW DFW DPP DSF DSFFFc DWFFd DWSSSP DWWFWc DWWFWD FFF FPSFW FSSDD P p PDWP PPws PSDD PSDF PSFW PWPFSSSD PWPWWc SD SFW SPF SPFPSDW SPPc SSFP SWD SWWc WDDc WFP WFPSFW WPFD WPP WSSc WWFP WWP WWS"__&[1 11 0 2 3 4 5 6 7 8 9 10]er12b256b
24 to decode it: 256bCb"cBDPWSwFdps "f=S/ ... add ]z to zip it up with the names if you need to.
@Doorknob冰 I was browsing MSE a bit today, and I noticed that they do have implemented audio embedding (via SoundCloud) for some sites. Do you think if we get a post on meta (PPCG) that shows some support for this request, they might be willing to activate this for PPCG as well?
 
Is this going to auto play, or will it only play when clicked?
Better yet, linky?
 
I'd hope when clicked
everything else would be horrible
37
Q: Can an embedded audio player be added to Audio.SE and Music.SE?

Tom WijsmanOn the Audio and Music Meta, people are requesting the ability to embed audio into posts, this would be useful for the asker to let us hear audio he is having a problem with and good for us to easily give examples. This lead to a embedded audio player request on the audio meta and music meta bu...

 
Well, some people liked MySpace.
By the way, how much can stack snippets actually control? Can they rearrange the page when you click on them?
 
2:49 PM
no, I don't think so
I believe they're in an isolated iframe
 
Do we have a stack snippet sandbox?
 
I thought I saw one on big meta.
 
@Geobits yep
26
Q: Stack Snippets Sandbox: Try It Out Here!

HaneyThis post is dedicated to testing out the newly announced Stack Snippets feature. Feel free to answer with your own Stack Snippets!

 
Gah like 2 seconds. 3 seconds if I count the fact that you pinged Geobits to confirm.
 
3:22 PM
Is it fair to abuse undefined behaviour that you know produces the outcome you want on many systems, but not your own?
 
Is it fair not to? ;)
 
AFAIK its ok if you know which systems do that
 
Can I say "it works on xnor and Sp3000's machines" or do I have to know what makes it work for them and not me?
 
Does it work on your computer?
 
What are you trying to do? the []+=set()?
 
3:25 PM
@Sp3000 no
@FryAmTheEggman yeah
 
It'd probably be better to say "works on X operating system with Y installed" or equivalent.
 
>>> x=[]
>>> x+={1,4,2,6,8,9,2,5}
>>> x
[1, 2, 4, 5, 6, 8, 9]
That's Python 2.7.8 for me
 
I don't think that is undefined behaviour
 
@MartinBüttner stop spamming the front page :P
 
(fyi what I suggested was *d,=set(L), same idea)
 
3:27 PM
(in parts)
 
@FryAmTheEggman docs say it's an "unordered collection" so i assumed getting a specific order out of it wasn't defined, but i could be mistaken
 
I think sets are sorted when they are put into lists, let me try to find it
 
@Sp3000 wait, why does that work for me and not d=[];d+=set(map(f,i))?
 
That... should also work. What output are you getting?
 
[0, 8, 2, 3]
print map(f,i)
d=[];d+=set(map(f,i))
print d

----

[0, 2, 2, 0, 3, 8, 2, 3, 0]
[0, 8, 2, 3]
 
3:31 PM
Okay, I just tried
And it doesn't work
Damn :/
It seems to work for small cases but I just tried a bigger one and it broke
 
that's weird
 
Well, as you say it wasn't meant to be ordered
I thought it was some kind of undocumented feature but I think we just got lucky when hashing
 
Oh I think I have an idea why
 
it looks like it works with literal sets for me
or if i use set() on a list literal
 
3:39 PM
I have a suspicion that it's something to do with the number of elements and the size of the elements
Basically I'm doing x=[];x+=set(random.randint(0,a) for i in range(b))
And it seems to fail when a > b
 
i had it successfully sort a set with length 10ish and 89 as an element
 
Maybe it happens on a collision?
 
I blame luck :P
Hmm maybe...
 
Hrm, no I tried a long one with 8 and 2 and it worked :/ Unless python hashes are like dynamic (???)
 
>>> set([1,2,3,4,5])
{1, 2, 3, 4, 5}
>>> set([2,3,4,5,6])
{2, 3, 4, 5, 6}
>>> set([3,4,5,6,7])
{3, 4, 5, 6, 7}
>>> set([4,5,6,7,8])
{8, 4, 5, 6, 7}
>>> set([5,6,7,8,9])
{8, 9, 5, 6, 7}
>>> set([6,7,8,9,10])
{8, 9, 10, 6, 7}
Hmm...
 
3:50 PM
@Optimizer 2 edits is cool. 5 isnät.
 
its the same, thing 2 edits per day for 3 days, 5 in 1 go :P
its like you get 2 spam email every day for 5 days , vs 10 in 1 day
 
@Sp3000 Maybe the underlying array size is set to 8 at first?
 
@MartinBüttner so your compression logic comes to around 470 bytes, right ?
 
set([12,13,14,15,16]) gives the same loop around
But when you add another element, you don't get that problem
 
3:56 PM
Powers of two, you reckon?
 
@MartinBüttner and you dont care about <32 ASCII code characters being in the encoded string..
 
@Optimizer why would I?
 
well...
 
4:11 PM
globby got a Red Baron hat
we all missed it.
 
@Optimizer you don't need _&
 
yeah ...
 
and assuming the array in A seems fine to me, too
 
I am so bad at golfing :(
 
@MartinBüttner I just noticed I copied you :'(
 
4:13 PM
@FryAmTheEggman shame on you
5
 
@FryAmTheEggman shame on you
5
 
Ugh. I need to read and understand Keith Randall's entry to Lembik's math problem; almost everything it uses is either something I've forgotten or something I never knew
 
1 more answer and the question asker is getting that hat
he got it
 
@FryAmTheEggman Damnit I got ninja'd on Python 18 bytes
:P
 
4:20 PM
Haha! Success!
 
Have an upvote
But wow, not even this question made 5 answers in 30 min
 
Oh?
 
what do the hats even do
 
@EricTressler they look nice
 
4:22 PM
They keep your head warm?
 
probably the only one getting that hat
 
where? are they just displayed with your badges or something?
or are there physical hats
 
codegolf.stackexchange.com/users/15822/globby did not opt for hat, otherwise he would have gotten a rare hat too
 
they are displayed on your avatar
I think it's time we start looking if this is a duplicate :D
 
lol
 
4:27 PM
XD I did a quick search but didn't find much
 
if u guys are closing it, do let me know. I need to downvote it
:P
 
@EricTressler It's just for fun, nothing physical (or even permanent): winterbash2014.stackexchange.com/faq
 
I can't find anything either
 
Shall we close it, all edit it, then reopen it fast enough for the OP to not notice? :P
 
for that hat ?
 
4:29 PM
lol
 
You've already got it!
 
that is very easy to get without causing any disturbance.
 
I already retracted my close vote :(
 
or spam
just find a to be closed question, vote to close, edit, vote to reopen. No one else will vote to reopen anyways.
no idea if u can retract reopen vote later
 
no, I don't think you can retract reopen, delete and undelete votes
I've gotta go... later
 
4:31 PM
ah
 
@MartinBüttner You can do T9
 
i need to think of a super exciting yet novel question to get that hat
must be super easy to do too
 
is there currently a standard at all for duration granularity on PCs?
does anything anywhere specify how accurate a computer has to be at measuring ms, or anything?
 
IEEE?
 
I'm asking whether the IEEE actually addresses that
because as far as I know, I can't get clock measurements below ms, and I don't even know how reliable those are
 
4:37 PM
even JavaScript has a way of getting microseconds
so System provides that info.
 
I'm basically trying to figure out how cplusplus.com/reference/chrono/high_resolution_clock actually works
 
evne JS would be using that only internally
as it runs on C++ only
 
yeah, but you're not really answering my question; that clock supports measurements down to nanoseconds. how can you find out the actual finest resolution of your system, and is there a standard?
I'm sure I can call that function and it will return a measurement in nanoseconds, but I might call it again immediately and get the same measurement
and I have no way to tell how many significant digits there are
 
IIRC, the only good way to find that out is by testing it on a particular system. I've never seen a standard for it. On some systems, I've seen it return a nanosecond value that was simply rounded to the nearest thousandth (so no more helpful than milliseconds).
But that was a few years back. I doubt it's changed much, but...
 
@Geobits I suppose that's better than returning a garbage nanosecond value; at least it suggests significant digits
I'm pretty sure I've never used a system with sub-ms resolution, but I could be wrong. I haven't played around with the high resolution clock much
 
4:51 PM
I've used it on some that returned values with significant digits all the way down, but I have no idea how accurate they were.
 
5:08 PM
okay, I have couple of array manipulation related questions
Anyone interested ?
hoping that they would be actually nice questions.
 
Hm?
 
Should I just post the first (bearing the risk) ?
 
Well if you think the question's fine as is...
 
yeah I think its fine. just searching through PPCG for related/dupes
@Sp3000 btw, there are pending items in review. I remember you complaining that you dont find any
 
Done them :P That's why I mentioned T9
 
5:14 PM
I don't understand
oh!, you should close T9 too to Martin
 
T9's now closed and Martin's already voted
 
yeah, I gave the OP time to clarify rules. he did not respond.
oh!
 
Just give the OP some time to sort out the bonuses, yeah
 
5:29 PM
go
0
Q: Create an array with repeated numbers

OptimizerChallenge Your task in this question is to write a program or function which takes input integer n via STDIN,ARGV or function arguments and outputs an array via STDOUT or function returned value. Sounds simple enough ? Now here are the rules The array will only contain integers from 1 to n Ea...

nope, I don't see 5 answers coming in anytime :(
 
I save... 3 bytes by doing the bonus :/
 
:D
well bonus should not be overkill
I say that saving 3-6 bytes in an otherwise 30 byte answer is the optimial
 
Oh it fails on 2
Awkward.
 
2 1 2
it fails there ?
 
It gave 2 2 1
 
5:38 PM
how much is ur code without bonus ?
 
46
 
why do you have n= part there ?
also, python doesn't have unary operator -- or ++ ?
 
Nope it doesn't
And yeah I don't need the n=, not sure why I did that
(I blame 5am coding skills)
Oh right, I used n for the bonus
 
oh ok
If I get 3 more answers there in next 10 minutes, I will post mine JS one. But I don't see them coming.
 
I guess PPCG's just too hard
 
5:46 PM
yeah. BTW, you cannot use range in there ?
 
What for?
x=[]
for i in range(input()):x+=[i]*i
print x
is 45
 
:D ok
 
Also I need the i for the bonus :P
 
no luck this time. I guess, I will try my luck on the second one in my mind
 
6:04 PM
hmm, answers are coming in ^.^
@VisualMelon nice algorithm!
 
I scored 22 with C, lol
 
Wow
 
I forgot C, but h(n,o)int*o; <- what is this semicolon ?
 
K&R-style function parameter declaration
 
oh!
I think if Visual Melon converts his' to function, it would be shorter ?
short by 12 minutes ..
 
6:12 PM
My brain's telling me there's got to be a shorter way to get the bonus
 
I prefer full programs, means I have an excuse for my general inferiority ;)
 
heh.
@Sp3000 I think the algorithm by VisualMelon is quite short. no ?
 
I can't say I put much effort into my answer :P
 
Yeah that works
 
I've not golfed anything for ages
 
6:14 PM
@Sp3000 striked 44 is still 44
 
I feel bad for stealing :(
 
everyone is stealing today
also guys, I am out of votes, so I will upvote everyone tomorrow :D
 
(trying to beat C :P)
 
I was lucky to find this algorithm
it writes numbers all the way down through 0, then overwrites the zeroes with later loops
 
6:29 PM
@VisualMelon You just got indirectly credited by someone crediting my solution crediting your solution
 
@Sp3000 standard
 
meta
how did the yes question go viral ? Just HNQ or reddit/etc ?
 
I wish I could test that VBA one...
 
I wish you all were 12 minutes faster..
 
you would like to be living 12 minutes in the past?
 
6:35 PM
no. i got 5 answers in 42 minutes.
 
just draw the hat on your screen with sharpies
and don't scroll or anything
 
Damnit @FryAmTheEggman that's twice tonight
;P
 
6:51 PM
Wut
Oh, you made a pyth answer?
 
I don't Pyth usually so it's pretty bad
 
Yeah, key difference between pyth and python is learning to use map for everything
;)
@Sp3000 You can reuse the value of Q btw, it won't read each time
Only w reads each time you use it, z and Q store the value
 
Oh Pyth has reduce, that's right
I actually need the Q as the original input number
 
Oh, ok, then use J or K to save the = ;)
 
HNQ but a bit low ...
 
6:57 PM
I don't get how to lambda in Pyth :(
 
What are you trying to do?
 
lambda x: range(x, Q+1)
Is it not Lrd+1Q?
 
Ah, ok
You don't need to use L to make a lambda
 

« first day (1420 days earlier)      last day (3430 days later) »