Jelly Hypertraining

Mr. Xcoder

13:30

If anyone wants to train, ping me. I am kinda free today

caird coinheringaahing

14:09

@Mr.Xcoder I'm okay to train for an hour max

Mr. Xcoder

@cairdcoinheringaahing U here now?

caird coinheringaahing

@Mr.Xcoder Yep.

Mr. Xcoder

Who thinks of a CMC?

caird coinheringaahing

@Mr.Xcoder Can you?

Mr. Xcoder

Ok

CMC: Number of primes smaller than the sum of the prime factors of the sum of a given list.

test case to come

[1,2,3,4,5,6] -> 21 -> [3, 7] -> 10 -> [2, 3, 5, 7] -> 4 (cc @cairdcoinheringaahing)

caird coinheringaahing

14:16

@Mr.Xcoder Ok, I think I understand. Nice CMC

Mr. Xcoder

Not really nice. Kinda Chameleonic

But still, ok as a CMC

Oh, and if the sum of the prime factors itself is a prime too, we count it.

Like, 13 would yield [2,3,5,7,11,13]->6

@cairdcoinheringaahing 6 bytes here.

caird coinheringaahing

@Mr.Xcoder ಠ_ಠ I have 13 bytes

Mr. Xcoder

@cairdcoinheringaahing Lol wut

Can I see

Maybe you misunderstood

caird coinheringaahing

@Mr.Xcoder SÆFḢ€SµÆRL+ÆP

I think I over complicated it

Mr. Xcoder

oh lol soo redundant

@cairdcoinheringaahing Hint: Check out Æf and ÆC.

caird coinheringaahing

14:23

@Mr.Xcoder Ok, down to 10 bytes

Mr. Xcoder

Can I see?

(again)

caird coinheringaahing

@Mr.Xcoder Hang on, golfing a bit

Mr. Xcoder

okok

Btw, did you catch

6 mins ago, by Mr. Xcoder

Oh, and if the sum of the prime factors itself is a prime too, we count it.

?

caird coinheringaahing

@Mr.Xcoder Yep, that takes 5 bytes of my code

@Mr.Xcoder Shouldn't that be 7?

Mr. Xcoder

wut... Did you check out ÆC?

@cairdcoinheringaahing Why?

caird coinheringaahing

14:26

Ignore me

Mr. Xcoder

heh

tell me when you're done golfing

that

caird coinheringaahing

Ok, got 6 bytes. 4 bytes were because I can't count :P

Mr. Xcoder

Heh

My 6-byter

caird coinheringaahing

6 bytes: SÆfSÆC

Mr. Xcoder

yes.

now you should think of a CMC... I don't think it can get any shorter

brb

caird coinheringaahing

14:30

CMC: Given a number, double it until all digits (0-9) are used (example coming). The output should be the number of times it was been doubled.

Mr. Xcoder

cool cmc

very, very nice

caird coinheringaahing

The input may be a float

Mr. Xcoder

oh. why?

nvm

caird coinheringaahing

Example: 15070.409912109375 => 13

Mr. Xcoder

I can imagine a good algorithm, brb searching for appropriate quicks

Mini-CMC #1: Check if all the digits are used in writing a certain a float.

caird coinheringaahing

14:36

@Mr.Xcoder 5 bytes

Mr. Xcoder

oh that's short

@cairdcoinheringaahing Does that handle .?

caird coinheringaahing

@Mr.Xcoder No, I just realised that it doesn't work if the decimal is longer than the integer part

brb, fixing it

Mr. Xcoder

@cairdcoinheringaahing To the mini-cmc, 9 bytes

oh no, doesn't work

YOU CAN TAKE INPUT AS A STRING

duh caps lock

caird coinheringaahing

@Mr.Xcoder 12 bytes

Takes input as a number

Mr. Xcoder

Would you make it shorter by taking a string instead?

caird coinheringaahing

14:43

@Mr.Xcoder 1 byte shorter

Mr. Xcoder

@caird 8 bytes, input as a string.

caird coinheringaahing

@Mr.Xcoder Do you use œ- in yours?

Mr. Xcoder

no

caird coinheringaahing

@Mr.Xcoder It could be helpful

Mr. Xcoder

do you think so?

No idea what it does

caird coinheringaahing

14:46

@Mr.Xcoder Removes items in x that are also in y

Mr. Xcoder

@cairdcoinheringaahing I use filter for that, 1 byte shorter

Can I see yours?

caird coinheringaahing

@Mr.Xcoder To be completely correct, it's "multiset difference." (not idea what that is though)

@Mr.Xcoder I would, but its wrong D:

Mr. Xcoder

ok, try to make it work. Now I think your cmc is a bit too hard for us :D

caird coinheringaahing

Ok, it works at 13 bytes (input as number)

@Mr.Xcoder Now, I'm going to try my CMC :P

Mr. Xcoder

@cairdcoinheringaahing Still, can I see yours?

caird coinheringaahing

14:50

@Mr.Xcoder Ṿṣ”.;/V€µ⁵Ḷœ-. Returns empty list for all used, non-empty otherwise

Mr. Xcoder

Oh wow that's soo different

How... @cairdcoinheringaahing Why don't you use ØD at all?

oh you generated that by hand >.<

caird coinheringaahing

@Mr.Xcoder SHould I explain how it works or have you got it?

Mr. Xcoder

i got it...

caird coinheringaahing

@Mr.Xcoder Just checking. You seemed confused

Mr. Xcoder

that's a clever but lengthy approach

caird coinheringaahing

14:53

@Mr.Xcoder What's yours?

Mr. Xcoder

But yours will probably be shorter as it works with integers

@cairdcoinheringaahing 8 bytes: ØDḟ³ḟ”.Ṇ

Ok, I have no idea how to recurse in Jelly

caird coinheringaahing

@Mr.Xcoder ß

Mr. Xcoder

yeah, no clue how to use it

caird coinheringaahing

@Mr.Xcoder <link>ß

Mr. Xcoder

@cairdcoinheringaahing ಠ_ಠ

caird coinheringaahing

14:58

@Mr.Xcoder Like this

Mr. Xcoder

Yeah, I get segfault

caird coinheringaahing

@Mr.Xcoder There needs to be some sort of conditional, to prevent max recursion error

Mr. Xcoder

@cairdcoinheringaahing lol

caird coinheringaahing

@Mr.Xcoder Every number until segfault :P

Mr. Xcoder

@cairdcoinheringaahing lol

that's too hard for me

caird coinheringaahing

15:03

Right, I'm going to make my CMC slightly easier. CMC: Double until all numbers are used at least once. The final number is the output

@Mr.Xcoder How is that even syntaxically valid?

Mr. Xcoder

@cairdcoinheringaahing no idea

Why is main soooooooo inactive today, any idea?

caird coinheringaahing

@Mr.Xcoder Just one of those days I guess

@cairdcoinheringaahing 16 bytes

Mr. Xcoder

I am too tired rn to solve that. I just waana see yours now

@Mr.Xcoder 0/10 bad, bad English

caird coinheringaahing

@Mr.Xcoder Hold on, I'm checking to see if I can make it work for the first version of the CMC

Mr. Xcoder

I have another CMC (if you didn't already solve it)

caird coinheringaahing

15:14

@Mr.Xcoder You can post it if you want, but I may not answer it right now

Mr. Xcoder

CMC: Multiplication table up to n

5 yields this exact result:

caird coinheringaahing

@Mr.Xcoder 4 bytes

Mr. Xcoder

 1  2  3  4  5
 2  4  6  8 10
 3  6  9 12 15
 4  8 12 16 20
 5 10 15 20 25

Formatted like that ^

@cairdcoinheringaahing yes

2 4-byters, in fact

caird coinheringaahing

@Mr.Xcoder ×€RG

Mr. Xcoder

That's my first one

My second one is ×þRG (and Erik's, mostly)

caird coinheringaahing

15:19

YES! For the first CMC, I have 21 bytes.

Try it online! if you want to take a go at golfing it :P

Mr. Xcoder

Hooray

@cairdcoinheringaahing 20 bytes

caird coinheringaahing

@Mr.Xcoder do you think I should post that as a main challenge? 20 bytes for Jelly shows its not trivial

Mr. Xcoder

Mhm, maybe

@cairdcoinheringaahing Please, you'd still be outgolfed by someone

caird coinheringaahing

@Mr.Xcoder I'm glad to see you have confidence in my golfing skills :P

Mr. Xcoder

@cairdcoinheringaahing You have done an amazing job, but TBH Jonathan / Erik would shave off a couple of bytes

@cairdcoinheringaahing I think it's good for main, yeah

caird coinheringaahing

15:24

@Mr.Xcoder Just checking, you're not just saying that because you want something on main, right? :P

Mr. Xcoder

@cairdcoinheringaahing No, I said that because you asked me a question.

That doesn't mean I wouldn't solve it, though.

caird coinheringaahing

@Mr.Xcoder Ok, just checking :P (was mainly joking)

Mr. Xcoder

:DD:

caird coinheringaahing

Hang on, I've got to go, can't post it now. Damn CV o/

Mr. Xcoder

@cairdcoinheringaahing CV?

\o

Curriculum Vitae...?

caird coinheringaahing

15:26

@Mr.Xcoder A piece of paper that tells employers about you

Mr. Xcoder

@cairdcoinheringaahing ^^

caird coinheringaahing

@Mr.Xcoder Yep

Mr. Xcoder

Ok, do your thing

@cairdcoinheringaahing For when you come back, your very first test case should've been 2 instead of 13, and your program agrees.

@cairdcoinheringaahing Also for when you come back, 11 should yield 39 instead. 11*2^39 has unique digits, whilst 11*2^40 lacks an 8.

Transcript for