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 number
Search options not deleted
user 47245
A competition to solve a particular problem through the usage and manipulation of numbers.
1
vote
Repair the ranges
Somewhat readable:
s/(\d+)(( 0)+) (\d+) # match number, sequence of 0, number
/
$s=$1; # start number
$e=$4; # end number … $_=$2; # sequence of ' 0'
$c=$s; # initialize counter with start number
s! …
- 956
4
votes
Count up forever
Perl, 34 32 30 28 26 23 bytes
-Mbigint -E '{say$_+=1;redo}'
Test with
perl -Mbigint -E '{say$_+=1;redo}'
- 956
5
votes
Count up forever
1f pop ds # data segment
b9 08 00 L1: mov cx, 8 # loop count
31 ff xor di, di # ds:di = address of number … Note: it wraps around at 2128; simply change the 8 inmov cx, 8 to 9 to show a 144 bit number, or even 80*25 to show numbers up to 232000. …
- 956