« first day (80 days earlier)      last day (2592 days later) » 

07:26
@cairdcoinheringaahing correct
 
11 hours later…
18:28
@LeakyNun Do you have a Jelly riddle?
@DJMcMayhem yes
> Find the largest list of consecutive numbers that sum to N (e.g. f(100)=[9, 10, 11, 12, 13, 14, 15, 16])
3 messages moved from The Nineteenth Byte
@LeakyNun Could you give me a hint for where to start?
@DJMcMayhem the search space
Huh?
Hmmm....
is there a filter atom?
nvm found it
18:35
No, but there is a quick
yeah
urgh error
Honestly, I have no idea how to do this
@DJMcMayhem what is the search space?
@totallyhuman I hope you can figure that out
;-;
oh i'm an idiot
18:47
@LeakyNun I have no clue
I mean, obviously it'll be smaller than N/2
oh, I mean the literal search space
I still am not sure
in other words, name a larger family that the list [9,10,11,...,16] belongs to
Lists that sum to 100? List of consecutive integers?
the latter.
what if I told you you can generate the latter with one byte?
18:49
RẆ?
what i don't need to take the range
how does that work
@DJMcMayhem right
Oh, just
:o i'm getting closer
OK, so that helps a little, but the list doesn't necessarily start with 1
18:50
@DJMcMayhem so?
ok so i have a list of lists that sum to n
now i need to find the largest of em
max(l,key=len) :P
Wait, why is the depth of all messed up?
@DJMcMayhem ?
singletons are printed as the element itself
wait a minute
18:54
@totallyhuman maybe you can keep that to yourself, since there are others doing the same challenge, thanks
oh was that supposed to be a spoiler?
sorry
@LeakyNun I finally got it in 11!
Should I post my solution, or is that a spoiler?
post it as a link saying it's a spoiler
I golfed a byte off too
Can it be done without the helper link?
@DJMcMayhem of course
19:01
Hmmm
a newline followed by a naked Ç is a nop
often
Oh duh: spoiler Try it online!
OK, next question. I use the same character twice. Can I get rid of that?
you're essentially doing filter
Then why doesn't spoiler work?
@DJMcMayhem I hope you can figure that out yourself
19:06
I don't think I can, but I'll try
@totallyhuman congratulations
19:23
@LeakyNun I give up
Mostly because I have a hard time understanding what constitutes a link
I looked at totallyhuman's solution, but I don't entirely understand it
alright
So ¥ groups and S= into a dyad?
Or wait, would it be ẆS and =?
@DJMcMayhem no
still no
would this be more legible?
Yes, much
Woah
Okay, so it groups S and =. But why does that have to be a dyad?
[i==n for i in sum(combinations(n))]
19:29
But if you call that link monadically, it would pass N as the left and right arguments, right?
no because you call on N
the left argument is the list being filtered
so the left would be the combinations and the right would be N
ninja'd
@totallyhuman nope that's wrong
[sum(i)==n for i in combinations(n)]
@DJMcMayhem a monad only has a left argument
19:46
@LeakyNun I meant as the right argument to the = dyad
@DJMcMayhem a monad only has one argument
I know
if you combine S and = to become a whole monad
then the list would be the right argument to =
because the list is the "right argument" of the monad
Oh I see the issue
It's because the current value is the list, not N
19:49
But I still don't get why the original one doesn't work
(Original being this)
Because Ðf modifies
you need =⁸$ instead of =⁸
but then the result would be trivial
because you're filtering on a list of sums...

« first day (80 days earlier)      last day (2592 days later) »