@Adnan is 667777 a valid test case ? It should be Fasly if I understood the CMC correctly

Yes that should be falsy

@Kaldo hmm, well spotted

in that case 13 is indeed too low

actually, this cmc brings me on an idea for a new command

split an list in half ?

[0,1,2,3,4,5,6] would become [[0,2,4,6],[1,3,5]]

exactly

but maybe with an extra parameter

that way you could test that the first list only contains the same value and that the other list is the reverse range of the max

Yes, which should make the byte count a lot lower

a "number of sublists" parameter ?

Yeah, so it extracts every nth element to its corresponding list

like [1, 2, 3, 4, 5, 6, 7, 8, 9] 3 <<command>> → [[1, 4, 7], [2, 5, 8], [3, 6, 9]]

yep that would do the trick

technically you can already do that though

g;äζ

with zip you mean?

yep

but it's not really working when you have an odd amount of values

Yeah, that's the problem with the zip

@Adnan So basically Python's ::?

Most golfing languages have it and the Jelly 13-byter uses it so that would be a good idea.

@Mr.Xcoder Yes, something like that

And if b is a list then it would default to 2 perhaps? (I imagine that would be extremely useful)

Yes, that is a good idea

If you push the changes to master anytime soon I can ask Dennis for a pull if you want (05AB1E hasn't been synced in a while, and some bugs have been fixed since – e.g the .» and .« input evaluation problems)

what command should we assign to this?

What are the free ones?

anything without something assigned here

except λ

I'd say ι from eιement

that is going to piss off greeks, because that is a iota

sorry erik /s

@Mr.Xcoder added and tested

Nice, Should I ask Dennis to sync?

sure go ahead

@Mr.Xcoder alright, in that case the cmc can be solved with γ€g2ιćË*`RāQ

That's roughly the same as the Jelly method ;))

how many bytes was the jelly submisson?