@cairdcoinheringaahing https://codegolf.stackexchange.com/questions/230509/find-the-erd%c5%91s-woods-origin I think the wording here might be a bit wrong (or confusing)
`output a positive integer a for which no element of (a,a+1,a+2,...,a+k) is coprime to a or a+k.`
@rak1507 I don't think so. For an example of a similar sentence "Find a prime which has neither 2 or 3 in the digits". The negation makes it use "or" instead of "and"
Allowing users to choose which characters are deleted means that you're only going to get "if 10, Code Golf, else Coding Challenges". Making it a pop-con won't exactly help either
A Geiger counter is a device that is used to detect radiation.
We will be making a Geiger counter program.
As we all know, when radiation hits a computer program it removes exactly 1 byte at random. So a Geiger counter program is a program that itself does nothing, but when any byte is removed...
Personally, I think rak's suggestion is the most interesting one. You run the risk of it being a dupe of other radiation-hardening challenges, but tbh the other alternatives are either dupes or very boring
The thing with radiation hardening challenges, is that because of the "volatility", our dupe test of "Can answers be ported across?" often fails because the answers can't handle e.g. having to output something if not modified
Even if the core task looks very similar. I'd consider this to be a dupe of a "Output X. If modified, output Y" challenge if it exists, but that's a borderline dupe imo
If I pose a challenge for the median of 5 numbers it's going to be quite trivial for all high level languages but interesting for the low level ones. Is that ok?
The median of five is sometimes used as an exercise in algorithm design and is known to be computable using only 6 comparisons.
What is the best way to implement this "median of five using 6 comparisons" in C# ? All of my attempts seem to result in awkward code :( I need nice and readable code w...
As you can see, when the market is flooded with fake links, the ability to say "haha you got epicly pranked, aren't I such an epic troll" becomes increasingly harder and has less value and weight among the community
Here's the number one takeaway: don't be a sussy baka by devaluing the rickroll further than doge coin.
"Rick low and roll high" as they say at Dankford University™
This time, you are working on a regex. Your regex is meant to approximately full-match the base-10 representations of primes 0 <= p < 1000, while ignoring anything else. You can fullmatch 2, 53 or 419, but not 0, 82 or example.
The approximately is important -- you don't need to match every prime 0
The objective is to print a graph from an array of numbers, of the design below. Printing the X and Y scale exactly as in the "design", with padding, is part of the challenge. The input array of numbers can be of virtually any range of integers in X and Y, but not 0 and not negative - though I wo...
@wasif you've almost certainly misunderstood. I believe the "match or ignore 90%" is referring to a regex either matching or not matching a given string (so it should have a 90% success rate), not that you can ignore 90% of the inputs and only match 10%
A Geiger counter is a device that is used to detect radiation.
We will be making a Geiger counter program.
As we all know, when radiation hits a computer program it removes exactly 1 byte at random. So a Geiger counter program is a program that itself does nothing, but when any byte is removed...
