UVA - 457 Linear Cellular Automata

Linear Cellular Automata

Time Limit: 3000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

Submit Status

Description

Linear Cellular Automata

A biologist is experimenting with DNA modification of bacterial colonies being grown in a linear array of culture dishes. By changing the DNA, he is able ``program" the bacteria to respond to the population density of the neighboring dishes. Population is measured on a four point scale (from 0 to 3). The DNA information is represented as an array DNA, indexed from 0 to 9, of population density values and is interpreted as follows:

• In any given culture dish, let K be the sum of that culture dish's density and the densities of the dish immediately to the left and the dish immediately to the right. Then, by the next day, that dish will have a population density of DNA[K].
• The dish at the far left of the line is considered to have a left neighbor with population density 0.
• The dish at the far right of the line is considered to have a right neighbor with population density 0.

Now, clearly, some DNA programs cause all the bacteria to die off (e.g., [0,0,0,0,0,0,0,0,0,0]). Others result in immediate population explosions (e.g., [3,3,3,3,3,3,3,3,3,3]). The biologist is interested in how some of the less obvious intermediate DNA programs might behave.

Write a program to simulate the culture growth in a line of 40 dishes, assuming that dish 20 starts with a population density of 1 and all other dishes start with a population density of 0.

Input

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.

For each input set your program will read in the DNA program (10 integer values) on one line.

Output

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

For each input set it should print the densities of the 40 dishes for each of the next 50 days. Each day's printout should occupy one line of 40 characters. Each dish is represented by a single character on that line. Zero population densities are to be printed as the character ` '. Population density 1 will be printed as the character `.'. Population density 2 will be printed as the character `x'. Population density 3 will be printed as the character `W'.

Sample Input

1

0 1 2 0 1 3 3 2 3 0

Sample Output

bbbbbbbbbbbbbbbbbbb.bbbbbbbbbbbbbbbbbbbb
bbbbbbbbbbbbbbbbbb...bbbbbbbbbbbbbbbbbbb
bbbbbbbbbbbbbbbbb.xbx.bbbbbbbbbbbbbbbbbb
bbbbbbbbbbbbbbbb.bb.bb.bbbbbbbbbbbbbbbbb
bbbbbbbbbbbbbbb.........bbbbbbbbbbbbbbbb
bbbbbbbbbbbbbb.xbbbbbbbx.bbbbbbbbbbbbbbb
bbbbbbbbbbbbb.bbxbbbbbxbb.bbbbbbbbbbbbbb
bbbbbbbbbbbb...xxxbbbxxx...bbbbbbbbbbbbb
bbbbbbbbbbb.xb.WW.xbx.WW.bx.bbbbbbbbbbbb
bbbbbbbbbb.bbb.xxWb.bWxx.bbb.bbbbbbbbbbb

Note: Whe show only the first ten lines of output (the total number of lines must be 50) and the spaces have been replaced with the character"b" for ease of reading. The actual output file will use the ASCII-space character, not "b".

分析：

题目大意给出一个DNA种群密度的对应表，每一个培养皿的种群密度等于左右的密度加上他自己的之和，然后通过DNA表对应的算出密度。

开始时第20个密度值1其余密度为0；第二天第19个值是0+1+0是1，需要注意的是DNA表是0开始到9的所以DNA[1]=1；密度值为1；

 代码：

#include <stdio.h>
int main ()
{int t,i,j,DNA[10],a[51][41],k;
 scanf("%d",&t);
 while (t--)
 {
 for (i=0;i<10;i++)
 scanf("%d",&DNA[i]);
 for (i=1;i<=40;i++)
 a[1][i]=0;
 a[1][20]=1;
 for (i=2;i<=50;i++)
 {
  for (j=1;j<=40;j++)
  {k=a[i-1][j];
   if (j>1) k=k+a[i-1][j-1];
   if (j<40) k=k+a[i-1][j+1];
   a[i][j]=DNA[k];
  }
 }
 for (i=1;i<=50;i++)
 {
  for (j=1;j<=40;j++)
  switch (a[i][j])
  {
  case 1:printf(".");break;
  case 2:printf("x");break;
  case 3:printf("W");break;
  case 0:printf(" ");break;
  }
  printf("\n");
 }
 if (t) printf("\n");
 }
}