« first day (2820 days earlier)      last day (2027 days later) » 

12:02 AM
0
A: Sandbox for Proposed Challenges

DanielMarriage Logic Gate code-golf logic-gates I saw this funny meme on instagram that describes 𝒯𝒽𝑒 𝑀𝒶𝓇𝓇𝒾𝒶𝑔𝑒 𝐿𝑜𝑔𝒾𝒸 𝒢𝒶𝓉𝑒. Your job is to create a function or program to implement this logic gate. Input A true/false or 1/0 tuple. Output Print out "Woman is Right" or "Man ...

 
 
5 hours later…
4:45 AM
Hooray my half-a-year-old powershell issue got closed as a duplicate of a year-old issue with no comments or work done
 
 
2 hours later…
6:26 AM
0
Q: C++ program using an array of strings

Humma ZileCreate a program that reads in course codes (e.g., CSCI1060U) until the user enters “DONE”. Each course code that is read in should be stored in an array of strings. I am confused on how to create a program that reads in course codes (like MATH1010) until the user enters “DONE”. Each course code ...

 
7:25 AM
@Pavel Ok...? If they don't get any comments/answers then having more duplicates around won't help.
I am running a Jelly solution to Anush's challenge. It takes 2GB of RAM...
 
8:15 AM
0
Q: Is this a BST pre-order traversal?

Delfad0rBackground A binary tree is a rooted tree whose every node has at most two children. A labelled binary tree is a binary tree whose every node is labelled with an integer; moreover, all labels are distinct. A BST (binary search tree) is a labelled binary tree in which the label of each node is ...

 
 
2 hours later…
10:35 AM
@user202729 Now I regret not making my question fastest-code!
 
 
2 hours later…
12:11 PM
-2
Q: Write a program that randomly generates a genuine mathematical research paper

Robert FrostIn the spirit of Mathgen, which generates a paper of nonsense, write a generator which takes some meaningful mathematical input from the end-user and then generates a genuine paper which proves some (relatvely) randomly-generated theorem from the sentences input. Extra points 1: Divide any proof...

 
12:23 PM
0
A: Sandbox for Proposed Challenges

JobWrite a Self-Hosting Ouroboros: each quine produces the next quine AND its interpreter My meta-questions: Too elaborate or long post? Rules too strict? Too lax? Good idea to not have a dealine or not? A Quine is a program that prints its own source code as output when it is run. A Self-Ho...

 
 
3 hours later…
3:17 PM
So, about the unpopular topic time, there always is an ebb and flow. It's mostly students here, and people have less time when they start work. You just need to get more people attracted regularly.
 
3:29 PM
@Anush Looking at the votes, I guess.
The fastest-code is more interesting than the code-golf part
(although I use a lot of nice golfing techniques in the Python code :()
 
3:41 PM
@user202729 how fast do you think is possible? Will it always be exponential time?
 
I guess.
It might be possible to have median running time to be polynomial.
(I don't know if it's possible)
 
hmm.. now I want to set that as a challenge :)
but it might be too late
 
@Anush It won't be closed as duplicate, for the reasons I've mentioned multiple times.
 
@user202729 are these answers non-competing?
 
Which these?
 
3:43 PM
or is that not the reason you have mentioned multiple times?
The ones to my current question
 
in Discussion on question by Anush: Find an array that fits a set of sums, 3 hours ago, by user202729
In case somebody don't like the "testable" restriction and want to post a non-restricted version: I'm certain that it will not be closed as duplicate, as answers here are not competing there (bad method, optimization are not necessary!), and answers there cannot be ported here (needs a complete change in algorithm)
Anyway, talking about votes (again)... How will Axtell work regarding reputation system (or equivalent)?
 
@Hosch250 This isn't ebb and flow. I've done some queries over multiple years: We are getting fewer challenges, but those challenges are getting about the same number of views.
 
Cool.
I'm guessing it's just becoming harder to ask new challenges because they are all asked, and you have a higher standard of quality.
Maybe you guys should do sorts of "reruns" and revive old challenges temporarily for the newer users?
 
I agree: There are different ways to interpret that data. I'm still not sure how I do, but you are absolutely correct that higher standards of quality has decreased the number of challenges
 
@Hosch250 Why if they can just post to the old challenge?
 
3:45 PM
They can.
 
@Hosch250 This has been proposed many times
 
I mean, do something to draw attention to the existing old challenge to help people find it.
 
a bounty? ;-)
 
Old challenges get bumped off the front page fast without a lot of activity.
That could work. Or a meta post.
Or a coordinated sequence of posts to keep it on the front page for a while.
 
I don't think you can post "hey, people, see this challenge!"
 
3:47 PM
No, but you could maybe do a "challenge of the week" series.
 
@Hosch250 It's not a bad idea!
 
PPCG is a little tricky because most of the time people don't search for an existing challenge, I wouldn't think.
They would tend to follow the "current challenge" cycle on the home page, I'd guess.
 
if an accidental dupe is posted and the fact is discovered, the closure is pretty immediate :P
 
I think most of our traffic comes from HNQ (and I'm not meaning drive-by votes).
I think people will see our challenges, click on it, and answer it
That, and the posts in TNB
 
HNQ may be going away.
They got sick of filtering out NSFW questions :)
 
3:49 PM
um, meta post please?
 
@Hosch250 Not unless there is another Twitter complaint. <this is a joke>
 
That's the thing: I don't think the front page is as valuable as people make it out to be
 
@Hosch250 That's not even NSFW.
 
@EriktheOutgolfer it's featured on meta.SE. Should be easy to find
 
Twitter-driven development, "Sites are excluded only after a twitter demand, from someone with at least 1k followers. That's how it works. Feature requests here regarding those things are 100% ignored." — gnat yesterday
 
3:49 PM
42
Q: Revisiting the "Hot Network Questions" feature, what are our shared goals for having it?

Tim PostSome things happened yesterday that caused a need for us to (quickly) remove a site's eligibility to contribute to the list of hot network questions. For those of you not familiar with what we've come to call the 'HNQ' list, please visit the link; the list of questions shown as 'hot' on stackexch...

 
The same thing is true for "challenge of the week" or programs that try to increase visibility of challenges
there are people that would participate
but they aren't the majority of our users
 
yeah, I don't think that's about removing the HNQ entirely
 
(unrelated: the meta post above is upvoted because HNQ is bad, but downvoted because of meta.stackexchange.com/questions/316934/… .)
 
@EriktheOutgolfer it is a possible outcome, but I agree, it's unlikely
 
I think it's mostly a revisiting how it works, with the option of removing it or not showing individual questions (but maybe hot sites, or something).
 
3:55 PM
...is somebody here posting a challenge soon?
 
@user202729 I have a question which I am hoping you might know the answer to. If the input array is A = [1,2,3,4,....,n] is this always the only array (with its reverse) that gives set f(A)?
 
...and would it be off topic to include a survey in the post? Maybe in the comments?
 
@Anush Probably not.
 
oh.. it works for 1,2,3 :)
 
I'm going to try some ns to see if I can find a counterexample.
 
3:58 PM
with A = [1,2,3,4] you get f(A) = 1,2,3,4,5,6,7,9,10 (8 is missing) as far as I can tell
thanks!
 
@Doorknob hey, do you mods have tools to look at traffic sources?
 
@NathanMerrill Isn't it in the site analytic?
 
typically, yes, but that isn't public info?
 
3:59 PM
@user202729 I am confused... if I put in [1,2,3,4,5,6,7,9,10] I get nothing returned by your code
 
oooh
hmmm...this isn't as fine grained as I had hoped
 
@Anush (link fixed)
@NathanMerrill SE would probably blame performance for that.
 
@NathanMerrill I don't think we have anything more detailed
the only other thing I see in the mod version is search keywords
 
ok, thanks
 
@user202729 thanks.. does your code not return the reverse of arrays?
 
4:01 PM
(talking about that, SE argues that it takes a lot of resource to add a custom HNQ filter, and people point out that it's compeltely wrong)
@Anush It has some optimization, like assuming that the sum of first n-1 items is the second largest one.
 
@user202729 it's very helpful, thank you
 
So unless the first is equal to the last element, it won't.
 
@user202729 got you
 
4:43 PM
CMC List all 1080 5-digit numbers where the ith digit is divisible by i. Link. Example, 12345 -- 1 is divisible by 1, 2 is divisible by 2, etc.
Another example -- 90680 -- 9 is divisible by 1, 0 is divisible by 2, 6 is divisible by 3, etc.
 
(it's silly that "remove first element of first element of array" takes too many bytes in Jelly)
¦ not vectorize may be useful sometimes, but I see myself using € with ¦ a lot.
 
4:59 PM
 
@AdmBorkBork Jelly, 12 bytes: ⁵ḶọƇⱮ5Ḋ€1¦ŒpḌ
 
@AdmBorkBork APL, 31 bytes
 
I have 39 bytes in PowerShell. Try it online! -- I'm guessing it's similar to the V answer.
 
@EriktheOutgolfer That's 13
 
Oh, blast, that outputs 100 000. Dang.
 
5:05 PM
CMC: Check if the input square matrix that consists of 0s and 1s is an identity matrix.
 
@EriktheOutgolfer Canvas, 11 bytes
 
@EriktheOutgolfer PowerShell, 77 bytes Try it online!
Matrix manipulation in PowerShell sucks, so I made it string manipulation.
 
why does the input need the @s?
 
5:22 PM
@EriktheOutgolfer would ⊢≡+.×⍨ work?
 
@Cowsquack I guess so
 
are there binary matrices that can be the "square-root" of the identity matrix?
 
@Cowsquack fails for 3 3⍴1 0 0 0 1 0 0 1 0
 
and that's where I went wrong, I simply checked that the square of it equals itself rather than the identity matrix
and won't work in cases where the determinant is 0, like in dzaima's one
 
yep, my suspicions are confirmed there :P
 
5:27 PM
but you can try using an error guard for a much larger bytecount
 
I've got a long (,¨∘⍳≢)≡⍸¨∘↓
 
@Cowsquack ⌹⍬ unfortunately doesn't work, yeah
 
is an identity matrix?
^^^^ hopefully {0::0⋄⍵≡⌹⍵} for 11 works
 
hm, ⌹0 0⍴0 works
yeah, isn't really a matrix
 
Epic fail, ignore.
 
5:33 PM
a 5-byte version in Jelly would be L⁼þ`⁼
 
Exactly...
 
APL, 9 bytes
 
@isaacg hm, maybe it would be better to edit the scores in the answers directly? it would reduce the comment clutter (reference)
 
@dzaima nice
 
I quite like being able to see at a glance that the score is official (as long as only the most recent score comment is left)
 
5:50 PM
hm, maybe a combination of editing and commenting
and the older comments being deleted
 
6:02 PM
@Cowsquack rip 2 2⍴¯1 0 0 1 fails, reflections man...
 
Yikes
 
@EriktheOutgolfer Strictly speaking, it doesn't, but it's easier to visualize where the array-of-array delineation is.
 
@Cowsquack You could change to ⍵≡⍵⌹⍵. Although, there are shorter ways of solving the problem
 
@H.PWiz {⍵≡⍵⌹⍵} is the same as ⊢≡⌹
 
but I need a dfn to act as an error guard
@EriktheOutgolfer shouldn't that be ⊢≡⌹⍨?
 
6:14 PM
@Cowsquack hm, maybe, not sure what you're going for here
 
⊢≡⌹ isn't the same as {⍵≡⍵⌹⍵} because in the train the is applied monadically
@H.PWiz do you have a shorter approach than dzaima's?
 
yeah, I'm focusing more on eating rn
 
@Cowsquack the input is guaranteed to be only 1s and 0s
 
@EriktheOutgolfer You need an error guard though
 
yeah, tough luck there
 
6:26 PM
@dzaima apparently 2 2⍴0 1 1 0 passes through
 
6:57 PM
0
Q: Is this string a palindrome (in Morse Code)?

CowabungholeChallenge Inspired by this video As you may know, a palindrome is a word that is spelled the same forward as it is backward. The word "PULP" is not a palindrome, but when translated into Morse Code (with the spacing between letters removed), "PULP" becomes ".--...-.-...--." which is a palindrom...

 
@AdmBorkBork Retina, 41 bytes
 
CMC: A119408
 
@dzaima another interesting thing is the list of binary matrices that are self-inverses
brute-forcing for n=4, gives me the following tio.run/##SyzI0U2pTMzJT/…
basically axes switches
 
7:13 PM
@dzaima PowerShell, 54 bytes Try it online!
 
7:24 PM
@Cowsquack for each such matrix, find the position of the 1 in each of the columns (apl: +⌿∨⍀⊖r), then grading it once and twice both give the same result (⍋≡⍋∘⍋)
 
7:38 PM
@Cowsquack correction 1⊃¨¨⍸¨r instead of +⌿∨⍀⊖r
 

« first day (2820 days earlier)      last day (2027 days later) »