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 | |
Results tagged with kolmogorov-complexity
Search options not deleted
user 61247
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
I deserve a castle for it only being Tuesday
Swift 3, 200 bytes
var z=" /\\ 9/\\\n/ \\ 7/ \\\n-2 7-2\n| |^7| |\n-95\n| 5_ 5|\n| 1| | | | 1|\n| 4| | 4|",o="",x=""
for c in z.characters{let k="\(c)"
if let b=Int(k){for i in 0...b{o+=x}}else{ …
- 181
1
vote
This is my pillow
Swift 3, 100 99 97 bytes
var a="/////",b="\\\\\\\\\\",c=""
(1...144).map{c+=a+b+($0%6<1 ?"\n":"")
$0%24<1 ?swap(&a,&b):()}
Could save 1 byte if Swift print function did not add a newline by default.
…
- 181
1
vote
Build me a brick wall!
Swift 3, 69 bytes
(3...702).map{print($0%4<1 ?"|":"_",terminator:($0-2)%70<1 ?"\n":"")}
Output after compiling and running:
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___| …
- 181