You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Cyclic tag system is a language with 3 instructions and a data queue: ;: pop a bit at front of the queue; 0: if the bit at the front of the queue is 1, push a 0 bit. 1: if the bit at the front of the queue is 1, push a 1 bit.
the program halts when the queue is empty.
Given a cyclic tag program with a initial data queue of a single 1, print the first 1000 bits removed in the process, or all bits removed if the program halts before removing 1000 bits. Example input (if any)
Description
see https://esolangs.org/wiki/Cyclic_tag_system.
Cyclic tag system is a language with 3 instructions and a data queue:
;
: pop a bit at front of the queue;0
: if the bit at the front of the queue is 1, push a 0 bit.1
: if the bit at the front of the queue is 1, push a 1 bit.the program halts when the queue is empty.
Given a cyclic tag program with a initial data queue of a single 1, print the first 1000 bits removed in the process, or all bits removed if the program halts before removing 1000 bits.
Example input (if any)
Example output
The text was updated successfully, but these errors were encountered: