Pagini recente » Cod sursa (job #3134595) | Cod sursa (job #1972768) | Cod sursa (job #3228800) | Cod sursa (job #2900232) | Cod sursa (job #2121372)
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main()
{
if(!freopen("cutii.in","r",stdin))
{
return 1;
}
if(!freopen("cutii.out","w",stdout))
{
return 2;
}
short int N, T, **s, db ;
scanf("%hd%hd",&N, &T);
for (int i=0; i<T; i++)
{
s = (short int **) malloc (N * sizeof(short int *));
if (s==NULL)
{
return 3;
}
for (int j=0; j<N; j++)
{
s [j] = (short int *) malloc (3 * sizeof (short int));
if (s[j]==NULL)
{
return 4;
}
}
for (int k=0; k<N; k++)
for (int l = 0; l<3 ; l++)
scanf("%hd",&s[k][l]);
bool ok = true ;
for (int k = 0; k < 3 && ok ; k++)
{
bool lattot [N+1] = {0};
for (int l = 0 ; l<N; l++)
{
lattot[s[l][k]] = true;
}
for (int x = 1 ; x <=N && ok; x++)
if (!lattot[x])
ok = false;
}
//if (!ok)
// printf("Nem lehet");
db = 0 ;
for (int k = 0; k < N-1; k++)
for (int l = k+1 ; l < N ; l++)
{
if ((s[k][0] < s[l][0] && s[k][1] < s[l][1] && s[k][2] < s[l][2]) ||
(s[k][0] > s[l][0] && s[k][1] > s[l][1] && s[k][2] > s[l][2]) )
db++;
}
printf("%hd\n",db);
for (int k = 0; k<N; k++)
free(s[k]);
free(s);
}
freopen("CON","r",stdin);
freopen("CON","w",stdout);
return 0;
}