The Nineteenth Byte

Lyxal

00:00

And our userscript expert too

Redwolf Programs

00:37

I put all my userscripts in a repository

3

Razetime

01:01

good for autoupdating

New Main Posts

-1

Q: "Simple" Programming Homework

Your friend has been caught sleeping in class again! As punishment, his computer science teacher has assigned him homework, knowing that he will not be able to solve it due to not having paid any attention. The assignment seems deceiving simple at first; all that is required is to output the stri...

caird coinheringaahing

01:34

Damn, collectively, we have over 9.3m rep, or 1/9th of a Jon Skeet

That’s counting all users who have more than 1 rep, or more than 101 rep if the just have the association bonus

Lyxal

@cairdcoinheringaahing Jon skeet has 1m rep

9.3m is not 1/9th of 1m

1.24m more precisely

And I know that we have more than 500k collective rep on code golf, so it isn't a ninth

What kind of stats are you reading?

caird coinheringaahing

70

Q: Let's go on a mission

We've been in beta for 1129 days. Don't you think it's time we get out? We seem to be in a similar situation as Code Review. We don't have enough users with sufficient reputation to gain privileges like voting to close and delete. Here's some quick analysis I did with the API (the percentages a...

discussion reputation beta-status

Take a browse through the SEDE queries

@Lyxal Bah, you youngsters and your “correct mathematical calculations”

Lyxal

Okay but I mean where are you getting your Jon Skeet info from?

You clearly have a dodgy dealer

caird coinheringaahing

9.3m and 1.something m = some relation involving the number 9

Redwolf Programs

@Lyxal His dealer won't tell him where he gets it

caird coinheringaahing

01:40

It’s like 2am here, I can’t do coherent maths

Lyxal

@cairdcoinheringaahing you need to sleep

Go on.

Leave.

Go sleep

caird coinheringaahing

@Lyxal I need to finish my pint first

Lyxal

@cairdcoinheringaahing Imma pester you until you sleep.

Redwolf and sporeball both know how persuasive I can be in getting people to sleep.

caird coinheringaahing

Also, I never leave chat :P My computer stays on overnight, so I’ll stay here until my Wifi dies

Lyxal

But I know you're still awake

So go physically leave your computer

And SLEEP

ngn

01:44

while(1) { sheep++; }

3

caird coinheringaahing

@Lyxal On my phone rn

You’ll never win :P

Lyxal

@cairdcoinheringaahing turn your phone off and sleep.

Redwolf Programs

You should give up before caird gets ahold of a smart toaster

Lyxal

@cairdcoinheringaahing if you go sleep right now, I might consider giving you rep

might

caird coinheringaahing

@Lyxal Phone’s off, now this is one of my crappy languages communicating with you

Lyxal

01:45

@cairdcoinheringaahing understandable

Hey wait a second

@cairdcoinheringaahing quickly wake up! Your esolangs have gone sentient

Come stop them

Before they dominate the world

Redwolf Programs

nonono this could be revolutionary for golfing

caird coinheringaahing

@Lyxal No, seriously. I added a “create sentient AI” command to Whispers when it became LotM :P

Lyxal

@cairdcoinheringaahing oh

So you're saying I might have inadvertently caused the end of the world.

I'm proud of myself.

I've accomplished a life goal lol

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

“Simple” Programming Homework code-golf restricted-source Your friend has been caught sleeping in class again! As punishment, his computer science teacher has assigned him homework, knowing that he will not be able to solve it due to not having paid any attention. The assignment seems deceiving ...

Lyxal

@NewSandboxedPosts yesnt.

caird coinheringaahing

01:48

I suppose I can’t win this, because I have to sleep at some point, and Lyxal’s at the perfect time zone to stay awake and force me to :/

Lyxal

@cairdcoinheringaahing it's noon on a Saturday

I've got nothing but time

caird coinheringaahing

Guess I should take a page out of my pfp’s behaviour and hit the hay :P

Lyxal

See now you're getting it

Good night caird.

See you soon

As for the rest of you watching, take note of how easy things can be if you just listen to me

caird coinheringaahing

@Lyxal Think of it as me giving you a few hours to get some reviews in :P

Lyxal

Inb4 nothing pops up in queues

Redwolf Programs

01:50

Do you have the stalk script?

Lyxal

Mobile no let me have userscripts

Redwolf Programs

Hmm, I wonder if it's possible to open the page in an iframe and inject the script into it like Tampermonkey would do

Lyxal

You haven't ever done much on mobile have you

Redwolf Programs

Not really

Lyxal

Do you know how annoying opening a page in an iframe sounds?

Redwolf Programs

01:54

Not by hand :p

Lyxal

It's bad enough opening the results of the leaderboard snippet on mobile

Laggy as all heck

Hopefully duckduckgo listens to my feedback and lets us have userscripts

I think I did it

Redwolf Programs

Got to go for now, I'll be back in an hour or so

Lyxal

I think caird is going to sleep

This means I can add yet another person to my list of people who I've pressured into sleeping.

Razetime

congratrtaazsss

usr

03:22

@Lyxal Could this be updated?

Lyxal

You know what, sure

it's pretty much month end

Actually I can't

SEDE isn't working rn

Lyxal

07:02

@usr done

New Main Posts

0

Q: Reverse and error!

You have to write a program, if its source code is reversed, then it will error. For example, if your source is ABC, then reversing it and writing CBA should crash/throw an error. And ABC itself should be a vaild program (I mean your primary source should be a valid program). Output of the main s...

code-golf source-layout error-message

New Main Posts

07:30

0

Q: Square root multiples

This code-challenge is based on OEIS sequence A261865. \$A261865(n)\$ is the least integer \$k\$ such that some multiple of \$\sqrt{k}\$ is in the interval \$(n,n+1)\$. The goal of this challenge is to write a program that can find a value of \$n\$ that makes \$A261865(n)\$ as large as you can....

math sequence number-theory optimized-output

usr

08:01

@Lyxal You couldn't have. SEDE is also not working for me as well.

If you managed to do it, either 1) you are God or 2) the link above links to the best song in the world

New Main Posts

08:21

Recent Questions - Code Golf Stack Exchange: Integer partitions into fixed number of parts with coprimality constraint on each part

posted on February 27, 2021 by DanielOnMSE

Background Let \$a\$ \$\in \mathbb{N}\$ and \$b\$ \$\in \mathbb{N}\$ and \$S\$ be some set of Naturals. Consider \$X(a ,b, S)\$: The number of integer partitions of \$a\$ into \$b\$ many parts, where each of the \$b\$ numbers are co-prime to all elements of \$S\$. Example: $$X(a ,2, \{a\}) = |\{(x, y): x + y = a,\ gcd(a, x) = gcd(a, y) = 1,\ x \leq\ y\}|$$ In fact it can be sh…

New Sandboxed Posts

08:34

1

A: Sandbox for Proposed Challenges

Background Let \$a\$ \$\in \mathbb{N}\$ and \$b\$ \$\in \mathbb{N}\$ and \$S\$ be some set of Naturals. Consider \$X(a ,b, S)\$: The number of integer partitions of \$a\$ into \$b\$ many parts, where each of the \$b\$ numbers are co-prime to all elements of \$S\$. Example: $$X(a ,2, \{a\}) = |\{(...

Wasif

08:59

@Lyxal My troll using Japt, 14 bytes: Try it online! "`yr èe Ò5"

Anush

10:25

hi all

does anyone know a way to easily make this image black and white so the grey parts are black and the rest is white? ibb.co/WG2RnQH

@rak1507 thank you!

@ngn thank you.

@user thank you

New Main Posts

11:44

1

Q: Continuous Port Ranges

Background Network discovery tool Nmap takes a list of TCP/UDP port numbers as input and performs a security audit against the listed ports. The target port listing on the command line includes selected port numbers as strings separated by a comma. To make specifying big amounts of ports more con...

code-golf

Neil

@Anush <img src="https://i.ibb.co/TYgNcZw/mazurka2.jpg" style="filter: brightness(.625) contrast(8);">

Anush

12:21

@Neil interesting. I never would have tried that

caird coinheringaahing

13:02

@usr @Lyxal I don't think we need that updated every month. At best, every 3/4 months is enough

Wasif

16:01

Hi everyone, a question popped up in mind, can we as ffmpeg for writing answers?

Unrelated String

like, as a standalone language? IIRC the consensus on what constitutes a programming language requires that it can perform a primality test but even if it can it would be weird to score because everything's a bunch of flags so you may as well just make it a bash/zsh/what have you answer

(and add two numbers but I feel like there's some way or another it can do that)

Wasif

16:16

@UnrelatedString So we need to write the title as bash + ffmpeg?

Unrelated String

probably

Wasif

ok thanks for the info

New Sandboxed Posts

17:29

0

A: Sandbox for Proposed Challenges

Gray code... Gray code? Your task: to print the numbers 1-100 in some form of gray code with no input. Your restrictions: Each successive byte after the first can only change one bit from the previous byte. Example valid code (in utf-8): q1!#c. Here, q (01110001) and 1 (00110001) are different i...

caird coinheringaahing

I started this, thinking it'd be trivial in Jelly as ® is the only "variable", before realising that it could be in strings, and I'd have to write a Jelly program to detect Jelly strings ಠ_ಠ

Unrelated String

I was about to say it wouldn't be too bad because string terminators are contiguous at the end of the code page, but then I actually checked and “ is in the middle of them, so... that might actually help, depending on the approach, come to think of it

caird coinheringaahing

@UnrelatedString The worse thing is that the terminators all have meanings outside of strings, so it's context parsing, which is so much worse

Neil

20:37

@cairdcoinheringaahing might be doable in Charcoal; ´ quotes the next character (except inside a string quote) and ”...” quotes a string (except after a character quote)

New Sandboxed Posts

23:24

0

A: Sandbox for Proposed Challenges

Shortest and Asymptotically Fastest Sort of 3-Tuples Tags: fastest-algorithmcode-golfsorting Write the shortest and asymptotically fastest function or program that will sort a set of 3-tuples. Input Input is a set (or unique list, array, etc) of 3-tuples. Each 3-tuple contains elements \$0 \le n ...

caird coinheringaahing

23:39

> Performance is not critical - let's say, for an input of total length < 100 characters the result must be computed in < 10 second on average modern hardware.

Ah, the naivety of old questions :P

rak1507

If it's a complex challenge that could be quite difficult

Redwolf Programs

But then you can't save a byte by using an O(n^n^n) solution rather than O(log n) :p

caird coinheringaahing

If I can't implement a O(n^{n!}) solution, it isn't worth answering :P

2

CMQ: What's the worst complexity you've ever had in an answer?

rak1507

my slowest ever answer was constant time

caird coinheringaahing

I think mine was O(9^{n^2})

rak1507

23:44

lol what was that

sudoku or something?

caird coinheringaahing

This

rak1507

codegolf.stackexchange.com/questions/218544/… this probably has pretty bad time complexity, I don't know what the complexity of integer partitions is but it probably isn't great

caird coinheringaahing

> For each i in 1,2,...,n get the i'th Cartesian power of the fish

Where the "fish" was a 9 element list :P

Redwolf Programs

I don't answer many challenges, but I know I've written at least one program with O(2^(2^n)) compexity (don't remember if it was an answer to a challenge, probably wasn't)

user

I think I once made a Worstsort implementation for a sorting algorithm question, but it wasn't on CGCC

I have no idea how you represent the complexity of Bogosort, though, let alone Worstsort

rak1507

23:52

bogo is n! right

caird coinheringaahing

Bogosort has a chance of running forever, so I guess the worst case is O(∞)

user

It's not totally deterministic, unfortunately

And even if it were n!, the coefficient is really, really high

Redwolf Programs

It does have fairly good best case compexity, though :p

caird coinheringaahing

It ranges from "Never had to loop" to "I'm sorry, did you need this computer?"

user

Permutation sort is a somewhat nicer version of Bogosort because it's deterministic

rak1507

23:54

does something have to be deterministic to have a time complexity?

caird coinheringaahing

@rak1507 I'm guessing so

user

<s>I don't think so</s>

Great, <s> doesn't work here

caird coinheringaahing

There is worst and best case complexities tho, so I guess maybe not

Redwolf Programs

I think it can still have worst/average/best case time complexities

caird coinheringaahing

@user ---abc--- is ~~abc~~

rak1507

23:55

en.wikipedia.org/wiki/Bogosort average is o(n * n!) or o((n+1)!)

user

@cairdcoinheringaahing Ah, thank you

What's big theta and big omega again?

Are those for lower and upper bounds?

caird coinheringaahing

> also known as [...] stupid sort

Bit judgemental

user

Why?

It is an objectively stupid algorithm

caird coinheringaahing

Whose to say which sorting methods are bad or good?

I say, whichever is shortest is good

user

@cairdcoinheringaahing No one. But some are just stupid :P

I never said stupid is bad

rak1507

23:57

in The APL Orchard, Nov 30 '20 at 14:16, by rak1507

more proof that bogosort is the superior sorting algorithm

user

@cairdcoinheringaahing Well, of course :P

caird coinheringaahing

It's stupid, right up until the client asks for it :P

Redwolf Programs

Bogosort is almost infinitely parallelizable

user

^

Redwolf Programs

It's the best sorting algorithm

user

23:57

Perfect for when you have multiple cores

caird coinheringaahing

@rak1507 Those are not the same

rak1507

no, if you have multiple cores, you should use sleepsort

caird coinheringaahing

Y'all are missing out on sleep sort

Ninja'd

user

That's actually not a bad algorithm

With a very precise clock, you can make it very fast /s

rak1507

@cairdcoinheringaahing (n+1)! = (n+1) * n! = n*n! + n! so the highest term is n*n! and the n! gets discarded (I think)

Redwolf Programs

23:59

Yeah, but the time complexity is still going to be O(n), where n is the highest element

caird coinheringaahing

Just use microseconds instead of milliseconds

user

@RedwolfPrograms Yup, but we can scale it down

caird coinheringaahing

@RedwolfPrograms O(n+m) where n is length and m is max element

Redwolf Programs

But bogosort could be O(n), no m, with enough cores

Transcript for