CodeGolf Hackathon

1:10 PM

First message :P

Welcome to the CodeGolf Hackathon!

FWIW, the Deorst answer for Puzzle 1 is Ě€ĄďK=, but it isn't fully implemented yet.

@cairdcoinheringaahing take your time

I will most likely not be online for the next couple of hours, starting from half an hour from now. Please update the scoreboard and ping if you add new submissions (cc @cairdcoinheringaahing @EriktheOutgolfer)

@Mr.Xcoder Ok, will do

alright

1:14 PM

@EriktheOutgolfer do you know Husk?

He knows a bit

Me too

@cairdcoinheringaahing well, not fully yet

as mr xcoder said

Either of you know enough to solve puzzle 1?

I'll add some new features to the challenges, such as difficulty rates

@cairdcoinheringaahing Meh, after a bit of struggling maybe

@Mr.Xcoder I have changed the explanation a bit to indicate implicit stuff and nesting, tell me if it's good

1:17 PM

How would you rate challenge one on a scale from 1 to 10, in terms of difficulty.

Cause we all know Jelly, you two know Pyth, Erik (and maybe Xcoder) knows 05AB1E, I know 2Deorstv, so who's going to do Husk?

@Mr.Xcoder 3-5

@cairdcoinheringaahing Maybe H.PWiz will join in the future

Are we going to have to get Zgarb or HPWiz doing this as well? :P

or zgarb

most likely h.pwiz

but mr xcoder and I can try too...

@Erik The explanation is great, let me align those lines though >->

1:20 PM

@Mr.Xcoder no

@EriktheOutgolfer Why?

that's how nesting is represented

Ok then.

and I want to represent it some way

It's yours, so it's up to you.

1:21 PM

alright

@EriktheOutgolfer Collaborative Husk until I leave?

sure

Great

We shall pick an algorithm first though

(btw puzzle 1 is a case where prefixes including empty prefix is an advantage...)

@EriktheOutgolfer Is it?

1:23 PM

except that

there's no average builtin

@EriktheOutgolfer No built-in for average

Ninja'd

...

@EriktheOutgolfer Husk CMC: average of a list.

where [] -> 0

that's the difficult part

§/ΣL is average definition

Presumably along the lines of S÷L$$0L=0$$? for Jelly?

@cairdcoinheringaahing Yes xDxD

but it returns NaN for []:LN

1:27 PM

@EriktheOutgolfer Doesn't work

because it's not the whole solution

ignore the input

@EriktheOutgolfer link?

oh wait it doesn't work

dang it has to be §/LΣ

/ reverses order of arguments

@Mr.Xcoder not ready yet

heh

> [NaN,1.0,2.5,2.6666666666666665,4.0,4.4]... Dang

and NaN isn't 0

1:30 PM

yeah

Can't you just do str, replace(Nan, 0), eval?

§&§/LΣL seems to work

for the average

@cairdcoinheringaahing Ungolfy >_>

@Mr.Xcoder Meh, I don't know Husk :P

Could be 1 byte builtin for all I know

@EriktheOutgolfer 4 bytes equivalent?

1:32 PM

@Mr.Xcoder but mine returns 0 for []:LN

Now to map over two collections in parallel

oh that's easy I guess

but I'm focusing on the §&§/LΣL part yet

seems like something could be optimized

Wouldn't bet on that

nah

Ok, I have to go, I think.... Bye!

1:35 PM

bye

Good luck!

I think I'll add Ohm too

later

Leaky Nun

2:19 PM

@cairdcoinheringaahing you're a genius

I just figured out how your solution works now