Efficient counting
code-golf number
When I was a kid, and wanted to count the dollar bills in my life savings, I would count out loud:
one, two, three, four, five, six, seven, eight, nine, ten;
eleven, twelve, thirteen, fourteen, fifteen, sixteen, seventeen, eighteen, nineteen, twenty;
...
Note: This challenge is now closed. Any future cops' submission will not be considered for the accepted answer. This is to ensure that no one can post a very simple regex in the future that only remains uncracked because no one is interested in the challenge any more.
The Cops' Challenge
Yo...
given that the cops are trying to set an obfuscated solution to a question of their choice and the robbers are tasked with determining what the question was
actually I'll do that now
or, hmm, the problem is that editing it will bump it to the front page
despite the fact that it doesn't allow new submissions
and even with all the whitespace (it doesn't have comments that aren't made of digits), I have problems reading my own 7 code
like, you could write a comment with something like 17…613, but given that the comment could only contain digits (and would need have balanced 76 pairs), I'm not sure there's any point
@ATaco well it's a stack-based language, so I'm guessing the print is either implicit or comes last, the range endpoints come near the start, and the range operator is in the middle
~ is a ZSS, which is an RProgN specific thing, 1aL1 is three different numbers, 1, 26 and 1, {}: is a for loop that does nothing, thus, leaving its numbers on the reg stack, which is implicitly printed.
I'm a developer, and I don't feel like doing my work. I know from XKCD that the best excuse for slacking off is that your code's compiling. Because of this, I think I need some code that will compile forever! And because I'm lazy and don't want to have to type much, this has to be done with the s...
What do you guys think about a code golf challenge for outputting the first 10 prime numbers in as few bytes as possible [No Literals allowed]. It
It's interesting to me because the prime numbers have no true generation pattern. But there are many patterns that can be found just for the first 3 or 7 or 10 or X.
@ATaco I'd treat that as a literal; the main defining feature of a literal to me is that it comes as part of a near-infinite family of commands that differs only in the numbers or strings involved
Sometimes literals might be necessary too. I think in some C IDEs you have to define all variables. So I can't just create an integer and start working with it from 0 or 1, it will instead just grab some random variable from memory. So restricted-source may require exceptions for non-null variables that must be assigned.
@DJMcMayhem: a compile time infinite loop is not a duplicate of a runtime infinite loop, it's very rare that code for one will work for the other (my Perl program is possibly a special case but it wouldn't work in other languages, which don't have universal compile time hoists)
Primality testing at compile time would involve creating a family of classes/types/sth such that type_x::out returns a truthy value iff x is a prime, in constant time.
It's challenging in C++, impossible in Java (I think), and only a minor complication in Lisp.
Ruby doesn't have a compilation phase. You can create new classes on the fly, but creating a class with a class method that returns a specific value isn't too hard either.
@NathanMerrill I'm going to do 1 once I figure out how to incorporate it into the score. 2 I won't do -- special characters are just a nuisance to both sides and I don't see the point. 3 is so I can have an objective way of stopping bowled self cracks -- otherwise it doesn't really fall under our definition of not competing since it maximizes the cop score and provides a robber win too. 5 is so strong but doable submissions don't end up with 0s while lazy completely uncrackable submissions don't get points
Efficient counting
code-golf number
When I was a kid, and wanted to count the dollar bills in my life savings, I would count out loud:
one, two, three, four, five, six, seven, eight, nine, ten;
eleven, twelve, thirteen, fourteen, fifteen, sixteen, seventeen, eighteen, nineteen, twenty;
...
Note: This challenge is now closed. Any future cops' submission will not be considered for the accepted answer. This is to ensure that no one can post a very simple regex in the future that only remains uncracked because no one is interested in the challenge any more.
The Cops' Challenge
Yo...
