#define n 2

typedef relation [n][n];

relation rel;

void initvide()
{
	int i,j;
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
			rel[i][j]=0;
	}
}

void initclav()
{
	int h,t;
	do {
		printf("entrer un entier positif ");
		scanf("%d",&h);
		printf("en relation avec ");
		scanf("%d",&t);
		if ((h>=0) && (t>=0) && (h<n) && (t<n))
			rel[h][t]=1;
	} while((h>=0) && (t>=0) && (h<n) && (t<n));
}

int reflex()
{
	int i=0;
	while((i<n) && (rel[i][i]==1))
		i=i+1;
	if(i<n)
		return 0;
	else
		return 1;
}

int cherchek (int i,int j)
{
	int k=0;
	while((k<n) && !(rel[j][k]==1 && rel[i][k]==1))
		k=k+1;
	if(k<n)
		return 0;
	else
		return 1;
}

int trans()
{
	int i=0,j=0,t=1;
	while((i<n) && (t==1))
	{
		while ((j<n) && (t==1))
		{
			if (rel[i][j]==1)
				t=cherchek(i,j);
			j=j+1;
		}
		i=i+1;
	}
	if ((i<n) || (j<n))
		return 0;
	else
		return 1;
}

main()
{
	int choix,p;
	do {
		clrscr();
		printf("Choix de l'action ");
		scanf("%d",&choix);

		switch(choix)
		{
			case 1:
				initvide();
			break;
			case 2:
				initclav();
			break;
			case 3:
				if(reflex()==0)
					printf("Non reflexive");
				else
					printf("Reflexive");
				getch();
			break;
			case 4:
				if(trans()==1)
					printf("Transitive");
				else
					printf("Non transitive");
				getch();
			break;
			default:
			break;
		}

	} while(choix!=0);


}