Return to Answer

Bits and Bytes constant generation

In this challenge, you have to generate the shortest Bits and Bytes program that outputs an integer input. For the simplicity of the challenge, you only have to search with ! and <.

Bits and Bytes quick reference

Bits and Bytes operates on a one-byte accumulator. There are 4 operations (only 2 are neccecary for this challenge):

• ! : Invert all of the bits in the accumulator
• < : Shifts all bits in the accumulator one bit to the right. The leftmost bit becomes a 0 and the rightmost bit is discarded.
• > : Shift right
• @ : Swap nybbles

Input / Output

Input will be one integer. Your program should output the shortest program in Bits and Bytes that sets the accumulator to that value.

Examples

255
!

4
!<!<!<

This is a code-golf contest; the shortest program wins.

code-golf shortest-path

Bits and Bytes constant generation

In this challenge, you have to generate the shortest Bits and Bytes program that outputs an integer input. For the simplicity of the challenge, you only have to search with ! and <.

Bits and Bytes quick reference

Bits and Bytes operates on a one-byte accumulator. There are 4 operations (only 2 are neccecary for this challenge):

• ! : Invert all of the bits in the accumulator
• < : Shifts all bits in the accumulator one bit to the right. The leftmost bit becomes a 0 and the rightmost bit is discarded.
• > : Shift right
• @ : Swap nybbles

Input / Output

Input will be two integers. The first integer sets the accumulator to the value of that integer. The second integer indicates the resulting value. Your program should output the shortest program in Bits and Bytes that sets the accumulator to that value.

Examples

0
255
!

0
4
!<!<!<

This is a code-golf contest; the shortest program wins.

code-golf path-finding

Bits and Bytes constant generation

In this challenge, you have to generate the shortest Bits and Bytes program that outputs an integer input. For the simplicity of the challenge, you only have to search with ! and <.

Bits and Bytes quick reference

Bits and Bytes operates on a one-byte accumulator. There are 4 operations (only 2 are neccecary for this challenge):

• ! : Invert all of the bits in the accumulator
• < : Bitwise left-shift the accumulator's value left one binary digit
• > : Inverse of <
• @ : Swap nibbles

Input / Output

Input will be one integer. Your program should output the shortest program in Bits and Bytes that sets the accumulator to that value.

Examples

255
!

4
!<!<!<

This is a code-golf contest; the shortest program wins.

code-golf shortest-path

Bits and Bytes constant generation

In this challenge, you have to generate the shortest Bits and Bytes program that outputs an integer input. For the simplicity of the challenge, you only have to search with ! and <.

Bits and Bytes quick reference

Bits and Bytes operates on a one-byte accumulator. There are 4 operations (only 2 are neccecary for this challenge):

• ! : Invert all of the bits in the accumulator
• < : Shifts all bits in the accumulator one bit to the right. The leftmost bit becomes a 0 and the rightmost bit is discarded.
• > : Shift right
• @ : Swap nybbles

Input / Output

Input will be one integer. Your program should output the shortest program in Bits and Bytes that sets the accumulator to that value.

Examples

255
!

4
!<!<!<

This is a code-golf contest; the shortest program wins.

code-golf shortest-path

Bits and Bytes constant generation

In this challenge, you have to generate the shortest Bits and Bytes program that outputs an integer input. For the simplicity of the challenge, you only have to search with ! and <.

Input / Output

Input will be one integer. Your program should output the shortest program in Bits and Bytes that sets the accumulator to that value.

Examples

255
!

4
!<!<!<

This is a code-golf contest; the shortest program wins.

code-golf shortest-path

Bits and Bytes constant generation

In this challenge, you have to generate the shortest Bits and Bytes program that outputs an integer input. For the simplicity of the challenge, you only have to search with ! and <.

Bits and Bytes quick reference

Bits and Bytes operates on a one-byte accumulator. There are 4 operations (only 2 are neccecary for this challenge):

• ! : Invert all of the bits in the accumulator
• < : Bitwise left-shift the accumulator's value left one binary digit
• > : Inverse of <
• @ : Swap nibbles

Input / Output

Input will be one integer. Your program should output the shortest program in Bits and Bytes that sets the accumulator to that value.

Examples

255
!

4
!<!<!<

This is a code-golf contest; the shortest program wins.

code-golf shortest-path