« first day (2025 days earlier)      last day (3037 days later) » 

15:00
Well, Linux. The characters render fine, they just render abnormally big due to how something weird works with fonts in gnome
Hmm, strange. You could also try checking the length of the names you get, to see if it's a display-related bug.
Needs more JQuery — Business Cat 21 mins ago
ಠ¯ಠ
I got 3 thumbs up on a github commit note. On a official valve commit. 10/10
meta.codegolf.stackexchange.com/a/9839/20198 I've got another KoTH idea, I'd appreciate feedback
and once I finish up the major parts of this KoTHComm, I'll likely be posting a KoTH a week
because I have a backlog of KoTHs I want to post
15:18
Am I the only (ethnical) Chinese here?
I don't quite get KoTH, so would appreciate if anyone care to explain
Stack starts with riffled coins
You get to rotate coins
Profit.
Ugh. Every store I can think of within 30 miles is sold out of No Man's Sky (PS4). This game can't seriously be that popular.
That's why I play it on PC
15:20
My PC is not up to snuff for gaming. That's why I have consoles.
Well, one of the many reasons, anyway.
@LeakyNun is there a section that is confusing, or just the over arching "What's the goal"?
I still can't comprehend why developers are willing to work their asses off to optimize a game on console but then seemingly go out of their way to make it run as slow as possible on an equivalent PC
@NathanMerrill latter
@quartata I think Sony pays them to :P
1
A: Sandbox for Proposed Challenges

Nathan MerrillThe Coin Flop In this challenge, you start out with a stack of 100 coins, alternating between gold and silver: 1. Gold 2. Silver 3. Gold 4. Silver ... 99. Gold 100. Silver Now, Gold, Inc. will pay you for any gold coins you can give them. Furthermore, they really like bulk ship...

15:23
Probably. Sony traditionally has given developers kings' ransoms to make their games PS exclusives
but this strategy is bad. bad PC experience = bad global reviews = less sales
Bad for the developers? Probably but would you turn down an extra hundred thousand to make your game a PS exclusive
And it's certainly not bad for Sony :P
@TùxCräftîñg Not really. No console fan is going to care what the game plays like on PC. We skip past those sections of the review.
but you console gamers are weird
I'd say the same of PC gamers, but some things don't need to be said.
15:26
@TùxCräftîñg why exactly?
because you put random letters at the end of your phrases... ?
I hit 8000 rep! Someone just +1'd tho.
@quartata I count 13 usernames with apostrophes altogether. The two Calvin's Hobbies are due to different users.
@Mego despise? Despite has no verb form.
15:28
@mbomb007 Stop violence against rep
I should invent more pathological esolangs.
@Lynn good luck
@Lynn more pathological in what regard?
Pathological lying
In mathematics, a pathological phenomenon is one whose properties are considered atypically bad or counterintuitive; the opposite is well-behaved. A notable case is the Alexander horned sphere, a counterexample showing that topologically embedding the sphere S2 in R3 may fail to "separate the space cleanly", unless an extra condition of tameness is used to suppress possible wild behaviour. See Jordan–Schönflies theorem. == Pathological functions == A classic example is the Weierstrass function, which is continuous everywhere but differentiable nowhere. The sum of a differentiable function and the...
Maybe that term isn’t entirely the right one, oops
Well, I was inspired by Headsecks, specifically — the Brainfuck substitution in which all that matters is each byte’s value mod 8
@flawr Languages like diseases: en.wikipedia.org/wiki/Pathology
15:32
Or Unary, where the bytes you use don’t matter at all. Just, languages that have… weird degrees of “freedom” like that. Always useful in !
Is there a way in KDE to make one window the desktop (background)?
            Also, for a non-integer index, ị retrieves the elements at both
            adjacent integer (1-based) indices.
9
A: Wave-Particle Duality Laterally Programmatically

DennisJelly, 17 14 bytes ṪO*2.ị“ .\/\”ṭ Try it online! or verify all test cases. How it works ṪO*2.ị“ .\/\”ṭ Main link. Argument: s (string) Ṫ Tail; pop and yield the last chatacter. O Ordinal; map “./\” to [46, 47, 92]. *2. Elevate the code point to the p...

Jelly is so full of surprises
15:46
It's not only the language that's impressive. Finding that solution is pretty amazing imo
And that indexing :P
Wow, the transcript parser is just tearing through the 2011-2013s
I expect it'll slow down in 2015
Three days left
19
Q: Golfing strings in Fourier

βετѧ ΛєҫαγChallenge Given a string as input, golf down the Fourier program which outputs that string. In Fourier there is no easy way to output a string: you have to go through each character code and output that as a character. Fourier The language is based upon an accumulator, a global variable which...

@quartata There's actually a whole year (Nov 2011 to Nov 2012) where there's exactly one message, IIRC.
@El'endiaStarman Whaattt
On September 2014 right now
Err, two messages. A "Chris Jester-Young unfroze the room" and then a "This room froze" message the same day.
15:51
oh! We need a "identify the site by their chats" challenge
or a "identify the site by the question"
@quartata Yeah, August 5, 2012. Previous message was Nov 10, 2011 and next was Nov 14, 2012.
What changed so much anyways
Critical mass of users?
Yeah, but what caused that? Code trolling?
[code-trolling] happened in December 12 IIRC
So yeah, probably that.
15:54
Well that's rather sad
So when was the last day 24h period without any messages?
day is much easier
2014 is really when it looks like it started to pick up
Nov 17 '12 at 19:36, by GlitchMr
This room is so inactive
Next message was 9 days later:
Nov 26 '12 at 20:42, by Aarthi
@GlitchMr terribly so, indeed!
15:57
Doorknob used to be "Doorknob of Snow"
That was 3 Winter Bashes ago, I believe
@El'endiaStarman phew, S-cool
Oh, I was wrong. It looks like code trolling was near the end of 2013, not 2012.
On November 2015. I thought this would be slow...
2
Q: Right and tfeL truncatable primes

Nathan MerrillA right-truncatable prime is a prime where every prefix is a prime (in base 10). A left-truncatable prime is exactly the opposite, where every postfix is a prime. Both of these sequences are finite (There are only 83 Right-truncatables, while there are 4260 Left-truncatables). You need to writ...

16:02
@quartata The database stuff was probably what slowed it down so much for me.
Most likely yeah
16:15
@NathanMerrill nice twist on "when the program is reversed..." challenges :)
OK, so as I suspected looking for the minimum edit distance is way too slow
I'll have to do it based on a threshold
> Hello
< Nice. (I actually posted a hexdump solution too, so. Was trying to confirm that I wasnt the only one.)
checks out
I need to weight it so that insertions count more
Hmmm
@MartinEnder thanks :)
I was actually going through my old sandbox posts and found it
16:48
It really bothers me that this post by an English teacher has a run-on sentence.
that bothers me too how awful i mean come on now
And Harry Potter is improperly capitalized
@MitchSchwartz Thanks, I needed fake agreement. Now I can get back to work!
anytime don't mention it tainBolt
hey, are mods able to edit comments?
16:59
@Dennis the "words" formatting is quite smart. If only it was possible with newlines
@NathanMerrill :) Re: newlines, that's why I used . Jelly understands both the pilcrow and the newline as link separators.
out of curiosity, how much "verbosity" was added by the reversal challenge?
(or, how many bytes does it take to do only one of the tasks)?
Huh, this is interesting:
> China 45
...
Hmmm. So, about “Right and tfeL truncatable primes”…
We generally accept solutions that define two functions, and then the answer specifies which one is “main”, right?
@Lynn Yes.
So what if I just define two functions here for left and right truncatable primes, and split my answer into one chunk, and choose my reversal to do nothing?
I’d have two equal, yet valid solutions — the bit of information that differentiates them living outside of the code
you're saying to write two functions, one does Left, the other Right, and no reversal?
17:11
Yep
that's fine, but I find it hard to believe that that is shorter than any other answer
Except, when reversed, I posit that my solution’s main is now the other function
Right
So the US does significantly better in Gold medals per capita than the other two categories (Medals per capita or weighted medals per capita)
codegolf as an olympic discipline
"no way! He managed to shave off another byte, giving him a gold with a world record of 6 bytes!"
yeah, I'm sure that'll work
wait, forgot the :P
17:17
the problem: rulebending trolls
doesn't matter if there is a jury
> hey look! 0 byte quine
I'm still waiting for a language with programs of negative size.
if it really was a thing, then competitors would submit their language before knowing the task.
17:19
then the task would be posted, and competitors would have 30 minutes
maybe 3 tasks?
So everyone would choose Jelly
Well there could be different competitions. (There is also shooting at different ranges / prone / standing e.t.c)
Why not MATL?
or 05AB1E/2sable
Maybe also as a team.
what if we really did a mini-olympics
17:21
A team of 3, each uses a different language, and they get to decide who does which of 3 challenges
Or something
nah, I'd be interested if the same language was used for all 3 tasks
that way, targetted languages are tough
it all just feels too similar to code-golf
nevermind
You could pick a golf, a fastest-code and a code-challenge, to even things up between languages
heh
oooh, and countries would be by language?
0
Q: Show off your tree analysing toolbox

LaikoniAs a programmer or computer scientist one might encounter quite a lot of trees - of course not the woody growing-in-the-wrong-direction kind, but the nice pure mathematical kind: *<- root (also a node) /|\<- edge * * *<- inner node | / \ * * *<- leaf (also a node) | * Naturally over ...

Maybe the country of origin of the language decides which country wins?
17:31
oh, I was just meaning that languages were the countries
but maybe?
could we figure out where languages came from
some of them are easy (especially if their owners are active PPCG members)
Might be better your way as I don't know how well spread languages are between countries
I would think most established languages would have a wikipedia reference to an individual or institution. You'd have to decide whether the designer's nationality or the place of birth of the language takes precedence though
Java is Canadian
Python is Dutch
I'm stuck with Java ;_;
I wasn't thinking that you would have to compete in a language from your country, but that might be interesting too...
17:34
its too hard to enforce
I'm...uh...from England
Also some people have moved around
Er, Golang was created by both a Canadian and American
Why not by the user id=)
Maybe best to keep it simple and just pick a winning language. I'm not as keen on dividing along national boundaries
yeah I think so too
So: 1. Declare a language 2. Team up people based on the language they picked 3. Post a code-golf, fastest-code, and code-challenge
do you combine/average scores?
simply give out gold/silver/bronze medals?
17:38
Maybe we send out the medals in the post
oooh, it'd also be great if the mods was the challenge committee (the ones that come up with the challenges), so that we have a chance to beat Dennis/Martin
If Dennis and Martin compete it wouldn't be fair to us mortals
@βετѧΛєҫαγ we had a parade for my local city days, and one of the floats was throwing those coins out, but it turned out that they had bubble gum instead of chocolate in the middle
17:42
Ew
1
A: Right and tfeL truncatable primes

LynnPython 2, 143 bytes I=0 a={2} def f(s): for d in'123456789':u=[d+s,s+d][I];z=int(u);z+=z==2;z!=63973>2==pow(2,z,z)>a.add(z)<f(u) f('') lambda n:sorted(a)[~-n] I=1 Consists of five parts: I=0 A newline a={2}…[~-n] A newline I=1 So reversal is just flipping the value of I. Explanation The...

@MitchSchwartz Okay, maybe my comment on your GolfScript answer should’ve said “I asked you to specify what your program outputs for 0 and for 1 in the OP” ;D
which i ignored on purpose, as did some other people
well, i can't speak to whether they did it on purpose
My assumption was that most of them didn’t even think about it after golfing up their answers. Oh well.
well the positive spin here is that i have great confidence in we the people, and that interested readers will take the time to read and understand code
i have faith!
2
Q: Quick Golf: The Gold Leader

βετѧ ΛєҫαγUsing data from the API here, output the names of the three countries with the most Olympic gold medals at the 2016 Rio Olympic Games (i.e. the first element of the returned list). For example, at the time of posting (18:23 UTC+1, Monday, 15th August), the USA, the UK and China have the most gol...

17:54
comments suggesting otherwise will be treated as exceptions to the rule
Huh, that API scrapes google to get its counts. Where does google get it?
0
Q: Do answers have to be on one line?

iPhynxI was going to submit an answer but it would have to import a module (which is built-in to Python). This makes my answer two-lined, because of the import. Is this acceptable?

profound question
@Lynn Good to see your avatar is finally ready. It was greenish when it was unripe...
0
Q: Is it a wordinian?

Jacques MaraisWhat is the shortest way to see if an input is a wordinian using any programming language? A wordinian is a word that contains words of length 1 to the original word's length. For example, bin 'I' is a word 'in' is a word 'bin' is a word Or, stage 'a' is a word 'ta' is ...

18:12
0
A: "Hello, World!"

TùxCräftîñgCaker, 294 bytes ωΩθΩθθΩθΩθθθΘΩθθΩθθΩθΩθΩθΘθθΩθΩθθΩθθΘΩθθΩθΩθθΩθθΘΩθθΩθΩθθθθΘθΩθΩθθΩθθΘΩθΩθθθθθΘΩθΩθΩθΩθΩθθθΘθθΩθΩθθθθΘθθθΩθθΩθΩθΘΩθθΩθΩθθΩθθΘΩθθΩθθΩθΩθθΘΩθΩθθθθΩθΘ

[text](link)
ON THE BOTTOM RIGHT THERE IS HAWLP
thanks @TùxCräftîñg
NO PRAWBLEM
18:14
@TùxCräftîñg My brain
i always forget the order
the tape status after ω is [1 0], so after the code is simple
Ω basically toggle the memory location between -1 and 0, θ push a bit on the print stack and Θ print
Anyone an idea how to score this challenge?
This is an absolutely fascinating answer to a Spanish speaker asking if two English words are homophones. As a native English speaker, I never realized this was the case, but now it's like my ears have been opened.
4
What do you think about the idea of weighting the scores for each thing?
18:22
> You don't have to find the optimal solution.
it is probably impossible to find the optimal solution within a reasonable time
@flawr Mathematica laughs
i think borat had a horse/whores joke (tv show, not movie)
@ReleasingHeliumNuclei Tell me more?
As far as I know it is not solvable in a polynomial time.
And I think even Mathematica has to obey maths.
no
math obey to Mathematica
18:30
never
@flawr tell you what i dun understand
16 mins ago, by flawr
Anyone an idea how to score this challenge?
(Considering the suggesion I made there)
I hate when someone respond to a comment of mine, but the comment is too long to read in the notification preview, and the post is deleted so that I have no idea what they said.
2
18:45
WorldSEnder's solution for the ternary problem is wrong, but this may fix it and if so would be shorter than the current full program approach def f(s):z=s.pop;r=z(0);return[]<s!=z(0)>'>'and(f(s),f(s))[r<'1']or r (68 in py2)
@Rainbolt Ironic where that cuts off on the starboard...
oh i wrote the py3 there, it's != into > for py2
er, <
@flawr Do you want the score to be independent of the solutions? That is, a fixed formula rather than in terms of the best current solution?
@trichoplax It would be easier, but no, we can also make it dependent on the other scores.
So you suggest normalizing by the best answer?
I much prefer an independent score, but I'm not coming up with any ideas, whereas score being the number of red pixels behind the leader for that test case is nice and easy
18:58
idk what the etiquette is though, i mean the posted answer doesn't even pass the test cases in the problem statement

« first day (2025 days earlier)      last day (3037 days later) »