last day (124 days later) » 

caird coinheringaahing
caird coinheringaahing
13:10
First message :P
Mr. Xcoder
Mr. Xcoder
Welcome to the CodeGolf Hackathon!
3
caird coinheringaahing
caird coinheringaahing
FWIW, the Deorst answer for Puzzle 1 is Ě€ĄďK=, but it isn't fully implemented yet.
Mr. Xcoder
Mr. Xcoder
@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)
caird coinheringaahing
caird coinheringaahing
@Mr.Xcoder Ok, will do
Erik the Outgolfer
Erik the Outgolfer
alright
caird coinheringaahing
caird coinheringaahing
13:14
@EriktheOutgolfer do you know Husk?
Mr. Xcoder
Mr. Xcoder
He knows a bit
Me too
Erik the Outgolfer
Erik the Outgolfer
@cairdcoinheringaahing well, not fully yet
as mr xcoder said
caird coinheringaahing
caird coinheringaahing
Either of you know enough to solve puzzle 1?
Mr. Xcoder
Mr. Xcoder
I'll add some new features to the challenges, such as difficulty rates
@cairdcoinheringaahing Meh, after a bit of struggling maybe
Erik the Outgolfer
Erik the Outgolfer
@Mr.Xcoder I have changed the explanation a bit to indicate implicit stuff and nesting, tell me if it's good
Mr. Xcoder
Mr. Xcoder
13:17
How would you rate challenge one on a scale from 1 to 10, in terms of difficulty.
caird coinheringaahing
caird coinheringaahing
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
Mr. Xcoder
Mr. Xcoder
@cairdcoinheringaahing Maybe H.PWiz will join in the future
caird coinheringaahing
caird coinheringaahing
Are we going to have to get Zgarb or HPWiz doing this as well? :P
Erik the Outgolfer
Erik the Outgolfer
or zgarb
most likely h.pwiz
but mr xcoder and I can try too...
Mr. Xcoder
Mr. Xcoder
@Erik The explanation is great, let me align those lines though >->
Erik the Outgolfer
Erik the Outgolfer
13:20
@Mr.Xcoder no
Mr. Xcoder
Mr. Xcoder
@EriktheOutgolfer Why?
Erik the Outgolfer
Erik the Outgolfer
that's how nesting is represented
Mr. Xcoder
Mr. Xcoder
Ok then.
Erik the Outgolfer
Erik the Outgolfer
and I want to represent it some way
Mr. Xcoder
Mr. Xcoder
It's yours, so it's up to you.
Erik the Outgolfer
Erik the Outgolfer
13:21
alright
Mr. Xcoder
Mr. Xcoder
@EriktheOutgolfer Collaborative Husk until I leave?
Erik the Outgolfer
Erik the Outgolfer
sure
Mr. Xcoder
Mr. Xcoder
Great
We shall pick an algorithm first though
Erik the Outgolfer
Erik the Outgolfer
(btw puzzle 1 is a case where prefixes including empty prefix is an advantage...)
Mr. Xcoder
Mr. Xcoder
@EriktheOutgolfer Is it?
Erik the Outgolfer
Erik the Outgolfer
13:23
except that
there's no average builtin
Mr. Xcoder
Mr. Xcoder
@EriktheOutgolfer No built-in for average
Ninja'd
...
@EriktheOutgolfer Husk CMC: average of a list.
Erik the Outgolfer
Erik the Outgolfer
where [] -> 0
that's the difficult part
§/ΣL is average definition
caird coinheringaahing
caird coinheringaahing
Presumably along the lines of S÷L$$0L=0$$? for Jelly?
Mr. Xcoder
Mr. Xcoder
@cairdcoinheringaahing Yes xDxD
Erik the Outgolfer
Erik the Outgolfer
but it returns NaN for []:LN
Mr. Xcoder
Mr. Xcoder
13:27
@EriktheOutgolfer Doesn't work
Erik the Outgolfer
Erik the Outgolfer
because it's not the whole solution
Mr. Xcoder
Mr. Xcoder
ignore the input
@EriktheOutgolfer link?
Erik the Outgolfer
Erik the Outgolfer
oh wait it doesn't work
dang it has to be §/LΣ
/ reverses order of arguments
@Mr.Xcoder not ready yet
Mr. Xcoder
Mr. Xcoder
heh
> [NaN,1.0,2.5,2.6666666666666665,4.0,4.4]... Dang
Erik the Outgolfer
Erik the Outgolfer
and NaN isn't 0
Mr. Xcoder
Mr. Xcoder
13:30
yeah
caird coinheringaahing
caird coinheringaahing
Can't you just do str, replace(Nan, 0), eval?
Erik the Outgolfer
Erik the Outgolfer
§&§/LΣL seems to work
for the average
Mr. Xcoder
Mr. Xcoder
@cairdcoinheringaahing Ungolfy >_>
caird coinheringaahing
caird coinheringaahing
@Mr.Xcoder Meh, I don't know Husk :P
Could be 1 byte builtin for all I know
Mr. Xcoder
Mr. Xcoder
@EriktheOutgolfer 4 bytes equivalent?
Erik the Outgolfer
Erik the Outgolfer
13:32
@Mr.Xcoder but mine returns 0 for []:LN
Mr. Xcoder
Mr. Xcoder
oh
Now to map over two collections in parallel
Erik the Outgolfer
Erik the Outgolfer
oh that's easy I guess
but I'm focusing on the §&§/LΣL part yet
seems like something could be optimized
Mr. Xcoder
Mr. Xcoder
Wouldn't bet on that
Erik the Outgolfer
Erik the Outgolfer
nah
Mr. Xcoder
Mr. Xcoder
Ok, I have to go, I think.... Bye!
Erik the Outgolfer
Erik the Outgolfer
13:35
bye
Mr. Xcoder
Mr. Xcoder
Good luck!
I think I'll add Ohm too
later
Leaky Nun
Leaky Nun
14:19
@cairdcoinheringaahing you're a genius
I just figured out how your solution works now
caird coinheringaahing
caird coinheringaahing
@LeakyNun Thanks! I thought it was quite a basic solution TBH sheepish grin
Also, you may not have found the explanation
 
8 hours later…
H.PWiz
H.PWiz
22:40
Husk, 8 bytes using caird's algorithm.
11, before I saw caird's

  last day (124 days later) »