The Nineteenth Byte

3:55 AM

@isaacg I haven't really noticed too much of a drop in activity, and it's hard to judge mood beyond the mod resignation posts, and the occasional declaration in chat of a long time user leaving. I suspect a lot more people would have jumped ship if there was a similar enough alternative site, and there's been talk of restarting development on Axtell.

btw, does anyone know what happened on Nov 5th for the site analytics to show such a massive spike in views?

4:12 AM

i imagine a hot network question with a click-baity title?

4:38 AM

@primo I can't see any around then with a lot of views. Maybe Pi to the power y, for small y's at 6k views?

But that's not really above normal. The rock-paper-scissors question last month got 9k views

i have no explanation

Bubbler

Can you see the actual view count at the spike? (just asking because I don't have access to it)

Jono 2906

@JoKing well, there was a chat room event over in The Sixth Barrel on November 5th

also, i wish that question woutld have been tagged [pi], I didn't get my email alert :<

Jono 2906

But I doubt that would have caused views to increase

A: Pi to the power y, for small y's

4:42 AM

12

Julia 1.0, 18 bytes @.π^(big(1)/1:12) Try it online! (big(1)./1:12) divides a BigInt 1 by each of 1 thru 12, then π.^ raises pi to each of those values. So long as there is one BigInt or BigFloat involved in each computation, it will calculate the result at that precision. The @. macro tran...

The total views for that day was 34410 compared to the previous 15558 and next 16236

how does that 1:12 not require parentheses?

With 13165 of those being new visits compared to previous 2349 and next 3090

i bet i could improve a few cgios...

nevermind, it does

It's the highest spike since traffic starting being recorded. (Unless that's reset every now and then)

If anyone has access to a different site's analytics can you check if it's similar there?

Q: Format a swedish phone number

5:17 AM

0

In some parts of the world, phone numbers are fixed-length, apparently. That sounds boring, though. For this challenge, your task is to take the digits of a what is presumed to be a valid phone number, and format it based on some simplified rules around what a phone number looks like. Input for...

code-golf string

8:18 AM

hello!

Jono 2906

8:46 AM

@Anush howdy!

today I am trying and failing to install gmic on ubuntu

it's very frustrating

A _

9:26 AM

@Anush Why do you want to install gmic?

@Poke I have the intuition that Poke want me to change my username to Jono 2906.

@Jono2906 I guess the views have decreased on that day; I have avoided to view TSB on November 5th. (As far as I can tell, there isn't anything interesting there on that day.)

9:59 AM

@A_ I want to remove a car from a picture :)

any college/university students who have taken a probability class? Here is a tricky puzzle someone gave me

Suppose that X, Y and Z are independent random variables, each uniformly distributed on (0, 1). How can you prove that (XY )^Z is also uniformly distributed on (0, 1).

A: Sandbox for Proposed Challenges

11:47 AM

how can I grep for lines that only contain characters from a-z?

that is all the characters are from that set of size 26

New Sandboxed Posts

12:07 PM

0

A guess the word game The agreed dictionary. Rules: This is a game of two players and the task will be to implement one of them. Player 1 choose a 4 letter word with all letters distinct from an agreed dictionary Player 2 repeatedly guesses a word with all letters distinct from the agreed di...

12:21 PM

any help with this question gratefully received

CMC Read in stdin and output each line sorted into alphabetical order

i.e. if a line is cab then the output for that line is abc

@Anush -P ^[a-z]*$

@Adám is that grep -P ^[a-z]*$ ?

@Anush Yes.

interesting, thanks. The -P cleverly deals with the LANG problem

I always learn something new here

@Anush APL (Dyalog Extended), 6 bytes →≡⎕←∧⍞

12:27 PM

@Adám ooh.. I quite like that

is it too trivial for a main challenge?

@Anush Not only that, it will also be panned for awkward I/O.

argh

I really don't understand this hatred of standard in/out

the clue is in the word standard!

To be acceptable, it'd need to be given a list of strings, sort each which is way too trivial.

you would have sort each individual string

@Anush For purely functional languages, it is a huge annoyance.

12:29 PM

but yes

@Adám I thought haskell had that all resolved

any thoughts on my sandbox challenge?

@Anush Compare e.g. my solution above to the corresponding solution for given a list of strings, sort each: ∧¨ which is literally "sort each".

@Adám I see

@Anush None of the agreed dictionary's words have 4 letters.

did I say 4??

silly typo, fixed

thanks

> how many letters they guess has in common

somthing wrong here ^

12:33 PM

fixed. Thanks

Define in common with.

same letter at same position or same letter anywhere?

added an example. Does that help?

It does.

So we have to optimise for all 12 million cases?

3482 cases

in the sense of the number of words

For each of the 3482 words Player 1 can think of, there are 3482 words Player 2 can guess.

12:37 PM

ah ok... trying all possibilities doesn't seem a good way to make a strategy

because then you have to worry about the order too

it's basically minesweeper

@Anush No, for each response from Player 1, combined with the history of guesses from Player 2, there's just one (or a few equally) good options for the next guess. Thus, this problem is finite, and can in principle be coded as a simple decision tree.

yes a decision tree is a good idea

but the problem is to find a good decision tree

It is simply Mastermind in disguise, which is a solved problem.

well.. it's a version of mastermind but I don't think this version is solved

but I do believe it is solvable

so there are a few options. 1) Assume it is easy to solve optimally and make it code-golf

2) assume it is hard to solve and make it code-challenge

3) assume it is medium hard and make the score the max number of guesses + the number of bytes in the code

I am not sure I believe 1). At least not easy enough to just demand optimality.

Neil

1:19 PM

@Anush I would use grep -v [^a-z] (with appropriate quoting and whatever LANG stuff you want)

@Neil the -P trick seems nicer somehow

to avoid the LANG issues

@Neil but your grep line doesn't seem to check all the characters in the line does it?

Neil

it doesn't need to

the -v means exclude matching lines

so if the line only contains lowercase letters, then it won't match, and therefore won't get excluded

(I can't comment on -P since I don't have the grep manual handy)

ah OK

-P, --perl-regexp
Interpret the pattern as a Perl-compatible regular expression (PCRE). This is highly experimental and grep -P may warn of unimplemented
features.

@Neil How is that even possible? Try it online!

Neil

following your convenient link is handy, but having to actually type "man grep" was already sufficiently unhandy (despite being a use of my hands... because reasons)

1:32 PM

Alexa: man grep

in my dreams :)

so it seems that sorting each individual line from standard in is actually non-trivial in anything apart from APL :)

@Anush I'm sure you can use APL (no, the other APL) to teach Alexa that.

:)

how about the lowest score and if two answers have the same score, the smallest number of bytes wins

what tag would I use for that?

1:52 PM

@Anush code-challenge, I think.

@A_ in my sandbox question codegolf.meta.stackexchange.com/questions/2140/… the first score is not that

ok I think my question is done codegolf.meta.stackexchange.com/a/18265/9207

my only problem is if the link to the dictionary is not permanent

is there any way to tell how long it is supposed to last?

@Anush You could make it a GitHub gist.

@Adám I genuinely don't know how to do that

@Anush gist.github.com

thanks

code-golf string natural-language

2:49 PM

2

Q: Counting syllables

Challenge Write code that, given an English word, outputs the number of syllables it has. Scoring will be determined by a combination of code length and accuracy. Rules The accuracy of the solution should be measured against this CSV file (which countains syllable counts for all the 52,439 e...

could someone check the gist link works please codegolf.meta.stackexchange.com/a/18265/9207

I have never used one before

it seems ok

3:09 PM

0

Q: A guess the word game

A guess the word game The agreed dictionary. All words are 6 letters long with all letters distinct Rules: This is a game of two players and the task will be to implement Player 2. Player 1 chooses a word from the agreed dictionary Player 2 repeatedly guesses a word from the agreed dictiona...

code-challenge

dzaima

3:34 PM

@Anush What is stdin if not running directly in an OS? Canvas can't read stdin because browser JS, and even from the input box it cannot read all because to it the input endlessly cycles, and it's first attempted to be evaluated as JS, so a while(1); in the first input line makes every program freeze forever.

4:21 PM

@dzaima interesting

Veskah

4:31 PM

pbs.org/newshour/politics/… Is going on right now if anyone is curious.

Taylor's testimony is almost through

Yeah, now it's onto question time

El'endia Starman

I might read the transcript after.

code-golf string ascii-art

5:12 PM

1

Q: Exploding Primes

At the time of writing this puzzle, there are soon to be 269 puzzles related to primes. To celebrate/mourn this event (269 is prime), this challenge will be about exploding primes. In preparation for this task, I've obtained a permit (legal, I assure you) for dynamite charges of military grade, a...

mınxomaτ

5:49 PM

TIL: spencermortensen.com/articles/bezier-circle

El'endia Starman

Wow, that's really good.