lkj.c

来自「自己做的常用库和实现的数据结构。public domain.」· C语言 代码 · 共 37 行

#include<stdio.h>
#define M 5
#define N 7

int main(void)
{
	int t1,t2,t3,t4,i,j,a[M][N]={
				{1,1,1,1,1,1,1},
				{1,0,0,0,0,0,1},
				{1,0,0,0,0,0,1},
				{1,0,0,0,0,0,1},
				{1,1,1,1,1,1,1}
			};
	for(i=0; i<M; i++) {
		for(j=0; j<N; j++) {
			t1 = i-1;
			t2 = j-1;
			t3 = i+1;
			t4 = j+1;
			if(i==0)
				t1 = i;
			if(i==M-1)
				t3 = i;
			if(j==0)
				t2 = j;
			if(j==N-1)
				t4 = j;
			if(a[i][j]==1 && (a[t1][j]==0 || a[t3][j]==0 || a[i][t2]==0 || a[i][t4]==0))
				printf("%d ", 1);
			else
				printf("%d ", 0);
		}
		puts("");
	}
	return 0;
}