Jelly Hypertraining

user165474

2:18 AM

Sorry, I was in Toronto today. I'll work on this in a bit.

user165474

3:19 AM

@LeakyNun 4 bytes SPOILER

user165474

@EriktheOutgolfer

user165474

3:40 AM

@LeakyNun @EriktheOutgolfer 8 bytes SPOILER for the pascal triangle rows thing

user165474

7 bytes SPOILER

user165474

For the triangular number thing, is this SPOILER right? I'm not sure the last byte is necessary but you said one monad.

Leaky Nun

4:08 AM

@HyperNeutrino I have a 6-byte solution

@HyperNeutrino yes

user165474

Ah okay. I'll try getting another byte off

Leaky Nun

@HyperNeutrino that is what we have as well

user165474

yay

user165474

...oh

user165474

@LeakyNun

Leaky Nun

4:11 AM

nice, that wasn't what I had

user165474

Oh hm.

user165474

Interesting.

user165474

(I usually try taking off things like ranges because some things automatically go over ranges)

Leaky Nun

14 hours ago, by Leaky Nun

spoiler

user165474

wait i've never seen " before

Leaky Nun

4:12 AM

it forces a level-one vectorization to both sides

user165474

hm i don't quite understand your solution

user165474

oh okay ^

user165474

what should my next task be? i'm not quite sure i can finish the euclidean algorithm thingy but i'm still trying to do it in jelly

Leaky Nun

May 14 at 13:14, by Erik the Outgolfer

This challenge posted on main. Remember not to look at the answers, and ignore the bonus. :-)

user165474

oo okay

user165474

4:20 AM

ehhh i can't think of a starting point :c i'll just try random things for a bit and see if i can converge on anything useful

Leaky Nun

what is your search space?

user165474

hm?

Leaky Nun

1. define your search space (all the possible solutions)
2. search

user165474

oh okay

user165474

well i guess all possible solutions is all contiguous subslices of range(n)?

Leaky Nun

4:24 AM

sure

user165474

@LeakyNun I have this for 10 bytes...

Leaky Nun

and you can golf off 2 bytes

user165474

Well I can remove the R (again :P)

user165474

eh hints on the last byte?

Leaky Nun

do it in one line

user165474

4:33 AM

ok

user165474

ehh i still can't get it :I i think i'm not taking the right approach to this

user165474

do i need extra stuff or just $ or µ?

Leaky Nun

neither

user165474

do i need to change any atoms

Leaky Nun

you don't

user165474

4:41 AM

ok

user165474

ok i feel really dumb right now but i can't seem to get it into one line???

Leaky Nun

try ¥

user165474

ohhh hm i've never seen that before. guess i should look through the resources more carefully

user165474

ẆS=³¥ÐfṪ looks like what I want but it doesn't work

Leaky Nun

of course it doesn't

you grouped =³¥

user165474

4:47 AM

oh

user165474

wait what's wrong with that

Leaky Nun

what are you filtering?

user165474

to make sure the sum is equal to the argument

Leaky Nun

but what is passed to Ðf in your code?

user165474

oh wait am i filtering to check that the thing itself is equal to the argument? (as opposed to the sum)

Leaky Nun

4:50 AM

sure

user165474

tio.run/##ARwA4/9qZWxsef//Uz3CswpS4bqGw4fDkGbhuar///85

Leaky Nun

you forgot to press save

user165474

tio.run/##y0rNyan8///hrrZg20NLD09Ie7hzFRD9///fEgA

user165474

whoops

user165474

I don't know why I need tail twice

Leaky Nun

4:51 AM

@HyperNeutrino can you figure out why?

user165474

I think the filter ends up giving an array containing the array of arrays and the first tail gets the inner array of arrays and the second tail gets the last array in the array of arrays, sorry if that makes no sense

Leaky Nun

can you analyze your code using nilad/monad/dyad?

user165474

you mean like write it out in terms of how all of the links group together or something?

Leaky Nun

yes

user165474

well it's <monad><dyad:[<monad><dyad>]><dyad><monad><monad>

user165474

4:55 AM

I think that's how it goes

Leaky Nun

what's the last dyad?

user165474

filter?

Leaky Nun

no it isn't a dyad

user165474

oh

user165474

<monad><dyad:[<monad><dyad>]><monad><monad><monad>?

Leaky Nun

5:00 AM

@ATaco hi

ATaco

Hello!

Leaky Nun

@HyperNeutrino no it isn't a monad either

@ATaco how much do you know about jelly?

user165474

do quicks count as monads/dyads or are they just quicks?

ATaco

I know the concept, and I've written a few answers in it.

Leaky Nun

@HyperNeutrino they are modifiers

user165474

5:01 AM

oh...

user165474

hm

user165474

<monad><(<dyad:[<monad><dyad>]>):modifier><monad><monad>?

user165474

sorry if the notation's confusing

Leaky Nun

@HyperNeutrino a quick can turn a dyad into a monad, or a monad into a dyad, or a dyad to a dyad, or a monad to a monad

what is it in this case?

user165474

dyad -> monad

Leaky Nun

5:02 AM

no

user165474

wait no sorry

user165474

monad -> monad

Leaky Nun

still no

you only have 2 options left

user165474

hm? ok hold on lemme think this through

user165474

so the input is a condition which is a monad

user165474

5:03 AM

i think?

Leaky Nun

no it isn't

look at what the input is

user165474

eh right it's a dyad because of the yen symbol thingy

Leaky Nun

yes

user165474

and i guess the overall thing takes in an array of values and returns a filtered array. doesn't that make it a monad?

Leaky Nun

no it doesn't

user165474

5:06 AM

wait so can you define a monad and a dyad just to make sure i actually know what they are?

Leaky Nun

a monad acts on one argument...

a dyad acts on two arguments...

user165474

ok

user165474

oh right so if i understand this correctly, it's a dyad because it acts on the first command argument and on the input from the subsets?

user165474

making it dyad -> dyad?

Leaky Nun

alright

there's something wrong in your logic

but let's continue

user165474

5:09 AM

ok

Leaky Nun

so on the macro scale, what are your links?

user165474

eh i'm not sure i understand that exactly. sorry i haven't really done much analysis on my code i just know how to produce the code to do what i want (usually)

Leaky Nun

8 mins ago, by Hyper Neutrino

<monad><(<dyad:[<monad><dyad>]>):modifier><monad><monad>?

can you rewrite this?

ignore the details inside each link

user165474

<monad><dyad><monad><monad>?

Leaky Nun

yes

and how is that parsed?

let's say your code is FgHK

ATaco

5:12 AM

I've got an eleven byter, I'm not sure how to golf it.

Try it online!

Leaky Nun

the argument is z

can you write it in prefix notation?

e.g. F(z)

@ATaco there's 3 bytes you can golf from that

user165474

ok first let me write down what F g H and K are

user165474

F = flatten list

Leaky Nun

...

those are just substituents

user165474

or wait did you not mean literally the jelly things

Leaky Nun

5:13 AM

capital letters are monads

user165474

oh ok

Leaky Nun

small letters are dyads

user165474

whoops

user165474

sorry rip

ATaco

Oh, the default behaviour of Ẇ when passed a number is to range it anyway..?

Leaky Nun

5:13 AM

because "F" is shorter than "<monad>"

@ATaco yes

user165474

right

ATaco

That's well documented...

Leaky Nun

@ATaco alright I'll update the docs

user165474

I want to say K(g(F(z),H(z)))

Leaky Nun

correct

so can you see why you repeated tail twice?

ATaco

5:15 AM

And My S=³$$ can be replaced with S=¥, because it calls the Equals with the input, when dyadic?

Leaky Nun

@ATaco it just turns it into a dyad

what the second argument is depends on the rest of your program

ATaco

I know the difference, but I'm not sure why filter calling a dyad is just passing the left argument.

Leaky Nun

the right argument is still used

in python, it is [x for x in left_argument if dyad(left_argument, right_argument)]

user165474

oh ok

ATaco

Ah, and because I took off the right half of the code, it's.. Yeah I see how that works.

user165474

5:18 AM

so the first tail is kind of redundant if i understand this correctly?

Leaky Nun

@HyperNeutrino not redundant, but wrong

user165474

oh

Leaky Nun

it just so happens to generate the correct result

what should you replace it with?

user165474

¹?

Leaky Nun

yes

user165474

5:20 AM

so technically spoiler is the actual correct answer

Leaky Nun

yes

user165474

yay

ATaco

I don't need to sort the list, do I?

Leaky Nun

you don't

ATaco

It will always have it longest last?

Leaky Nun

5:21 AM

yes it will

ATaco

Then I've got 8 bytes. spoiler

Leaky Nun

nice

user165474

hm interesting. nice

ATaco

Oh, we've used almost the same solution.

user165474

yes. :p

Leaky Nun

5:24 AM

and both are different from the solution posted there

user165474

oh interesting

user165474

we can check the posted solution now right

Leaky Nun

sure

user165474

oh interesting

user165474

it's quite close, it uses the non-vectorizing equals and right-argument instead of first-argument or identity

Leaky Nun

5:26 AM

that's the left argument

user165474

*left :p

user165474

so wait could you theoretically use any of the following?

user165474

ẆS=¥Ðf¹Ṫ
ẆS=¥Ðf³Ṫ
ẆS=¥Ðf⁸Ṫ
ẆS⁼¥Ðf¹Ṫ
ẆS⁼¥Ðf³Ṫ
ẆS⁼¥Ðf⁸Ṫ
ẆSn¥Ðḟ¹Ṫ
ẆSn¥Ðḟ³Ṫ
ẆSn¥Ðḟ⁸Ṫ
ẆS⁻¥Ðḟ¹Ṫ
ẆS⁻¥Ðḟ³Ṫ
ẆS⁻¥Ðḟ⁸Ṫ

Leaky Nun

how did you generate that table

user165474

manually

Leaky Nun

5:29 AM

alright

user165474

i just took the first one, copied it 6 times, and then changed the numbers, then the equals signs, then copied the whole thing and changed the equals to not-equals and filter-in to filter-out

ATaco

I thought I was rather smart when I was using RẆ, then I found out it's the solution every else has used ;-;

user165474

lol :P

Leaky Nun

May 9 at 15:58, by Leaky Nun

Given e.g. n=4, display:

May 9 at 15:58, by Leaky Nun

#
 #
  #
   #

user165474

@ATaco

user165474

5:32 AM

1 hour ago, by Hyper Neutrino

well i guess all possible solutions is all contiguous subslices of range(n)?

user165474

and ok i'll do that challenge

user165474

6 bytes right?

Leaky Nun

I used 7 bytes

user165474

ok

Leaky Nun

trailing whitespace/newline optional

user165474

5:35 AM

ok

user165474

i have an idea that's potentially golfy but if not it will be horribly long

ATaco

I've got a rather inefficient 13 bytes. Try it online!

user165474

⁶ is better than ”<space>

Leaky Nun

two useful commands that @ATaco might have overlooked: Y and G

user165474

two useful commands one of which i may have overlooked as well :P

user165474

5:42 AM

I remember Y because it's one of the first things I used iirc

ATaco

Try it online! is a 10 byter now.

user165474

I got this for 10 bytes also

user165474

this is also possible but still 10 bytes ;_;

user165474

aha 9 bytes

ATaco

Oh right, Chain separators.

user165474

5:48 AM

hehe

user165474

hey no looking at the other's solutions ;)) :P

user165474

@LeakyNun Any hints to get down from 9 bytes?

ATaco

Are there any examples of G being used..?

Leaky Nun

6:10 AM

@HyperNeutrino I don't know how to hint

Erik the Outgolfer

10:31 AM

Welcome to our class ATaco!

@LeakyNun I welcomed ATaco you can rest now

@ComradeSparklePony 5-byte spoiler (note: you can use any non-whitespace char)

also 7-byte spoiler (more trivial version)

Erik the Outgolfer

11:31 AM

@HyperNeutrino a step closer to level 5 for you!

note that it's a bit hard to go to level 5 since that means you will be eligible to be a teacher so you must prove it ofc

user165474

12:52 PM

@EriktheOutgolfer Yay! And yes ofc it will probably take some time to get lv5

Erik the Outgolfer

1:17 PM

@HyperNeutrino have you thought of a next task?

user165474

1:42 PM

I was going to try this but it's too hard for now

Erik the Outgolfer

let that alone...

user165474

hm?

Erik the Outgolfer

it's like the euclidean stuff, heavy work and such

user165474

ah ok

user165474

yeah i was originally going to just take the arcsine, add and subtract pi*2 to it a ton of times, take the difference of that and pi*2*k a bunch of times and then filter it but that's too weird for tacit languages

Erik the Outgolfer

1:48 PM

@HyperNeutrino on second thought I'd recommend trying it a bit at least

user165474

ok

Erik the Outgolfer

I'll be trying too

user165474

okay :)

user165474

crap i think i lost all my code

Erik the Outgolfer