« first day (4180 days earlier)      last day (654 days later) » 

12:31 AM
@Adám why is בניין spelled with two yods?
 
0
A: Sandbox for Proposed Challenges

qwrConvert Descriptive Notation to Algebraic Notation chesscode-golfstring Many old chess books use descriptive notation to notate squares on a chessboard, naming the file (column) of the square based on the starting piece positions of White or Black, depending on whose move it is. The ranks (rows) ...

 
1:33 AM
 
1:46 AM
@DLosc Would it be possible to make Regenerate use iteration instead of recursion for repetition-by-quantifier? Currently {995} and a{993}, for example, crash due to a RecursionError: maximum recursion depth exceeded.
 
 
3 hours later…
4:38 AM
@UnrelatedString lol 4 bytes in flax
lol
(with flag)
 
 
1 hour later…
5:59 AM
0
Q: Typo resistant pin codes

Dennis JaheruddinBackground I was working on a system where for convenience (not security) people could use four digit codes to identify themselves. I figured this is something that may actually be useful in many real cases, yet is well enough defined that it could make a nice challenge! Explanation of pin codes ...

 
I feel like this is a dupe
 
 
2 hours later…
7:44 AM
In the Harry Potter books, how many sides does the centre of wizarding London have?
 
8:03 AM
That sounds like the setup to a joke
 
8:43 AM
^
 
8:58 AM
two, because its a di-agon alley!
 
9:16 AM
Do people actually use SE's bookmark feature?
 
Nope
 
10:11 AM
I do.
 
not really, ive only bookmarked one post lol
 
On a completely unrelated note, behold: My new programming font!
In which I now view literally everything!
 
dang nice
tho i dont think i can look at that font for more than a few minutes, its not for me ig lol
too blocky for me
 
Yeah, 'tis a joke. I do not think I can bear it for long myself, though I am its creator.
 
10:37 AM
hello fellow bitmap font creator :P
@pxeger i do
 
@pxeger only to make numbers go up
The follow feature is way more useful
 
@LeakyNun It shouldn't be. That's a modern Hebrew construct, probably to disambiguate from (the country) Benin, trying to indicate that י is a consonant /j/ here, and not standing for the vowel /i/.
 
 
1 hour later…
11:57 AM
(spoilers for my sandbox challenge): can someone tell me why this Jelly program works but this doesn't?
 
12:19 PM
i sense chain separators
 
12:33 PM
0
A: Sandbox for Proposed Challenges

JiříTransform characters of your choice into "Hello, world!" codegolf Challenge: Write program or function, which takes character as input and outputs character. Also create list of 13 unique ASCII printable characters (32-126). When elements of this list are fed into the program one by one, then the...

 
12:45 PM
@pxeger Use Ɗ instead of Ʋ
Because 2Ṣ€Ṣ is a LCC, the parsing will consume the next link before the 2 as well
 
1:32 PM
I see
btw has anyone else noticed that jelly's grouping quicks are ɗrei und ʋier
 
ʋ looks like a u to me
 
it also looks exactly like how I hand-write ν (Greek nu)
 
1:58 PM
0
A: Sandbox for Proposed Challenges

JiříInput program generating Fibonacci, output program generating Fibonacci code-golf fibonacci code-generation Challenge: You will have to write program, which outputs program, that outputs single Fibonacci number. You can also write two input strings - first is input to your program when it is firs...

 
2:28 PM
@pxeger That's intended :P
 
yes, I assumed so
I'd just not seen it written anywhere
 
I think Dennis' explanations refer to them as drei/vier, but that's more or less it
 
...that would make sense
 
@Zionmyceliaadamancy ah yes, e.g. codegolf.stackexchange.com/a/159916
 
I do like the fact that almost all of Jelly's "letter like" commands have corresponding "names"
 
2:32 PM
yeah
 
I don't like it at all, because I can't Ctrl+F the Atoms page for what I want unless I remember the quirky name Dennis gave it, in which case I would already know what command it is because the quirky names are mnemonic
 
the quirky names come with explanations; the problem is the explanations are too short :P
 
The underdot = inverse notation is also quite cool
e.g. "unhalve", "unbinary", "unord"
 
and also the explanations are just inconsistent
like the wiki page doesn't actually call unhalve
 
> Tighten; dump all lists inside z
I guess it's supposed to be like "tyten"
but if I'm searching for "flatten by one level", that's not helpful
 
2:35 PM
Tighten's always been one of those builtins where I know exactly what it does, but can never describe it
 
Vyxal has a pretty good idea with attaching "keywords" to builtins, so has the keywords "tighten, flatten, level, inside" or something
I think JHT search also does that, but it's not complete enough
 
Tbf, the Jelly docs are always in need of improvement
 
You can always just edit the wiki
it's a wiki for a reason
 
Yeah, but there's so much to edit :P
 
@Zionmyceliaadamancy i'd just describe it as "concat" :P
concatenate a list of lists
 
2:39 PM
But it doesn't really do that for non-homogenous arguments
 
oh wait what
 
lambda z: sum(map(iterable, iterable(z)), [])
 
It's more "reduce the depth of every element by 1"
 
so yeah it's concatenate a list of lists
with the usual list builtin behavior of treating atomic values as singleton lists :P
 
2:52 PM
0
A: Sandbox for Proposed Challenges

YousernameAll Possible Ties in Tic-Tac-Toe code-golf tic-tac-toe kolmogorov-complexity Your task is to output all possible ways to end a game with a tie (all rows, columns, and diagonals are completely filled and do not have 3 X's or 3 O's) in Tic-Tac-Toe (assuming X goes first): OXO XXO XOX OXX XOX OO...

 
My list of Jelly "letter-like" commands and their names beginning with the same letter: gist.github.com/cairdcoinheringaahing/…. Blank ones I couldn't think of one, there are some cheeky ones (eVal for V) and "underdot inverse" commands can have an "un" in front of the starting letter
 
I'm guessing y for translate comes from its use as such in sed and perl
 
i feel like eVal probably is where V is from
 
@pxeger i dont understand that lol
 
Probably, but I couldn't think of a "translate" version with y :P
 
3:06 PM
@Zionmyceliaadamancy Looks like it's just like .flat() or .flatten in most languages
 
@NoHaxJustRadvylf No, that's F
 
@NoHaxJustRadvylf its just ,/ in k
reduce by concatation
 
@Zionmyceliaadamancy That's deep flat though, isn't it?
 
@PyGamer0 drei is German for 3; vier is German for 4
 
.reduce((x,y)=>x.concat(y)) i think
 
3:07 PM
@NoHaxJustRadvylf yes...?
 
Not aware of any languages where .flat() is deep flat, that would be unusual
 
.flat() should, IMO, result in, y'know, a flat list
 
but who would name concat flat
 
@pxeger oh ... thats kinda cool
 
3:08 PM
(Ash uses "squish" and "crush" to differentiate them and use less es :p)
@UnrelatedString concat to me takes two lists and concats them, not a list of lists
 
you're telling me... the english language is ambiguous??
 
concat to me is Foldable t => t [a] -> [a] because concatenating two lists is ++ :P
 
@Zionmyceliaadamancy But that's nowhere near as useful in many situations, it's slower, and sometimes some smartass pushes a list to itself
 
@UnrelatedString nah, shallow flat is called (>>= id), clearly!
 
i am using :P too much
(>>=id) is just the better of several Foldable t => t [a] -> [a] :P
that was confusing
 
3:11 PM
My message was ambiguous, so I disambiguated it... wrongly...
 
3:25 PM
Always fun when you edit to correct something and end up making it wrong lol
 
 
2 hours later…
5:36 PM
CMC: Given positive integer n, return the smallest prime number greater than or equal to n. e.g. (input,ouput) = (1,2), (2,2), (3,3), (4,5), (15,17)
 
Y'know I was wondering why my server started acting up when I made a 2 GB ramdisk
Turns out it was a 2 TB ramdisk
RTO is off to a great start (or middle, I guess)
Huh, hovering over a deleted message still shows what it was a reply to
 
@LeakyNun Jelly, 3 bytes: ’Æn
Brachylog, 2 bytes: ≤ṗ
 
5:53 PM
@LeakyNun Catstruct, three bytes: (a bunch of binary representing "[find] in [infinite list of primes] a number [greater than or equal to] the input")
 
@NoHaxJustRadvylf can you give me a link to catstruct docs?
 
It's not implemented yet, and the operators aren't finalized yet, but gist.github.com/Radvylf/73d14cbd5812205bdfbe4c2fe1b89234
 
6:05 PM
@NoHaxJustRadvylf looks cool!
 
Thanks! Hopefully I'll get around to implementing it someday
 
6:20 PM
@LeakyNun ECMAScript 2018, 67 bytes: (x*?).*$(?<!(?=(?=\4*(x+))(?=.*(?=\4)\2(x*))\3\4*(?<=^\1))^.+(x+x)) - returns result-N in \1 - Try it online!
The largest prime less than or equal to N is obviously much easier, (?!(xx+)\1+$)xx+ (16 bytes)
actually 64 bytes, (x*?)(x*)$(?<!(?=(?=\5*(x+))(?=.*(?=\5)\3(x*))\4\5*\2$)^.+(x+x))
 
@Deadcode how do you return a result longer than the input??
 
60 bytes, (x*?)(x*)$(?<!(?=(?=\6*(x+))(?=\5\3(x*))\4\6*\2$)^(x+)(x+x))
@pxeger I don't. I'm returning result-N
 
ah
 
That's the golfiest output specification, but I could do (result/2, result%2) as two capture groups also
 
6:46 PM
CMQ In python, what is a golfed way to iterate over all triples of non negative integers that sum to 100?
 
Ah yes :)
How about doing it quickly?
I forgot about wasteful golf solutions for a crazy moment :)
 
Just start with the smallest number the first number could be, 0, and find all pairs that add up to 100. Then do the same for 1 snd 99, and continue up to 100.
 
@LeakyNun and Regex (ECMAScript+(?*) or PCRE2), 63 bytes: (?*(x*?)(x*$))(?!(?*(xx+)(x+$))(?=\3*(x+))(?=\4\5(x*))\6\3*\2$) Attempt This Online!
 
@NoHaxJustRadvylf I like it
That is nice and clean. Thank you
Anyone want to try to golf that?
 
7:01 PM
@pxeger 55
 
@graffe JS: _=>[...Array(100)].flatMap((_,i)=>[...Array(x=100-i)].map((_,j)=>[i,j,x-j]))
 
@UnrelatedString ooh
@NoHaxJustRadvylf is that python?
 
No, but it can be ported pretty easily
 
True
Thanks so much all
 
@NoHaxJustRadvylf that's pretty much exactly the same as unrelated's
 
7:04 PM
Problem fully solved now by the chatroom geniuses
 
@pxeger Ah
 
geniuses?
it's not a very difficult problem
 
is flat map some kind of concatmap
python doesn't really have that but it also doesn't like normal map in the first place
but you can also use comprehension syntax for that kind of thing
yeah
 
@pxeger that's not your fault :)
 
@UnrelatedString JS's flat is shallow flat, for obvious reasons, and flatMap is map then flat (which comes in handy way more often than it seems like it would)
 
7:06 PM
i can see why it would come in handy a lot :P
 
@pxeger I guess I could have asked for a general solution for x-tuples
 
considering that's pretty much the entire premise of haskell's default monad instance for lists
 
0
A: Sandbox for Proposed Challenges

thejonymysterpattern-matching sequence code-golf Find all matches for the digit pattern In an older challenge, you were tasked with finding numbers which, in base-ten, matched this specific digit pattern: (n)(x)(n+1)(x)(n+2)(x)(n+3) etc... Meaning any number between 4 and 18 digits long such that the digits ...

 
@graffe that's what I based my answer on - to be easily adaptable to different sizes
 
that you can use it to pretend you're writing prolog
 
7:07 PM
@pxeger cool
 
but it's also not too hard to adapt unrelated's method to that either
 
@pxeger would you mind showing how?
 
You'd just add more comprehensions/maps
Keep iterating from the sum of the previous ones to 100
 
@NoHaxJustRadvylf oh yes I see
Thanks all
 
@LeakyNun Regex (ECMAScript 2018 or .NET), 55 bytes: (x*?)(x*)$(?<!(?=(?=\5*(x+))\4\3(?<=^\2\5*))(^x+)(x+x)) Try it online!
 
7:11 PM
@graffe [(a//100,a%100,100-a//100-a%100) for a in range(10000) if 100>=a//100+a%100] or [(a,b,100-a-b) for a in range(100) for b in range(100) if a+b<=100] depending on context
don't know which one is shorter
 
actually the second one can become [(a,b,100-a-b) for a in range(100) for b in range(101-a)]
 
cool
 
wait isn't that verbatim what i had
aside from the range for a
 
Yeah that's now three of us that have arrived at the exact same thing lol
 
7:15 PM
@NoHaxJustRadvylf :)
 
@hyper-neutrino Could you please unfreeze Mathematical Regexes? :-)
 
@LeakyNun second one's shorter; first one can also be golfed to (h:=100)and((a//h,a%h,h-a//h-a%h)for a in range(h**2)if h>=a//h+a%h)
 
h**2 is h*h
 
oh true
 
@Deadcode done :)
 
7:18 PM
Thank you :)
 
CMM: Opinions on snippets for input-less deterministic challenges?
 
...though discarding that entirely to bring the assignment inside seems to be a bit shorter
 
Having to include a _=> or lambda feels kinda pointless for those
 
kinda funny you aren't allowed to assign in the iterable expression but it's fine in the condition
 
7:39 PM
 
7:56 PM
@LeakyNun Vyxal, 3 bytes: Try it Online!
Basically builtin
 
@Steffan is it isomorphic to the jelly answer
 
I guess so
should be <ÅN in 05ab1e
 
This ECMAScript Regex answer somehow flew under the radar... it could use a bit of attention: Semidivisibility
What the heck.
 
8:12 PM
Some people don't like people bringing attention to their posts in chat
 
Maybe I should just retire from CGCC. It's too stressful having answers I spent significant time on languish with 0 votes.
 
Personally I'm on the "good answers that took a lot of work are good and you deserve to show them off" side, but there's plenty of people who look at rep/upvotes as competitive and would see that as "cheating" or whatever
 
Every time I come back after a while, I go through this. It's nice for a while, but then I get stressed about the answers that got ignored.
 
i feel u, i have answers that ive spent quite a while on but get 0 upvotes, but some random answer that i post that i spent less time on gets a bunch of upvotes for no reason
 
Unfortunately the question-centric model we inherited from SO just isn't very good at fairly bringing attention to good answers :/
I think we should normalize posting answers we're proud of here. Not everyone doing that is just farming rep for the +10 dopamine spike, we're a community that enjoys coming up with cool and sometimes time-consuming answers, and showing them to other people, and sharing them more directly in chat is in almost every way a good thing.
 
8:16 PM
@NoHaxJustRadvylf i have quite a few of those lmao
i think its often becuz i spend a lot of time on some answer for some q that is just posted but then ppl arent really looking at the q anymore when i actually post an answer, so i get 0 upvotes
 
Yep, that happens to me a lot especially because I'm mainly interested in writing pure-regex answers, and the vast majority of questions can't even be answered that way. Since pure regex isn't Turning-complete.
So I have to go back to older questions to even have something that can be answered in pure regex.
 
@Deadcode stop golfing for some random internet points?
 
@Seggan Well, I'm sure this is preaching to the choir, but: I don't just do it for the points, I do it because I enjoy it. But the enjoyment alone isn't enough; I need to share the golfs for it to feel worthwhile.
And I crave more than just golfs, I want some mathematical advancement to happen in the field of pure regex.
Bringing attention to it with golfs might just accomplish that eventually.
 
8:38 PM
@pxeger ooh that's clever!
Remind me, what does ~-x do again?
 
att
x-1
 
Thanks. So why use it? It's the same length
 
att
in this case, no real reason
but for example it binds more tightly than division
 
in some cases it saves on parentheses
 
Fair enough :)
 
8:47 PM
but here it just looks cool
 
It's quite confusing code
Just this part. [[n]][x-1:]or. when is this Falsely?
 
att
when it's empty
 
when x is greater than 1
the slice produces an empty list
 
att
it's pretty idiomatic in python golf
 
Thanks
So what does the ~ operator mean?
 
8:58 PM
bitwise not
 
Ah!
It all makes sense now :)
 
att
negated increment ;)
 
:)
 
9:19 PM
CMC: Given two positive integers n and s, find the number of tuples of integers (x1, ..., xn) such that 0 <= xi <= i and x1 + ... + xn = s.
e.g. (4,8) -> 9 because 8 = 0+1+3+4 = 0+2+2+4 = 0+2+3+3 = 1+0+3+4 = 1+1+2+4 = 1+1+3+3 = 1+2+1+4 = 1+2+2+3 = 1+2+3+2
 
9:42 PM
What is i?
 
the index of each integer in the tuple
 
in your example, 0+1+3+4 and 1+0+3+4 are duplicates
 
ordered tuples
 
oh nvm
 
Jelly, 9 bytes: Ż€Œp§ċ
*6
how did i type 9
 
9:51 PM
where is the script for question leaderboards
 
Vyxal, 14 bytes: :ʀ↔'∑⁰=;'ż≤A;L
argh lemme port u
5 bytes after seeing Jelly: vʀΠṠO
 
@UnrelatedString Check out my mostly-dyadic links 17 byter :P
Aka, complete brute force :P
 
also, ive got a quite short answer to this in Fig: M's'$w. only 4.939 bytes
could shave off 2 chars if it wasnt for the word list input instead of a word
 
there are two monads
i feel lied to
gorgeous though
 
@UnrelatedString 1 monad, the L{ is dyadic :P
 
9:56 PM
What L{? It's }L :P
 
Ż, S,
though i guess you could count both of the last two out since they're not top-level monads
 
Those are in dyadic links
 
Hang on, lemme try it with all dyads :P
 
9:57 PM
ahahah
 
@LeakyNun Fig (theoretical), 6.585 bytes: tmP'#>#!. feels way too long
take from primes while the input num is greater
 
best i can think of to replace Ż is +Ƒ;ḷ€
 
...oh
actually no it would have to be r,Ƒ in case the arguments are equal
 
dyadic chaining for everything is hard :P
 
10:09 PM
yeah
lkmao
can actually get rid of S for free funnily enough
S=¥Ƈ -> _ƒÐḟ
 
I like ċi to count zeros, as i returns 0 for all pairs of flat lists: Try it online!
 
nice
can replace the last +/ with +ƒ,Ƒ for maximum dyadicity but the first +/ is a bit trickier
 
My bad, has to be 25 bytes
@UnrelatedString Replace >+/ċiʋ€ with >+ƒiɗċiɗ€
 
10:22 PM
perfect
 
29 bytes and every single link and sublink is dyadic :P
 
10:51 PM
oh 26
not sure how it took me this long to actually parse that bit :P
like how it spells ċiɗ€ṛ now
 
@UnrelatedString Nice :P
 
Fun fact: Jelly has exactly 69 single byte dyads :P
 
nice
 
11:10 PM
Vyxal has 66 :P
 
Isn't «Ƒ€ a monad
Oh nvm, I guess it is a dyad
 
Ƒ takes the arity of it's link
 
@Steffan Fig has 0 :P
 

« first day (4180 days earlier)      last day (654 days later) »