Jelly Hypertraining

Comrade SparklePony

1:10 AM

I figured out why I need it: S= is a dyad

user165474

3:14 AM

@EriktheOutgolfer @LeakyNun I'm ready for more practice, how about you guys?

Leaky Nun

@HyperNeutrino sure

come up with a challenge

and we can solve it together

user165474

Okay. Lemme think... Darn, I had a good one earlier today but I can't remember it

user165474

Can I also try finding one on main?

Leaky Nun

sure

user165474

oh check if a number is a factorial main challenge

Leaky Nun

3:20 AM

@HyperNeutrino what's the answer in the second place?

user165474

oh lol you already answered it :p

user165474

ooo you outgolfed dennis

Leaky Nun

he posted 6 hours after me

user165474

oh i see

user165474

ok

user165474

3:25 AM

well i'll try it and see if i can get it done quickly

Leaky Nun

3:58 AM

@HyperNeutrino how is your attempt?

user165474

pretty bad: Æ!2ṫS=0&Ḣ=1

user165474

I want to use factorial base but that may be wrong

user165474

(it also doesn't work)

Leaky Nun

alright

user165474

did you use the factorial base atom?

Leaky Nun

4:02 AM

not really

user165474

ah ok

user165474

sigh

user165474

R!ċ

Leaky Nun

sure

user165474

Oh interesting approach

user165474

4:11 AM

Exercise idea: Find the inverse of a matrix

Leaky Nun

built-ins allowed?

user165474

If there's an inverse builtin then no

Leaky Nun

input guarantee invertible?

user165474

but other matrix/vector operations sure i guess

user165474

^ yes

Leaky Nun

4:12 AM

alright

Leaky Nun

4:25 AM

@HyperNeutrino testcase?

user165474

[[4, 7], [2, 6]] -> [[0.6, -0.7], [-0.2, 0.4]]

Leaky Nun

4:46 AM

@HyperNeutrino 33 bytes:

J+þ`-*
J=þ`œp€⁸;/€
Ç€Çż/€ÆḊZ÷ÆḊ×Ñ

Try it online!

I must leave now

user165474

Nice

Leaky Nun

wolframalpha.com/input/…

user165474

Okay. Bye! o/

user165474

6:25 AM

@LeakyNun I was trying to implement this but my program rapidly died and now I don't get how any of it works

Erik the Outgolfer

7:56 AM

@ComradeSparklePony totally sure you didn't see Hyper's list?

@HyperNeutrino still there? wanna still train?

Erik the Outgolfer

8:09 AM

@HyperNeutrino assuming matrix is square?

Erik the Outgolfer

10:40 AM

@LeakyNun teacher training:make a dyad to "rectangularify" a 2d array with a specific value. it should work as an inline, one-link dyad

test-cases:

x=[[1, 2, 3], [4, 5], [6, 7, 8, 9]] y=0

=> [[1, 2, 3, 0], [4, 5, 0, 0], [6, 7, 8, 9]]

x=[[], [1, 2, 3, 4, 6], [3, ['a', 'b', 'c']]] y='d'

=> [['d', 'd', 'd', 'd', 'd'], [1, 2, 3, 4, 6], [3, ['a', 'b', 'c'], 'd', 'd', 'd']]

x=[[1, 2], [3, 4, 5, 6], [7]] y=[0, 8, 9]

Comrade SparklePony

@EriktheOutgolfer This will sound shady, but I promise that it is the truth. I was trying to find when ATaco joined, and in doing so, passed the list and a message saying how the sublists atom vectorizes. I did not pay very much attention to the list, and only realized what it was of after reading some other messages.

Erik the Outgolfer

=> [[1, 2, [0, 8, 9], [0, 8, 9]], [3, 4, 5, 6], [7, [0, 8, 9], [0, 8, 9], [0, 8, 9]]]

@ComradeSparklePony did you scroll up to take a look of it after you saw the messages?

that's called spoiling...

Erik the Outgolfer

11:12 AM

btw I can do this in 3 bytes

Comrade SparklePony

12:05 PM

@EriktheOutgolfer No. I did not mean to be spoiled, and am sorry about that. I will try not to accidentally spoil myself anymore. :)

Erik the Outgolfer

well it's good practice to avoid posting spoilers in first place too ;)

Comrade SparklePony

What should I work on next?

Erik the Outgolfer

I'll put an easy one right now

May 9 at 16:12, by Leaky Nun

let's draw the diagonals

@ComradeSparklePony

Comrade SparklePony

Okay. I need to go now, but I will work on it.

Erik the Outgolfer

12:30 PM

room topic changed to Jelly Hypertraining: Practice your Jelly :) To be a student, request access. Rules & Resources: v.ht/jhtrr Student & Teacher catalog: v.ht/jhtstc Easy challenges to try: v.ht/jhtc [class] [code-golf] [jelly] [practice]

Wonder where did the pinned challenges go? Well, they're simply not pinned anymore, since they were cluttering the starboard. They're in the room description now. You can find them and even more there!

user165474

12:53 PM

@EriktheOutgolfer Hi

Erik the Outgolfer

hi

ready for training?

user165474

Yup!

Erik the Outgolfer

(ignore the pings)

user165474

alright

Erik the Outgolfer

you remember the triangle?

user165474

12:57 PM

Which one?

Erik the Outgolfer

#
##
###
##
#

have you done it?

user165474

Oh right. I think I did but I'll try it again. Input would be n=3 for this right?

Erik the Outgolfer

doesn't hurt to try again, you'll need it for something more

user165474

oo ok

Erik the Outgolfer

and yes n=3 for this

user165474

12:58 PM

ok

user165474

@EriktheOutgolfer Spoiler

Erik the Outgolfer

you can golf this since you can use any non-whitespace char

user165474

Oh cool

user165474

This then spoiler

Erik the Outgolfer

correct

user165474

1:01 PM

yay

Erik the Outgolfer

now here's the real challenge

...make a flag!

user165474

ooo

Erik the Outgolfer

you'll take two arguments (let's call them n and m)

e.g. n=3, m=4:

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

but be careful!

user165474

eh wut

user165474

oh i see

Erik the Outgolfer

1:03 PM

watch the intersection between triangles

user165474

ah yes

Erik the Outgolfer

it's # not #\n# so no just "repeat the triangle a number of times"

user165474

ah ok

Erik the Outgolfer

e.g. for n=4 m=2 this would be wrong:

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

doesn't make sense at all right?

user165474

yeah i see

Erik the Outgolfer

1:05 PM

remember that you may use any non-whitespace char, it will probably help you golf it

user165474

@EriktheOutgolfer 13 bytes spoiler could probably be golfed more

Erik the Outgolfer

lemme try for a sec

user165474

ok

Erik the Outgolfer

@HyperNeutrino trivial 9-byte version possible

user165474

11 bytes

user165474

1:10 PM

@EriktheOutgolfer oh

user165474

10 bytes

Erik the Outgolfer

@HyperNeutrino sorry I was disconnected from the internet for a bit

user165474

that's ok

user165474

Hints for the last byte?

Erik the Outgolfer

hint: you need to entirely change your code

user165474

1:14 PM

rip

Erik the Outgolfer

and also use a trick

user165474

Should I still be using ŒḄ?

Erik the Outgolfer

yep

the trick is structural

@HyperNeutrino wanna show?

it's a bit difficult to figure out yourself

user165474

can you give me a hint as to what the trick is?

Erik the Outgolfer

hint: nilads in a row

user165474

1:19 PM

oh hm

user165474

I got this but it's still 10 bytes :I

Erik the Outgolfer

you don't use the trick

user165474

ehm. i don't see which nilads would help me :I

Erik the Outgolfer

what nilad is for '\n'?

user165474

⁷

Erik the Outgolfer

1:23 PM

this is one of the nilads you're going to need

user165474

ah ok

user165474

Does the code contain ŒḄṖẋ anywhere?

Erik the Outgolfer

sorta

user165474

or ŒḄḊẋ

Erik the Outgolfer

no that would be detrimental

user165474

1:28 PM

ok

user165474

eh. i can't figure it out. what other nilads are in use?

user165474

I have [this][tio.run/nexus/jelly#@/9wZ0vQoc0Pd3UfnfRwR8vDHV1AZuT////N/psAAA] but it won't work for n>9

user165474

also 10 bytes :I

Erik the Outgolfer

@HyperNeutrino try 1 2 3 and see what happens

user165474

it becomes 123?

user165474

1:38 PM

I can get like 50 different 10-byters :I

Erik the Outgolfer

@HyperNeutrino yes

and 1 2 3 are nilads in a row

how can you use this trick to make a 9-byte solution (hint: also need complete structural change)

user165474

Will I need ¤?

user165474

Hi @ComradeSparklePony

Erik the Outgolfer

@HyperNeutrino no

user165474

ok

user165474

1:46 PM

ok i need more hint :((( where is the bounce atom?

Erik the Outgolfer

first one

user165474

I could make a book of solutions that are 1 byte too long :I

Erik the Outgolfer

as I said you need a complete structural change

and no it's not that kind of change

user165474

so question. is the approach meant to be bounce -> repeat -> unduplicate -> repeat (1) -> join?

Erik the Outgolfer

unduplicate what? you mean uniquify or something?

user165474

1:52 PM

yeah

user165474

but not globally, just by runs

Erik the Outgolfer

you mean run-length encoding...well totally unneeded

user165474

oh

user165474

k

Erik the Outgolfer

@HyperNeutrino let's break it into parts

user165474

1:54 PM

okay

Erik the Outgolfer

first part: make this for n=3:

you also need to figure out how to do the flag intersections

user165474

ŒḄ1ẋY

Erik the Outgolfer

...almost

but it doesn't handle intersections as-is

also it doesn't handle the m argument

like this for n=2 m=2 I guess:

that is as long as it's accompanied by the other parts needed

user165474

um that could be extended in many different ways, can you give the example for n=3 m=4?

Erik the Outgolfer

totally wrong as you can see

user165474

2:00 PM

oh

user165474

ŒḄ1ẋYẋ

Erik the Outgolfer

still the same error

user165474

well it doesn't handle intersections but it does do what you listed above

user165474

ŒḄ1ẋYṖẋ;1

user165474

@EriktheOutgolfer

user165474

2:06 PM

I think I finally got it

Erik the Outgolfer

yes!

and you didn't use the trick I used

user165474

oh hm.

user165474

yay but that took too long :'I

Erik the Outgolfer

mine was ŒḄṖ1ẋẋY⁷1

user165474

oh hm, interesting

Erik the Outgolfer

2:09 PM

want more training or your head hurts by now?

user165474

i have PhD (permanent head damage) from school already :P I want more training. I have 40 minutes left for training btw

Erik the Outgolfer

ok how about a simple one?

user165474

sure :)

Erik the Outgolfer

currently thinking of one

@HyperNeutrino find if two positive integers have no prime divisors in common

I can do it in 3 bytes

user165474

ooo ok

Erik the Outgolfer

2:16 PM

e.g. a=8 b=15 don't have prime divisors in common

user165474

input as jelly 3 5 or jelly [3,5]

Erik the Outgolfer

jelly 3 5 is golfier

user165474

ah ok

Erik the Outgolfer

anything over 3 bytes is overkill of course this is so trivial

user165474

well having prime divisors in common is equivalent to having gcd != 1

user165474

2:18 PM

And so g=1 works...

Erik the Outgolfer

note that you can do in 2 bytes as well

user165474

oh hm

user165474

Still using g?

Erik the Outgolfer

yes

user165474

hm??? ok

user165474

2:21 PM

well then i need 1 byte to check if it's equal to 1...

user165474

heh gİḞ works too but idk 2 bytes???

Erik the Outgolfer

search for atoms...

user165474

monad right?

Erik the Outgolfer

just search...

@HyperNeutrino yet to find?

user165474

mhm :I

Erik the Outgolfer

2:29 PM

well what kind of link do we use when we want to process 1 value?

user165474

monadic

Erik the Outgolfer

yes so what should you be searching for?

user165474

single byte monads

Erik the Outgolfer

search for them then

user165474

:I

Erik the Outgolfer

2:34 PM

@HyperNeutrino search better

user165474

lol i don't even know what to look for

Erik the Outgolfer

4 mins ago, by Hyper Neutrino

single byte monads

user165474

well i've looked through the whole list a couple of times and nothing seems to be of any use

Erik the Outgolfer

search better then

@HyperNeutrino it's there I assure you

user165474

is there something that specifically checks if something's equal to 1, or is it less obvious than that?

Erik the Outgolfer

2:39 PM

less obvious

user165474

FINALLY gỊ

user165474

I also made all of these

user165474

g;1E
g=1
gİḞ
g’¬
gP=

user165474

funny how the "insignificant" atom was the one I needed :c

Erik the Outgolfer

@HyperNeutrino YEEES!

it's actually z <= 1 but since z would always be a positive integer it works like z == 1

user165474

2:41 PM

ah

user165474

yay

user165474

ok I have about 5 minutes left for a quick challenge

Erik the Outgolfer

@HyperNeutrino tabula-rectify

e.g. s="Hello, World!"

user165474

hm?

user165474

what is a tabula-rectify?

Erik the Outgolfer

2:44 PM

Hello, World!
ello, World!H
llo, World!He
lo, World!Hel
o, World!Hell
, World!Hello
 World!Hello,
World!Hello,
orld!Hello, W
rld!Hello, Wo
ld!Hello, Wor
d!Hello, Worl
!Hello, World

user165474

oh

Erik the Outgolfer

I can do it in 5 bytes at most

maybe consider trying later?

user165474

If this is fine then it's 3 bytes:

user165474

ello, World!H
llo, World!He
lo, World!Hel
o, World!Hell
, World!Hello
 World!Hello,
World!Hello,
orld!Hello, W
rld!Hello, Wo
ld!Hello, Wor
d!Hello, Worl
!Hello, World
Hello, World!

Erik the Outgolfer

no that's why I did 5 bytes

user165474

2:47 PM

ah ok

user165474

I have ṙJṙ-1Y for 6 bytes :I

user165474

welp anyway I got to go now. thanks, cya! o/

Erik the Outgolfer

\o

I'm pretty sure it can be done in 4 bytes though...