Star if you understand this: Decimal expansion of A1*B1, the average number of non-isomorphic semisimple rings of any order, where A1 is prod_(m>1) zeta(m) and B1 is prod_(r*m^2>1) zeta(r*m^2).
@Cowsquack, it's annoying to spend time writing an answer and be beaten to the punch, but it's unnecessarily frustrating to spend time writing an answer and then discover that the previous one has been changed so that it's no longer the next sequence
As StepHen said earlier, if you're going to golf your answer do it before posting
Challenge
Print "The quick brown fox jumps over the lazy dog" with a program that uses only alphanumeric characters and spaces. The shortest program that successfully achieves this wins.
Can you beat Bash?
$ echo The quick brown fox jumps over the lazy dog
Any one knows how to set facebook page plugin width to full page size, or any other way to show page posts in full width (specially on mobile devices).
Thanks
@BlackCap can you undelete your answer please? I want to keep the challenge going, you've got fib and I'm fine bending the rules slightly. I'll delete mine.
code-challenge answer-chaining polyglot
Title to Be Determined
Your "challenge" is to write a program that outputs something.
Output rules:
You must output / print something (empty output is forbidden) in an acceptable output format of your language
Your program must not error:
Exit with a...
@cairdcoinheringaahing Aaargh. Stop it! The whole point of answer-chaining is to chain answers, and when people keep changing history it wastes other people's time.
rosetta-stone
A Thousand Errors
Your challenge is to make a program that errors fatally in as many languages as possible. Your program must be less than or equal to 50 bytes. The submission that errors fatally in the most languages wins.
> After an answer has been posted and no new answers have been posted for more than a week, the answer before the last posted (the one who didn't break the chain) will win.
@cairdcoinheringaahing We're not telling you to revert your decision; the damage is done already. We're just telling you why you shouldn't be changing answers like that.
Challenge
Given a list of integers, return the list of these integers after repeatedly removing all pairs of adjacent equal items.
Note that if you have an odd-length run of equal numbers, one of them will remain, not being part of a pair.
Example:
[0, 0, 0, 1, 2, 4, 4, 2, 1, 1, 0]
First, y...
llama@llama:~$ cat > a.c
main=0;
llama@llama:~$ gcc a.c
a.c:1:1: warning: data definition has no type or storage class
main=0;
^~~~
a.c:1:1: warning: type defaults to ‘int’ in declaration of ‘main’ [-Wimplicit-int]
llama@llama:~$ ./a.out
zsh: segmentation fault (core dumped) ./a.out
@cairdcoinheringaahing it's true, any token that can't be used in math but is valid can be added to the end any otherwise valid cQuents program, usually
Solve the Trolley Problem code-golf machine-ethics
Philosophers have long pondered the Trolley problem. Unfortunately, this no human has solved this problem yet. Luckily, as programmers we can use computers to solve the problem for us!
Your program will take as input a (finite) directed graph...
@HyperNeutrino would the community view it as a cheat? and I think I should hold myself at a higher standard if I participate, as this is my question and I have to be a role model or whatever :D