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 code-golf
Search options not deleted
user 58336
Code-golf is a competition to solve a particular problem in the fewest bytes of source code.
2
votes
The Squaring Sequence
Ruby, 47 bytes
First golf! Saves bytes with -n option (but still count as 1! :)).
a=1111;$_.to_i.times{a="#{a*a}"[0,4].to_i};p a
0-indexed.
To run it:
ruby -ne 'a=1111;$_.to_i.times{a="#{a*a}"[0, …
- 121