The Nineteenth Byte

caird coinheringaahing

00:02

> This is Lyxal but he’s not signed in. I’d appreciate it if y’all would accept the edit for me.

Hmm, how do I know this isn't Vyxal, Lyxal's evil twin?

Lyxal

Because ones a golfing language and the other one is me

No points for guessing the golfing language

It's extremely obvious

Clearly I'm the golfing language

And you can't convince me otherwise

caird coinheringaahing

@Lyxal That depends on how short you are :P

Lyxal

00:17

@cairdcoinheringaahing :shrug: guess I'm a bowling language then.

New Meta Posts

00:32

0

Q: What's our policy on "reposting" older answers with newer versions?

On occasion, especially with a couple of specific, inactive users, I'll craft a Jelly answer identical to an existing answer, except for a few byte-saving substitutions that have been added to the language since (stuff like ŒgL€ \$\to\$ Œɠ or ÐĿ \$\to\$ Ƭ for those familiar with Jelly). While thi...

caird coinheringaahing

02:02

So I just saw a meme on r/ProgrammingHumour about “haha programmers can’t name variables”, and I realised that, because of Jelly, I haven’t actually used a variable in months :/ Golfing languages have ruined my view of programming

Razetime

04:08

@cairdcoinheringaahing come to APL, we have variables

ASCII-only

@cairdcoinheringaahing come to haskell we have pointfree

aoc-rph.gitlab.io/#ATIwMjAAl7czGA

:o

Razetime

oo I'm at 12th

ASCII-only

if you wanna see how badly you did per star, i use local score/star, turn off cumulative, turn on connect and hover over whatever name

Razetime

How do I have a higher placing that Johan Renaudie

who finished all the stars

ASCII-only

he just did it more slowly

if you set it to time instead you can see the huge spikes at 20.2 and 23.2 lmao

and you can see doorknob's sub-1 minute on 6.1

Razetime

04:24

doorknob is a god

the time based graph kinda confusing to read with many people

HyperNeutrino

sub 1 min

wtf xdd

Redwolf Programs

04:52

~~10m to AoC~~

ASCII-only

welp

gotta get off the mc server now

Redwolf Programs

Am I just immature for thinking...never mind

ASCII-only

...

Redwolf Programs

lol sorry

Unrelated String

05:14

@ASCII-only checked it out from seeing it at the bottom of the leaderboard and til that there's an r/programmerhumor leaderboard

ASCII-only

lel

there's also one for r/programminglanguages, although both are for the discords, just like this one is for TNB

Unrelated String

ah, so that's why i never saw any kind of post about it

i really need to join more subreddit discords come to think of it

Razetime

@UnrelatedString subreddit discords are no good most of the time

ASCII-only

@Razetime shut

subreddits are no good most of the time

the discords are way better

Unrelated String

one of the two subreddit discords i'm on is one that i'm not even on the sub for, i just joined for emotes while i had a gifted month of nitro

ASCII-only

05:28

i generally just don't reddit

Unrelated String

and then the other i posted on like 5 times because my friends were sick of me talking about what it's about

Razetime

05:38

@ASCII-only better than reddit still does not mean good

2

ASCII-only

i said way better.

Razetime

meh

@ASCII-only this I can agree with

Lyxal

11:40

Y'all don't know how hard it was to type this message

Smartwatch keyboards are tiny af

As is the web browser

@RedwolfPrograms I don't get the joke

2x-1

12:45

@Lyxal The all-new Safari. It’s love at first site.

@Lyxal Which Apple Watch is right for you?

Anush

16:00

hello!

Are there any C/C++ geniuses who could translate this code from python bpa.st/GGNA ? I want to see how much faster it can be

HyperNeutrino

16:18

why is expand a deque if you never manipulate it except for append? just curious @anush

Anush

@HyperNeutrino I am not sure it is really needed. I was just trying to see if I could replace it with a list

HyperNeutrino

ah, okay.

Anush

it hasn't worked yet :)

bpa.st/NMCQ is hopefully equivalent and easier to translate

slightly easier again? bpa.st/3EOQ

@HyperNeutrino can you code in C/C++?

HyperNeutrino

yep

am working on it rn

Anush

thanks!!

Anush

16:43

@HyperNeutrino my attempts are failing due to my weak C knowledge.

HyperNeutrino

@anush so, what's expected length for the sample input (and what is the sample input again?)?

Anush

@HyperNeutrino let's try "a" * 10

HyperNeutrino

ey, works

Anush

wow :)

HyperNeutrino

gist.github.com/hyper-neutrino/6ffc38a680c81af242fa46bed0c56273

first try xd

Anush

16:49

C++!

HyperNeutrino

surprisingly it takes longer i think

not by a noticeable amount for count=1, but at count=2 for size 10 input, python takes 2.4 seconds realtime (tio) and cpp takes 8.795

my implementation is probably not that good, and also i don't know how efficient cpp strings are

Anush

dit-ball.cpp:33:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
33 | for (int i = 0; i < eString.length(); i++) {

it does run but it seems slower than the original python!

I tried with count=2

maybe I should pose this problem as a challenge on main?

HyperNeutrino

i think that wouldn't be a bad idea. fastest-code?

Anush

yes

the problem is I am not sure how to make sure people actually compute the right thing

timing the output of 1.6 million strings seems to ruin the question

HyperNeutrino

oh true.

caird coinheringaahing

16:54

Man, I love the \newcommand thing in Latex, I'm abusing it to all hell with my latest Sandbox proposal :P

Anush

:)

@HyperNeutrino I have an idea how to get round ti

it

HyperNeutrino

Oh? what are you thinking

Anush

17:09

I got a friend to post it :)

0

Q: Compute all close strings quickiy

Input A string S of length between 2 and 30. The characters are taken from the 95 printable ASCII characters. Output Your code must compute all strings within Levenshtein distance 2 of S. You can have duplicates as long as you also have all the different strings. Correctness testing To show corre...

fastest-code

HyperNeutrino

number of strings isn't going to work well as a test if you allow duplicate strings

Anush

@HyperNeutrino Good point.

I guess we are just asking people to add optional debugging code that prints out all the strings

HyperNeutrino

true. given that it's not cg it should be fine to just have debug code for proof of correctness

Anush

you can submit your c++ code straight away :)

any idea why it's so slow though?

HyperNeutrino

it's so slow though xD

idk, i asked my friend, he's better at C++ than I am

Anush

17:17

cool.. what did they say?

or are they thinking about it?

HyperNeutrino

i'm still waiting for him to wake up lol

Anush

:)

julia seems to be a cool language for speed these days but we don't get many julia answers here sadly

HyperNeutrino

it's not a language i've seen much anywhere. what's its main strength/use case?

Anush

it has a cool type system, looks a bit like python and is built for speed

really it's for python users who want to write fast code

New Main Posts

0

Q: Compute all close strings quickiy

Input A string S of length between 2 and 30. The characters are taken from the 95 printable ASCII characters. Output Your code must compute all strings within Levenshtein distance 2 of S. You can have duplicates as long as you also have all the different strings. Correctness testing To show corre...

fastest-code

HyperNeutrino

17:21

wait haven't you already posted it (not sure codegolf -> fastest-code is enough of a diff)

Anush

@HyperNeutrino I believe the rule is that they are only duplicates if a reasonable attempt for one would be a reasonable attempt for the other.

so code-golf and fastest-code questions are rarely duplicates

HyperNeutrino

hm, fair enough. i'm not gonna nuke it but idk if people will vote it /shrug/

^^ i mean yes but also most of the time the challenges don't have the same spec/concept, similar at most

caird coinheringaahing

CMMC (chat mini math challenge): what is the smallest number that can be expressed as the sum of 3 cubes in 2 different ways?

Anush

@cairdcoinheringaahing nice question!

ngn

@cairdcoinheringaahing taxi cab?

caird coinheringaahing

17:31

@ngn Related to; 1729 is the sum of 2 cubes in 2 different ways

Anush

3 is the sum of three cubes

in two different ways

caird coinheringaahing

@Anush But not in 2 different ways (not counting 0)

Anush

@HyperNeutrino I will be really interested in what your friend says about the C++

4^3+4^3 +(-5)^3?

caird coinheringaahing

Ah right, should've specified

HyperNeutrino

but then there is no smallest right?

lol. cuz then your answer could be negative

Anush

17:33

I assumed smallest in absolute value :)

caird coinheringaahing

@cairdcoinheringaahing What is the smallest number that can be expressed as the sum of 3 cubes of positive integers in 2 different ways?

Anush

aha!

caird coinheringaahing

My program timed out on TIO :/

HyperNeutrino

my code reports 251

ngn

@cairdcoinheringaahing ah, so upper bound: 1729+1 :)

HyperNeutrino

17:36

251 = 216 + 27 + 8 = 125 + 125 + 1

3

Anush

@HyperNeutrino although maybe a C++ expert here could help too

caird coinheringaahing

@HyperNeutrino Man, my Jelly code is inefficient :P Thanks!

ಠ_ಠ Adding +5 bytes to my code, now it finds 251 in less than a second

HyperNeutrino

lmao

caird coinheringaahing

And finds 5104 as "What is the smallest number that can be expressed as the sum of 3 cubes of positive integers in 3 different ways?" :D

HyperNeutrino

13896 for 4 different ways

161568 for 5, 1296378 for 6, 2106496 for 7, 2562624 for 8

and then it starts taking a pretty good amount of time afte rthat

caird coinheringaahing

17:49

I'm hoping my code can handle some of the larger cases I'm including :P

HyperNeutrino

8.5 seconds to find for 9 different ways

caird coinheringaahing

@HyperNeutrino Mind sharing your code? That's much faster than mine

Redwolf Programs

Are you making a list of the cubes first or is that not the slow part

HyperNeutrino

tio.run/##XY/…

caird coinheringaahing

Here's a challenge: "sum of 6 powers of 8 in 8 different ways" :P

I think your Python answer may not work too well for that

HyperNeutrino

17:54

by "powers of 8" do you mean "numbers to the power of 8"

caird coinheringaahing

Yep, poorly worded

HyperNeutrino

is there a more efficient method than bruteforce lmao

caird coinheringaahing

No idea. I'm basically trying to get some test cases for a challenge, so brute force works for me :P

HyperNeutrino

tio.run/##dVDLboNADDzjr/…

TLEs though

HyperNeutrino

18:48

@anush my code had edit == count + 1 instead of - 1 as intended

after fixing it it saves very marginal time though

otherwise my friend hasn't found anything wrong with it

caird coinheringaahing

@HyperNeutrino I've put the code on my laptop to look for some solutions to some examples; it definitely seems to grow (runtime wise) based on the "N different ways" bit rather than the powers or the "X powers" bit, which is interesting

HyperNeutrino

well, the "to the power of X" part shouldn't grow because exponentiating non-massive numbers is mostly constant

i'm a bit surprised it doesn't grow based on number of numbers

idk if there's an asymptotic representation of the answer size since it seems to be O(answer)

caird coinheringaahing

Yeah, I just thought it's an interesting observation. Although, it's very fast for 6 4 4 (sum of 4 quartics 6 different ways), but it Memory Errors for 5 4 6 (sum of 4 sextics (?) 5 different ways)

HyperNeutrino

19:03

oh huh. interesting

Anush

@HyperNeutrino hmm.. how very odd

@HyperNeutrino a simple cython version is faster even though it's still mostly in python!

@HyperNeutrino bpa.st/7IRQ is faster. If I knew more C I could speed it up a lot

@HyperNeutrino printable needs to be a char array , we need a set implementation for result and for i,char in enumerate(eString): needs a Cish version

Anush

19:25

very excited to see what the first answer will be and how much it will beat my python solution!

caird coinheringaahing

20:01

What tag do we use for restricted space alpgorithms? restricted-space doesn't exist?

For those more familiar with the topic, does restricted-memory work for a challenge that specifies "O(n) space complexity"?

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Generalised Taxicab Numbers \$\newcommand{T}[1]{\text{Ta}(#1)} \newcommand{Ta}[3]{\text{Ta}_{#2}^{#3}(#1)} \T n\$ is a function which returns the smallest positive integer which can be expressed as the sum of 2 positive integer cubes in \$n\$ different ways. For example, \$\T 1 = 2 = 1^3 + 1^3\$ ...

rak1507

20:20

just accidentally swapped text in TIO so now it is right aligned, how do I fix this? sorry if this isn't the right room to ask

HyperNeutrino

@rak1507 wait how did you even manage

you can ask about TIO here

send your TIO link?

caird coinheringaahing

It's better than asking in the dead TIO room

HyperNeutrino

yeah

Neil

@rak1507 (guess) did you press Ctrl+Shift+X perhaps?

rak1507

yes I did, was doing some APL so yeah

caird coinheringaahing

20:40

@rak1507 Sending your TIO link might help us

rak1507

nah it's no problem now

Anush

20:52

@cairdcoinheringaahing restricted complexity maybe?

caird coinheringaahing

@Anush That's more for time restrictions rather than space

Anush

21:14

It might make sense for both if you don’t want to make a new tag

caird coinheringaahing

@Anush restricted-rememory is underused but it isn't that new. I went with it anyway cause someone can always correct me if I'm wrong

Anush

21:26

Oh cool

It seems never to have been used

Ah no. There was just a typo in the link

caird coinheringaahing

@Anush Yep, I can't spell tonight :P

Anush

21:42

:)

the problem with fastest-code questions is that they are not good for the impatient :/

NMaybe someone could kindly put in a n answer even if it isn’t that fast?

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Answers made up from older answers answer-chaining decision-problem In this challenge, your task is to take a number as input, and determine whether it is the number of previous answers. For example, the third answer would print/return a truthy value is given 2, and a falsey value for any other ...

Adám

22:19

@rak1507 Ctrl+RightShift will mark the input field as RtL. Ctrl+LeftShift undoes it.

caird coinheringaahing

22:57

Anyone who has access to the mod tools, could we get a couple of delete votes on the questions listed there? They've been hanging around for a while and could do with finally being deleted

caird coinheringaahing

23:37

@RedwolfPrograms You wrote the Random Question userscript right?

Lyxal

23:50

Yeah they did

Transcript for