Jelly Hypertraining

caird coinheringaahing

10:23

@EriktheOutgolfer how do you apply 2 atoms to one argument? e.g. x => [min(x),max(x)]

Leaky Nun

12:09

Welcome to our class, Mr. Xcoder!

@Mr.Xcoder

Mr. Xcoder

@LeakyNun Thank you!

When does the first class begin?

Leaky Nun

12:21

@Mr.Xcoder anytime you want?

Mr. Xcoder

How about now?

Leaky Nun

post my code first :p

Welcome to our class, Qwerp-Derp!

Qwerp-Derp

@LeakyNun Hello!

Leaky Nun

@Qwerp-Derp hello

Qwerp-Derp

Why doesn't this work? Ṫ‘ṭ<⁴¿ (I'm trying to generate the maximal list of increasing numbers starting from x whose sum is less than y)

So x = 5, y = 20 => [5, 6, 7]

Leaky Nun

12:32

> <body><condition>¿

the body is < and the condition is ⁴

Qwerp-Derp

? So is the body only meant to be one atom

Leaky Nun

or one chain

Mr. Xcoder

@LeakyNun Posted your answer, if you are free, can we begin the class?

Leaky Nun

@Mr.Xcoder How much do you know?

Mr. Xcoder

@LeakyNun Little.

Let's begin with the very beginning

Leaky Nun

12:36

@Mr.Xcoder every atom has an arity

they can be nilads, monads, or dyads

And the arity of an atom is fixed

in general, capital letters are monads and small letters are dyads

Qwerp-Derp

Where do I even start with this question:

Find the largest list of consecutive numbers that sum to N (e.g. f(100)=[9, 10, 11, 12, 13, 14, 15, 16]) Minimum needed bytes: 8

Leaky Nun

@Qwerp-Derp generate the list of consecutive numbers

@Mr.Xcoder nilads are numbers or constants that start with Ø

or strings, etc

however, you can group atoms together into links/chains

and the arity of the links depends on how it is called

Mr. Xcoder

So, there is absolutely no atom of unbounded arity?

Leaky Nun

@Mr.Xcoder right

each line of the program defines a link, where the last link is the main link

it is like the main() function in various languages

monadic links are interpreted quite differently from dyadic links

if you provide one CLA, then it would be interpreted as a monadic link

if you provide two or more CLA, then it would be interpreted as a dyadic link

Mr. Xcoder

What does CLA stand for?

caird coinheringaahing

12:44

@Mr.Xcoder command line arguments

Mr. Xcoder

Ok, I understood so far

Qwerp-Derp

RÇ€ Why doesn't this map over the R?

caird coinheringaahing

@LeakyNun is there a way of suppressing Jelly's automatic printing?

Mr. Xcoder

@Qwerp-Derp You should have:

R
Ç€

Or just R€.

Leaky Nun

@cairdcoinheringaahing you might need to make the current variable void, or else I don't know of any way

basically find a way to turn it into the empty string

Mr. Xcoder

12:49

Else it throws a Segmentation Fault.

Qwerp-Derp

What about the function? Is that on the right?

Leaky Nun

or the empty array

@Qwerp-Derp it is correct

but map what over the R?

Mr. Xcoder

@Qwerp-Derp <monad/dyad>€

Qwerp-Derp

The previous link

Leaky Nun

@Qwerp-Derp show me your program

Qwerp-Derp

12:49

S>³
rṖÇ¿
RÇ€

Leaky Nun

@Qwerp-Derp what is it supposed to do?

r is dyadic range

caird coinheringaahing

@LeakyNun Hẋ@⁾ #UṄ$⁸’¤¡U is too long for the checkerboard challenge, right?

Leaky Nun

@cairdcoinheringaahing it's golfable

Mr. Xcoder

@LeakyNun Can I work out the easy challenges and submit the solutions I have, such that you can suggest improvements?

Leaky Nun

@Mr.Xcoder sure

caird coinheringaahing

12:52

@Mr.Xcoder you could do what I do, which is have a text file with the solutions I have. Once I've finished I'm gonna get one of the teachers to check it

Qwerp-Derp

@LeakyNun So it takes an integer n, and creates a list [1...n], and then maps that to a function which takes an integer x and creates a range which its sum is smaller than n

Mr. Xcoder

@cairdcoinheringaahing Ok, but I highly doubt I'm going to solve even half of them

Qwerp-Derp

So 5 becomes [[1, 2], [2, 3], [3], [4], [5]]

caird coinheringaahing

@Mr.Xcoder the mathematical ones are a lot easier than the string ones

Mr. Xcoder

@cairdcoinheringaahing I am solving the mathematical ones

Leaky Nun

12:54

@Qwerp-Derp your rṖÇ¿ wouldn't work

test this one first

do things one at a time

Qwerp-Derp

Why doesn't this work?

S>³
rṖÇ¿
R1Ŀ€

@LeakyNun?

Leaky Nun

9 mins ago, by Leaky Nun

@Qwerp-Derp your rṖÇ¿ wouldn't work

9 mins ago, by Leaky Nun

test this one first

9 mins ago, by Leaky Nun

do things one at a time

Qwerp-Derp

I got that bit to work though

S>³
rṖÇ¿
Rç€

Now I just need to filter the list

Leaky Nun

right, it need to be dyadic if you want it to work

Mr. Xcoder

I have 15 of the challenges done (all the trivial ones):

1. Add two numbers (e.g. f(1, 2)=3) Minimum needed bytes: 1

Solution, 1 byte: +

2. Subtract two numbers (e.g. f(5, 3)=2) Minimum needed bytes: 1

Solution, 1 byte: -

3. Multiply two numbers (e.g. f(2, 4)=8) Minimum needed bytes: 1

Solution, 1 byte: ×

4. Divide two numbers (e.g. f(3, 2)=1.5) Minimum needed bytes: 1

Solution, 1 byte: ÷

5. Integer-divide two numbers (e.g. f(9, 4)=2) Minimum needed bytes: 1

Solution, 1 byte: :

6. Modulo two numbers (e.g. f(100, 57)=43) Minimum needed bytes: 1

caird coinheringaahing

13:08

@Mr.Xcoder I have 3 left, but 5 of mine can be shorter

Leaky Nun

@Mr.Xcoder for 12. one of your solutions wouldn't work

Mr. Xcoder

@LeakyNun U wouldn't work?

Leaky Nun

@Mr.Xcoder yes, why?

Mr. Xcoder

@LeakyNun Because it reverses every element as well? (Vectorization)

Leaky Nun

@Mr.Xcoder not "as well", just reverses every element

Mr. Xcoder

13:12

@LeakyNun Yeah

@LeakyNun Can you give me suggestions on Find the median (e.g. f([-0.1777777777, -2.5, -333333, -444]=-223.25) Minimum needed bytes: 9? I though I should start with an if statement to check the parity of the length of the list.

Leaky Nun

@Mr.Xcoder I suggest you skip that :p

Mr. Xcoder

@LeakyNun Ok

Too hard right now lol

@LeakyNun Give me a task for Jelly (I might solve it in Pyth too)

Leaky Nun

> Draw an N×N checkerboard with white top-left square. Use space for white and a consistent non-whitespace char for black. Trailing spaces not required. Example for f(8):

 # # # #
# # # #
 # # # #
# # # #
 # # # #
# # # #
 # # # #
# # # #

Mr. Xcoder

Never used Strings yet in Jelly

@LeakyNun Give me a hint

Leaky Nun

13:27

I don't know what hint I can give

Mr. Xcoder

@LeakyNun You can always find a hint to give

@LeakyNun What's an easy way of repeating a string. Like #<space> becomes #<space>#<space>...#<space>, n times?

Leaky Nun

@Mr.Xcoder "repeat"

Mr. Xcoder

"repeat", yes ==]

Leaky Nun

search the atom list for "repeat"

Mr. Xcoder

@LeakyNun x?

Leaky Nun

13:30

the other one

Mr. Xcoder

Also, should I use ⁾?

Leaky Nun

@Mr.Xcoder sure

Mr. Xcoder

@LeakyNun I currently have this: H⁾# ẋ for # # # #

Leaky Nun

ok

Mr. Xcoder

13:47

Oh, Strings are hard

@LeakyNun How can I have something stored, like in a variable?

Cows quack

@Qwerp-Derp @LeakyNun for this challenge, is there a boundary on the first number in the range?

Leaky Nun

@Mr.Xcoder register ©

Mr. Xcoder

@LeakyNun Thanks

Leaky Nun

@Cowsquack yes, it must be positive

Cows quack

I mean any other boundary, what is it limited to?

like is it always less than the square root of n?

Mr. Xcoder

13:49

@LeakyNun Can you give me an example with ©?

Leaky Nun

@Cowsquack no idea

0

A: Counting N-bit integer multiplication overflows

Jelly, 11 bytes 2*’©ŒċP€>®S Try it online! A literal implementation of the problem. Quite slow.

Mr. Xcoder

Thx

Cows quack

I asked because I found a solution without powerset (not in Jelly though)

Mr. Xcoder

@LeakyNun I have this: H⁾# ẋẋ. How can I split it into 8 equal pieces and separate them by newlines (I know this won't give the expected output)?

I'll take a break from Jelly now, because it is exhausting. Ping me if you can answer my question above

Leaky Nun

14:09

@Mr.Xcoder something like s

Mr. Xcoder

@LeakyNun Ok

caird coinheringaahing

@Mr.Xcoder tio.run/##y0rNyan8/9/jUeM@ZYWHu7qB6OjkYotDW49Oerhzxv///y0A?

Mr. Xcoder

@cairdcoinheringaahing I don't want them to be split by characters

@cairdcoinheringaahing This helps much though: H⁾# ẋẋœs8Y, thanks

Actually this: H⁾# ẋẋs8Y

I have this:

# # # #
# # # #
# # # #
# # # #
# # # #
# # # #
# # # #
# # # #

Getting close

I have no idea how to alternate those. @LeakyNun Can you please give me the intended solution?

Leaky Nun

@Mr.Xcoder I won't tell you the intended solution but I'll tell you that ¦ might help

caird coinheringaahing

@Mr.Xcoder they never give the solution :(

Mr. Xcoder

14:16

@LeakyNun Ok, thanks :)

@LeakyNun or @cairdcoinheringaahing What does <repetitions> mean in <link><repetitions>¡?

Leaky Nun

@Mr.Xcoder the number of repetitions

caird coinheringaahing

@Mr.Xcoder x in for i in range(x) in Python

Leaky Nun

f(f(f(f(v))))

Mr. Xcoder

@LeakyNun Then why does ⁾# 6¡ print # 6?

Leaky Nun

@Mr.Xcoder the number of iterations

Mr. Xcoder

14:21

Oh, nVM

@LeakyNun I have no idea how to use ¦

caird coinheringaahing

@Mr.Xcoder me neither

Mr. Xcoder

And how I should generate <indexes>

caird coinheringaahing

And I'm stopping Jelly for today! Bye!

Leaky Nun

@Mr.Xcoder JḤ$ :)

@cairdcoinheringaahing bye

Mr. Xcoder

Oh

@LeakyNun How should I make it add 8 each time?

Leaky Nun

14:26

@Mr.Xcoder I don't understand

Mr. Xcoder

@LeakyNun The shortest way to generate [8,16,24,...64]

Leaky Nun

8R×8?

Mr. Xcoder

@LeakyNun Yes, good one

@LeakyNun Can we stop Jelly for now, go to TNB and practice Pyth a bit?

Leaky Nun

sure

Mr. Xcoder

@LeakyNun Thanks

Bye, Bye, Jelly!

caird coinheringaahing

20:46

@Mr.Xcoder rip, you haven't been added to the list of students yet D:

Mr. Xcoder

@cairdcoinheringaahing Doesn't matter that much

caird coinheringaahing

@Mr.Xcoder do you want a CMC?

Mr. Xcoder

@cairdcoinheringaahing 'çourse, easy one to begin with

caird coinheringaahing

Are you trying strings?

If so: Draw a right triangle with equal perpendicular sides of length N. You must use a not necessarily consistent non-whitespace char.

5 bytes (apparently)

Mr. Xcoder

No, not strings plsss

caird coinheringaahing

20:48

@Mr.Xcoder hint: generate the numbers, then times by strings. Works for most of the string ones

Mr. Xcoder

@cairdcoinheringaahing Ok, but help me get the good atom order

caird coinheringaahing

@Mr.Xcoder sure, if you need it

Mr. Xcoder

SO [1,2,3,4,5,...,1]

@cairdcoinheringaahing The generating list: ŒḄ

caird coinheringaahing

@Mr.Xcoder yep

Mr. Xcoder

I don't get the right order; ”#ẋŒḄ

I have this now: ŒḄ”#ẋ

I need to spilt by linefeeds

caird coinheringaahing

20:54

@Mr.Xcoder not split by. Join with

Mr. Xcoder

@cairdcoinheringaahing Ok

@cairdcoinheringaahing 6 bytes: ŒḄ”#ẋY

caird coinheringaahing

@Mr.Xcoder good. Can you do it using multiplication?

Mr. Xcoder

@cairdcoinheringaahing I think so

@cairdcoinheringaahing Wait, what do you mean

caird coinheringaahing

@Mr.Xcoder like print('#'*5) in Python

Mr. Xcoder

×”#? Dunno how it would help

caird coinheringaahing

20:57

@Mr.Xcoder it doesn't remove bytes, but its another way of doing it.

Mr. Xcoder

@cairdcoinheringaahing Ok

I have this: R×”#Y

@cairdcoinheringaahing ŒḄ×”#Y

caird coinheringaahing

@Mr.Xcoder exactly. Do you want another one?

Mr. Xcoder

@cairdcoinheringaahing Another way to do it?

Did you solve it in 5?

caird coinheringaahing

@Mr.Xcoder no, I got 6 :(

Mr. Xcoder

@cairdcoinheringaahing It good anyway

caird coinheringaahing

21:00

Leaky's gone though, so we can't ask him

Mr. Xcoder

@cairdcoinheringaahing I think I know a 5byter, wait

@cairdcoinheringaahing Another 6-byter: ḶŒḄ⁵*Y, I think this one can be a 5-byter golfed

@cairdcoinheringaahing Another one (that's not in that list)

caird coinheringaahing

@Mr.Xcoder do you want a different CMC?

Mr. Xcoder

@cairdcoinheringaahing Yes

caird coinheringaahing

@Mr.Xcoder personal favourite: codegolf.stackexchange.com/questions/121921/make-a-interpreter

Don't look at the Jelly answer

Mr. Xcoder

Hmmm

That's a CMC!

caird coinheringaahing

21:06

13 bytes to beat (by Dennis)

Mr. Xcoder

Oh god

@cairdcoinheringaahing We must split the parts between the # and count the ;s first, right?

caird coinheringaahing

@Mr.Xcoder yes.

Mr. Xcoder

> ṣ - Split list x at occurrences of y.

This one is going to be really helpful ^

@cairdcoinheringaahing First part is done.

caird coinheringaahing

Test case: ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;#;;;;;" => !

Mr. Xcoder

@cairdcoinheringaahing Do the ;s after the last # not affect the output?

caird coinheringaahing

21:12

@Mr.Xcoder nope. # must be used to output

Mr. Xcoder

I got it

caird coinheringaahing

Me too. spoiler (maybe)

Mr. Xcoder

So we must remove the last one in the list, because it is either ; n times or ''

@cairdcoinheringaahing What's the thing for count the occurences of y in x?

Duh, it's ċ

caird coinheringaahing

@Mr.Xcoder Dennis made it so that the atoms make sense :)

Mr. Xcoder

@cairdcoinheringaahing Yeah, it followed the exact defintion

caird coinheringaahing

21:16

@Mr.Xcoder have you finished?

Mr. Xcoder

We should obviously use map € now

@cairdcoinheringaahing No

I think I have one more atom: ṣ”#Ṗċ€”;%127

caird coinheringaahing

@Mr.Xcoder you are 1 byte away from Dennis'

Mr. Xcoder

@cairdcoinheringaahing This one was too easy :)

ṣ”#Ṗċ€”;%127Ọ

This is the only obvious solution

@cairdcoinheringaahing It's my turn for a CMC, to compare our byte counts

caird coinheringaahing

@Mr.Xcoder what do you mean?

Mr. Xcoder

@cairdcoinheringaahing I'll write a CMC now

caird coinheringaahing

21:20

Oooh fun. Go on, then

Mr. Xcoder

I wish I had ideas

CMC: n -> [n^0, n^1, n^2, ... n^(n-1)]

No, it's waaay too easy: *Ḷ

caird coinheringaahing

@Mr.Xcoder ninja'd :)

Mr. Xcoder

@cairdcoinheringaahing CMC: n -> n! - n^3

5 -> 125 - 125 = 0

@cairdcoinheringaahing Sorry, I have to go now. See you another time, perhaps

Bye!

caird coinheringaahing

@Mr.Xcoder 5 -> 120 - 125 = -5

Bye!

Mr. Xcoder

@cairdcoinheringaahing 120 - 125 = -5

Sorry! Sya

caird coinheringaahing

21:28

@Mr.Xcoder When you get back, 6 bytes

Mr. Xcoder

21:43

@cairdcoinheringaahing Nice one. I will be sleeping for the next 10 hours, so bye!

Qwerp-Derp

23:23

How does Ŀ work?

Transcript for