« first day (4157 days earlier)      last day (678 days later) » 
00:00 - 15:0015:00 - 21:00

12:00 AM
e.g. in jelly, you can usually use a segfault if you need to
 
att
wouldn't transpose be better to have than zip?
 
@att we can have both
 
att
zip is basically just a transpose though
 
no because it pairs
you could always zip then flatten
 
att
12:04 AM
I don't follow
 
zipping 2 lists then flattening the result is a transpose
 
att
zip(a b c, d e f) is the same as transpose((a b c,d e f)), no?
 
nop
zip = [[a,d],[b,e],[c,f]]
 
what is zipping
 
att
I assume like in python
 
12:06 AM
yep
 
att
I don't see how it's different from transpose then
 
transpose makes [a,d,b,e,c,f], zip makes [[a,d],[b,e],[c,f]]
 
att
that's not what a transpose is
 
no, transpose of [[a, b, c], [d, e, f]] is [[a, d], [b, e], [c, f]]
 
its not?
 
12:09 AM
you google "python transpose", what you get is zip(*mat)
so zip == transpose
 
hmm
ok then
ill keep calling it zip tho
 
@Seggan where are you getting this from lmao
 
why is it called zip
 
becuase vyxal
@UnrelatedString my brain
 
think of the elements as the teeth on a zipper except also think of the teeth on a zipper as being paired instead of staggered
 
12:12 AM
i suppose but also thats really dumb :P
 
isnt transpose some matrix thingy, never knew it was a code term as well
 
it's the same thing
 
@UnrelatedString That is... not a good metaphor
 
@AidenChow it's "using matrix in code" thingy :P
 
att
reason I suggested transpose over zip is your current zip only acts on 2 lists
though, that naming might lend itself to different conclusions in edge cases
 
12:15 AM
like what, ragged lists?
 
att
yeah
 
when will this be resolved?
15
Q: Repost "Word stays a word after taking away a letter"?

mathcat"Word stays a word after taking away a letter. Repeat" was a massively downvoted question, not because of challenge, but mainly because it was badly written. Personally, I think that the idea is great and it still has scope for many new answers, as it currently only has 4. I think that we should ...

 
It has moderate support, so, whenever mathcat gets around to doing so
 
can ijust repost it
or do we have to wait for @mathcat
 
why u want to repost it ?
 
12:30 AM
Given that mathcat was the one who asked, the general "who gets to repost is?" goes Hubert Grzeskowiak (original poster), mathcat, then someone else
Strictly speaking, mathcat should ask Hubert if they'd like to repost it, but we generally let the person who asked on meta repost the challenge when the OP is no longer active
 
@cairdcoinheringaahing well they kinda active on SO it seems like
 
@UnrelatedString polyglots
 
@AidenChow Then it might be worth asking them @mathcat
 
1:00 AM
Sandbox posts last active a week ago: Race some Robots, Parenthetical names
 
@NobodyNeedsNames I'll get around to adding a controller, namely, once it's finished, along with an example round. No need to leave reminders
 
OK...
@cairdcoinheringaahing The question is when will it be "finished"
 
As unhelpful as an answer as it is, it'll be finished when it's finished
Personally, I'm in no rush to finish it, so it'll be done during my free time in the future
 
1:16 AM
ok. I'd guess 1yr.............................................
 
1 year? That's optimistic, I've had a KOTH in the Sandbox for 5 years now :P
Also, I chose to keep the board the same to avoid bots being overcomplicated. Already, I suspect they'll be super complex (or super simple), and changing the board will lead to even more complexity
 
@cairdcoinheringaahing which one
 
@Seggan A and a could be python's all and any
 
@cairdcoinheringaahing ok
 
@cairdcoinheringaahing except if your language doesn't error on division by 0
 
1:27 AM
im all for a 1 byte exit
 
0
A: Sandbox for Proposed Challenges

caird coinheringaahingMonopoly KoTH king-of-the-hill game python This is going to take me a while to finish and may never be fully done. Don't expect this to be posted anytime soon. However, this will be an ongoing project under development. Who hasn't heard of Monopoly? If not, don't worry, as I will expla...

 
@thejonymyster python: "
 
that exits before the program starts though right :P
 
I should find the controller program for that tbh
 
> because I'm British and proud of it!
downvoted /s
 
1:29 AM
Yeah, not proud of it anymore :P
Got some rewriting to do tbh
 
@cairdcoinheringaahing is that wip or just dead...
 
More or less dead
 
aw what cries i didnt notice hte date til now
i was excited LOL
 
It is 10 days away from being 5 years old lol
> Member for 5 years, 3 months
That's close to being one of the first Sandbox posts I ever made
 
> Over the winter, he swaps his Stack Exchange hat for a Santa hat.
what's his SE hat?
I just realized you have 200 answers @cairdcoinheringaahing
 
1:33 AM
On meta? Oh cool
@NobodyNeedsNames I'd need to find it, I think I've saved it somewhere on my computer :P
 
@cairdcoinheringaahing haha
help me revise this
36
A: What are our specific abbreviations and terms?

AdámSee also Stack Exchange Glossary - Dictionary of Commonly-Used Terms. Abbreviations marked with a star (*) are chat specific. ATO: Attempt This Online; a website similiar to TIO where newer versions of languages are hosted. Created by pxeger. *The Bakery: The Nineteenth Bakery, the room where spa...

 
Trust me, I keep a close eye on edits to that :P
 
ttthhhaaannnkkk yyyooouuu
 
You know something's gone wrong when you're triply currying functions... in Python.
 
1:48 AM
@emanresuA Only thing worse is quadrupled curried functions in Jelly :P
 
@emanresuA do I even want to know
 
Jelly doesn't even have first-class functions
 
2:04 AM
haha
 
4 slowpokes moved to Pokeball
 
2:23 AM
@emanresuA i never curried functions in python once
 
2:34 AM
i cant even think of a sensible way to curry a function in python
like i suppose youd have to write something like return lambda a: blahblahblah but i cant think of any reason youd actually need to do that
 
You write something like that when you write a decorator
 
2:47 AM
Yeah, that's what I'm doing
 
why would you need triply curried one though
 
Because I have a decorator that takes an argument and modifies the function's return value
So the signature's something like:
def decorator(config):
  def inner(func):
    def inner_inner(*args,**kwargs):
 
I mean it should be at most doubly curried, not triply
 
Oh, is that doubly curried? Okay.
 
3:07 AM
Apr 5 at 9:52, by pxeger
hyper-neutrino has become the flag of San Marino
 
3:52 AM
@emanresuA kinda wish jelly (and flax) had that ..
@cairdcoinheringaahing flax, 3 bytes: 1²ⁿ
 
4:20 AM
0
A: Sandbox for Proposed Challenges

thejonymysterRemove the unaverageables Related. Given a list of 3 or more positive integers, remove every number X for which there is another number Y in the list and the average of X and Y is also in the list. The average of two numbers is their sum divided by two. Examples: input => output explanation [1, ...

 
4:31 AM
what would i search to find more answers in this language, \/\/>
 
searching for "/worm" (which is part of the lang's url) on SEDE might work
SE search is too weak for that
 
i don't think there were that many answers in that lang, mostly just by the author
i think i might have posted one
 
4:57 AM
thank you, i find it very pleasing to look at :P
 
and i feel like that would be graded rather harshly as a bad-faith attempt to avoid answering the question :P
 
why is that homework help?
+ how can i know if my classmate (or anyone) registered?
@emanresuA why is it hw (i;m not saying it shouldn't be moved
i was just about to say someone move it actually
 
um, no
Is this a pure set?
{{},{}}
@emanresuA .
 
att
no
that's not a set
 
"a set is an unordered group of unique elements", so no
 
yah
just to make sure
there is a definition for sets in math that allows dupes
 
that is called a multiset
 
6:10 AM
oh goood thank yooooo
 
6:24 AM
@emanresuA May as well post then. Tags?
 
@emanresuA I suppose specify whether you want that exact string representation, or what kinda leeway there is there
 
oh yeah that's a good idea
 
6:41 AM
currently trying to figure out how to actually solve this problem
 
i continually hate that {} in python is an empty dict and not an empty set
 
It kinda makes sense given that dicts are more fundamental in Python
 
oh you cant even nest sets, there goes that whole train of ideas
 
but I agree. basically sets should just have their own syntax that's completely separate
 
6:48 AM
@des54321 were you thinking of brute forcing over strings of {,} with eval as a validator
 
@UnrelatedString not even yet, im just trying to manually make the first however many terms of the sequence to see if i can find a related OEIS entry, and i wanted to use python to validate whether I had typed the same set twice
because {{{},{{}}},{{{}}}} and {{{},{{}}},{{}}} look a lot alike
 
ah
...there's probably a lot of different ways to order an enumeration of all pure sets and i wouldn't expect a ton of them to be on oeis even if you do guess the encoding right so good luck
but also good idea
 
my thought is that we can group pure sets into groups of different "depths", and the number of sets on each depth might be a useful sequence
 
i feel like the easiest approach would be to recur with some notion of "thickness"
like for every positive integer thickness you generate sets the elements of which have thicknesses that yeah that's sort of what i'm thinking of
though strict "depth" would not solve much
 
att
there's an easy approach you're both missing, I think
 
6:53 AM
I already have a pretty elegant answer
 
@att if yours is the same as mine, let it be a good old-fashioned FGITW shootout
 
att
I've got a good idea but the implementations have all been ugly
:)
 
depths 1,2 and 3 are all trivial, as depth one is just {}, depth two is just {{}}, and depth 3 is just {{{}}} and {{{}},{}}, but im pretty sure there are 11 sets at depth 4
 
6:55 AM
@des54321 depth(n+1) = 2^(sum for i from 1 to n-1 of depth(i)) * depth(n)?
 
^
at depth 4 you just have sets of all sets of depth 3 or lower, etc.
 
but you need to include at least one of previous depth
 
yeah I just realised that
 
...and that's not how combinatorics works
 
yeah, any set of depth n has to include one set from depth n-1, and can contain any other sets of lower depth
 
6:57 AM
@Bubbler yeah I just realised that ;)
@pxeger depth(n+1) = 2^(sum for i from 1 to n-1 of depth(i)) * (2 ^ depth(n) - 1)
 
should be this
 
huh looks like i missed a set of depth 4, not surprised honestly
 
(any subset of all sets up to depth n-1) - (any subset of all sets up to depth n-2)
= (any subset of all sets up to depth n-1, containing at least one of depth n-1)
 
Posting in one moment
 
and its cumulative sum is nicely 2^(previous term)
 
7:02 AM
0
Q: Enumerate all pure sets

emanresu AIn set theory, a set is an unordered group of unique elements. A pure set is either the empty set \$\{\}\$ or a set containing only pure sets, like \$\{\{\},\{\{\}\}\}\$. Your challenge is to write a program that enumerates all pure sets, in some order of your choice. Standard sequence rules appl...

 
att
yours is better
 
yours is pretty neat too
 
That was some very quick FGITWing :P
 
att
I got hung up on finding the length for the list comp
 
Yeah, you don't need to worry about taking too many bits, and the number of bits of x is always <= x
 
 
1 hour later…
8:31 AM
@xnor If you want to fix the md in your bounty (there's an extra space) I can refund it for you. Or you can leave it whatever you prefer.
 
8:43 AM
According to my Marshal badge progress, I've raised 54 helpful flags today. According to codegolf.stackexchange.com/users/flag-summary/97857, all of them were comment flags. My daily limit for comment flags was 49 today. What happened?
Is this just eventual consistency being inconsistent?
 
@pxeger And/or your limit got upped by 5 because you raised 50 more helpful flags
Idk if it's smart enough to do that
 
Can the limit get upped during the course of the day?
I thought it only happened once per day, at the start of the day
 
¯\_(ツ)_/¯ It's a plausible explanation
Why the heck is there a TI-BASIC FANDOM???
 
Fandom is just used as a place for communities to set up their own wikis
 
I guess :P
 
9:15 AM
@emanresuA I found this: meta.stackexchange.com/a/83712
> If flag weight goes up during the UTC day such that max increases, you will receive the additional flags before the increase to max at midnight UTC.
flag weight no longer exists, but I suspect the idea of getting an increase during the day may still be around
 
Makes sense ish
 
 
1 hour later…
10:26 AM
@pxeger I thought that once a flag is marked as helpful it no longer counts towards your limit for the day. That would at least make sense.
 
Maybe it's that
but it would have to still count flags that are automatically marked helpful, because most of my flags were those
 
I mean that does kinda make sense, because they're marked helpful, but mods can still go back and invalidate them (right?)
Jun 14 at 9:47, by pxeger
@forest I guess mods can probably see those flags though, to check they were indeed valid?
 
If I can I don't know how.
 
10:30 AM
Yes that I can do.
But I cannot generally see what flags have been recently accepted / rejected.
 
oh, you can see them, but you can't retroactively invalidate them?
 
Let me see.
Nope.
I can't even undelete comments.
 
So if I write a genuinely helpful comment, but it contains the word "thanks", then a malicious user could unanimously delete it??
 
Maybe. It might also require that the comment be under a certain length.
 
Yes, I've seen that, and I've been trying to work out what that length limit is
I think it might be 50 chars
 
10:39 AM
But yeah it seems if you do write a genuinely helpful comment containing "thanks" anyone can delete it and there's nothing a mod can do.
 
I guess it's not too hard to just rewrite your comment
 
its also not hard to reflag it
 
you could rewrite it without using the word "thanks"
or put a zwsp in the middle of the word or something
but that would require knowledge of how the comment was deleted
in fact, you're unlikely to even notice your comment being deleted at all
 
that's true
 
10:57 AM
i got an idea that will work but idk how to implement it
ngn/k in paste
 
11:12 AM
Probably doable
The hard part is understanding ngn's code
 
yeah
so i gave up cause i can't do this on a phone
will try later
@emanresuA it will be epic if it works
 
It's a matter of exposing the correct memory and interfaces to k.wasm
Which is easier said than done, thanks to ngn's programming style
The world only needs one Arthur Whitney
 
11:27 AM
Why does SE keep going down for about 5 seconds at a time, every now and then?
 
11:58 AM
@emanresuA CORS
 
Frick.
 
@cairdcoinheringaahing I think they‘re still active on SO
I might contact them
 
@emanresuA wait ... i think i can do oK
 
I can‘t now, though
 
@emanresuA i need to know the interface for oK
^ incomplete
but should work
 
12:11 PM
Cool, o/
 
12:36 PM
I know how to optimize an answer on a problem by 1 byte. Should I create a new answer or leave a comment under the answer ?
 
Typical etiquette is to leave a comment
 
OK !
 
but if it's a particularly novel or non-obvious improvement, you could post your own answer
 
It's kind of obvious. The answer is just old and with ruby 2.7 you can use _1 you can win one char
 
Oh yeah, then you'd leave a comment
although often people aren't that interested if it uses a language feature that wasn't around when the answer was originally posted
 
12:42 PM
Thank's :)!
 
I was talking of another thing
 
I annoyingly mistyped my comment
I meant: minimise the number of non- alphabetic characters
 
Ohhh yeah I didn't saw that it was the response with the less :O
 
sorry, my mistake
 
12:50 PM
I thought it was the opposite
Well at least ... I done a golfing answer..
 
@emanresuA got it working
 
all in all that /[a-z]/ challenge seems to have gone over well, though im sad i didnt get to see too many keyword heavy answers y_y maybe allowing whitespace not to be counted would have helped? alas
 
That Perl "dialect" which only allows keywords could be interesting, yeah
 
mathcat must have gotten so much rep
 
i suppose the challenge is too simple to have any answers that would need too many keywords anyway
 
1:02 PM
 
hm, i wonder if "does this ascii drawing contain this shape" has been done yet
i.e. input a single shape made of ascii and a bigger ascii art with more shapes, and then decide if the shape appears in the art
 
@thejonymyster title it "Is This Loss?"
 
omfg yes
 
.:|:;
 
love to see it
but uhh
i guess one question before i sandbox; would it be obviously better one way or the other if
A) the shape had to not be connected to any other shape
B) the shape could be connected to any other shape
A) is more restrictive, idk if it matters though
if its not an obvious difference in question quality then ill just go ahead n start
 
1:08 PM
I think A is probably unnecessarily complex
B makes a nice simple challenge allowing potentially really interesting answers
although it might be a duplicate, I'd worry
 
nod (^_^)b ill scour the site a bit
 
check for possible pointers
 
aha, i didnt know about htat tag ty
the but is it art challenge seems to be a much harder version of B)
but id say that itd be different enough, still looking though
 
That's definitely different enough
 
this one is "does it have this one specific shape in a grid of different symbols"
wow i was expecting there to be way more challenges in this tag
 
1:23 PM
Do we have a challenge for "output truthy if the input is the same as your source code"?
 
alright im convinced its not a dupe for now :P
oh god defining this rigorously and concisely seems hard X_X
 
say "spaces match any character; non-spaces only match themselves"
presuming that's the idea you're going for
 
i may be too stupid to write this :P if youre itching to do it, this is your greenlight, but if not itll probably take me a bit
 
I'm not itching
 
i was thinking of having input only be the two distinct symbols
e.g. space and #
(and newlines of course but we dont talk about those)
lol the regex approach makes me think you could get some mileage out of using . as your blank character
should i roll with the assumption that the pattern shape is all one contiguous shape?
i.e. could never be # #
 
1:44 PM
@lyxal mind if i turn your sum of consecutive ints cmc into an actual challenge
 
sure
not that I remember which CMC that was
 
ty
 
and also it's probably AI generated anyway, so it's not exactly "mine" to control lol
 
Jun 10 at 14:38, by lyxal
AICMC: Given a number N, return the total ways to write it as sum of consecutive numbers.
 
@lyxal the one where i gave a 3 byte solution against your 9 bytes :P
 
1:47 PM
including the trivial N = N?
and also do negative numbers count too
 
1) yes
2) no
 
i say N=N should be optional, if you want my opinion
 
and I guess also not including 0?
 
which everyone always always does
 
because otherwise anything starting with 1 will have a duplicate, but with 0 prepended
 
1:52 PM
yea agree, no 0
 
yeah, thats what i assumed in the cmc too
@thejonymyster it actually made my code shorter
 
i mean optional to the solver yeah
cause you never know
"its golfier if i count them" vs "its golfier if i dont count them"
 
0
A: Sandbox for Proposed Challenges

thejonymysterIs This Loss? Given two shapes A and B in ASCII-art, determine if the A appears within B. (more spec to come? i'm not sure how to phrase this) Examples Shape B (will remain the same for the next few examples): # # # # # # # ########### # # # # # # # ### Shape(s) A (separated by ne...

 
@thejonymyster Bearing in mind the title joke, I think this assumption should be removed
I can't see many answers relying on it, and it makes for better clickbait
 
2:08 PM
Not sure I understand the title/clickbait factor in that assumption
 
the Loss image can be made better
 
oh lolol
the shapes in the contiguous loss are way more interesting though :P
 
 #       #
 #       #  #

 #  #    #
 #  #    # ###
 
and a shape perhaps appearing therein would be
#       #  #

#  #    #
right?
 
I was thinking the other way around
Given a shape, does Loss appear within it?
 
2:11 PM
oh, loss specifically?
if its loss specifically then its a dupe of the U bend imo :P
 
well no, but the example you'd give would have Loss as the input to find, not the input to have a pattern found within
 
well yea
the order doesnt matter
but uh hm
 
Order does matter
 
in that case, the other input would be
 
## is inside ####, but #### is not in ##
 
2:12 PM
no im like
words hard
#  #    #  #
#  #    #  #

#  #    # ###
#  #    # ###
so this might be input 2
i understand what youre getting at now
that is better clickbait
 
Do not underestimate the HNQ effect ;)
 
lol no of course i respect the drip i just didnt understand your plan
 
drip?
 
very good idea, will implement later (im at work and my supervisor is showing up in any minute lolol)
 
dang zoomers
 
2:15 PM
i think i used the wrong buzzword there anyway :P
 
@pxeger you clearly don't own an air fryer if you don't have drip
 
00:00 - 15:0015:00 - 21:00

« first day (4157 days earlier)      last day (678 days later) »