I think we could do with an offline TIO to make it faster to test (either that, or a TIO version that let you run the program in multiple languages at once)
Anonymous
9:03 PM
I think Zach made it up because he couldn't decide what to call it
Anonymous
@ais523 For the first, you can always clone the repo
@ais523 I realise it was probably unfair of me to change everything and not document exactly what depends on what (only leaving hints for what I felt was most important), so feel free to ask if there's anything I can help with, since I'd like to see this get to the point where it beats Versatile Integer Printer :)
I don't mind that you changed things around (the only real problem it gives is that it doesn't save the golfing opportunities for when they're needed to fit a language in)
A ragged array is an array where each element is an array of unknown number of integers.
For example, the following are ragged arrays:
[[1,2,3],[4],[9,10]] Shape: 3,1,2
[[1],[2],[3]] Shape: 1,1,1
[[1,2,3,4,5,6,8]] Shape: 7
The following a...
@ais523 The only reason I did that was because I didn't want the polyglot to bloat exponentially in size too far due to poor golfing (but that is sort of why I'm aiming to use only "real" languages until I'm forced to do otherwise)
@Sp3000 my main problem is needing parentheses, those screw up a bunch of other languages (notably Cardinal and Prelude); and I also need to place code on the first line (or very early on the second), which screws up Turtlèd
I can hide code from Turtlèd with # signs, but that annoys ><>; and I tried moving the ><> code to the right in order to solve that, but that confused Pyth for some reason I haven't been able to establish yet
@Sp3000 For what it's worth, PowerShell should be (relatively) easy to get into the mix, as you just need to get a number on the pipeline. The problem is any parsing errors are terminating, so we'd need to surround the print statement with blockquote <# ... #> somehow, which messes up 2D languages.
This challenge is to get a x-radius and a y-radius as input and evaluate an ellipse of those. (x-radius as first argument)
For example, with the values 1 and 1, something like that has to be the output :
/\
\/
Or with 2 and 2:
/‾\
| |
\_/
But with 2 and 1:
/‾‾\
\__/
...
it's probably impossible to polyglot it following the spec (the first character in any valid Underload program is (), but stringie ignores anything it doesn't understand
unfortunately, it segfaults if you attempt to pop an empty stack
so you need to make sure to top the stack up a bit early
nothing in the existing program causes problems for Underload apart from stack underflow, though
Yeah, the binary operations thing is only if you're in brackets of some sort, or at least that's one situation
But py2 print being a statement fails there
Explanation for @#: it's right after both Befunges have ended, before Turtled and ><>, so the only thing to be careful of it that it needs to be valid Pyth syntax I think (but runtime-wise I think the program already ends by that point)
One of the more popular comments on our site goes something like this:
Hi, and welcome to PPCG! Your challenge was closed because it's a bit unclear/broad/whatever as it is now. I would recommend posting in the Sandbox so you can get constructive feedback before you post to main.
(Please ex...
@Geobits considering how little our current close votes apply, I'd totally just change a close vote to be the "Welcome, please refine your challenge in the sandbox"
@NathanMerrill That sounds like a good idea. Once the current debates on meta settle, we should figure out what custom close reasons we want as defaults.
duplicate makes the comment automatically (or, I discovered, automatically upvotes any comment where someone's mentioned the link you're marking as a duplicate, regardless of what the comment actually says)
@Dennis in case it matters, the clarity around "remove only" definitely pulled me to your side. I don't think its a perfect solution, but its the best one I can think of
@NathanMerrill Definitely not perfect, I agree, but I do think it's a step in the right direction.
@NathanMerrill I've posted three discussions in the past two days and there were four more in the same time frame. There's no upper limit, but I do think it's best to wait a little before posting the next big one.
Why does this have so many reopen votes? It wasn't changed since it was locked and suffers from arbitrary restrictions. Plus the answer should be deleted as it is invalid.
The question is open again for whatever reason and the answer is still there.
It's asking for the smallest Mach-O binary. I don't see how that's different from asking for "the smallest <single language> code to do X", which would be down-voted to hell. Eventually, the smalles technically valid binary will be found and that's it.
I agree oscillation is a problem. At the moment it takes a mod to step in and lock the post - I'd like to see an automatic lock if a question starts cycling
@Zizouz212 the idea would be that you could cast a "do not close" vote while there's a close vote ongoing; then the post would take one more vote to close, however it'd count as your reopen vote for that post
One of the more popular comments on our site goes something like this:
Hi, and welcome to PPCG! Your challenge was closed because it's a bit unclear/broad/whatever as it is now. I would recommend posting in the Sandbox so you can get constructive feedback before you post to main.
(Please ex...
@trichoplax It's not asking for advice. It implies a challenge. It's still valid, as boring and trivial as it is. But the answer should still be deleted, as it is unrelated to question and invalid.
@trichoplax Also I don't see how the assembly tag is relevant, since the submission asks for the MO binary, not the assembly. As the comment shows, one doesn't need assembly to do that. I'd strip all tags but the code-golf and machine-code. Maybe add size-coding.
the way to get a post onto HNQ is: a) make sure that everyone can find an obvious (if not necessarily perfect) answer to it; b) give it an eyecatching/clickbaity name
that's about it
if you wanted to write a challenge specifically to hit HNQ, rather than to be a good challenge, it would be fairly easy
@NathanMerrill After re-reading the first paragraph, I think I can answer my own question. The input is always an array of arrays of integers, so it's 2D.
@trichoplax I disagree with that. There's no reason to wait for downvotes. It should be deleted with a comment directing them to the guidelines, as has been done many times for other answers.
@mınxomaτ I just meant that I don't have the authority to delete vote without more downvotes. I see no reason not to mod flag it though - it's clearly invalid
The Task
Write a program or function that, when passed a numerical input x, prints or returns the primes beneath the square root of x1 that are not factors of x.
Examples
Let f(x) be the function called:
>>> f(5)
[2]
>>> f(20)
[3]
>>> f(60)
[7]
>>> f(100)
[3, 7]
>>> f(10000)
[3, 7, 11, 13...
@mınxomaτ Separate weird thing: is your network profile deliberately not accessible from your SO profile? Your chat profile links to your SO profile, and your PPCG profile links to your network profile which links to your SO profile, but I can't get to your network profile from your SO profile
(not a bad thing if you chose it, I just didn't realise it was possible)
@mınxomaτ I solved the first weird thing - I couldn't delete vote because the answer wasn't at a negative score when I opened the page, and my downvote didn't trigger that to change. Refreshing the page allowed me to delete vote.
The problem
You must write a code then when the konami code is typed in (user hits UUDDLRLR BABA enter) says +30 lives and plays some sort of "ding" type noise. You may chose the noise.
The rules
You may not use variables of any sort (you can make a function just not things like int a = ["UUD...
@Zizouz212 it largely depends on whether the [link] expansion happens on the browser or on the server. Because markdown parsing happens on the server, I think the same will be true of [link] expansion
Partition an n X n square into multiple non-congruent integer-sided rectangles. a(n) is the least possible difference between the largest and smallest area.
___________
| |S|_______|
| | | L |
| |_|_______|
| | | |
| |_____|___|
|_|_________| (fig. I)
The largest rectangle (L) has a...
Now that I'm home, I would personally like to apologize to everyone who uses PHP for work and has to deal with the rearranging of parameters between preg_replace and preg_replace_callback
The problem
You must write a code then when the konami code is typed in (user hits UUDDLRLR BABA enter) displayes +30 lives and plays some sort of noise
The rules
Make a noise
Take the input from the user you can use Keyboard, mouse, ect.
Must loop until the Konami code is entered
You may use ...
@El'endiaStarman Side note: It is if I say so and everybody else agrees. (It is if I make a postulate that ∞ is even and the math community accepts it.)