@Mego If anyone wants to go through all 30 answers and check whether that rule is actually used, then if it isn't could we just edit out that rule to avoid the need to close?
And maybe remove quine and the reference to quines in the title too...
@PyRulez since none of the existing answers appear to use the "useless code" rule, would it make sense to just remove that rule to remove the ambiguity? — trichoplax43 secs ago
There seem to be several answers depending on error messages, so they don't output anything to stdout
Anonymous
@ConorO'Brien Seriously is a superset of HQ9 (replacing 9 with N). Since the + in HQ9+ doesn't actually do anything, I don't consider Seriously to be a superset of HQ9+.
It's pretty cool, but it's not a bug report, feature request, discussion or support question. I guess unclear what you're asking fits the bill if you can't find the question in a question.
@trichoplax If a meta question isn't actually a question, it needs to actually be useful for the site. The indefinite bounties post could be transformed into a question by rephrasing it as "What indefinite bounties are people offering?"
I think site statistics should be on-topic in meta. There are concerns over this particular thread's methodology, but I'm talking about site statistics in general.
The "question" can be implicit for informational posts. If there's a graph depicting "bytes per post over number of posts" then the question is implicitly "how does the number of answers in a language correspond to lengths of the answers?"
> If you represent the central or local administration, you can request the creation of the necessary number of projects. For this purpose, you can contact the department of "Modernization of the administration" of the Administration of the Council of Ministers, or to create a new github issue here.
@PhiNotPi I don't often VTC them, and I didn't this one the first couple times I saw it. I'm just not sure what it's trying to convey (or more pointedly, to what purpose).
Compute the Eulerian number
The Eulerian number A(n, m) is the number of permutations of [1, 2, ..., n] in which exactly m elements are greater than the previous element. For example, if n = 3,
There are 3! = 6 permutations of [1, 2, 3]
1 2 3
< < 0 elements are greater than the previous
1 3 2
<
> [company] has a temporary opening for an expert level computer programmer/analyst with specific expertise and proficiency in the Python programming language fro software development purposes (this is not web application development).