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 80755
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.
0
votes
Print a 10 by 10 grid of asterisks
C, gcc 36 bytes
recursive solution. One downside is you need to pass 2 when you call the function to get 10 rows.
f(a){a<puts("**********")?f(a+1):0;}
This alternative addresses that issue and you d …
- 91
0
votes
List all possible titles for the Anno games
Prolog 117 bytes
b(X):-between(0,9,X).
w(X):-write(X).
y():-b(A),b(B),b(C),b(D),X is A+B+C+D,X=9,(A=0;B=0;C=0;D=0),w(A),w(B),w(C),w(D). …
- 91