Please in order to save solutions and appear on the leaderboards.

Details

Print the first 100 rows in the Rule 110 cellular automaton starting from an initial single living cell.

Each new row in the life of the automaton should be a new line, and the rules for whether a cell is alive or dead depends on whether is was alive on the previous iteration, as well as the state of the two neighbouring cells. The rules which dictate whether a cell is alive or dead in the next iteration are as follows:

Previous cellsNew centre cell
1110
1101
1011
1000
0111
0101
0011
0000
where 1 is alive, 0 is dead, and the middle digit represents the previous state of the current cell.

The first 10 rows are shown here:

         █
        ██
       ███
      ██ █
     █████
    ██   █
   ███  ██
  ██ █ ███
 ███████ █
██     ███
0 characters
 
 
 
 
 
 
 
 
ARGV is available via STDIN, joined on NULL. x is a no-op.
arguments holds ARGV, print() to output with a newline, write() to output without a newline.
say() is available without any import.
SELECT arg FROM argv to access the arguments, only the first column of the first result set will be printed, NULL values will be skipped, and the dialect is SQLite.
ctrl + enter or Run