« first day (3552 days earlier)      last day (36 days later) » 

3:40 AM
@RedwolfPrograms MAlbolge
 
 
4 hours later…
7:19 AM
How to answer difficult question:
> follow question
> wait for kevin cruijssen answer
> wait for explanation
> Write a port of it
Profit!
 
It doesn't work for more difficult questions though
 
7:43 AM
hmm well only works when kevin answers it obviously
there's always a catch
 
RGS
8:29 AM
Hello all ○/ I'm about to post this challenge to the main site and was wondering if anyone has any last minute comments/suggestions:
0
A: Sandbox for Proposed Challenges

RGSWhat valence does this APL train have? code-golf sequence decision-problem apl Context In APL, trains are tacit sequences of monadic/dyadic functions that can be called with one or two arguments. We'll code something to check if a given train follows the correct structure we need in order to have...

I'm explicitly asking for feedback because the sandbox post was dormant for a long time and probably this is the best idea to draw some attention to it.
 
8:55 AM
0
Q: Accepting my first answer, things to consider beyond byte count with a tie on "shortest code wins" question?

uhohMy first ever question Find all integer pairs that produce a given Loeschian number was a straightforward code-golf tagged problem. I copied the format from an earlier related question, including the line: This is code golf so shortest code wins. In this case it seems that when I'm ready and ce...

 
 
1 hour later…
9:58 AM
@NewMetaPosts answered lol
 
3
Q: What valence does this APL train have?

RGSContext In APL, trains are tacit sequences of monadic/dyadic functions that can be called with one or two arguments. We'll code something to check if a given train follows the correct structure we need in order to have a sound train. Task Given the sequence of function arities in the train, deter...

 
10:14 AM
Does anyone think this has potential to be turned in a serious challenge or nah
 
10:54 AM
@NewMetaPosts Potential duplicate? The new question seems to be a better quality question, so maybe we close the older question as a dupe of this?
 
0
Q: Is a coincident point in a pair of rotated hexagonal lattices closest to the origin?

uhohPreface This is a code-golf question where the technique must search or exclude from search all possibilities. As soon as I figure out how to pose it, there will be a separate code-challenge question for mathematical techniques other than a simple search, so please don't use them here. Below is q...

 
 
1 hour later…
12:43 PM
@Lyxal might have a chance
you could change it to "if there's no input, delete the program"
 
No wonder the link doesn't work, it was posted
 
@Adám Done, I think it should work. (I thought it was an RO feature not a mod feature, or that only write access for private rooms)
 
@HyperNeutrino You need 20 rep to chat, or have a mod grant you access
 
1:39 PM
@HyperNeutrino Yup, I can see that. (^)
 
Oh, okay. So write access for ROs is only for private rooms, and the rep limit can only be bypassed by mods. Got it, makes sense :D
 
@HyperNeutrino Not really. I think ROs with high rep should be allowed to grant access to low-rep users.
 
@Adám The 20 rep requirement is to avoid spammers, and most of the ways to get around spam restrictions on SE require mod intervention, so it's consistent with their policy, even if it may not make the most sense
 
I think I could make arguments for either only letting mods do it or letting the owner of the room themselves make that decision, because it's just for that room, right?
 
Exactly, and it is highly unlikely that a high-rep RO would intentionally let in a spammer. And if they do it by accident, they have the power to kick and clean up.
 
1:52 PM
Like I don't think there's a way to allow a user to use chat in general, only to give access to specific rooms?
in which case I think any RO can be trusted to manage their own room as they see fit
 
Yeah, I'm not saying it makes sense or I agree with the current policy, just that it's consistent with SE's other policies on preventing spam
 
 
1 hour later…
3:23 PM
if it takes 28 days to go from 28 to 134 and we assume it is doubling every x days, show code to find x.
I guess it's a CMC :)
 
3:44 PM
@Anush Python 3, 48 bytes: lambda a,b,c:a/log(c/b)*log(2);from math import*
finds the number of days it takes to double if it takes a days to get from b to c
 
@HyperNeutrino that's cool
the answer should be 12.3963231938 in this case if you want a sanity check
 
okay. yeah that's what I got too, both from the code and by hand
 
cool!
how come you can import after you use it?
 
Cause it's a function, the code doesn't actually get interpreted until it's called
So long as there's no syntax errors in a function, you can basically put anything in there and Python will only throw a hissy-fit when you try to run it
 
oh I see the import is outside the lambda
got it
 
3:49 PM
yeah. I only used a semicolon to paste into chat better but usually i'd put it on the second line for clarity
 
cool. thanks
 
i only import after so i can name the function in the header
 
I do like the fact that it means that, if your Python project is split into functions like PEP recommends, you can stick your imports as the end, which is 100% not PEP-friendly :P
 
:)
 
 
4 hours later…
7:59 PM
1
A: Sandbox for Proposed Challenges

Wheat Wizard The goal of this challenge is to fill a niche that is mostly lacking on this site. In my observations there most parsing verification challenges fall into two categories: Super easy parsing. This parsing can usually be done with a regex, and regex based answers usually do well. Super complex...

 
@NewSandboxedPosts This looks really interesting, but I have no idea how to even approach solving it :P
 
@cairdcoinheringaahing Heh, finger on the trigger for that 1-byte APL solution…
 
@Adám Well, as far as I can tell, Jelly doesn't have a builtin for this, so APL might take the crown within minutes :P
 
8:35 PM
@Adám starts timer
 
0
Q: Calculate the inverse of a matrix

caird coinheringaahingSomehow, we don't yet have a challenge for finding the inverse of an arbitrarily-sized square matrix, despite having ones for 3x3 and 4x4, as well as a more complex version. Your task is, given a square \$n\times n\$ non-singular matrix \$M\$, output the matrix \$M^{-1}\$ that satisfies $$MM^{-1}...

 
Almost finished a controller for Political Simulator. Any final feedback?
 
 
1 hour later…
9:46 PM
@cairdcoinheringaahing 12 mins until RGS answered.
 
 
2 hours later…
11:37 PM
Q: A challenge asks a task A, requiring answers to fetch thing (e.g. time). Someone asks in the comments: If thing is impossible in our language, can we take thing as input?" The question goes unanswered. Is it acceptable to post an answer in a language unable to do thing, but that takes thing as input, and the answer assumes the answer to the comment is yes?
 
I'd personally refrain from posting such an answer.
I guess it's similar to an answer that uses a questionable I/O format that OP didn't explicitly allow.
 
Understandable. I'm genuinely 100% torn over this, especially because the question I'm considering already has at least 1 answer that takes thing as input and 1 different answer that does so but is deleted, after someone pointed out that thing should be generated by the answer, not taken as input
Honestly, I might post this to meta
 

« first day (3552 days earlier)      last day (36 days later) »