The Nineteenth Byte

12:32 AM

@Neil Yes. If a regular user does it, it will just append a comment saying "Let's continue this discussion in chat" and link a new room; if a moderator does it, it will remove the entire comment thread and copy the messages into chat and say "This discussion has been moved to chat".

(At least, this is how I remember it works)

Lyxal

12:56 AM

Why is it that we say "see you later" to people we'll probably never see again?

Like one time I bought boxes from a guy off gumtree and as I was leaving, he said "see you later"

Even though it was a one time transaction

James

1:24 AM

Set phrase

A set phrase or fixed phrase is a phrase whose parts are fixed in a certain order, even if the phrase could be changed without harming the literal meaning. This is because a set phrase is a culturally accepted phrase. A set phrase does not necessarily have any literal meaning in and of itself. Set phrases may function as idioms (e.g. red herring) or as words with a unique referent (e.g. Red Sea). There is no clear dividing line between a commonly used phrase and a set phrase. It is also not easy to draw a clear distinction between set phrases and compound words.It is different from a proverb in...

Redwolf Programs

1:53 AM

@Lyxal I think it's the same reason it sounds weird (at least to me) when you say "good morning" when leaving; we're used to it being used as a greeting, although it's equally as valid as "good night" (at their respective times of day). "See you later" does actually sound weird to me in the context you mentioned, but I probably wouldn't notice since it's so commonly used elsewhere.

2x-1

2:07 AM

@Bubbler The good thing is that x86 machine code isn't mentioned. :P

@cairdcoinheringaahing 22.72 for me

Redwolf Programs

2:31 AM

I'm very annoyed at TIO right now...one of the languages (can't say which because of CnR) isn't working. My code wasn't working properly, so I tried the most minimal example possible. Still broken. Tried all of the reference programs, and it's outputting the wrong things. Arggggh this is so annyoing.

Neil

9:03 AM

@HyperNeutrino yeah, I was just wondering whether it was worth bothering a mod to remove the comments that were copied/continued in chat

Newly Featured Questions

10:11 AM

35

Q: Sum the powers that be

A simple but hopefully not quite trivial challenge: Write a program or function that adds up the kth powers dividing a number n. More specifically: Input: two positive integers n and k (or an ordered pair of integers, etc.) Output: the sum of all of the positive divisors of n that are kth powe...

26

Q: Vandermonde Determinant

Given a vector of \$n\$ values \$(x_1,x_2,x_3,\ldots,x_n)\$ return the determinant of the corresponding Vandermonde matrix \$V(x_1, x_2, \ldots, x_n) = \begin{bmatrix}1 & x_1 & x_1^2 & x_1^3 & \ldots &x_1^{n-1} \\1 & x_2 & x_2^2 & x_2^3 & \ldots &x_2^{n-1} \\ \vdots & & & \vdots & & \vdots \\ 1 &...

code-golf math matrix linear-algebra

HyperNeutrino

1:41 PM

@Neil Ah. Generally I'd use the regular "continue in chat" if I'm personally going back and forth with someone on clarity or questions, and now I would only use the mod thing if people are being chatty. If there are comments that are in chat already or are no longer needed you can flag a couple of them and usually if I see a flag or two on a comment section I'll scan through all of them and remove chat or clarifications that have already been addressed/edited in.

You can also just ping me about a specific comment section

Neil

@HyperNeutrino this one I guess: codegolf.stackexchange.com/posts/comments/499376?noredirect=1

HyperNeutrino

@Neil Ah, I see. Okay, I've cleared all of the comments since they've been copied to chat and the clarifications are probably mostly helpful to just the commenter themselves.

Neil

@HyperNeutrino thanks

caird coinheringaahing

2:41 PM

Any feedback on this?

Anush

3:58 PM

@dzaima do you think the computing the sequence we discussed would make a good challenge on main?

dzaima

4:14 PM

@Anush i think it's fine as a CMC, but i don't participate on SE anyways

Anush

@dzaima topanswers?

dzaima

@Anush i'm pretty sure this chat room is more active than it :p

Redwolf Programs

5:01 PM

I think while (++m ** 2 <= n); might be my favorite line of code I've written so far. It finds the squareroot of n (rounded up, or +1 if a perfect square), assuming m is 0. I think this is the closest to code golf I'd ever do in production code.

Neil

5:38 PM

(huh, why did that ping me, even though I answered it a minute later?)

Anush

6:18 PM

@dzaima :)

It's good for latex as it has three experts who answer everything

James

6:48 PM

@RedwolfPrograms TIO is no longer being maintained, so it comes down to each individual language whether or not it's going to work

dzaima

@RedwolfPrograms you can use that as an advantage ;)

Redwolf Programs

I guess so :p

caird coinheringaahing

Oh, cause its on TIO, it's a valid language, but people won't be able to use TIO to test it :P

Redwolf Programs

Only problem is, I won't know if I did it right either :p
Wouldn't want someone who actually knows the language to get mad because it doesn't actually do what it's supposed to

New Main Posts

7:14 PM

0

Q: Extend/confirm the most recent "nice" OEIS sequence

Today Neil Sloane of the OEIS sent out an email asking for an extension of the latest OEIS sequence A337663 with the keyword "nice". Here's how this sequence works: You label \$n\$ cells on the infinite square grid with \$1\$s, and then place the numbers \$2,3,4,\dots,m\$ in order, subject to th...

code-challenge sequence combinatorics grid

Redwolf Programs

8:49 PM

My Stack Overflow is cursed. I've had 666 reputation for months now.

HyperNeutrino

9:11 PM

so I just remembered about Music SE and decided to go on it and ended up posting my first answer there yesterday

and literally today I got the Yearling badge

is it just a lucky coincidence that it's been a multiple of a year since I created that account, or is it because I was inactive that I was barred from getting the badge until now?

caird coinheringaahing

The badge info doesn't help :/

> Active member for a year, earning at least 200 reputation

HyperNeutrino

nvm seems to be the latter, I got my association on July 5th 3 years ago

@cairdcoinheringaahing oh that would make sense; beyond the association I hadn't gotten any reputation until now

caird coinheringaahing

Oh, unrelated, but I'd recommend editing your profile @HyperNeutrino from "I am an elected community moderator (2020)" to "I am an elected community moderator on CGCC (2020)" or similar :P

HyperNeutrino

@cairdcoinheringaahing Oh, good idea, I forgot that my profile's network-wide lmao :P it'd be good clarity either way

thanks lol

caird coinheringaahing

Interestingly, the last date (closest to today, already passed this year) that no one on PPCG earned the Yearling badge was Sep 25

caird coinheringaahing

9:34 PM

CMC: Implement Jelly's T and Ṭ commands. Write two programs, one that implements T and the other Ṭ. Score is Levenshtein distance between the two. T takes a list of integers and returns the indexes of non-zero elements. Ṭ does the inverse (takes a list of integers l and returns a list where the elements at indexes in l are 1 and 0 otherwise)

Example outputs for [1, 0, 0, 1, 1, 4]

Adám

10:05 PM

@cairdcoinheringaahing Dyalog APL 18.0 or Extended: 3 (I think, I don't really know how to measure Levenshtein distance): ∪⍸ and ×

CMC: Implement APL's ⍸ and ⍸⍣¯1 commands. Write two programs, one that implements ⍸ and the other ⍸⍣¯1. Score is Levenshtein distance between the two. ⍸ takes a list of integers and returns a list of indices where each index is replicated as many times as that position's integer. ⍸⍣¯1 does the inverse (takes a sorted list of integers l and returns a list where the element at each index is the count of that index in l)

Example outputs for [0, 0, 1, 1, 1, 4]

Neil

@Adám assuming the longest program is 2 bytes, then that's also the upper limit for the distance

Adám

10:20 PM

@Neil Ah, so one step is removing a character, and then other is replacing one?

Neil

right

@cairdcoinheringaahing Charcoal, Ｉ⌕ＡＥθ¬ι⁰ and ＩＥ⊕⌈θ№θι, distance 5

Adám

@Neil Can you explain how that is 5 steps? (And how did you compute that?)

Neil

@Adám oh, hmm, I think I miscounted

yeah, distance is 6, sorry

(I thought there were three places where the characters matched, but it turns out that one isn't an exact match, which makes it irrelevant, as two edits is the same as an insert and a delete)

Adám

OK so for your code, the Levenshtein distance is also the Hamming distance.

Neil

also, Charcoal doesn't have a good way of implementing ⍸, it takes me 12 bytes as a full program

@Adám right, there aren't enough near matches to justify using inserts or deletes

caird coinheringaahing

10:31 PM

@Adám Jelly, distance of 6 (1 edit, 5 inserts)

Top is ⍸, bottom is ⍸⍣¯1, I believe

Adám

Do we really not have a vanilla Hamming distance challenge? I mean just look at those horribly verbose implementations on Wikipedia.

@cairdcoinheringaahing Looks good. (only your link doesn't run the top one, but removing the bottom one runs it, so all good)

caird coinheringaahing

10:57 PM

@Adám Yeah, Jelly only runs the last line by default, I just included them both in one link

Transcript for