草稿

#include<stdio.h>

int copy(int a[8][8],int b[8][8])
{
	int i,j;
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
		{
			a[i][j]=b[i][j];
		}
	}
}
int f(char ch)
{
	int i,j;
	int mid[8][8];
	int n[8][8]={{0,1,1,1,1,1,1,0},
		{0,1,1,1,1,1,0,0},
		{0,1,1,1,1,0,1,0},
		{0,1,1,1,0,1,1,0},
		{0,1,1,0,1,1,1,0},
		{0,1,0,1,1,1,1,0},
		{0,0,1,1,1,1,1,0},
		{0,1,1,1,1,1,1,0}};
	if(ch=='N')
		copy(mid,n);
		
			
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
		{
			if(mid[i][j]==0)
			printf("*");
			if(mid[i][j]==1)
			printf(" ");
		}
		printf("\n");
	}
} 
int main()
{
	int i=0;
	char x[10];
		scanf("%s",x);
	while(x[i]!=' ')
	{
		switch(x[i])
		{
			case 'N': f(x[i]);
		}
		i++;
	}
	return 0; 
}

猜你喜欢

转载自blog.csdn.net/inshixu/article/details/80327489