hi @Mr.Xcoder

@HyperNeutrino Hi. Give me 1 min

ok

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]

@Mr.Xcoder 4 bytes

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

@Mr.Xcoder Didn't use it

4 bytes

Ok great

MD5 hash is 0fa56f6f6640ccdc23ed98d8e30589bb

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

yup :P

@HyperNeutrino Mine is 0fa56f6f6640ccdc23ed98d8e30589bb

\o/ We have the same answer

\o/

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

ಠ_ಠ What am I doing wrong

@Mr.Xcoder What is your code?

Let me golf first

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

@HyperNeutrino 4 bytes

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

@Mr.Xcoder There isn't one

WHAT??! Jelly needs one :c

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

3

Ok, 4 bytes

@Mr.Xcoder Use =T$

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

yes

whoops :P

I cannot solve my own CMC and it's TRIVIAL

Can't get 4 bytes

@Mr.Xcoder Do you want a hint?

I'd say both yes and no

Filter

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

@Mr.Xcoder Nope

4 bytes for my CMC

MD5 is ba5f7e28a94c765eb5eaba469f459458

ಠ_ಠ 7 bytes

Mine

rip

⁴g=⁴µÐf

@HyperNeutrino You have exactly the same as mine

:'-(

there is a builtin for divisibility check

Ctrl-F divides

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

yup

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

lol

⁴ḍµÐf golfing...

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

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

I have 2 bytes

@HyperNeutrino Asking me?

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)

MD5 hash bb25c36af31beec2fce25dc765783c58

⁼Ṛ

I did the same but with U

MD5 bb25c36af31beec2fce25dc765783c58

anyway gtg now o/

o/

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

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

Mine

ḍ@Ðf

Ok

Have you tried Hyper's?

Oh no

I haven't even seen it lol. Trying now

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

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

4 bytes

ẎÐĿL

@Mr.Xcoder Yep

(idea came before your comment)

Now another one. Can you think of one please?

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

ಠ_ಠ

Search
Jelly
2,735 results

Let's do this one again

Ooh, didn't see that one. Looks fun

8 bytes here, for now

ಠ_ಠ I have 10 bytes

Mine looks like it can be shortened significantly

ḂÐfḂÐḟLḂ$?

Ternary if? Please

@caird 6 bytes now

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

(regex match)

@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?

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

Oh yeah sorry.

lol

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

@cairdcoinheringaahing 6 bytes‌​

@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

@cairdcoinheringaahing But that's only 2 bytes anyway

In this specific case, 1 byte

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

@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>µƇ

@Mr.Xcoder What about dyads?

Dunno

Hmm, actually, yeah I see your point.

I have a nice one (IMO)

Requires time to write...

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

@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]

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

@Mr.Xcoder 12 bytes, golfing

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?

@Mr.Xcoder ÆNÆR

@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

@Mr.Xcoder In JHT or PPCG?

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

Yep, got 11 bytes

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

ÆN€µDSÆPµÐf

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

11 bytes:

DSÆP
ÆN€ÇÐf

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

(my second challenge)

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

1 byte

ಠ_ಠ

I must go in 2'.

1 byte

@Mr.Xcoder Premature o/

@Mr.Xcoder you still here?

yes

Are you doing my CMC?

just a sec

I have a better one :P

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

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

@cairdcoinheringaahing 2 bytes

And I must go now.

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