I do not understand why my latest challenge has been closed as a duplicate. Others seem to agree with me, for the following reasons: 1. Allows empty spots 2. Lets the answerers assume the board is valid 3. Has flexible I/O - That being said it is hugely different from the alleged duplicate, and have commented here in order to get some more feedback (I think it should be reopened)
Number of all hyperrectangle-filling walks
Your input:
size of the hyperrectangle – generally an n-tuple
eg. (s,s) in case of a square
position in the hyperrectangle – generally 0 <= pos[i] < size[i] for i-th dimension
eg. (x,y) where 0 <= x < s and 0 <= x < s in case of a (s,s) square.
...
It can be golfed more by removing the function definition, using print, replacing f"{y}{x}" with y+str(x), somehow golfing that large constant in the middle, removing the space between in and ", etc.
That way the left-right border would be the previous-next line, the top border would probably be the current stack frame and the bottom border would probably be the previous stack frame / private variables.
@JohnDvorak But the result of a function call being based on the state of the calling function?
For large enough n, whether the program SEGFAULTED or not being dependent both on the OS' calling convention for starting programs and the length of the path used to execute the program?
I noticed this question come up today, with a really good comment that the code-golf tag description itself states that code golf questions are no longer on-topic for SO:
DO NOT USE - Code Golf is no longer on-topic for Stack Overflow given the existence of Code Golf.
This seems like it mig...
zig is looking for contributors. I'm not related to the project, but I want it to be a thing. Basically a Rust-like replacement for C that still understands unmodified C files (like stdlib headers).
There is a difference between generating bindings and compiler support. Plus Rust has a different goal altogether, only the syntax is slightly similar.
Given an integer p > 1, find the smallest integer q > p such that the list of exponents of the prime factorization of q is the same of that of p, no matter the order or the value of the prime factors.
Examples
The prime factorization of p = 20 is 22 x 51. The smallest integer greater than p wit...
@cairdcoinheringaahing Part of the problem is that the stated goal of SO is not to answer your programming questions (I saw that somewhere but I can't find the link right now)
In fact, I expect documentation failed because the Q&A's goal is to provide documentation for frequently asked questions. For more complex stuff like an introduction/tutorial, there were plenty of other resources for that
@cairdcoinheringaahing well I thought it could sometimes take more than 2 links if two of them were combined into a dyad-nilad pair, but turns out that the examples I look at are all ambiguous because the third link back is auto-vectorizing so the each quick can't be used to examine the result
(also, trying to make a tacit language has taught me a decent bit about how Jelly actually works, so rather than throwing together copy-pasted symbols and hoping it works I can actually understand how it will work ahead of time)
I would find it very strange if someone referred to me as Alex, or Xcoder as Victor, or Leaky as Kenny, or ... (proceeds to list everyone's real name xD)
> "Either A or B" most precisely means, in symbolic logic terms, "A XOR B", where XOR is the "exclusive or". So yes, it means "A or B but not both". It isn't always actually used with full precision, though, so, as usual, context has to be taken into account.
In mathematics, "A or B" includes "A and B".
Does "either" mean "A or B but not (A and B)" or does it include the possibility of "A and B"?
The context might be mathematics, formal logic or ordinary language.
Shortest golang code to println the first byte of a function’s code
Rules
The code must be a function which takes another function as parameter and will print the first cpu instruction byte of parameter such as :
.
func dummy() {
}
print_first_native_instruction_byte(dummy)
would print :
...
Prime Factoral Roots code-golf number prime
Inspired by digital roots, the prime factoral root of a number is the number that emerges when you take the prime factors of a number, add them together, and repeat the process on that number, continuing until you end up with a prime number (which has ...
For the purposes of this question, the prime factorial of a number n is the result of multiplying all prime numbers smaller than n, and then multiplying the result by n.
Your Task:
Write a program or function to find the prime factorial of a number, as outlined above.
Input:
An integer n ...
You can create a pair of functions that pick only odd bits from a number and only even bits from a number. You can call those two functions car and cdr, too
Loops can be implemented with conditional jumps. Conditional jumps can be implemented with computed jumps if you have a logical negation function, AKA (==0)
Shortest golang code to println the first byte of a function’s code
Rules
The code must be a function which takes another function as parameter and will print the first cpu instruction byte of parameter such as :
.
func dummy() {
}
print_first_native_instruction_byte(dummy)
would print :
...
Unlike other SE sites, where most new users will likely start by asking questions, we're more an answer focused site, as writing good challenges is much harder than it seems.
You deal cards labeled 0 to 9 from a deck one a time, forming stacks that start at 0 and count up by 1.
When you deal a 0, you place it on the table to start a new stack.
When you deal any other card, you stack it atop a card that's exactly
one lower in value, covering it. If there's no such c...
It is my firm belief that writing decent challenges is both more fun and easier than writing good answers.
However, when a challenge goes wrong, it goes really wrong, but when an answer is bad, it's just a suggestion or two in the comments and a really quick formatting edit.
Related
Goats are great. Everybody loves goats.
And they also, for some reason, are an excellent complex ascii art for many languages to have built-ins for. Because of this, I personally feel a catalogue to document just how easily a language can print goats is greatly needed.
The Challenge
G...
Number of all hyperrectangle-filling walks
Your input:
size of the hyperrectangle – generally an n-tuple
eg. (s,s) in case of a square
position in the hyperrectangle – generally 0 <= pos[i] < size[i] for i-th dimension
eg. (x,y) where 0 <= x < s and 0 <= x < s in case of a (s,s) square.
...
I noticed this question come up today, with a really good comment that the code-golf tag description itself states that code golf questions are no longer on-topic for SO:
DO NOT USE - Code Golf is no longer on-topic for Stack Overflow given the existence of Code Golf.
This seems like it mig...
Given an integer p > 1, find the smallest integer q > p such that the list of exponents of the prime factorization of q is the same of that of p, no matter the order or the value of the prime factors.
Examples
The prime factorization of p = 20 is 22 x 51. The smallest integer greater than p wit...
In mathematics, "A or B" includes "A and B".
Does "either" mean "A or B but not (A and B)" or does it include the possibility of "A and B"?
The context might be mathematics, formal logic or ordinary language.
Shortest golang code to println the first byte of a function’s code
Rules
The code must be a function which takes another function as parameter and will print the first cpu instruction byte of parameter such as :
.
func dummy() {
}
print_first_native_instruction_byte(dummy)
would print :
...
You deal cards labeled 0 to 9 from a deck one a time, forming stacks that start at 0 and count up by 1.
When you deal a 0, you place it on the table to start a new stack.
When you deal any other card, you stack it atop a card that's exactly
one lower in value, covering it. If there's no such c...
Related
Goats are great. Everybody loves goats.
And they also, for some reason, are an excellent complex ascii art for many languages to have built-ins for. Because of this, I personally feel a catalogue to document just how easily a language can print goats is greatly needed.
The Challenge
G...
