Jelly Hypertraining

user165474

2:33 AM

@LeakyNun Hello.

Leaky Nun

3:03 AM

@HyperNeutrino are you working on anything?

user165474

I'm still trying to figure out how to distinguish open and close brackets

user165474

Oh wait... How did I not see this before...

user165474

The last two digits are the same for open brackets and different for close brackets.

user165474

3:42 AM

@LeakyNun I can't seem to get it to work so I'll try your newest challenge first (obviously without looking at the answer)

Leaky Nun

Alright

user165474

3:55 AM

@LeakyNun Is using powerset a good idea here? I can't seem to get anything in a reasonable size; it always ends up looking like a Python port which is probably not good

Leaky Nun

search "equal" in the atoms

user165474

Okay.

user165474

E checks if all elements are equal, might come in useful.

Leaky Nun

search again

user165474

Œg looks potentially useful but this is only contiguous so it probably won't work... I can't find anything else that looks potentially useful

Leaky Nun

4:04 AM

look for G with a dot

user165474

Ġ Group the indices of z by their corresponding values.

user165474

I found this

user165474

Not quite sure what this means, but I'll run it on some stuff

user165474

4:16 AM

Okay, so if I'm understanding it correctly, I think ÐṀ will only keep the elements from the domain that are the maximum in the codomain of a link.

user165474

I was originally going to do some weird things and use normal maximum and unindex but that seems unnecessarily long

user165474

@LeakyNun ĠLÐṀị€ appears to work, and it makes sense; the challenge is relatively easy to understand. From my understanding, using your hint about the G with a dot, it gets all of the "groups", then takes the ones that have the maximum length (are the longest) and then maps the array elements by taking the value at that index in the original array.

user165474

ĠLÐṀị€

user165474

Wait the map is redundant.

user165474

ĠLÐṀị

Leaky Nun

4:35 AM

congratulations @HyperNeutrino

user165474

Yay! Thanks :D

user165474

That was interesting. I actually get what the maximum quick does now.

user165474

I will keep working on the brackets challenge now.

user165474

5:55 AM

@LeakyNun So far I have the following, which gives me the fancy array. I need to find the first occurrence of 0 in the array, but no matter where I place i0 or 0i it always returns the wrong value:

user165474

O‘%4:2Ḥ’+\

user165474

Oh wait, never mind, wrong input format

user165474

O‘%4:2Ḥ’+\i0

user165474

12 bytes, suboptimal but it works. Mainly the part that goes from [0 1 2 3] -> [0 0 2 2] is too inefficient (modulo by four, integer divide by 2 to get rid of the parity, then unhalve).

user165474

I need a better way to get the second last digit

user165474

6:00 AM

Wait, I think I can and-bitmask that then.

user165474

So I think...

user165474

Instead of mod 4 rightshift leftshift I can just do bitmask with 0b10 to only keep the second last digit

user165474

@LeakyNun 9 bytes:

user165474

O‘&2’+\i0

user165474

Yay, same bytecount, I will go check ais's answer now.

user165474

6:02 AM

Oh, they had the same approach.

user165474

Except the increment in my answer is a decrement in ais's.

Leaky Nun

congratulations

user165474

thanks :)

Leaky Nun

you are really competent

user165474

Thanks :D I'm glad I finally managed to learn Jelly. I must say, you're a really great teacher.

Leaky Nun

6:10 AM

@HyperNeutrino you're an equally great student, if not greater.

user165474

thank you :) I tried starting on it myself but I couldn't wrap my mind around the point-free style, but your guidance allowed me to finally understand this type of programming

Leaky Nun

11:46 AM

@HyperNeutrino make 18446744073709551615 without using 1, 2, 4, 6, or 8

(2^64 - 1)

user165474

12:05 PM

Interesting. I will try this.

user165474

@LeakyNun Is this allowed?

user165474

⁴*⁴’

Leaky Nun

yes

user165474

Is a shorter way possible?

Leaky Nun

I don't think so

user165474

12:11 PM

Alright. Yay ^-^

Leaky Nun

make 12345678987654321 (no restrictions)

user165474

Alright.

Leaky Nun

@HyperNeutrino why don't you ask questions / make challenges?

user165474

I used to make quite a few (like 5 in a day once) but I haven't really been active on main since I started with Jelly training. I think once I get the hang of it I'll be more active on main. I don't have an original and creative challenge idea right now, but when I think of one I'll make a challenge.

Leaky Nun

well, you could make some CMCs here or in TNB

and asking questions is an integral part of learning! :D

user165474

12:17 PM

yay :D Yeah, I have one question about Jelly:

user165474

How do I join a list together with '' as a separator? Is there a monad to do this?

Leaky Nun

I don't think there's a monad to do that.

user165474

Aww

user165474

Oh well, I may have to do this the longer way then

Leaky Nun

do your own CMC in Jelly lol

user165474

12:20 PM

lol I will

Leaky Nun

I think your CMC is good enough to post on main though

user165474

Oh? Hm. I might then.

user165474

Once I finish with the 12345678987654321 chllenge

user165474

Wait, decimal -> integer

user165474

:D

Leaky Nun

12:23 PM

Balanced ternary

Balanced ternary is a non-standard positional numeral system (a balanced form), useful for comparison logic. While it is a ternary (base 3) number system, in the standard (unbalanced) ternary system, digits have values 0, 1 and 2. The digits in the balanced ternary system have values −1, 0, and 1. Different sources use different glyphs used to represent the three digits in balanced ternary. In this article, T (which resembles a ligature of the minus sign and 1) represents −1, while 0 and 1 represent themselves. Other conventions include using '−' and '+' to represent −1 and 1 respectively, or using...

A harder challenge for you

user165474

Ooo Thanks!

user165474

That's a very peculiar numeral system. So is the challenge to convert to/from it?

Leaky Nun

yes

user165474

I see. Looks a bit tricky, but should be manageable.

user165474

@LeakyNun I got the program for the 12345678987654321 challenge.

user165474

12:28 PM

1x9Ḍ²

user165474

I realized that it's 111111111**2

Leaky Nun

nice

My solution is 9RŒBḌ

user165474

I see. Yes, I just came up with that as an alternate as well :P

user165474

I guess I'll solve my CMC next

Leaky Nun

@HyperNeutrino my solution to your CMC is 10 bytes. Beat me.

user165474

12:38 PM

Ooh. I will try. Hm.

user165474

I might use the eval atom.

Leaky Nun

I won't comment.

user165474

Alright. I'll try to figure this out on my own.

user165474

@LeakyNun I got this for 12 bytes, seems too straightforward though.

user165474

&3‘“-+×*”ị@v

Leaky Nun

12:46 PM

I see

oooh, I didn't know there's v. Now I'm just 8 bytes

@HyperNeutrino ^

user165474

Oh. Hm.

Leaky Nun

@HyperNeutrino ȷ9:9²

(Python: (1e9//9)**2)

user165474

Oh, interesting. Nice!

user165474

@LeakyNun Do you have a hint about how I can make my CMC code a bit better?

user165474

s/better/shorter

Leaky Nun

12:51 PM

remove extraneous operations

user165474

Okay. Thanks.

Leaky Nun

@HyperNeutrino are you doing it?

user165474

I'm trying, but I don't see any extraneous operations... ;_;

Leaky Nun

my solution is a subset of your solution

user165474

As in every character in yours is in mine in the same order?

Leaky Nun

1:02 PM

Try not to look at my solution

not the same order

user165474

Okay.

user165474

Hm.

user165474

So your program doesn't have any characters that mine doesn't?

Leaky Nun

ya

user165474

I see.

user165474

1:06 PM

Thanks for adding testcases.

user165474

@LeakyNun Can you give me a hint as to one of the bytes I should remove?

Leaky Nun

increment

user165474

Hm.

Leaky Nun

@HyperNeutrino is the input assumed to be a positive integer?

do we have to deal with 0?

user165474

Sure. I'll say it's positive.

user165474

1:14 PM

After removing increment, I feel like I need to move some things around.

user165474

I can't seem to figure out how to remove increment. It obviously doesn't work by just removing it directly, but I can't figure out how to reorder the things.

Leaky Nun

hint: Jelly uses modular indexing

user165474

Oh.

user165474

I'm going to edit the wiki for that.

user165474

@LeakyNun I got it down to 9 bytes:

user165474

1:22 PM

‘ị“-+×*”v

Leaky Nun

I said you don't need increment

user165474

ị“+×*-”v

user165474

I forgot that I could reorder the string ;_;

Leaky Nun

now check my answer

user165474

Is - not a thing? Hm.

Leaky Nun

1:26 PM

oh heh

user165474

Hm.

user165474

My program gives -1 for 8 when it should give 0

user165474

Yours is correct, I put - without testing it ;_;

Leaky Nun

apparently it is used for, you know, negative numbers, right

user165474

I see.

user165474

1:27 PM

Hm. Strange.

Leaky Nun

heh

user165474

¯_(ツ)_/¯

user165474

One of the arms is disembodied...

Leaky Nun

lol

user165474

Anyway, I will attempt the balanced ternary problem now.

user165474

1:50 PM

@LeakyNun codegolf.stackexchange.com/a/118270/42649

user165474

Is this golfable?

Leaky Nun

2:03 PM

@HyperNeutrino are you on computer?

user165474

Yes.

Leaky Nun

do you realize that TIO offers a completed version for you?

like, you can directly copy it to the answer, it provides you with two links

user165474

...Oh.

Leaky Nun

Do you know why you can't do Ṁ‘Rœ-Ṃ ?

user165474

I think it's because minimum vectorizes?

Leaky Nun

2:05 PM

think again

user165474

Is it subtracting the minimum from every element in the set?

Leaky Nun

no

it's a monadic chain

[monad][monad][monad][dyad][monad]

how is ^ interpreted?

user165474

I think it puts the argument through all of the monads, then puts the argument through the right side, then puts the two of those through the dyad?

Leaky Nun

yes

so you're only subtracting the minimum of the input

user165474

Oh.

user165474

2:13 PM

Right.

user165474

I edited my answer to fix the mistake, though I feel like it could now be golfed more.

Leaky Nun

I hope you don't mind my edit

I'll just tell you the answer

user165474

Oh. It's still wrong?

Leaky Nun

no, it isn't

user165474

Oh okay.

Leaky Nun

3:55 PM

@HyperNeutrino why didn't you update your answer?

user165474

@LeakyNun I had to leave right then so I forgot because I was in a rush to get to class. Sorry.

Leaky Nun

alright

user165474

Updated. Thanks! :)

Leaky Nun

@HyperNeutrino heh, I completely forgot that the challenge is a few years older than Jelly

@HyperNeutrino would you make a CMC lol

user165474

4:15 PM

@LeakyNun What kind of CMC? Just any CMC?

Leaky Nun

yes

user165474

Hm...

Leaky Nun

it seems that you make good CMCs

user165474

Wait so my answer's non-competing?

Leaky Nun

yes, unfortunately

user165474

4:16 PM

Oh, okay. I will mark it as thus.

user165474

Oh, you already did.

user165474

Thanks!

user165474

Wait no that was Mego.

Leaky Nun

ya

user165474

I will try to think of a good CMC.

Transcript for