/q/$postid[/$userid] and /a/$postid[/$userid] are actual routes in our system, with an actual controller action attached (both of those routes go to the same action—questions and answers both live in the Posts table, just with different PostTypeIds).
Depending on whether the post is a question o...
Snowman 1.0.2, 61 chars
}vgvgaC"[0-9]+"sM:10sB;aM2aG:AsO:nD;aF;aM0AAgaA*|:#eQ;AsItSsP
Pure gibberish (unless you happen to know Snowman), a.k.a. exactly in line with the language's design goal of being as confusing as possible.
Input format is same as in the post, output format is also the sa...
@ChrisJester-Young I'm hardly an expert when it comes to FPA. Is it possible that a / b != c /d when a * d == b * c and all four numbers can be represented exactly?
Wake, 17 bytes
":"Hello, World!"
According to the offial website,
Wake is a programming language which has the essences of Makefile, regular expressions, and pattern matches of functional programming languages.
Wake was created by shinh and can be tested on his golf server Anarchy Golf.
...
The task
Write a program or function that takes a traffic intersection structure and outputs the sequence, in which vehicles will pass.
The input can have any structure you like, the only requirement it must be human readable (so please do not use any bitmasks, arrays of numbers which say nothi...
The title pretty much says it. if I use tabs/spaces for making the code more readable do I have to count them?
and are linebreaks counted as 1 cahracter(\n) or as 2(\r\n)?
@BetaDecay I'm not sure how these challenges are actually substantially different from a normal code golf. And just a tag "standard programming task golf" sounds like a meta tag where we'd just get a lot of debate and/or rollback wars about other challenges
I wanna say Sorry in advice, because this is my first Code Golf (Correct me in comments):
My Code Golf is for you to decrypt this Brainfuck Code (3 times) with the shortest Programm possible in any Language:
[-]>[-]++++[-<++++++++>]<>>[-]>[-]++++++++++[-<++++++++++>]<---<<>>------.<<+++++++++++++.
I'm asking this especially after I stumbled on this question my self when I got asked some minutes ago in a comment, if the include in my C code is really neccessary.
I answered that it is, since I need printf which would be implicite declared if I wouldn't include the stdio.h what results in un...
Here's a simple one to stretch your compression muscles. Your code (a complete program) must output the spelled-out English representation of all the cardinal numbers from 1 to 100, and then all the ordinal numbers from 1 to 100. The numerals in each list should be delimited by commas and spaces ...
If a question has the "kolmogorov-complexity" tag and the outpout should be for example "abcdefg" and my code just echo's this string hardcoded, does this violate any rules?
We have a definition of what we consider a valid programming language for answers on PPCG. (If you disagree with this definition, please do so on that other post, and not here.)
The one type of challenge where people regularly tend to ignore this is for challenges with fixed output, i.e. mostly ...
Hard-coding the output
Unless the question is an obvious exception (the primary exception being those tagged kolmogorov-complexity), your program is expected to do work, not just print a pre-calculated result. If the question doesn't require input and so a solution which just prints the answer w...
Note that the loophole explicitly excludes kolmogorov-complexity.
So... uh... this is a bit embarrassing. But we don't have a plain "Hello, World!" challenge yet (despite having 35 variants tagged with hello-world, and counting). While this is not the most interesting code golf in the common languages, finding the shortest solution in certain esolangs can be a ...
@jrenk That's technically allowed (especially if it is the shortest solution in your language), but I'm not a big fan. Once somebody posts a low-effort answer, they start to pile on.
A tree is a connected, undirected graph with no cycles. Your task is to count how many distinct trees there are with a given number of vertices.
Two trees are considered distinct if they are not isomorphic. Two graphs are isomorphic if their respective vertices can be paired up in such a way tha...
@isaacg I've been there a few times. Consensus seems to be that winning your own challenge is perfectly acceptable. Personally, I'd wait at least a week to give others a chance to find a similar solution.
@isaacg I've currently got the same problem. my BF to MarioLANG conversion challenge has only one submission, and according to the author, it's not even correct
@Dennis Well, either the world will end or we'll master stargates. He seems a bit confused on that point:
> In this way, CERN is being used as a stargate so that human scientists will be able to go to and from currently unknown, perhaps very hostile, non-physical worlds and dimensions located and currently unseen, outside our physical universe.
@BetaDecay I think the reception such posts get is welcoming enough that anyone not actively looking to be offended can learn from it and go on to post well received challenges later.
It's been said many times that CERN is going to destroy the Universe and everybody in it, but most educated people know that this absolute hocum. It seems being the biggest supercollider therefore increases the chances that it's going to break by a near infinite margin.
However, if something wer...
@BetaDecay Yes maybe they will go on to post good questions later - sometimes such attitudes are just short term due to the perception of being attacked. It might pass once they see how other questions are treated in general
I have a world in which a demon created this really hard math problem and said "If you fail to solve my really hard math problem, I will destroy your world!" How would my citizens go about solving it?
Calvin is basically teaching his class at this point
Then we have guys like Dennis who are probably professors who enjoy solving puzzles as a pasttime. They have no clue that they are doing all of the homework
@Rainbolt Take everyone who's good at mathematics, and put them all together in a small number of university-like environments, and have them work on it together. Give them lots of computing and stuff.
hmmm, I really want to write HW in Monkeys, but in addition to being a really hard-to-program-in language, the reference implementation seems to contradict the spec in several ways :/
Randy is a common nickname (at least in the US) for people named Randall. Your username, randomra, begins with "rand," so the thought of referring to you as Randy amused me.
I personally do not believe in an exponential increase in intelligence ad infinitum, but many (very intelligent) people seem to implicitly assume its existence when talking about this.
once you've figured out the low hanging fruit for self-improvement, improving yourself becomes exponentially more difficult, while you only gained a linear increase in intelligence
the believers in an exponential intelligence increase (the singularity) would now argue it would find the next self-improvement 10% faster, leading to an exponential increase in intelligence
I think it's simply ridiculous to assume that the next self-improvement won't be harder to find, and might take vastly more than 100 time units
Gödel's incompleteness theorems are two theorems of mathematical logic that establish inherent limitations of all but the most trivial axiomatic systems capable of doing arithmetic. The theorems, proven by Kurt Gödel in 1931, are important both in mathematical logic and in the philosophy of mathematics. The two results are widely, but not universally, interpreted as showing that Hilbert's program to find a complete and consistent set of axioms for all mathematics is impossible, giving a negative answer to Hilbert's second problem.
The first incompleteness theorem states that no consistent system...
For example, a conditional operator expression where both branches are reference types can be lvalues. e.g., (foo ? x : y) = 42 can work if x and y are both lvalues.
Something from (almost) nothing
kolmogorov-complexity code-golf
In The Bible, Genesis tells the story of how God created the world from nothing. Since that would be a little out of scope for PCG, your challenge is to create the text of Genesis 1-2 from the smallest amount of program source you...
"Leveling the playing field" is something that a lot of newer users seem to want to do, but I think that's missing the point. The point is to write code in your language of choice and have fun. Chances are, unless your language is Pyth or CJam, you aren't going to win anyway.