#include <iostream>
 
using std::cout;
using std::cin;
using std::endl;
 
int consistencia(int v1[],int v2[],int lenght)
{
	int temp;
for(int i=0;i<lenght;i++)
	{	int k=0;
		do{
			if(v2[k]==v1[i])
			{
			temp=v1[k];
			v1[k]=v2[k];
			v2[k]=temp;
				}
			k++;
			}while(k<temp);
	}
 
for(int i=0;i<lenght;i++)
{	int k=0;
	do{
		if(v2[k]==v1[i])return 1;
		k++;
		}while(k<lenght);
	}
return 0;
}
 
int main()
{
int Regs, *gen1, *gen2, i;
 
cout<<"Cantidad de Registros: ";
cin>>Regs;
gen1 = new int[Regs];
gen2 = new int[Regs];
 
for(i;i<Regs;i++)
	{
	gen1[i]=-1;
	gen2[i]=-1;
		}
 
for(i=0;i<Regs;i++)
	{
	cout<<"1er Valor del registro "<<i+1<<" :";
	cin>>gen1[i];
	cout<<"2do Valor del registro "<<i+1<<" :";
	cin>>gen2[i];
		}
 
if(consistencia(gen1,gen2,Regs))cout<<"No son consistentes"<<endl;
else{cout<<"Son Consistentes"<<endl;}		
 
}
 

#include <stdio.h>
#include <stdlib.h>
 
int noFuck (int **corral, int g1, int g2, int n);
int addChicken (int **corral, int g1, int g2);
 
int main(int argc, char **argv) {
 
   int **corral, n, m, i, gays = 0;
   int g1,g2;
 
   if (argc != 3) return 1;
 
   n = atoi(argv[1]);
   m = atoi(argv[2]);
 
   if (!(corral = (int**)calloc(n,sizeof(int)))) return 1;
   for (i=0;i<n;i++) if (!(corral[i] = (int*)calloc(n/sizeof(int),sizeof(int)))) return 1;
 
   while (m-- > 0 & !gays) {
 
      scanf("%d %d",&g1,&g2);
      if (!noFuck(corral,g1,g2,n)) addChicken(corral,g1,g2);// añadimos g1 a parejas de g2 y viceversa
      else gays = 1;
 
   }
 
   if (!gays) printf("Si\n"); else printf("No\n");
 
   for (i=0;i<n;i++) free(corral[i]); free(corral);
 
   return 0;
 
}
 
int noFuck (int **corral, int g1, int g2, int n) {
 
   int i;
 
   if (g1 == g2) return 1;
   for (i=0;i<=n/sizeof(int);i++) if (corral[g1][i] & corral[g2][i]) return 1;
   return 0;
 
} 
 
int addChicken (int **corral, int g1, int g2) {
 
   corral[g1][g2/sizeof(int)] |= (g2%sizeof(int));
   corral[g2][g1/sizeof(int)] |= (g1%sizeof(int));
   return 0;
 
}