1051.cpp

zju_acm部分代码！都是自己做 有些事基本题目！题目还可以

#include <cstdio>
#include <string>

int main()
{
	int ipd[22][22];
	int pd[22][22];
	int D[16];
	int n;
	scanf("%d",&n);
	int flag=1;
	while(n--)
	{

		memset(ipd,0,sizeof(ipd));
		int days,temp=0;
		scanf("%d",&days);
		int i,j;
		for(i=0;i<16;i++)	scanf("%d",&D[i]);

		for(i=1;i<=20;i++)
			for(j=1;j<=20;j++)
			{
				scanf("%d",&ipd[i][j]);
			}
			
			while(days--)
			{
				for(i=1;i<=20;i++)
					for(j=1;j<=20;j++)
						pd[i][j]=ipd[i][j]+ipd[i+1][j]+ipd[i-1][j]+ipd[i][j-1]+ipd[i][j+1];

					for(i=1;i<=20;i++)
						for(j=1;j<=20;j++)
						{ 
							temp=(ipd[i][j]+D[pd[i][j]]);
						if(temp>3)
								ipd[i][j]=3;
						else	if(temp<0)
									ipd[i][j]=0;
								else ipd[i][j]=temp;
						}
			}

				for(i=1;i<=20;i++)
				{
					for(j=1;j<=20;j++)
					{
						switch(ipd[i][j])
						{	case 0:printf(".");break;
							case 1:printf("!");break;
							case 2:printf("X");break;
							case 3:printf("#");break;
					
						}
					}
					printf("\n");
				}//for
			if(n!=0)	printf("\n");
	}//while

	return 0;
}