简单题,既然边界被看做密集度为0的培养皿,那就把问题一般化,把数组的边界空出即可,由于遍历修改原培养皿由于前面的培养皿发生变化会使得后面的计算出错,所以再设置一个辅助数组。注意每个Case的清零操作和最后不要多输出一个空格(这题多输出UvaOJ不判PE判WA)。
#include <stdio.h>
#define N 42
int main(void)
{
int n;
const char s[4] = {' ', '.', 'x', 'W'};
scanf("%d", &n);
while (n--) {
int dishes[N] = {0}, temp[N], DNA[10], i, j;
dishes[20] = 1;
for (i = 0; i != 10; i++)
scanf("%d", DNA+i);
for (i = 0; i != 50; i++) {
for (j = 1; j != N-1; j++)
temp[j] = 0;
for (j = 1; j != N-1; j++) {
putchar(s[dishes[j]]);
temp[j] = DNA[dishes[j]+dishes[j-1]+dishes[j+1]];
}
for (j = 1; j != N-1; j++)
dishes[j] = temp[j];
printf("\n");
}
if (n)
printf("\n");
}
return 0;
}