Jelly Hypertraining

HyperNeutrino

14:56

hi @Mr.Xcoder

Mr. Xcoder

@HyperNeutrino Hi. Give me 1 min

HyperNeutrino

ok

Mr. Xcoder

I'm here now. I'll try to think of a cmc

CMC: Given an integer I and an array Q, return the integers of Q that are multiples of I. (@HyperNeutrino)

I=4, Q=[1, 3, 5, 4, 16, 2, 18, 7, 20] -> [4, 16, 20]

caird coinheringaahing

@Mr.Xcoder 4 bytes

Mr. Xcoder

Although I don't think you used it, @cairdcoinheringaahing ÐṀ wouldn't work

caird coinheringaahing

15:05

@Mr.Xcoder Didn't use it

HyperNeutrino

4 bytes

Mr. Xcoder

Ok great

HyperNeutrino

MD5 hash is 0fa56f6f6640ccdc23ed98d8e30589bb

caird coinheringaahing

@HyperNeutrino Well, an MD5 hasher is another tab I need :P

HyperNeutrino

yup :P

caird coinheringaahing

15:07

@HyperNeutrino Mine is 0fa56f6f6640ccdc23ed98d8e30589bb

\o/ We have the same answer

HyperNeutrino

\o/

@cairdcoinheringaahing there is non-zero probability otherwise though :P

Mr. Xcoder

ಠ_ಠ What am I doing wrong

caird coinheringaahing

@Mr.Xcoder What is your code?

Mr. Xcoder

Let me golf first

HyperNeutrino

CMC: Get the depth of a list without the depth builtin

caird coinheringaahing

15:10

@HyperNeutrino 4 bytes

Mr. Xcoder

What is the "Get all indexes of..." built-in?

caird coinheringaahing

@Mr.Xcoder There isn't one

Mr. Xcoder

WHAT??! Jelly needs one :c

caird coinheringaahing

@HyperNeutrino What should be output for [1, 3, 5, [4, 16, [2, 18], 7], 20]?

HyperNeutrino

3

caird coinheringaahing

15:14

Ok, 4 bytes

HyperNeutrino

@Mr.Xcoder Use =T$

caird coinheringaahing

@HyperNeutrino Shouldn't that be =T¥ as it's dyadic?

HyperNeutrino

yes

whoops :P

Mr. Xcoder

I cannot solve my own CMC and it's TRIVIAL

Can't get 4 bytes

caird coinheringaahing

@Mr.Xcoder Do you want a hint?

Mr. Xcoder

15:17

I'd say both yes and no

caird coinheringaahing

Filter

Mr. Xcoder

Wait do you take arguments in reverse order? Integer first and list second?

caird coinheringaahing

@Mr.Xcoder Nope

HyperNeutrino

4 bytes for my CMC

MD5 is ba5f7e28a94c765eb5eaba469f459458

Mr. Xcoder

ಠ_ಠ 7 bytes

Mine

HyperNeutrino

15:20

rip

Mr. Xcoder

⁴g=⁴µÐf

caird coinheringaahing

@HyperNeutrino You have exactly the same as mine

Mr. Xcoder

:'-(

HyperNeutrino

there is a builtin for divisibility check

Ctrl-F divides

caird coinheringaahing

At which point Xcoder goes (ノ°Д°）ノ︵ ┻━┻

HyperNeutrino

15:22

yup

Mr. Xcoder

ಠ_ಠ I searched for "divides" earlier, now I realise I searched the QUICKS!!!

HyperNeutrino

lol

Mr. Xcoder

⁴ḍµÐf golfing...

HyperNeutrino

how do you switch the order of a dyad's arguments ಠ_ಠ

caird coinheringaahing

CMC: Given a string, check whether it is a palindrome without using ŒḂ

I have 2 bytes

Mr. Xcoder

15:23

@HyperNeutrino Asking me?

HyperNeutrino

no that's a hint

@cairdcoinheringaahing 2 bytes I think this is simple enough to not hash it :P

(I didn't test my solution but I'm almost certain my solution works)

caird coinheringaahing

MD5 hash bb25c36af31beec2fce25dc765783c58

Mr. Xcoder

⁼Ṛ

HyperNeutrino

I did the same but with U

MD5 bb25c36af31beec2fce25dc765783c58

anyway gtg now o/

caird coinheringaahing

o/

Mr. Xcoder

15:27

@cairdcoinheringaahing What is the 4 byter? I want to move on to another CMC

caird coinheringaahing

@Mr.Xcoder For what? Yours, Hyper's or mine?

Mr. Xcoder

Mine

caird coinheringaahing

ḍ@Ðf

Mr. Xcoder

Ok

caird coinheringaahing

Have you tried Hyper's?

Mr. Xcoder

15:28

Oh no

I haven't even seen it lol. Trying now

@caird 5 bytes :-/ SÐĿL’

caird coinheringaahing

@Mr.Xcoder You should be able to remove the ’ if you change one other character

Mr. Xcoder

4 bytes

ẎÐĿL

caird coinheringaahing

@Mr.Xcoder Yep

Mr. Xcoder

(idea came before your comment)

Now another one. Can you think of one please?

caird coinheringaahing

CMC: Find any code in which the use of ' changed the way an atom worked

Mr. Xcoder

15:32

ಠ_ಠ

caird coinheringaahing

Search
Jelly
2,735 results

Mr. Xcoder

in The Nineteenth Byte, yesterday, by AdmBorkBork

CMC: Given a list of integers, output the even elements if the list length is even, otherwise output the odd elements. Example: [4, 5, 7, 4, 6, 8] -> [4, 4, 6, 8]

Let's do this one again

caird coinheringaahing

Ooh, didn't see that one. Looks fun

Mr. Xcoder

8 bytes here, for now

caird coinheringaahing

ಠ_ಠ I have 10 bytes

Mr. Xcoder

15:36

Mine looks like it can be shortened significantly

caird coinheringaahing

ḂÐfḂÐḟLḂ$?

Mr. Xcoder

Ternary if? Please

@caird 6 bytes now

caird coinheringaahing

@Mr.Xcoder Ð[fḟ] or [fḟ]?

(regex match)

Mr. Xcoder

@cairdcoinheringaahing My 8 byter has Ðf, my 6 byter contains neither of them

And the 6-byter is much easier to get compared to the 8-byter

@caird Can I see your 10-byter please?

caird coinheringaahing

@Mr.Xcoder ^^^^^^^^

Mr. Xcoder

15:44

Oh yeah sorry.

lol

caird coinheringaahing

Ok, I have 8 bytes, without using f or ḟ. Working on golfing

@Mr.Xcoder I've sort of moved on from the CMC, to a quick I think could be useful. You can spoil

Mr. Xcoder

@cairdcoinheringaahing 6 bytes‌

caird coinheringaahing

@Mr.Xcoder nice. Does this sound like a good idea for a quick: returns the number of elements in a list that meet a given condition. For example (lets call Ƈ the quick): [2,1,4,2,7,4]ḂƇ would return 2

Mr. Xcoder

@cairdcoinheringaahing But that's only 2 bytes anyway

In this specific case, 1 byte

caird coinheringaahing

@Mr.Xcoder What 2 bytes? I got 3: ḂTL

Mr. Xcoder

15:58

@cairdcoinheringaahing [2,1,4,2,7,4]ḂS

Or any other command, Ḃ€S or for a longer condition: µ<blah>µ€S, whilst the other one is [2,1,4,2,7,4]µ<blah>µƇ

caird coinheringaahing

@Mr.Xcoder What about dyads?

Mr. Xcoder

Dunno

caird coinheringaahing

Hmm, actually, yeah I see your point.

Mr. Xcoder

I have a nice one (IMO)

Requires time to write...

caird coinheringaahing

I think I found out what ƙ does: tio.run/##y0rNyan8/9/WVMXj2Mz///9HG@ooGOsoGOkomELIWAA

Mr. Xcoder

16:05

@cairdcoinheringaahing CMC: Given a number N, find the additive primes among the first N primes.

An additive prime is a prime whose sum of digits is also prime

25 -> [2, 3, 5, 7, 11, 23, 29, 41, 43, 47, 61, 67, 83, 89]

caird coinheringaahing

@Mr.Xcoder Interesting. I have an idea of how to do it though

@Mr.Xcoder 12 bytes, golfing

Mr. Xcoder

Nice

11 bytes.

The obvious way is 11 bytes. It can get to 10 though

@cairdcoinheringaahing What do you generate the first N primes with?

caird coinheringaahing

@Mr.Xcoder ÆNÆR

Mr. Xcoder

@cairdcoinheringaahing Ok, that is the part to be shortened.

ÆR can be replaced by something that automatically creates a range.

And we all use it all the time

caird coinheringaahing

@Mr.Xcoder In JHT or PPCG?

Mr. Xcoder

16:13

@cairdcoinheringaahing Both. It's like the most used quick.

caird coinheringaahing

Yep, got 11 bytes

Mr. Xcoder

(the 10-byter is not mine). The 11 byter is mine

ÆN€µDSÆPµÐf

Jonathan did it in 10 bytes: ÆNDS$€ĖÆPM

caird coinheringaahing

11 bytes:

DSÆP
ÆN€ÇÐf

Mr. Xcoder

I must admit it is a challenge of mine: codegolf.stackexchange.com/questions/112088/….

(my second challenge)

caird coinheringaahing

CMC: Given n, create a list n elements long, consisting entirely of n. ẋ and x are forbidden

Mr. Xcoder

16:16

1 byte

ಠ_ಠ

I must go in 2'.

caird coinheringaahing

1 byte

@Mr.Xcoder Premature o/

@Mr.Xcoder you still here?

Mr. Xcoder

yes

caird coinheringaahing

Are you doing my CMC?

Mr. Xcoder

just a sec

caird coinheringaahing

I have a better one :P

Mr. Xcoder

16:20

I will solve it when I have time. brb solving yours and bye then

caird coinheringaahing

CMC: Given a mathematical expression, evaluate it. Example: 3 + 10 * 4 => 43

Mr. Xcoder

@cairdcoinheringaahing 2 bytes

And I must go now.

caird coinheringaahing

You may use any characters for the operands. You must support multiplication, addition, subtraction, division and expoentiation

@Mr.Xcoder 1 byte and o/

Plus I have a super secret "cheat" :P

Transcript for