The Nineteenth Byte

12:16 AM

@cairdcoinheringaahing I figured that since the mod team would have to be interacting with SE on it, and dealing with any consequences, moderator opinions would be somewhat important

Ginger

~~hur hur funny joke~~

lyxal

[believe it or!!] that was a /srs message :p

Ginger

you really expect [[Great Deals!]] from SE?

Someone

@Bubbler it would be pretty pretty. though how one would golf it down to flat code is mystifying to me.

Jo King

1:05 AM

@Bubbler spoiled good or spoiled bad

emanresu A

2:54 AM

Should we also remove caird from the TST / gaming room owners now that they're a mod?

lyxal

3:12 AM

That's up to caird imo

caird coinheringaahin g

Didn't I remove myself from the TST owners?

I definitely remember removing myself as owner from a room

May 19 at 7:48, by Feeds

caird coinheringaahin g has removed caird coinheringaahin g from the list of this room's owners.

Right, it was TNB :P

lyxal

3:27 AM

Bbrk24

What's the JS equivalent of replaceSubrange?

 var nums = [10, 20, 30, 40, 50]
 nums.replaceSubrange(1...3, with: repeatElement(1, count: 5))
 print(nums)
 // Prints "[10, 1, 1, 1, 1, 1, 50]"

Bubbler

splice?

Bbrk24

splice only accepts a single new element, not an array of them

caird coinheringaahin g

Is New Posts down?

Bbrk24

here's a better example of what I need:

 var nums = [10, 20, 30, 40, 50]
 nums.replaceSubrange(1...3, with: [1, 2, 3, 4, 5])
 print(nums)
 // Prints "[10, 1, 2, 3, 4, 5, 50]"

Bubbler

3:37 AM

var nums = [10, 20, 30, 40, 50]
nums.splice(1, 3, ...Array(5).fill(1))
console.log(nums)
// [ 10, 1, 1, 1, 1, 1, 50 ]

TIO

Bbrk24

oh, ...

lyxal

@cairdcoinheringaahing there's been a whole discussion and MSE post about it :p

Bbrk24

I was doing splice(1, 3, arr), not splice(1, 3, ...arr)

caird coinheringaahin g

I spend 2 days moving continents and the bots die without me noticing :/

@lyxal link?

lyxal

17

Q: New Cloudflare protection breaking important bots

Something about SE's DDoS protection or human verification must have changed, which has caused several important chatbots to no longer be able to log in. At first, curling /users/login from my home IP address worked, and a bot hosted there could log in just fine, while a bot of mine running on a ...

Bbrk24

3:39 AM

Well since the main issue is status-completed, shouldn't that be good now?

lyxal

caird coinheringaahin g

Who is this melancholic teenager?

lyxal

rydwolf :p

have you not seen the rydwolf ai edits I've been making? :p

caird coinheringaahin g

I've barely been in chat over the past 2 weeks

lyxal

(that should say "skill issue" but "Shillly scll" is funnier)

Bbrk24

3:43 AM

Rydwolf posted one (1) picture of himself and Lyxal fed it to an AI

lyxal

more specifically DALLE-2

and now I have like 14 rydwolf based meme templates

and way more general edits :p

caird coinheringaahin g

Congrats....?

I stg, every time I visit TNB I feel older

4

lyxal

caird coinheringaahin g

Don't you have multiple rooms for these? :P

lyxal

Well yes, but a) I'm demonstrating my new favourite hobby and b) I'm using them as reaction images :p

@lyxal like instead of using the old /shrug emoji thing, I can use rydwolf :p

Bubbler

5:03 AM

feedback?

Simd

5:32 AM

CMC Given a permutation of the integers 1 to 10, compute the minimum number of swaps needed to get to that permutation from the sorted list of integers from 1 to 10

Bubbler

J, 8 bytes: -&#C.@/:

length of array minus the number of disjoint cycles in the permutation

if I can get 0 to 9 instead, remove @/:

Simd

Could you add a TIO link?

How do you count the number of disjoint cycles?

Bubbler

5:49 AM

ATO

@Simd C. pretty much does that for you

Simd

Thanks!

Bubbler

apparently I can omit @/: for 1 to 10 as well, because C. treats it with an implicit 0 at the front, which forms its own cycle and does not affect the answer

Simd

6:07 AM

Would be interesting to see this in other languages

Neil

@Simd for each element, count the number of prior elements that are greater than it, and take the total

oh, that's for adjacent swaps, did you mean arbitrary swaps?

Neil

6:30 AM

there's already a question for counting cycles, so all you have to do is to arrange to subtract from the length of the array, e.g. a=>a.reduce(g=(c,e,i)=>e<i?g(c,a[e],i):c-=e==i,a.length)

Simd

@Neil arbitrary swaps

Bbrk24

12:45 PM

Apparently TS doesn’t like new (this.constructor)() because constructor is just a function and you can’t new just any function

Neil

1:07 PM

last time I had to do that I just wrote new (this.constructor as new() => type)()

Bbrk24

I’ll probably move it to Symbol.species regardless

do the type cast there instead

Simd

1:54 PM

CMC How many permutations of 1 to 10 are there with 2,5,6,9 as a longest increasing subsequence?

Rydwolf Programs

@lyxal I'm still mad it got my shirt color wrong >:|

Tbf it might partially be the fault of the photographer

But she's my friend so it's definitely the AI

Rydwolf Programs

3:27 PM

Ooh neat:

XOR linked list

An XOR linked list is a type of data structure used in computer programming. It takes advantage of the bitwise XOR operation to decrease storage requirements for doubly linked lists. == Description == An ordinary doubly linked list stores addresses of the previous and next list items in each list node, requiring two address fields: ... A B C D E ... –> next –> next –> next –> <– prev <– prev <– prev <– An XOR linked list compresses the same information into one address field by storing the bitwise XOR (here denoted by ⊕) of ...

Simd

5:03 PM

@RydwolfPrograms and a really bad idea :)

Rydwolf Programs

Why's that?

Simd

just debugging difficulty

Rydwolf Programs

Just don't write buggy code duh

7

mousetail

Doesn't seem very practical but I guess cool it exists for if you have an extreme memory shortage

Seggan

^

Rydwolf Programs

5:05 PM

Or perhaps a really large list relative to your memory

If you've got 16 billion items that 1/3 less space is a whole lot

Simd

imagine a set of 2D points. We will choose a subset and color half of them red and half blue in such a way that you can draw a straight line from each red point to a unique blue point without any of the lines intersecting

mousetail

I'd use a chunked linked list over that, would save much more memory

Rydwolf Programs

True yeah

Simd

the problem is to find the largest subset where this is possible

is this a well known problem?

I feel it might be

Rydwolf Programs

3

Q: Prove that if $2n$ points are colored red or blue, then we can always connect the red points to the blue points with non-intersecting line segments.

Take any set of 2n points in the plane with no three collinear, and then arbitrarily color each point red or blue. Prove that it is always possible to pair up the red points with the blue points by drawing line segments connecting them so that no two of the line segments intersect. This problem i...

combinatorics geometry euclidean-geometry combinatorial-proofs

mousetail

5:07 PM

It does sound interesting, so it's basically just finding the maximum number of non-intersecting lines for a set of points?

Simd

@mousetail yes

Rydwolf Programs

This isn't homework is it

Simd

it is not :)

@RydwolfPrograms I am reading!

mousetail

Simd creates their own homework for themselves

Simd

@mousetail I do indeed

you know me well

Rydwolf Programs

5:09 PM

@mousetail For us, more like...

Simd

@RydwolfPrograms :)

"For any pairing P
of the red and blue dots, let s(P)
denote the sum of all line segments in the pairing."

I already don't know what that means!

what is a sum of line segments?

I really want someone to implement this here! puzzling.stackexchange.com/questions/43771/monte-carlo-chess

mousetail

I assume the sum of their lengths?

Simd

@mousetail I think you are right

Rydwolf Programs

Or maybe like some sort of vector sum?

Actually wait no

Seggan

5:27 PM

@RydwolfPrograms dynamic arrays go brr

Simd

and slices go...?

mousetail

rr

4

Seggan

punchlet.wordpress.com/2009/12/01/hello-world

The Empty String Photographer

6:04 PM

> You haven't voted on questions in a while; questions need votes too!

I have my doubts.

DAMM MARKDOWN!!!!!!!!!!!!!!!!1!1!1!1!!1!-!-!1!1!1!!1!

Rydwolf Programs

6:19 PM

Oh right no SP

0

A: Sandbox for Proposed Challenges

Print the answer before a given answer code-golf answer-chaining In this challenge, you'll take an answer as input, and print the answer before it. If the answer passed as input is the first answer, print your own submission's source. For example, if the first submission is xyz, the second is AB...

Oh we have NP/SP now!

Seems they did fix it

Ginger

:D

@mousetail apparently mousetail is the new Wheat Wizard

Rydwolf Programs

you're right, that is a very wheat wizard thing to say

How is WW? Haven't seen them around in a while

mousetail

I assume using magic to harvest wheat

DLosc

@mousetail I saw this in the chat sidebar and was very confused why it wasn't in CG&CC-gaming

Bbrk24

7:08 PM

@RydwolfPrograms I saw them on the discord recently

I asked something opinion-based about the haskell type system, and they wrote what felt like a shitpost about dependent types

> I no longer work as a dev at all, but I used to be a Haskell dev and I still write a lot of Haskell. While theory predicts the existence of overtyping it has not been directly observed even in laboratory settings. High energy experiments with dependently typed languages are promising but more research is needed and it will be a long time before this reaches prod.

caird coinheringaahin g

@RydwolfPrograms They're off battling the eldritch haskell gods, I'm sure :P

New Posts

8:39 PM

0

Q: Implement Subleq

Subleq is a Turing-complete esolang with only one instruction, SUBLEQ. This instruction takes in three parameters, A, B, and C, all of which are memory addresses. The instruction subtracts the value in memory address A from that in memory address B, storing it in address B. If the value at B is n...

code-golf

New Posts

10:00 PM

0

Q: Byte compression in scores

I am asking this because Vyxal, and mainly Vyxal has a compression algorithm to shave bytes off. I think of this as a bit unfair, so I would like to propose the following: If a programming language has a compression algorithm, then include the compressed score and the normal score. Furthermore, ...

discussion support

lyxal

Packed Stax moment

emanresu A

10:22 PM

Oh for goodness sake not this again

At least they're not pulling a Shaggy and deciding to only count 1 bits in their chosen language

Ginger

10:37 PM

not this again :/

Ginger

10:48 PM

@emanresuA when'd that happen again?

can't seem to find it

emanresu A

Since when did we start scoring in bits (presumably or the charcodes)? Does this mean I can claim my solution is 205 bits, or 25.625 bytes? — Shaggy May 11 at 0:00

Ginger

ah

emanresu A

And I can't find the actual answer but I do remember them posting something and scoring it like that

lyxal

in Vyxal, May 11 at 3:06, by lyxal

0

A: Is it a brainfuck instruction?

Japt -¡, 63 bits / 7.875 bytes o"+,-.<>[] Try it (Because, apparently, we're scoring in bits now? 🤷🏼‍♂️)

I'm starting to think that the joke of silently rolling it out may have been a bad idea :p

I feel like maybe I should write a meta post explaining what Vyncode is, how it works, how it's presented in answers and any other technical questions/clarifications

CMQ: ^?

(unironically and /srs if needed)

Ginger

11:25 PM

yes

always a good idea to be upfront

lyxal

My only argument against doing so is that typically new languages aren't announced on meta

New languages/new things

It'd have to be clear that it was out of clarification

Transcript for