457 - Linear Cellular Automata

#include<stdio.h>

#include<string.h>

intpopulation[40]={

0,0,0,0,0,0,0,0,0,0,

0,0,0,0,0,0,0,0,0,1,

0,0,0,0,0,0,0,0,0,0,

0,0,0,0,0,0,0,0,0,0

};

intmain()

{

intn,i,j,k;

intdna[10],tmp1[40],tmp2[40];

scanf("%d",&n);

for(i=0;i<n;i++)

{

memcpy(tmp1,population,sizeof(population));

memcpy(tmp2,population,sizeof(population));

for(j=0;j<10;j++)

{

scanf("%d",&dna[j]);

}

for(k=0;k<50;k++)

{

  for(j=0;j<40;j++)

switch(tmp1[j])

{

case 0:printf(""); break;

case1:printf("."); break;

case2:printf("x"); break;

case3:printf("W");

}

printf("\n");

for(j=0;j<40;j++)

{

if(j==0) 

tmp1[j]=dna[tmp2[j]+tmp2[j+1]];

elseif(j==39) 

tmp1[j]=dna[tmp2[j]+tmp2[j-1]];

elsetmp1[j]=dna[tmp2[j]+tmp2[j-1]+tmp2[j+1]];

}

memcpy(tmp2,tmp1,sizeof(tmp1));

}

if(i!=n-1)printf("\n");

}

return0;

}

uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=398