UVa457 Linear Cellular Automata

 Linear Cellular Automata 

A biologist is experimenting with DNA modification ofbacterial colonies being grown in a linear array of culture dishes. Bychanging the DNA, he is able ``program" the bacteria to respond to thepopulation density of the neighboring dishes. Population is measuredon a four point scale (from 0 to 3). The DNA information isrepresented as an array DNA, indexed from 0 to 9, of population densityvalues 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 ofDNA[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 populationexplosions (e.g., [3,3,3,3,3,3,3,3,3,3]). The biologist is interestedin how some of the less obvious intermediate DNA programs mightbehave.

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 allother dishes start with a population density of 0.

Input

The input begins with a single positive integer on a line by itselfindicating 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 betweentwo 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 outputsof 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 50days. Each day's printout should occupy one line of 40 characters.Each dish is represented by a single character on that line. Zero populationdensities are to be printed as the character ` '. Population density 1will be printed as the character `.'. Population density 2 will beprinted as the character `x'. Population density 3 will be printed asthe character `W'.

Sample Input

10 1 2 0 1 3 3 2 3 0

Sample Output

bbbbbbbbbbbbbbbbbbb.bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb.xbx.bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb.bb.bb.bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb.........bbbbbbbbbbbbbbbbbbbbbbbbbbbbbb.xbbbbbbbx.bbbbbbbbbbbbbbbbbbbbbbbbbbbb.bbxbbbbbxbb.bbbbbbbbbbbbbbbbbbbbbbbbbb...xxxbbbxxx...bbbbbbbbbbbbbbbbbbbbbbbb.xb.WW.xbx.WW.bx.bbbbbbbbbbbbbbbbbbbbbb.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".

这题就是有种细胞培养基，其中细胞的状态分0，1，2，3四种，每天每个细胞变化取决与前一天该细胞本身与其左右细胞的状态之和，人工可以通过设定，调整状态之和不同时细胞的变化，这题模拟我主要是利用一个整形数组将每天的各细胞的状态储存，然后再以另一个数组每天对其备份，在循环培养的时候将每个细胞所对应的备份数组中的本身及左右相加，再在表中查找所对应的状态。再将得出的结果输出。要注意下每个样例直接有行空行。

#include <iostream>#include <cstring>#include <cstdio>using namespace std;const char l[4] = {' ','.','x','W'};int main() {int a[42];int b[10];int t[42];int Case;cin >> Case;while (Case--) {memset(a,0,sizeof(a));a[20] = 1;for (int i = 0; i < 10 ; i++)cin >> b[i];for (int i = 1; i <= 40; i++)cout << l[a[i]];cout << endl;for (int i = 0; i < 42; i++)t[i] = a[i];for (int i = 1; i < 50; i++) {for (int j = 1; j <= 40; j++) {a[j] = b[t[j-1]+t[j]+t[j+1]];cout << l[a[j]];}cout << endl;for (int j = 1; j <= 40; j++)t[j] = a[j];}if (Case)cout << endl;}return 0;}