Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Kolmogorov complexity, informally, is the amount of code it takes to describe or produce a constant object, such as a string or image. When posting a challenge in this category, please make sure it adds something new to existing challenges.
3
votes
99 Bottles Of Beer
PHP - 252 bytes
$a=" bottles of beer";$b=str_replace("s","",$a);$c=" on the wall";for($i=98;$i;)echo($j=$i+1).$a.$c.", ".$j.$a.".
Take one down and pass it around, ".$i.($i-->1?$a:$b).$c.".
";echo"1 …
1
vote
The alphabet in programming languages
P is, in fact, for PHP - 23 chars / 27 score
<?=join('',range(a,z));
2
votes
List of primes under a million
PHP - 72 bytes
<?for($i=1;$i++^999999;print$d?~ı.$i:'')for($d=$j=2;$j<$i&&$d=$i%$j++;);
Hexdump:
0000000 3c 3f 66 6f 72 28 24 69 3d 31 3b 24 69 2b 2b 5e
0000010 39 39 39 39 39 39 3b 70 72 69 6e 74 …
2
votes
There are known knowns
Haxe, 71 bytes
(?x)->[for(a in x=["","un"])for(b in x)a+'known ${b}knowns'].join("\n")
Try it online!
2
votes
1, 2, Fizz, 4, Buzz
haxe, 110 bytes
class Main{
static function main()
for(i in 1...101)
Sys.println(i%3<1?"Fizz"+(i%5<1?"Buzz":""):i%5<1?"Buzz":i);
}
(newlines and indents added for clarity)
Haxe isn't m …