Questions tagged [binary]
For challenges about binary, or the base 2 number system.
229
questions
16
votes
5
answers
552
views
Prefix code generator
In this challenge, we consider an encoding from positive integers (up to a limit) to binary sequences. Some examples:
...
- 73.1k
11
votes
34
answers
2k
views
Convert binary to unary
The title says it all; Given a number in the binary (base-2) number system, output the same number expressed in unary (base-1).
You should take the binary number as a string (optionally with a ...
- 4,026
1
vote
1
answer
153
views
Start a program so that /proc/self/cmdline contains a binary representation of the input number
I am sorry for the very long description. But i think some information of how /proc/self/cmdline works and how it can be used to get a integer input was necessary.
...
1
vote
0
answers
121
views
making a binary string palindrome using xor operations [closed]
Problem
You are given a binary string A of length N.
You can perform the following type of operation on the string A:
Choose two different indices \$i\$ and \$j\$ (\$1 \le i\$, \$j \le N\$)
Change \$...
- 11
21
votes
13
answers
2k
views
Minkowski's ?(x) for rational x
Here is Minkowski's question mark function:
It is a strictly increasing and continuous function from the reals to themselves that, among other unusual properties, maps rational numbers to dyadic ...
- 3,707
21
votes
8
answers
3k
views
How many xor'ed waves?
In this challenge, you're given a list of overlapping waves. Each wave is a finite list with n truthy values, then n falsy ...
- 977
7
votes
0
answers
203
views
Find the linear transformation
Given a set of bit vectors \$A\$ and a binary matrix \$M\$, we can define the set \$MA = \{ Mx : x \in A \}\$, where \$ M x \$ is the result of the matrix multiplication of \$ M \$ by \$ x \$ over \$\...
- 7,448
0
votes
0
answers
194
views
How to efficiently count all powers of 2 in a given set of numbers in vb.net?
Every integer can be expressed in powers of 2. You know this as the binary system
Assume you are given a set of k numbers ...
- 9
16
votes
7
answers
1k
views
Largest Binary Area
Take the sequence of all natural numbers in binary, (1, 10, 11, ..) then write them vertically beside each-other like this (least significant bit on top; 0s have ...
- 11.4k
31
votes
70
answers
3k
views
Number to Binary
It seems we've managed to go all this time without a plain vanilla Number-To-Binary challenge! Whilst this will inevitably be only one element in many languages, it should put a few esolangs through ...
- 10.2k
8
votes
3
answers
348
views
Injectively saturate bit strings
It can be easily proven using Hall's marriage theorem that given fixed \$n\$ and \$k<n/2\$, there is an injective (one-to-one) function from all \$n\$-bit strings with \$k\$ ones to \$n\$-bit ...
- 3,707
15
votes
3
answers
545
views
Count the number of disjoint 11 blocks
The task is to count the number of disjoint 11 blocks in a 64-bit word, using the minimum number of straight-line instructions. That is, how many nonoverlapping ...
- 253
15
votes
21
answers
742
views
CGAC2022 Day 16: Playing with bits, Part 2
Part of Code Golf Advent Calendar 2022 event. See the linked meta post for details.
As soon as the Elves get bored with the last week's game, Bin comes up with a new game. The rules are similar, ...
- 73.1k
8
votes
3
answers
360
views
Smallest and largest 100-bit square with maximum Hamming weight
Introduction
In the binary representation of a \$k-\$bit \$(k>1)\$ square number \$n^2, \$ not all bits can be \$1\$. The maximum number of \$1\$-bits (Hamming weight, \$B\$ for short) is given in ...
- 701
13
votes
14
answers
1k
views
CGAC2022 Day 10: Help Santa sort presents!
Part of Code Golf Advent Calendar 2022 event. See the linked meta post for details.
Santa likes to sort his presents in a special way. He keeps "uninterleaving" the pile of presents into ...
- 7,889
19
votes
26
answers
1k
views
CGAC2022 Day 9: Playing with bits
Part of Code Golf Advent Calendar 2022 event. See the linked meta post for details.
The Elves like playing number games. One day, Bin (a friend of Fen) suggests a new game: given a positive integer <...
- 73.1k
4
votes
3
answers
246
views
Intermediate Boolean Algebra Calculator
Background
With the success of Simple Boolean Algebra Calculator, I present a more difficult problem.
Boolean Algebra concerns representing values with letters and simplifying expressions. The ...
- 1,767
29
votes
20
answers
2k
views
Simple Boolean Algebra Calculator
Background
Boolean Algebra concerns representing values with letters and simplifying expressions. The following is a chart for the standard notation used:
Above is what actual boolean algebra looks ...
- 1,767
29
votes
31
answers
2k
views
Generate Parity bits
Given a binary message, and the number of parity bits, generate the associated parity bits.
A parity bit is a simple form of error detection. It's generated by counting the number of ...
- 7,889
12
votes
39
answers
3k
views
Hexadecimal -> Binary Art
Take a list of 2-digit hexadecimal numbers as input, and output the binary value, replacing each 1 with an 'X', and each 0 with a space.
For example
Input = ...
- 17.5k
21
votes
20
answers
2k
views
Cut along the lines
In this challenge you will take as input a non-empty list of binary values (these can be booleans or integers on the range 0-1), you should output all the ways to partition the list into non-empty ...
- 95.5k
21
votes
11
answers
2k
views
Create a nibble shorthand
I recently stumbled across this image on wikimedia commons. It's a little bit of an information overload at first, but after examining it a bit it shows an interesting number system for writing ...
- 95.5k
16
votes
11
answers
1k
views
Carryless factors
Carryless multiplication is an operation similar to binary long multiplication, but with XOR instead of addition:
...
- 18.4k
13
votes
15
answers
2k
views
Advanced Binary Number System
Your task is to write a program that calculates the amount of different ways to display any given whole positive number using the following rules:
Meet the 'advanced binary system':
Any whole positive ...
- 147
13
votes
7
answers
514
views
Encode the systematic binary Varshamov–Tenengolts code
Background
Here on CGCC, a commonly seen subgenre is radiation-hardening – writing a program that works even if one character is deleted. A similar problem is studied in the field of coding theory: ...
15
votes
16
answers
1k
views
Implement Binary Exponentiation
Background
In programming, there is a recursive algorithm called binary exponentiation, which allows for large integer powers to be calculated in a faster way. Given a non-zero base \$x\$ and a non-...
- 12.3k
16
votes
14
answers
965
views
Number of binary partitions
We all know that any positive integer can be represented as the sum of powers of two. This is how binary representations work. However there's not just one way to do this. The canonical method, ...
- 95.5k
24
votes
25
answers
3k
views
How far from binary?
Given a decimal integer n as input, output the smallest (in terms of absolute value) decimal integer m such that the absolute ...
- 38.3k
13
votes
12
answers
2k
views
I want 8 bits for every character!
This is the reverse of this challenge.
Given an encoded list of codepoints and the characters used to encode it, you need to decompress it to its original string.
For example, given the encoded list <...
- 12.2k
21
votes
14
answers
3k
views
Bitwise XOR of floats
This is different from Floating Point XOR, and more in the spirit of a comment by R.. GitHub STOP HELPING ICE on that challenge, but I thought of this idea independently.
Generalized XOR
The bitwise ...
- 313
22
votes
16
answers
4k
views
Who needs 8 bits for one character?
Given a string and the characters used to encode it, you need to compress the string by only using as many bits as each character needs. You will return the character codes for each character needed ...
- 12.2k
32
votes
31
answers
3k
views
Collatz Encoding
The Collatz Conjecture
The famous Collatz Conjecture (which we will assume to be true for the challenge) defines a sequence for each natural number, and hypothesizes that every such sequence will ...
- 1,513
15
votes
24
answers
2k
views
The Binary Eyes
A binary eye is an odd set of digits, with all of its digits except the center one set to 1 or 0, and the center one set to the opposite of the others. Thus, there are two binary eyes for a given odd ...
- 420
13
votes
17
answers
1k
views
The interstice of two binary numbers
Given two integers, compute the two numbers that come from the blending the bits of the binary numbers of equal length(same number of digits, a number with less digits has zeros added), one after the ...
- 420
20
votes
30
answers
2k
views
Convert from variable-width Two's Complement to Integer
Take an input, and convert it from Two's Complement notation (binary where the first bit is negated, but the rest are taken as normal) into an integer (in a somewhat standard output form). Input can ...
- 1,357
19
votes
10
answers
2k
views
1 bit, 2 bits, 3 bits, …
Given a positive integer \$n\$, your task is to find out the number of partitions \$a_1+a_2+\dots+a_k=n\$ where each \$a_j\$ has exactly \$j\$ bits set.
For instance, there are \$6\$ such partitions ...
- 186k
11
votes
33
answers
1k
views
Convert the decimal digits of a string's Unicode codepoints to binary, reinterpret as decimal, and take the sum
Yeah... it's confusing. Let me explain it a little better:
With a string, get the unicode code points of each letter
Let's use "Hello World!".
The code ...
- 567
1
vote
0
answers
129
views
Binary with 0's only [closed]
The input message consists of ASCII characters
The encoded output message consists of blocks of 0
A block is separated from another block by a space
Two consecutive blocks are used to produce a series ...
- 5,035
8
votes
14
answers
725
views
Get all binary between a binary string and its reverse
Your Challenge is to take a binary string as input and get all binary numbers between itself and the reverse of its string representation (the reverse may be less than or greater than the original ...
17
votes
11
answers
2k
views
Write a number in overflowed binary
We all know how binary conversion works: the sequence of bits
$$ b_1, b_2, ..., b_{n-1}, b_n $$
encodes the number
$$ b_1 \times 2^{n-1} + b_2 \times 2^{n-2} + ... + b_{n-1} \times 2^1 + b_n \times 2^...
- 23.2k
17
votes
11
answers
2k
views
Binary triangle A141727
Challenge
Generate the 2D sequence of bits of A141727. (Allowed I/O methods explained at the bottom.)
...
- 73.1k
14
votes
12
answers
1k
views
Nega-Zeckendorf representation
Background
Zeckendorf representation is a numeral system where each digit has the value of Fibonacci numbers (1, 2, 3, 5, 8, 13, ...) and no two consecutive digits can be 1.
Nega-Zeckendorf ...
- 73.1k
13
votes
9
answers
791
views
Convert to a non-adjacent form
Consider a form of binary where digits can be any of \$1\$, \$0\$ and \$-1\$. We'll still call this "binary" because we convert the digits from base two. For example,
$$\begin{align}
[1, 0, -...
- 49.3k
25
votes
14
answers
2k
views
Emanresu numbers
My userid is 100664. In binary this is 11000100100111000.
An interesting property of this number is that it can be created entirely by concatenating strings which ...
- 34.4k
18
votes
14
answers
1k
views
Encode USB packets (part 2)
Inspired by this video by Ben Eater. This challenge forms a pair with Decode USB packets.
The USB 2.0 protocol uses, at a low level, a line code called non-return-to-zero encoding (specifically, a ...
- 23.2k
32
votes
19
answers
3k
views
Decode USB packets
Inspired by this video by Ben Eater. This challenge forms a pair with Encode USB packets.
The USB 2.0 protocol uses, at a low level, a line code called non-return-to-zero encoding (specifically, a ...
- 23.2k
18
votes
8
answers
2k
views
Sum of set bits from 1 to n
Given an integer \$ n \$ \$ (n \ge 1) \$, return/output the total number of set bits between \$ 1 \$ and \$ n \$ inclusive. To make the problem more interesting, your solution must run with a time ...
- 22.2k
20
votes
13
answers
921
views
Duplicates in "n × hamming weight of n" sequence
Background
The sequence in the title is A245788 "n times the number of 1's in the binary expansion of n" ("times" here means multiplication), which starts like this:
...
- 73.1k
21
votes
21
answers
3k
views
Fibonacci Encoding
Fibonacci coding is a universal code, which can encode positive integers of any size in an unambiguous stream of bits.
To encode an integer \$ n \$:
Find the largest Fibonacci number less than or ...
- 23.2k
27
votes
11
answers
2k
views
Test if a Gray code is Beckett
Background
An \$n\$-bit Gray code is an ordering of \$2^n\$ binary sequences so that adjacent sequences always differ by exactly one bit.
A Beckett-Gray code is a special kind of Gray code. In ...
- 73.1k