Anonymous
Anonymous
0
I'm surprised that this challenge isn't already here, as it's so obvious. (Or I'm surprised I couldn't find it and anybody will mark it as a duplicate.)
Task
Given a non-negative integer \$n\$, calculate the sum of the first \$n\$ primes and output it.
Example #1
For \$n = 5\$, the first fiv...
Just like the BSOD
Write a program (or a function), which will display a full screen blue background with some optional white texts.
Input
No input.
Output
Output a full screen blue background with some optional white texts.
Output must be displayed on the monitor. Not to a file or other w...
Most Turing-incomplete Instruction Set
Tags: code-challenge, language-design
This challenge expects you to define an instruction set \$I = \{ \texttt{instr}_1 \dots \texttt{instr}_n \}\$ which is provably Turing complete. The catch is that any subset \$I'\$ that is proper (ie. \$I' \neq I\$) ...
Pikachu, 1562 bytes
So simple even Pikachu can do it!
pi pi pika pi pi pika pi pi pika pi pikachu
pi pika
pi pika pikachu
pi pika pika pikachu
pi pika pi pi pika pi pi pika pi pikachu
pi pikachu pi pikachu
pikachu pikachu pi pikachu
pika pi
pika pi
pi pikachu pi pikachu
pi pi pikachu
pi pika pi...20
I answered a question on SuperUser and while on other sites I did not get a 'Reputation Notification' to explain that I was given 2 UpVotes for my answer - yet if I manually check my Profile here at meta.SE my total Reputation is in agreement with the amount there.
I'm not knowledge about the in...
There was an error scheduling the blog post. Somehow (we're looking into it), the time zone that the post scheduler used was flipped, so what was supposed to go out at 1PM EDT actually went out much sooner.
We've un-published the post until the actual routes go live, at which time the post sche...
write a function to tell if a number is symmetric or not.
for example:
input:
151
output:
True
input:
142
output:
False
and so on:
1111 True,
2390 False,
1226221 True
Define X as non-empty non-self-contain array of X and "1". Split an X into smallest amount of continuous parts Y, length of each of Y don't exceed n, so that each X is either part of a Y, or exactly some Ys. It's fine if output only express which part has how many 1's.
Samples:
[1,[1,1,1]],3 =>...
Anonymous
Anonymous
