Jelly Hypertraining

2:29 PM

@Mr.Xcoder 2 bytes

(Outputs a list, 3 if that's not allowed)

4:13 PM

@cairdcoinheringaahing bijective base 7?

@Mr.Xcoder Nope. Base 7 doesn't have 7

@cairdcoinheringaahing sorry 8

@Mr.Xcoder In that case, yep :P

(On mobile, didn't remeber the CMC)

Well done anyway

5:19 PM

CMC: Given a list of positive integers, determine whether all the integers are higher than the sum of the preceding deltas.

[5, 7, 8] -> deltas: [2, 1] -> 7 > 2, 8 > 3 -> True

[28,1000,56] -> False

@Mr.Xcoder I had 4 bytes, then noticed "preceding" ಠ_ಠ

Oh hi Hyper!

Hello!

@Mr.Xcoder 6 bytes

rip I have 10

5:23 PM

6 bytes too I think

Aaand, my compressor improvements are done! \o/ :P

@cairdcoinheringaahing Sha256?

nice

e1671b49add30f5540493599c8238e092ecfaa5b0e419e239b072226d1a8c3d2

6 bytes as well

387804bc09cd99ebc8fc7ffbfceb6e696697f96530315adff5693c6ca1587fa8

5:24 PM

@Mr.Xcoder 0a9b57dfd6042f3e039d957e9341db926cacd3edabc5cf69049b5df9a7d21156

So we got 3 different solutions :P

We all have different solutions ಠ__ಠ

except mine is wrong

lol

Mine is wrong

Damn it, mine is 1 byte away from being ASCII

now I have 7 lol

5:25 PM

ISµƤ⁼Ṣ is invalid, crap

What test case did yours fail on?

mine?

The first.

@HyperNeutrino Either

Oh nvm

5:26 PM

Mine doesn't even output the right type of answer; it outputs a list

Solution now a7a16a9eea17708addc79c50757e6f517208c98d7f2c7326dab0a76a1e7bc073

Why doesn't mine work though?

'Cause ISµƤ returns [0, 2, 3] which is sorted...

@Mr.Xcoder New monadic chain needed

Why... Isn't it... NVM

7 bytes

56c96c1a18fe525fba9ab095531dfb34c51ce16700e4e879827ba07397095572

spoiler to mine

Huh you had a similar approach to mine at the start

Can someone give me another test case? I feel like mine isn't going to work

5:29 PM

@cairdcoinheringaahing For what kind of test?

except mine is still invalid

@Mr.Xcoder Check if mine works. It works for the two you gave, but I'm not sure if it would work for others

[56, 76, 20] -> 1.

[56, 76, 21] -> 1

[56, 76, 19] -> 0

Ok, that's enough :P

(higher than or equal to I meant)

5:31 PM

I have 7 bytes now, and it's practically identical to yours lol. Just that I use $ instead of µ

Except mine is invalid...

Presumably yours is too @Hyper

really...

and all three test cases above except for the last one

Actually it fails on , 21

lol

@HyperNeutrino and , 20

5:33 PM

yup

I guess we must use Some kind of zip then

Hi DJ!

@Mr.Xcoder Because of this?

@cairdcoinheringaahing no, it's just terribly off.

I think [28,1000,56] should give True...

1000 > 972, 58 > 26

ಠ_ಠ

5:37 PM

@Mr.Xcoder VTC as unclear :P

I've got to go eat for now. Be back in a bit o/

I will rephrase CMC

CMC (rephrased): Given a list of positive integers, determine whether all are higher than the sum of the preceding deltas, from the beginning of the list up until the element (inclusive). You can assume that the delta sum for the first number is 0.

[28,1000,56] -> true

[1, 2, 3, 4, 5] -> true

[100, 10000] -> true

[1, 9, 3, 29] -> false

@cairdcoinheringaahing @HyperNeutrino Done.

Cool

How is the last one false?

6 bytes.

1 > 0, 9 > 8, 3 > 2, 29 > 28

@HyperNeutrino 3 < 8

Where did that 2 come from?

Bloody Hell.

5:44 PM

(9 - 1) + (3 - 9) = 2

You are right.

I have 1 byte

All my test cases are incorrect.

@HyperNeutrino 1 what

I conjecture that the answer is always true

:P

I don't think so...

5:45 PM

hm ok

(I mean again, higher than or equal to)

hm ok

@Hyper actually why are you right?

a > b -> a >= b though

?

I think you are right though, but I don't know why...

Done without any conjecture, I have 8 bytes

@HyperNeutrino I have ISµƤµ‘>Ạ

actually make that 9

uhm....

5:51 PM

Hello! I'm back :P

The list of delta sums is parallel to the original list

[4, 2] -> [0, -2] -> 2 > -2, 4 > 0

@HyperNeutrino brb, checking the builtin page :P

That is, the vectorized difference list is constant

@cairdcoinheringaahing 1 is his answer.

5:52 PM

Try this with any list

Oh yeah, he's right :P

well then...

@Mr.Xcoder 0 bytes (assuming that I can claim 0 as "is higher" and 1 otherwise)

Interesting.

wrong

5:53 PM

@cairdcoinheringaahing ಠ_ಠ

the argument gets passed through

@HyperNeutrino Who needs an argument? :P

...

https://tio.run/##pVd7dxPHFf8bfYrBfewuFsKyCykyaksJJLS0aYFCW6E469VIXrPaVXdXlm1KDiIJpJC0DZwToG0SXianDaFAAmglAudIRsfmW4y@iHvvzD6NILSVz5G1d373Mb/7mNnagjtjmRNra3q1ZtkucRacVPDTtXWzEjzpLrVdyzKcVAowmZrqzmR00wGhPJYmI1usmrtllhrGwogSqJR0zdUtU7UXUinNKtGpmlqhJE8kSepe6V7tXute7y51b3T/2b3ZvdW91/2m@3hw8mbvVO9076@9j3oXehefnOt92vusd6P3ee/28p2VB707vQe91pPzvUdk48h3vvu970uysmk0vTmzZSw7PvGDrdte@eH23OSO/I9@/JOdP9316u49r72@92c/3/eLX77xq1/vP3DwN4cO//Z3vy8cKb459ZY6rZVouTKjzx41qqZV@4PtuPW5xvzC4rE/Hn871b3d9bp3u18Nml8PmvcGzfuD5oNBszVoeoNme9DsDJoPB81vBs1H/Wb/dP9M/6P@@f7FwZ1b/U/61/s3@3dXrq@e77@/eqF/bvXy6o3@pdU7q3f7S08vrz5…

My compressor :P

Why does it seem familiar? :P

5:58 PM

@Mr.Xcoder Because its an optimised version of Lynn's compressor

Wait it's for Levant or Jelly?

Jelly

Wow you can post that as an answer.

I'm still working on it :P

CMC: Given a list (of positive integers), find all the numbers that appear in the integer partitions of at least one element.

(the list may not contain duplicates)

6:01 PM

@Mr.Xcoder So integer partition one element?

[2, 4, 8] -> partitions: [[[1, 1], [2]], [[1, 1, 1, 1], [1, 1, 2], [1, 3], [2, 2], [4]], [[1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 2], [1, 1, 1, 1, 1, 3], [1, 1, 1, 1, 2, 2], [1, 1, 1, 1, 4], [1, 1, 1, 2, 3], [1, 1, 1, 5], [1, 1, 2, 2, 2], [1, 1, 2, 4], [1, 1, 3, 3], [1, 1, 6], [1, 2, 2, 3], [1, 2, 5], [1, 3, 4], [1, 7], [2, 2, 2, 2], [2, 2, 4], [2, 3, 3], [2, 6], [3, 5], [4, 4], [8]]] -> [1, 2, 3, 4, 5, 6, 7, 8]

(note that it's a trap)

@Mr.Xcoder Ah, I get it :P

@Mr.Xcoder 4 bytes

@cairdcoinheringaahing 2 bytes.

1 min ago, by Mr. Xcoder

(note that it's a trap)

@cairdcoinheringaahing Pretty sure you do <int_partitions><flatten>Q

@Mr.Xcoder Yep, but I have 2 bytes :P