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 binary
Search options not deleted
user 61122
For challenges about binary, or the base 2 number system.
2
votes
Where's the 0xBEEF?
Ruby, 62 bytes
def f(a);a=~/1011(.{8}1110){2}.{8}1111/;$`.size.divmod(12);end
It expects a string of 0 and 1 and returns an array of Y and X, zero-based.
Try at ideone.
- 211