Binary Compliment Reverse Sequence
A challenge by
Description
The BCR sequence consists of numbers where, if you take the binary compliment and reverse it, you get back the original number.
10 is one example of a BCR number. When written in binary, 10 becomes 1010. Reverse 1010 to create 0101, and the compliment of 0101 is 1010 which is 10 in decimal.
Print all the BCR numbers from 1 to 20,000, each on their own line.
Leaderboard
| Author | Score | ||
|---|---|---|---|
| #1 |
|
lukegustafson | 59 |
| #2 |
|
Bulmenisaurus | 62 |
| #2 |
|
hallvabo | 62 |
| #4 |
|
4atj | 63 |
| #4 |
|
Mukundan314 | 63 |
| #4 |
|
bizy-coder | 63 |
| #7 |
|
AlephSquirrel | 64 |
| #8 |
|
MeWhenI | 71 |
| #8 |
|
b-kamphorst | 71 |
| #8 |
|
fuzzylojik-golf | 71 |
JavaScript (Deno)
Kotlin
JavaScript (NodeJS)
Python
Rust
C (tcc)
APL (TinyAPL)
Vyxal
Vyxal 3