The Nineteenth Byte

des54321

00:03

@cairdcoinheringaahing I feel like it kinda depends on how complicated each of those pieces of information is, gimme a min to read this challenge

caird coinheringaahing

One of the bits of info is the proof of the Riemann hypothesis, another is the complete works of shakespeare, but where every letter is replaced by the script for the bee movie :P

des54321

sounds perfect :P

Ginger

I see no issues here, it should work fine

des54321

this does seem like a pretty good KOTH, still reading though

definitely will require complicated bots though, there are a lot of pieces to this

i feel like im not quite certain I fully understand double conveyor belts, do those always move the bots twice or can they chain if you get moved from one conveyor to another?

caird coinheringaahing

Basically, the double conveyers "activate" twice, whereas the single ones only "activate" once

des54321

00:13

I do feel writing good bots for this will be hard though, there are kinda a few too many moving pieces

yeah, the more I think about this the more complicated i realize it would be to code a bot for it that actually does well

caird coinheringaahing

So, the thing I found about playing the IRL version of this is that even the best laid strategies can go chaotically wrong. I suspect a simplistic bot might actually do quite well

des54321

quite possibly

caird coinheringaahing

@Wezl'lo-ol' I'm tempted to remove walls from the spec tbh, they're a bit of an annoying edge case

des54321

I feel like if i wrote a bot for this it would mostly consist of various conditionals for what it wants to do in certain situations, like if its on the big conveyor loop in the center stay on that until its close to a checkpoint, move towards a checkpoint if its in the right area, etc etc

removing walls might help, or just turning them into completely impassable spaces instead

I do feel like some sort of graphical controller that actually shows the bots moving around the field is almost necessary for this

because otherwise it would be too hard to debug stupid shit your bots are doing

New Posts

0

Q: Fill the rectangle

Challenge In this challenge, you have to fill an \$M\$ x \$N\$ rectangle grid with the most \$A\$ x \$B\$ rectangle pieces possible. Requirements: The sizes of the \$M\$ x \$N\$ rectangle grid is always bigger than the sizes of the \$A\$ x \$B\$ rectangle pieces. In other words, \$min(M, N) ≥ ma...

code-golf

des54321

00:27

probably not that hard to whip up something basic with pygame that just draws a bunch of rectangles and circles for everything

caird coinheringaahing

I'm going to write a normal controller first, then maybe turn it into a graphical one :P

OldSandboxPosts

01:00

Sandbox posts last active a week ago: Sell cinema tickets, ITEXTIN - Is This an EXTended Initialism?

emanresu A

01:14

TIL hyper made yet another tacit golflang

Seggan

01:39

3

when you try to be funny naming classes

New Posts

02:14

0

Q: Two In One: Guess That Language

Two In One: Guess That Language - Cops This robbers-and-cops challenge challenges the robber to create a script such that it runs in language A forwards and language B backwards. Language A and B must be distinct. By runs, a program must not ask for input and can only give text output to STDOUT a...

cops-and-robbers

0

Q: Two In One: Guess That Language - Robbers

Two In One: Guess That Language - Robbers This robbers-and-cops challenge challenges the robber to create a script such that it runs in language A forwards and language B backwards. Language A and B must be distinct. By runs, a program must not ask for input and can only give text output to STDOU...

cops-and-robbers

caird coinheringaahing

> (except or the case of Perl 5 and Perl 6)

That's weirdly specific

Also, 2 months is a crazy long time for answers to wait before being safe

Eman yalpsid

@cairdcoinheringaahing OK then

@cairdcoinheringaahing Because, they aren't actually the same language

caird coinheringaahing

@Emanyalpsid did you Sandbox this challenge?

Eman yalpsid

@cairdcoinheringaahing Yes

0

A: Sandbox for Proposed Challenges

Two In One: Guess That Language This robbers-and-cops challenge challenges the robber to create a script such that it runs in language A forwards and language B backwards. Language A and B must be distinct. By runs, a program must not ask for input and can only give text output to STDOUT and not ...

ANd awefully long ago I almost forgot it

Thanks + Thanks

Another upvote and I'll be 777 rep!

caird coinheringaahing

It's generally a good idea to ask for feedback before posting a zero score cops-and-robbers, especially if you haven't really gotten any feedback before. It's not too bad as in, but could've done with a bit of cleaning up before posting

I'll give it a quick edit

Eman yalpsid

02:24

ok

thanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanksthanks

caird coinheringaahing

Actually hang on, no, I'm going to leave some comments instead

Eman yalpsid

Why is this of course

could've been 5000 characters ;-)

caird coinheringaahing

@Emanyalpsid Perl 6 isn't a thing

And Raku is generally considered a completely separate language to Perl

Eman yalpsid

@cairdcoinheringaahing Just to avoid confusion

As technically it IS called perl6 and raku

caird coinheringaahing

I'd suggest changing "An answer is safe if it is not cracked until two months after the question is posted." to "An answer is safe if it is not cracked until two months after it is posted.", and potentially lowering the time (7 days, or 2 weeks are normal for CnRs)

Also, if you're going to copy-paste rules/specification from other challenges, at least edit it to make sense for your challenge

Eman yalpsid

02:33

Wait what

I'm confused

This robbers-and-cops challenge challenges the robber to write ... The cop should provide the following information:... Maybe is it supposed to be cops

caird coinheringaahing

Yes, Robbers are supposed to find the hidden information

Eman yalpsid

oh ok

fuck it

Congratualations to me for writing cop for robbers and robbers to cops

so um basically i copy pasted the flag part and i want to edit it to - Flags must be revealed to avoid obscure combinations.

@cairdcoinheringaahing you there?

caird coinheringaahing

Yep

Eman yalpsid

why delete this

The shortest safe answer by byte count wins.

caird coinheringaahing

That doesn't make sense for Robbers

Eman yalpsid

02:39

oh ok

caird coinheringaahing

In a Cops and Robbers challenge, the Cops have a different winning criteria to the Robbers, as they're trying to do different things

Eman yalpsid

yeah done

phew, cnr is a strange thing to me...

Thank you pretty sure you gave me that upvote

caird coinheringaahing

I didn't actually

Been too busy editing the challenges into shape :P

Eman yalpsid

um

nvm

caird coinheringaahing

Don't worry, I tend to only upvote challenges I answer, and I have a couple of ideas for this I might try

lyxal

02:45

found this gem in the OpenAI docs

> When we give examples of politeness but remove the word polite things totally go off the rails in the first response. Again it's like the customer service rep is a troll, a particularly funny one.

Eman yalpsid

I tend to only upvote challenges I answer? hmm

idk why but i always star stared messages

caird coinheringaahing

@Emanyalpsid I only upvote challenges I think are a net positive to the site, and I only answer challenges I think are a net positive to the site, so, very often, they go hand in hand

Eman yalpsid

My Homework:

Original: I drove five giants into chains, chased All of the race from the earth.
Paraphrase:Beowulffoughtfivegiantsandimprisonedthemall.Eventuallyhekilledofftheentirerace.

Teacher, I think your space bar is broken...

DialFrost

03:00

Hai guys

Radvylf Programs

Am I that bad at JS?

emanresu A

Lol

Radvylf Programs

It turns out I just used a ++ instead of -- in a for loop (for a shuffle)...kinda wack that it SIGILL'd

Bug maybe?

emanresu A

Yeah, I'd try to repro it if I were you

It's gotta be a compiler error, right?

(Also, you might have discovered a major security vulnerability)

Radvylf Programs

Maybe, but it's unlikely

And trying to boil this down into an MCVE isn't going to be fun

But y'know what, I don't have anything else to do

I've already boiled it down to 6 lines yikes

emanresu A

03:15

Maybe try running it in v8 if you can isolate the version your browser uses?

Radvylf Programs

This is it:

var points = [...Array(2)].flatMap((_, y) => [...Array(2)].map((_, x) => [x, y]));

for (var i = points.length - 1; i > 0; i++) {
    [points[i], points[0]] = [points[0], points[i]];
}

It takes about two seconds to awsnap the tab for me

thejonymyster

i>0, i++?

i have no context but that seems wrong :P

Radvylf Programs

Yeah, it is

It's a minor bug that should just do an infinite loop

It awsnaps after over 100 million iterations

Let's see if it's a consistent number

It is

112813857

emanresu A

@RadvylfPrograms How did you get this?

Radvylf Programs

Interesting, this number shows up elsewhere: github.com/xtuc/webassemblyjs/issues/718

@emanresuA console.loging every 1000 iterations, to get a rough estimate, then logging every i after that estimate until it died

emanresu A

03:21

So, you just reached the JS heap limit. Oh well :P

Radvylf Programs

Probably something boring like that, yeah. But SIGILL?

Weirder:

var points = [0, 1];

var x;

for (var i = points.length - 1; i > 0; i++) {
    x = points[i];

    points[i] = points[0];
    points[0] = x;
}

It doesn't have to do with using the [x, y] = [y, x], so OOM is less likely?

That changes the number of successful iterations though (increases by ~6000), so maybe it is just OOM and SIGILL (no idea what would be using more memory though)

PyGamer0

@emanresuA thats stack based..

emanresu A

Oops

Radvylf Programs

Hmm, it eats up 2 GB of memory instantly, so probably just...oh wait I'm an idiot swapping with incrementing is means that it'll grow the array to a larger and larger size

OOMing with a SIGILL is weird but probably intentional

emanresu A

@RadvylfPrograms It took me a while to realise that that didn't stand for Order Of Magnitude

thejonymyster

03:27

the sound a woc makes

emanresu A

03:48

CMQ: Is there a way to pipe bytes that are invalid utf8 into a file?

PyGamer0

@emanresuA which lang

and do you just want to store the bytes?

emanresu A

Nvm I figured out how to do it with xxd -r

lyxal

04:34

because that's what rational people do

emanresu A

Is this part of your computer science class?

lyxal

it is

that's unedited btw - I think I must have started the quiz and just forgot to finish it, so it ran for as long as it could

mind you this is the same course that claims Windows Phone is a popular mobile OS

emanresu A

04:54

Lol

des54321

05:07

clearly this is a teacher who is knowledgeable about computers and should be teaching you computer science

lyxal

well what do you expect from a course based on content from 2010?

thejonymyster

it is definitely one of the top ten mobile os names that i have heard of

emanresu A

windowsphone.se is dead, but it's still getting as many spammers as before

PyGamer0

i got the civic duty badge

in Wellscripted, 1 min ago, by PyGamer0

val collatz = (n: Integer) -> {
    var ar = [];
    while (n > 1) ar = ar.tack(n =
        n % 2 ?
        1 + 3 * n :
        n / 2
    );
    return ar;
}

thejonymyster

05:23

is that related to that quote?

askiing because im stupid

PyGamer0

05:36

@thejonymyster no

graffe

05:58

CMC given a floating point number between 0 and 1, output the same number in binary

emanresu A

07:40

Woo got a B on Calculus BC!

Aiden Chow

what u got ur score back already ?

PyGamer0

07:55

@emanresuA BC?

graffe

08:15

British Columbia?

emanresu A

08:54

@AidenChow I'm doing a special course thing :P

Will probably sit the actual exam next May

justANewb stands with Ukraine

Gosh I learn how to award a bounty the hard way.

Neil

@OldSandboxPosts hmm, maybe I should get my act together and actually post this

@graffe ES6: x=>x.toString(2)

emanresu A

09:16

@Neil Wait what that works??? TIL

pxeger

10:34

→ 1 pinch of salt moved to The Nineteenth Bakery

emanresu A

10:54

offline???

Wheat Wizard

It seems so.

pxeger

I just got randomly logged out as well

Wheat Wizard

I'm currently working on a very detailed answer. I really hope I don't have to start over.

pxeger

select all, copy into a separate document?

or was it just saved as a draft?

Wheat Wizard

I'm not that worried that I would actually do anything.

graffe

12:14

@Neil does that really work?

Do we have a question about converting floats to binary? I can't find one

New Posts

13:37

0

Q: Increasing permutation trees

For this challenge a "binary tree" is a rooted tree where each node has 0 children (leaf) or 2. The children of a node are unordered, meaning that while you might draw the tree with left and right children there isn't a distinction between them and mirroring the tree or a sub-tree does not prod...

code-golf combinatorics permutations graph-theory binary-tree

Sandbox Posts

14:40

0

A: Sandbox for Proposed Challenges

Super palindrome number Challenge A super palindrome number is a non-negative number that has only one digit repeating. For example, \$0\$, \$1\$, \$33\$, \$555\$, \$9999\$ are per palindrome numbers, while \$10\$, \$121\$, \$3332\$ is not. Your task is, given a number, output the smallest posit...

PyGamer0

15:30

CMC: Given 2 numbers find: x-(x+y)^2

example for 3&4: -46

ooh i have 3 bytes

flax, 3 bytes: -M+

thejonymyster

16:12

thats probably not even golfable in a lot of languages, like i bet in js the answer looks basically just like the expression

not that thats bad or anything i just find it interesting lol

awesome syntax idea

x=y assignment

x=y? comparison

Ginger

bash: hello: command not found

Bgil Midol

17:38

@PyGamer0 what does M do?

mathcat

square

mathcat

17:49

what

I think M squares an integer in flask

pxeger

oh, SE chat seems to have done an oopsie

→ 1 message moved to Trash

pxeger

18:54

CMC: given a list, and two predicate functions f and g, find the index of the first element in the list which satisfies both f and g, but the index only counts for elements which satisfy at least one of f or g

e.g., if the list is 1, 2, ... 10, and f is "is even", and g is "is square", then the first element is 4, but the elements which satisfy at least one of f and g is [1, 2, 4, 6, 8, 9, 10], of which 4 is the 3rd element, so the output is 3. (or, if you use zero-indexing, the output is 2)

des54321

huh thats an interesting one

trying to think of a python solution, I fear its going to involve both dicts and sets

pxeger

bonus challenge: generalise this to any number of functions

des54321

okay wait i think i might have a horrific python idea using del

oooor that doesnt work because del foo doesnt have a value

what am i doing modifying an iteratible while iterating over it doesnt work

pxeger

19:12

it works with lists

Wheat Wizard

@pxeger Haskell + hgl: f%g=st<<g1((f*^*g)<cr)<eu<fl(l2(||)f g)

pxeger

it doesn't work with dicts, unless you make a copy

user

@pxeger Scala, too many bytes: l=>_.map(f=>l.zipWithIndex.toSet.filter(x=>f(x._1))map(_._2)).reduce(_&_).min

Wheat Wizard

Way to long there's should be a "find index of function".

pxeger

my vanilla Haskell answer is also too long, because findIndex is in Data.List

Wheat Wizard

19:15

Slight improvement: f%g=st<<g1((f*^*g)<cr)<eu<fl(oR**f$g)

des54321

im still trying to figure out how to isolate the elements of the list that satisfy f or g in python while preserving their order

I cant use sets because i need order, which means dicts, which is irriating

mathcat

Python, 90 bytes

try to beat that ha

Wheat Wizard

@des54321 filter?

des54321

@WheatWizard python built-ins i did not know about until now: this :P

pxeger

you could also use a list comprehension with an if clause

Wheat Wizard

19:20

@mathcat You can get that down to 72 with some small tweaks

mathcat

oh wow i'm too used to vyxal

Wheat Wizard

69

mathcat

o.0

user

@user Corrected, boringer, shorter version, 59 bytes: F=>_.filter(x=>F.exists(_(x)))indexWhere(x=>F.forall(_(x)))

mathcat

@mathcat i sHouldN't HAVe SaiD ThAT

pxeger

19:27

Haskell, 52 bytes: f#a=0%[all($i)f|i<-a,any($i)f];j%(x:r)|x=j|1>0=j+1%r

works with any number of functions

user

Ah, ($i) is nice

The Scala version requires (x=>F.forall(_(x))) instead of something like (F forall _.$) :(

pxeger

I wish Functor f => f (a -> b) -> a -> f b were a Haskell builtin

because I spent way too long messing with <*>

Wheat Wizard

It's a builtin in hgl!

des54321

Try it online! I dont understand why this one doesnt work, or why it gives different errors in TIO and IDLE

its also fiendishly long

pxeger

@des54321 you've got two things called f

des54321

19:31

facepalm

working version, 110 bytes

hold on do i need the dict anymore

Wheat Wizard

@pxeger Your Haskell confuses me.

Haskell, 41 bytes: f%(x:r)|all($x)f=0|any($x)f=1+f%r|1>0=f%r

pxeger

I started with Data.List.elemIndex True, and just replaced that with a handwritten implementation (0%) without thinking too much

Wheat Wizard

Your use of j was really strange though.

Like j was only ever 1 or 0 and once it became 1 it never went back to 0.

pxeger

that's not true?

Wheat Wizard

How so?

You call % in two places, one with 0 and the other with 1.

pxeger

19:39

j is the current index for the finding algorithm in (%)

oh I see

that's just a precedence error, which happened to work in the specific test case I wrote

Wheat Wizard

Well j isn't needed at all you could do q(x:r)|x=0|1>0=1+q r.

pxeger

it should have been j%(x:r)|x=j|1>0=(j+1)%r

Wheat Wizard

Uh that's the same thing you wrote.

pxeger

oops

I should go to bed ;)

Wheat Wizard

Ah, well crucially your version wasn't wrong.

It always get's the correct result.

pxeger

19:41

hmm

des54321

I feel like I'm close to finding a short solution in python but I cant quite figure it

if there were a shorter way to write lambda x:f(x)or g(x) using filter would be much easier

pxeger

use a list comprehension?

user

@WheatWizard I tried combining the last two cases there, but all I got was f%(x:r)|all($x)f=0|a<-0:[1|any($x)f]=last a+f%r, which is 47 bytes :(

pxeger

instead of filter(...,lambda x:f(x)or g(x), write [x for x in...if f(x)or g(x)]

des54321

oooh that might actually work

Wheat Wizard

19:44

@user You can get 42 combining them, but I don't think you can beat 41. f%(x:r)|all($x)f=0|1>0=sum[1|any($x)f]+f%r

des54321

86 bytes, still painfully long though

Wheat Wizard

and can be shorter as *.

des54321

i for i in a if f(x)or g(x) is shorter than filter((lambda x:f(x)or g(x)),a) but not by much

pxeger

[*(...)] can just be [...]

Wheat Wizard

And or can be shorter as +

des54321

19:48

oh damn why do i still have that star in there

78 bytes

i for i in a if ... is still painfully unwieldy for having to use it twice

pxeger

a very weird one: lambda a,f,g:sum(iter((f(i)*g(i)<1for i in a if f(i)+g(i)).__next__,0))

two-argument iter is such an oddly undergeneralised function for Python to have

Wheat Wizard

What's the python record rn?

pxeger

for this CMC?

Wheat Wizard

Yeah.

pxeger

I think it was your 69: chat.stackexchange.com/transcript/message/61286506#61286506

Wheat Wizard

19:58

68

pxeger

@WheatWizard that finds the first matching item, not its index

mathcat

oh wow

pxeger

I'm guessing you meant [o for... instead of [i for...

Wheat Wizard

@pxeger Whoops replace i with o

67

pxeger

you need extra parens around the f(i)or g(i) I think

Wheat Wizard

20:00

Oh yeah.

I sort of hate the walrus for python golfing.

pxeger

60 (zero-indexed, unlike the previous ones)

Wheat Wizard

I liked the elegance of not messing with state for lambdas. I felt like it brought a certain balance to things.

pxeger

I enjoy Python golfing partly because of how janky it is

but without having quite so much jank to remember the mechanics of as JS has

Wheat Wizard

Well let's be clear it was jank without the walrus. I mostly just feel that lambdas are too powerful with :=. And it's also a little bit annoying to have to know all the execution order info.

pxeger

evaluation order is left to right with possibly as many as two exceptions

but, for example, Haskell golfing often produces relatively elegant code despite being golfed, but I like a good bit of raw jank in my golf

with Python, you get those "aha" moments of finding another oddly specific and utterly horrifying trick

Wheat Wizard

20:05

@pxeger This is very nice btw.

pxeger

it ended up pretty much the same as my original Haskell answer

Wheat Wizard

Haskell golf is really fun because you can just conjure infinities. Like if you need it you can just make the list of all square integers, no problem.

pxeger

I like Haskell laziness so much that I tried to implement in Python, and fell afoul of confusing side effects

Wheat Wizard

generators are basically haskell lists.

pxeger

except that they have side effects, and there are not enough builtin functions that operate on them, and in order to be really useful you need some kind of caching to them so you don't have to keep reevaluating them

Wheat Wizard

20:10

Ah yeah.

I'm not sure how you are going to avoid side effects though.

pxeger

switching to Haskell is the best option I've found ;)

des54321

i should really learn haskell, it seems like a fun language

pxeger

Haskell is genuinely fun to learn

att

20:39

I've been meaning to learn haskell for something like 3 years now :')

emanresu A

21:35

@pxeger TIL HODOR

Ginger

22:13

CMQ: cahm-proh-mize or cahm-promise?

des54321

22:31

definitely #1, but id say its more of COM-pruh-mize

emanresu A

^

@RadvylfPrograms could catstruct's operator encoding allow for digraphs?

Radvylf Programs

Yes, the triad modifier with a nilad or monad

TNN: Trigraph nilad, TN: Digraph monad, TM: Digraph dyad, TD: Digraph triad (T, the triad modifier, is a dyad parsing-wise)

In theory there's also TTN, TTM, TTD, etc. for even longer n-graphs and higher adicity operators

If you wanted digraph nilads and didn't care about triads, you could have a digraph monad: XN is a digraph nilad, XM is a digraph monad, XD is a digraph dyad

Radvylf Programs

23:27

"Splenomegaly" is a term that describes what it means really well. "Big spleen. Oh no."

Ginger

23:40

I hate it when my splen is megaly ;-;

Transcript for